Everything compiles and everything runs correctly except my insertionS.docx
•Download as DOCX, PDF•
0 likes•2 views
Everything compiles and everything runs correctly except my insertionSort(). When the user selects it in the app class it just list the last input the user made instead of showing the sorted list. HELP PLEASE! public void insertionSort(DoublyLinkedList dd) { DoublyLinkedList newLink = dd; DoublyLinkedList temp = first; if( extra == null ) //if empty list, { first = newLink;//newLink <--last first.next = null; first.previous = null; } else{ DoublyLinkedList previous=null; DoublyLinkedList next=first.next; DoublyLinkedList current=first; for(int i=0;temp.next!=null;i++){ if(Integer.parseInt(temp.dData.getId()) < Integer.parseInt(newLink.dData.getId())){ current=temp; previous=temp.previous; next=temp.next; } temp=temp.next;} newLink.previous=temp; newLink.next=temp.next; temp.next=newLink; next.previous=newLink; } Solution Try this code:- void insertionsort(node **d) { int n; node *cur; cur=*d; if(cur->next==Null) return; node *ptr, *tmp; cur=cur->next; while(cur!=NULL) { n=0; ptr=cur; tmp=cur->prev; cur=cur->next; while(tmp!=NULL && tmp->data->ptr->data) { n++; tmp=tmp->prev; } if(n) { ptr->prev->next=ptr->next; if(ptr->next!=NULL) ptr->next->prev=ptr->prev; if(temp==NULL) { tmp=*d; ptr->prev=NULL; ptr->next=tmp; ptr->next->prev=ptr; *d=ptr; } else { tmp=tmp->next; tmp->prev->next=ptr; ptr->prev=tmp->prev; tmp->prev=ptr; ptr->next=tmp; } } } } .
Report
Share
Report
Share
Recommended
i am looking for help on the method AddSorted and the method Copy only.pdf
I am in need of homework help please. Thank you!
For this assignment grade you will evaluate the similarities and differences between the AHIMA
code of ethics and other health professionals. Overview: 1. Healthcare Information and
Management Systems Society (HIMSS) https://www.ehra.org/resource-library/ehr-codeconduct
2. American Academy of Professional Coders (AAPC) https://www. aapc.com/aboutus/code-of-
ethics.aspx 3. American Nurses Association (ANA) http://nursingworld.org/codeofethics 4.
American College of Healthcare Executives (ACHE) http://ache.org/ABT_ACHE/code.cfm 5.
National Association for Healthcare Quality (NAHQ) https://nahq.org/about/code-of-ethics To
do: "Number your page from 1 to 5. *Compare the AHIMA code of ethics with the other health
organizations above. "Formulate a closing statement..
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
Here is the editable code:
Solution
import java.util.NoSuchElementException;
public class DoublyLinkedListImpl {
private Node head;
private Node tail;
private int size;
public DoublyLinkedListImpl() {
size = 0;
}
private class Node {
E element;
Node next;
Node prev;
public Node(E element, Node next, Node prev) {
this.element = element;
this.next = next;
this.prev = prev;
}
}
public int size() { return size; }
public boolean isEmpty() { return size == 0; }
public void addFirst(E element) {
Node tmp = new Node(element, head, null);
if(head != null ) {head.prev = tmp;}
head = tmp;
if(tail == null) { tail = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
/**
* adds element at the end of the linked list
* @param element
*/
public void addLast(E element) {
Node tmp = new Node(element, null, tail);
if(tail != null) {tail.next = tmp;}
tail = tmp;
if(head == null) { head = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
public void iterateForward(){
System.out.println(\"iterating forward..\");
Node tmp = head;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.next;
}
}
/**
* this method walks backward through the linked list
*/
public void iterateBackward(){
System.out.println(\"iterating backword..\");
Node tmp = tail;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.prev;
}
}
public E removeFirst() {
if (size == 0) throw new NoSuchElementException();
Node tmp = head;
head = head.next;
head.prev = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public E removeLast() {
if (size == 0) throw new NoSuchElementException();
Node tmp = tail;
tail = tail.prev;
tail.next = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public static void main(String a[]){
DoublyLinkedListImpl dll = new DoublyLinkedListImpl();
dll.addFirst(10);
dll.addFirst(34);
dll.addLast(56);
dll.addLast(364);
dll.iterateForward();
dll.removeFirst();
dll.removeLast();
dll.iterateBackward();
}
}
import java.util.Scanner;
/* Class Node */
class Node
{
protected int data;
protected Node next, prev;
/* Constructor */
public Node()
{
next = null;
prev = null;
data = 0;
}
/* Constructor */
public Node(int d, Node n, Node p)
{
data = d;
next = n;
prev = p;
}
/* Function to set link to next node */
public void setLinkNext(Node n)
{
next = n;
}
/* Function to set link to previous node */
public void setLinkPrev(Node p)
{
prev = p;
}
/* Funtion to get link to next node */
public Node getLinkNext()
{
return next;
}
/* Function to get link to previous node */
public Node getLinkPrev()
{
return prev;
}
/* Function to set data to node */
public void setData(int d)
{
data = d;
}
/* Function to get data from node */
public int getData()
{
return data;
}
}
/* Class linkedList */
class linkedList
{
protected Node start;
protected Node end ;
public int size;
/* Constructor */
public linkedList()
{
start = null;
end = null;
size = 0;
}
/* Function to check if list is empty */
public boolean isE.
hi i have to write a java program involving link lists. i have a pro.pdf
hi i have to write a java program involving link lists. i have a problem with the nodes, as it is
posting errors with the nodes.
please help me with this problem. thank you.
public class LinkLists {
/* only need to store a single pointer to the node at the head
* of the list.
* The pointer is null if the list is empty.
* Also record the size of the list.
*/
protected Node head;
/* invariant: size is the number of nodes in the list pointed to by head */
protected int size;
/* no-arguments default constructor creates an empty list */
public LinkLists() {
head = null; // start with an empty list
size = 0;
}
/* accessor method */
public int size() {
return size;
}
/* value to add to the end of the list
*/
public void add(T value) {
head = addAtEnd(head, value);
size++;
}
/* node of the list to which the value should be added
* value to add to the end of the list
*/
private Node addAtEnd(Node node, T value) {
if (node == null) { // special case
return new Node(value, null);
} else if (node.getNext() == null) { // other special case
node.setNext(new Node(value, null));
} else {
addAtEnd(node.getNext(), value);
}
return node;
}
/* iterative implementation of the same method
* value to add to the end of the list
*/
public void add2(T value) {
if (head == null) {
head = new Node(value, null);
} else {
Node node = head; // guaranteed not to be null initially
while (node.getNext() != null) {
node = node.getNext(); // guaranteed not to be null here
}
// now, node.getNext() is guaranteed to be null
// similar to the second special case in addAtEnd
node.setNext(new Node(value, null));
}
size++;
}
public void remove(int position) throws BadItemCountException {
if ((position < 1) || (position > size)) {
throw new
BadItemCountException(\"invalid position \" + position +
\", only 1..\" + size + \" available\");
}
if (position == 1) {
head = head.getNext();
} else {
Node node = head;
for (int i = 2; i < position; i++) {
node = node.getNext();
}
node.setNext(node.getNext().getNext());
}
size--; // one less item
}
public String toString() {
return toString(head);
}
private String toString(Node node) {
if (node == null) {
return \"\";
} else {
return node.getValue() + \"\ \" + toString(node.getNext());
}
}
public static void main(String[] args) {
/* create two empty lists, make sure they print out correctly */
LinkLists list1 = new LinkLists();
LinkLists list2 = new LinkLists();
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* insert some items, keep checking */
list1.add(\"hello\");
list1.add(\"world\");
list2.add(\"foo\");
list2.add(\"bar\");
list2.add(\"baz\");
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* remove an item at an invalid position */
boolean caught = false;
try {
list2.remove(4);
} catch .
JAVA A double-ended queue is a list that allows the addition and.pdf
**JAVA** A double-ended queue is a list that allows the addition and removal of items from
either end. One end is arbitrarily called the front and other the rear, but the two ends behave
identically. Specify, design and implement a class for a double-ended queue. Include operations
to check if it is empty and to return the number of items in the list. For each end, include
operations for adding and deleting items. Use doubly linked list for your implementation. Call
your class Deque (pronounced \"deck\").
Solution
//package com.java2novice.ds.queue;
public class DequeDblLinkedListImpl {
private LinkedNode front;
private LinkedNode rear;
public void insertFront(T item){
//add element at the beginning of the queue
System.out.println(\"adding at front: \"+item);
LinkedNode nd = new LinkedNode();
nd.setValue(item);
nd.setNext(front);
if(front != null) front.setPrev(nd);
if(front == null) rear = nd;
front = nd;
}
public void insertRear(T item){
//add element at the end of the queue
System.out.println(\"adding at rear: \"+item);
LinkedNode nd = new LinkedNode();
nd.setValue(item);
nd.setPrev(rear);
if(rear != null) rear.setNext(nd);
if(rear == null) front = nd;
rear = nd;
}
public void removeFront(){
if(front == null){
System.out.println(\"Deque underflow!! unable to remove.\");
return;
}
//remove an item from the beginning of the queue
LinkedNode tmpFront = front.getNext();
if(tmpFront != null) tmpFront.setPrev(null);
if(tmpFront == null) rear = null;
System.out.println(\"removed from front: \"+front.getValue());
front = tmpFront;
}
public int size(){
if(front == null && rear ==null){
return 0;
}
//remove an item from the beginning of the queue
LinkedNode tmpFront = front;
LinkedNode tmpRear = rear;
int i=0;
while(tmpFront != rear)
{
i++;
tmpFront=tmpFront.getNext();
}
i++;
return i;
}
public void removeRear(){
if(rear == null){
System.out.println(\"Deque underflow!! unable to remove.\");
return;
}
//remove an item from the beginning of the queue
LinkedNode tmpRear = rear.getPrev();
if(tmpRear != null) tmpRear.setNext(null);
if(tmpRear == null) front = null;
System.out.println(\"removed from rear: \"+rear.getValue());
rear = tmpRear;
}
public static void main(String a[]){
DequeDblLinkedListImpl deque = new DequeDblLinkedListImpl();
deque.insertFront(34);
deque.insertFront(67);
System.out.println(\"Size of the queue : \"+deque.size());
deque.insertFront(29);
deque.insertFront(765);
deque.removeFront();
deque.removeFront();
deque.removeFront();
deque.insertRear(43);
deque.insertRear(83);
deque.insertRear(84);
deque.insertRear(546);
deque.insertRear(356);
deque.removeRear();
deque.removeRear();
deque.removeRear();
deque.removeRear();
deque.removeFront();
deque.removeFront();
deque.removeFront();
}
}
class LinkedNode{
private LinkedNode prev;
private LinkedNode next;
private T value;
public LinkedNode getPrev() {
return prev;
}
public void setPrev(LinkedNode prev) {
this.prev = prev;
}
public LinkedNode getNext() {
return next;
}
public void setNext(L.
C++ Please test your program before you submit the answer.pdf
C++. Please, test your program before you submit the answer.
Background:
Circular Linked List: A circular linked list is a linked list where a non-empty list has no null pointers.
Unless empty, each node has a pointer to the next node, and the last node points back to the first
node.
Assigment:
Write a cpp program that will serve the purpose of a test driver for previously written CLinkedList.h
file. Your program will:
1) Create a choice menu and prompt the user for input. Must be case insensitive!
2) Read the input and call for functions outside of main, in order to perform operations chosen by
the user. These functions involve: Inserting Interger, Removing Interger, Forward Print and
Backward Print.
Requirements and Notes:
1. Forwards Print does not require a subfunction in order to produce output. All the other
operations must call corresponding subfunctions.
2. Nodes of the circular list must be arranged in ascending order.
3. User Input must be processed case insensitive, and implemented using the loop.
4. Document your code completely.
5. CLinkedList.h file contains 3 classes.
- Circular linked lists class with following member functions: constructor, copy constructor,
destructor, assignment operator, insert and remove.
- Node class included in the file header.
- A list iterator class provides a public interface to the list. The pointer points at nodes in the linked
list. Its member functions are as follows:
Constructor: Assigns the linked list data member to the parameter, a reference to a circular linked
list.
begin() sets the iterator to the first node of the linked list (or NULL if the list is empty)
isEmpty() returns whether or not the wrapped linked list is empty
isFirstNode() returns whether the present node is the first node of the linked list
isLastNode() returns whether the present node is the last node of the linked list
operator*() returns the data of the node currently pointed at. (You need 2)
operator++() pre-increment operator advances the pointer to the next node in the list, if there is
one
operator++(int) post-increment operator advances the pointer to the next node in the list, if there
is one
6. Insert function must give feedback where it says the position of where the int was inserted for
example: "Inserting 25 in the middle."
7. Remove function must give either one of these types of feedback:
- "Removing 25" if the int given by the user was found in the list
-"Cannot find 25" if it was not. The program will then move the user back to the choice menu.
Files:
// File: Node.h
// Singly-linked list node definition/implementation (also good for circular)
#ifndef NODE_H
#define NODE_H
// Need to prototype template classes if they are to be friends
template <typename eltType> class CLinkedList;
template <typename eltType> class CListItr;
template <typename eltType> class Node
{ private:
Node(eltType info, Node* link = NULL ) :
data(info), next(link)
{};
eltType data;
Node *next;
friend class CLinkedList<eltType>;
friend c.
Write a JAVA LinkedListRec class that has the following methods siz.pdf
Write a JAVA LinkedListRec class that has the following methods: size, empty, insertBefore,
insertAfter, addAtHead, addAtEnd, remove, replace, peekFront, peekEnd, removeFront,
removeEnd, toString. Use recursion to implement most of these methods. Write a driver to test
your implemented LinkedListRec class methods.
Solution
import java.util.Scanner;
public class LinkedListRec {
int data;
LinkedListRec prev=null,next=null;
int size(LinkedListRec l)//method which returns the length of the list
{
if(l==null)return 0;
return 1+size(l.next);
}
boolean empty(LinkedListRec l)//method checks whether the list is empty or not...
{
if(l==null)return true;
else return false;
}
LinkedListRec insertBefore(LinkedListRec l,int value,int num_insertbefore)//method which
adds a new number before the given number..
{
if(l==null)return l;
if(l.data == num_insertbefore)
{
LinkedListRec n = new LinkedListRec();
n.data = value;
if(l.prev==null)
{
n.next = l;
l=n;
}
else
{
n.prev = l.prev;
n.next= l;
l.prev = n;
}
return l;
}
return insertBefore(l.next,value,num_insertbefore);
}
LinkedListRec insertAfter(LinkedListRec l,int value,int num_insertafter)//method which adds
the new number after the given number
{
if(l==null)return l;
if(l.data == num_insertafter)
{
LinkedListRec n = new LinkedListRec();
n.data = value;
if(l.next==null)
{
l.next = n;
n.prev = l;
}
else
{
n.next = l.next;
l.next.prev = n;
n.prev = l;
}
return l;
}
return insertAfter(l.next,value,num_insertafter);
}
LinkedListRec addAtHead(LinkedListRec l,int value)//method which adds a new number at
the head position of the list...
{
LinkedListRec n = new LinkedListRec();
n.data=value;
n.next = l;
l=n;
return l;
}
LinkedListRec addAtEnd(LinkedListRec l,int value)//method which adds a new number at
the end position of the list...
{
if(l==null){ l = new LinkedListRec();l.data = value;return l;}
if(l.next==null)
{
LinkedListRec n = new LinkedListRec();
n.data=value;
n.prev = l;
l.next = n;
return l;
}
return addAtEnd(l.next,value);
}
LinkedListRec remove(LinkedListRec l,int value)//method which removes given numbet
from the list....
{
if(l==null)return l;
if(l.data == value)
{
if(l.prev!=null){
l.prev = l.next;
}
else
l=l.next;
return l;
}
return remove(l.next,value);
}
boolean replace(LinkedListRec l,int value,int newvalue)//method which replaces current
number with new number,...
{
if(l==null)return false;
if(l.data == value)
{
l.data = newvalue;
return true;
}
return replace(l.next,value,newvalue);
}
int peekFront(LinkedListRec l)//method which returns the first value of the list...
{
if(l!=null)
return l.data;
else return -1;
}
int peekEnd(LinkedListRec l)//method which returns the last value of the list........
{
if(l==null)return -1;
if(l.next == null)return l.data;
return peekEnd(l.next);
}
LinkedListRec removeFront(LinkedListRec l)//method which removes the first element of the
list..
{
if(l==null)return l;
l=l.next;
return l;
}
boolean removeEnd(LinkedListRec l)//method which removes the last element o.
Help please, I have attached LinkedList.cpp and LinkedList.hPlease.pdf
Help please, I have attached LinkedList.cpp and LinkedList.h
Please help with the implementation of the Stack.h and Stack.cpp as well
LinkedList.cpp
~~~~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
/*Exercise2 */
void LinkedList::insertAtFront(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
if (last == NULL)
first = last = temp;
else
{
temp->next = first;
first = temp;
}
}
bool LinkedList::removeFromFront()
{
if (first == NULL)
return false;
Node *temp = first;
first = first->next;
free(temp);
if (first == NULL)
last = NULL;
return true;
}
LinkedList.h
~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *.
Recommended
i am looking for help on the method AddSorted and the method Copy only.pdf
I am in need of homework help please. Thank you!
For this assignment grade you will evaluate the similarities and differences between the AHIMA
code of ethics and other health professionals. Overview: 1. Healthcare Information and
Management Systems Society (HIMSS) https://www.ehra.org/resource-library/ehr-codeconduct
2. American Academy of Professional Coders (AAPC) https://www. aapc.com/aboutus/code-of-
ethics.aspx 3. American Nurses Association (ANA) http://nursingworld.org/codeofethics 4.
American College of Healthcare Executives (ACHE) http://ache.org/ABT_ACHE/code.cfm 5.
National Association for Healthcare Quality (NAHQ) https://nahq.org/about/code-of-ethics To
do: "Number your page from 1 to 5. *Compare the AHIMA code of ethics with the other health
organizations above. "Formulate a closing statement..
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Here is the editable codeSolutionimport java.util.NoSuchEleme.pdf
Here is the editable code:
Solution
import java.util.NoSuchElementException;
public class DoublyLinkedListImpl {
private Node head;
private Node tail;
private int size;
public DoublyLinkedListImpl() {
size = 0;
}
private class Node {
E element;
Node next;
Node prev;
public Node(E element, Node next, Node prev) {
this.element = element;
this.next = next;
this.prev = prev;
}
}
public int size() { return size; }
public boolean isEmpty() { return size == 0; }
public void addFirst(E element) {
Node tmp = new Node(element, head, null);
if(head != null ) {head.prev = tmp;}
head = tmp;
if(tail == null) { tail = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
/**
* adds element at the end of the linked list
* @param element
*/
public void addLast(E element) {
Node tmp = new Node(element, null, tail);
if(tail != null) {tail.next = tmp;}
tail = tmp;
if(head == null) { head = tmp;}
size++;
System.out.println(\"adding: \"+element);
}
public void iterateForward(){
System.out.println(\"iterating forward..\");
Node tmp = head;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.next;
}
}
/**
* this method walks backward through the linked list
*/
public void iterateBackward(){
System.out.println(\"iterating backword..\");
Node tmp = tail;
while(tmp != null){
System.out.println(tmp.element);
tmp = tmp.prev;
}
}
public E removeFirst() {
if (size == 0) throw new NoSuchElementException();
Node tmp = head;
head = head.next;
head.prev = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public E removeLast() {
if (size == 0) throw new NoSuchElementException();
Node tmp = tail;
tail = tail.prev;
tail.next = null;
size--;
System.out.println(\"deleted: \"+tmp.element);
return tmp.element;
}
public static void main(String a[]){
DoublyLinkedListImpl dll = new DoublyLinkedListImpl();
dll.addFirst(10);
dll.addFirst(34);
dll.addLast(56);
dll.addLast(364);
dll.iterateForward();
dll.removeFirst();
dll.removeLast();
dll.iterateBackward();
}
}
import java.util.Scanner;
/* Class Node */
class Node
{
protected int data;
protected Node next, prev;
/* Constructor */
public Node()
{
next = null;
prev = null;
data = 0;
}
/* Constructor */
public Node(int d, Node n, Node p)
{
data = d;
next = n;
prev = p;
}
/* Function to set link to next node */
public void setLinkNext(Node n)
{
next = n;
}
/* Function to set link to previous node */
public void setLinkPrev(Node p)
{
prev = p;
}
/* Funtion to get link to next node */
public Node getLinkNext()
{
return next;
}
/* Function to get link to previous node */
public Node getLinkPrev()
{
return prev;
}
/* Function to set data to node */
public void setData(int d)
{
data = d;
}
/* Function to get data from node */
public int getData()
{
return data;
}
}
/* Class linkedList */
class linkedList
{
protected Node start;
protected Node end ;
public int size;
/* Constructor */
public linkedList()
{
start = null;
end = null;
size = 0;
}
/* Function to check if list is empty */
public boolean isE.
hi i have to write a java program involving link lists. i have a pro.pdf
hi i have to write a java program involving link lists. i have a problem with the nodes, as it is
posting errors with the nodes.
please help me with this problem. thank you.
public class LinkLists {
/* only need to store a single pointer to the node at the head
* of the list.
* The pointer is null if the list is empty.
* Also record the size of the list.
*/
protected Node head;
/* invariant: size is the number of nodes in the list pointed to by head */
protected int size;
/* no-arguments default constructor creates an empty list */
public LinkLists() {
head = null; // start with an empty list
size = 0;
}
/* accessor method */
public int size() {
return size;
}
/* value to add to the end of the list
*/
public void add(T value) {
head = addAtEnd(head, value);
size++;
}
/* node of the list to which the value should be added
* value to add to the end of the list
*/
private Node addAtEnd(Node node, T value) {
if (node == null) { // special case
return new Node(value, null);
} else if (node.getNext() == null) { // other special case
node.setNext(new Node(value, null));
} else {
addAtEnd(node.getNext(), value);
}
return node;
}
/* iterative implementation of the same method
* value to add to the end of the list
*/
public void add2(T value) {
if (head == null) {
head = new Node(value, null);
} else {
Node node = head; // guaranteed not to be null initially
while (node.getNext() != null) {
node = node.getNext(); // guaranteed not to be null here
}
// now, node.getNext() is guaranteed to be null
// similar to the second special case in addAtEnd
node.setNext(new Node(value, null));
}
size++;
}
public void remove(int position) throws BadItemCountException {
if ((position < 1) || (position > size)) {
throw new
BadItemCountException(\"invalid position \" + position +
\", only 1..\" + size + \" available\");
}
if (position == 1) {
head = head.getNext();
} else {
Node node = head;
for (int i = 2; i < position; i++) {
node = node.getNext();
}
node.setNext(node.getNext().getNext());
}
size--; // one less item
}
public String toString() {
return toString(head);
}
private String toString(Node node) {
if (node == null) {
return \"\";
} else {
return node.getValue() + \"\ \" + toString(node.getNext());
}
}
public static void main(String[] args) {
/* create two empty lists, make sure they print out correctly */
LinkLists list1 = new LinkLists();
LinkLists list2 = new LinkLists();
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* insert some items, keep checking */
list1.add(\"hello\");
list1.add(\"world\");
list2.add(\"foo\");
list2.add(\"bar\");
list2.add(\"baz\");
System.out.println(\"list1 = \'\" + list1 + \"\', list2 = \'\" + list2 + \"\'\");
System.out.println(\"list1.size() = \" + list1.size() +
\", list2.size() = \" + list2.size());
/* remove an item at an invalid position */
boolean caught = false;
try {
list2.remove(4);
} catch .
JAVA A double-ended queue is a list that allows the addition and.pdf
**JAVA** A double-ended queue is a list that allows the addition and removal of items from
either end. One end is arbitrarily called the front and other the rear, but the two ends behave
identically. Specify, design and implement a class for a double-ended queue. Include operations
to check if it is empty and to return the number of items in the list. For each end, include
operations for adding and deleting items. Use doubly linked list for your implementation. Call
your class Deque (pronounced \"deck\").
Solution
//package com.java2novice.ds.queue;
public class DequeDblLinkedListImpl {
private LinkedNode front;
private LinkedNode rear;
public void insertFront(T item){
//add element at the beginning of the queue
System.out.println(\"adding at front: \"+item);
LinkedNode nd = new LinkedNode();
nd.setValue(item);
nd.setNext(front);
if(front != null) front.setPrev(nd);
if(front == null) rear = nd;
front = nd;
}
public void insertRear(T item){
//add element at the end of the queue
System.out.println(\"adding at rear: \"+item);
LinkedNode nd = new LinkedNode();
nd.setValue(item);
nd.setPrev(rear);
if(rear != null) rear.setNext(nd);
if(rear == null) front = nd;
rear = nd;
}
public void removeFront(){
if(front == null){
System.out.println(\"Deque underflow!! unable to remove.\");
return;
}
//remove an item from the beginning of the queue
LinkedNode tmpFront = front.getNext();
if(tmpFront != null) tmpFront.setPrev(null);
if(tmpFront == null) rear = null;
System.out.println(\"removed from front: \"+front.getValue());
front = tmpFront;
}
public int size(){
if(front == null && rear ==null){
return 0;
}
//remove an item from the beginning of the queue
LinkedNode tmpFront = front;
LinkedNode tmpRear = rear;
int i=0;
while(tmpFront != rear)
{
i++;
tmpFront=tmpFront.getNext();
}
i++;
return i;
}
public void removeRear(){
if(rear == null){
System.out.println(\"Deque underflow!! unable to remove.\");
return;
}
//remove an item from the beginning of the queue
LinkedNode tmpRear = rear.getPrev();
if(tmpRear != null) tmpRear.setNext(null);
if(tmpRear == null) front = null;
System.out.println(\"removed from rear: \"+rear.getValue());
rear = tmpRear;
}
public static void main(String a[]){
DequeDblLinkedListImpl deque = new DequeDblLinkedListImpl();
deque.insertFront(34);
deque.insertFront(67);
System.out.println(\"Size of the queue : \"+deque.size());
deque.insertFront(29);
deque.insertFront(765);
deque.removeFront();
deque.removeFront();
deque.removeFront();
deque.insertRear(43);
deque.insertRear(83);
deque.insertRear(84);
deque.insertRear(546);
deque.insertRear(356);
deque.removeRear();
deque.removeRear();
deque.removeRear();
deque.removeRear();
deque.removeFront();
deque.removeFront();
deque.removeFront();
}
}
class LinkedNode{
private LinkedNode prev;
private LinkedNode next;
private T value;
public LinkedNode getPrev() {
return prev;
}
public void setPrev(LinkedNode prev) {
this.prev = prev;
}
public LinkedNode getNext() {
return next;
}
public void setNext(L.
C++ Please test your program before you submit the answer.pdf
C++. Please, test your program before you submit the answer.
Background:
Circular Linked List: A circular linked list is a linked list where a non-empty list has no null pointers.
Unless empty, each node has a pointer to the next node, and the last node points back to the first
node.
Assigment:
Write a cpp program that will serve the purpose of a test driver for previously written CLinkedList.h
file. Your program will:
1) Create a choice menu and prompt the user for input. Must be case insensitive!
2) Read the input and call for functions outside of main, in order to perform operations chosen by
the user. These functions involve: Inserting Interger, Removing Interger, Forward Print and
Backward Print.
Requirements and Notes:
1. Forwards Print does not require a subfunction in order to produce output. All the other
operations must call corresponding subfunctions.
2. Nodes of the circular list must be arranged in ascending order.
3. User Input must be processed case insensitive, and implemented using the loop.
4. Document your code completely.
5. CLinkedList.h file contains 3 classes.
- Circular linked lists class with following member functions: constructor, copy constructor,
destructor, assignment operator, insert and remove.
- Node class included in the file header.
- A list iterator class provides a public interface to the list. The pointer points at nodes in the linked
list. Its member functions are as follows:
Constructor: Assigns the linked list data member to the parameter, a reference to a circular linked
list.
begin() sets the iterator to the first node of the linked list (or NULL if the list is empty)
isEmpty() returns whether or not the wrapped linked list is empty
isFirstNode() returns whether the present node is the first node of the linked list
isLastNode() returns whether the present node is the last node of the linked list
operator*() returns the data of the node currently pointed at. (You need 2)
operator++() pre-increment operator advances the pointer to the next node in the list, if there is
one
operator++(int) post-increment operator advances the pointer to the next node in the list, if there
is one
6. Insert function must give feedback where it says the position of where the int was inserted for
example: "Inserting 25 in the middle."
7. Remove function must give either one of these types of feedback:
- "Removing 25" if the int given by the user was found in the list
-"Cannot find 25" if it was not. The program will then move the user back to the choice menu.
Files:
// File: Node.h
// Singly-linked list node definition/implementation (also good for circular)
#ifndef NODE_H
#define NODE_H
// Need to prototype template classes if they are to be friends
template <typename eltType> class CLinkedList;
template <typename eltType> class CListItr;
template <typename eltType> class Node
{ private:
Node(eltType info, Node* link = NULL ) :
data(info), next(link)
{};
eltType data;
Node *next;
friend class CLinkedList<eltType>;
friend c.
Write a JAVA LinkedListRec class that has the following methods siz.pdf
Write a JAVA LinkedListRec class that has the following methods: size, empty, insertBefore,
insertAfter, addAtHead, addAtEnd, remove, replace, peekFront, peekEnd, removeFront,
removeEnd, toString. Use recursion to implement most of these methods. Write a driver to test
your implemented LinkedListRec class methods.
Solution
import java.util.Scanner;
public class LinkedListRec {
int data;
LinkedListRec prev=null,next=null;
int size(LinkedListRec l)//method which returns the length of the list
{
if(l==null)return 0;
return 1+size(l.next);
}
boolean empty(LinkedListRec l)//method checks whether the list is empty or not...
{
if(l==null)return true;
else return false;
}
LinkedListRec insertBefore(LinkedListRec l,int value,int num_insertbefore)//method which
adds a new number before the given number..
{
if(l==null)return l;
if(l.data == num_insertbefore)
{
LinkedListRec n = new LinkedListRec();
n.data = value;
if(l.prev==null)
{
n.next = l;
l=n;
}
else
{
n.prev = l.prev;
n.next= l;
l.prev = n;
}
return l;
}
return insertBefore(l.next,value,num_insertbefore);
}
LinkedListRec insertAfter(LinkedListRec l,int value,int num_insertafter)//method which adds
the new number after the given number
{
if(l==null)return l;
if(l.data == num_insertafter)
{
LinkedListRec n = new LinkedListRec();
n.data = value;
if(l.next==null)
{
l.next = n;
n.prev = l;
}
else
{
n.next = l.next;
l.next.prev = n;
n.prev = l;
}
return l;
}
return insertAfter(l.next,value,num_insertafter);
}
LinkedListRec addAtHead(LinkedListRec l,int value)//method which adds a new number at
the head position of the list...
{
LinkedListRec n = new LinkedListRec();
n.data=value;
n.next = l;
l=n;
return l;
}
LinkedListRec addAtEnd(LinkedListRec l,int value)//method which adds a new number at
the end position of the list...
{
if(l==null){ l = new LinkedListRec();l.data = value;return l;}
if(l.next==null)
{
LinkedListRec n = new LinkedListRec();
n.data=value;
n.prev = l;
l.next = n;
return l;
}
return addAtEnd(l.next,value);
}
LinkedListRec remove(LinkedListRec l,int value)//method which removes given numbet
from the list....
{
if(l==null)return l;
if(l.data == value)
{
if(l.prev!=null){
l.prev = l.next;
}
else
l=l.next;
return l;
}
return remove(l.next,value);
}
boolean replace(LinkedListRec l,int value,int newvalue)//method which replaces current
number with new number,...
{
if(l==null)return false;
if(l.data == value)
{
l.data = newvalue;
return true;
}
return replace(l.next,value,newvalue);
}
int peekFront(LinkedListRec l)//method which returns the first value of the list...
{
if(l!=null)
return l.data;
else return -1;
}
int peekEnd(LinkedListRec l)//method which returns the last value of the list........
{
if(l==null)return -1;
if(l.next == null)return l.data;
return peekEnd(l.next);
}
LinkedListRec removeFront(LinkedListRec l)//method which removes the first element of the
list..
{
if(l==null)return l;
l=l.next;
return l;
}
boolean removeEnd(LinkedListRec l)//method which removes the last element o.
Help please, I have attached LinkedList.cpp and LinkedList.hPlease.pdf
Help please, I have attached LinkedList.cpp and LinkedList.h
Please help with the implementation of the Stack.h and Stack.cpp as well
LinkedList.cpp
~~~~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
/*Exercise2 */
void LinkedList::insertAtFront(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
if (last == NULL)
first = last = temp;
else
{
temp->next = first;
first = temp;
}
}
bool LinkedList::removeFromFront()
{
if (first == NULL)
return false;
Node *temp = first;
first = first->next;
free(temp);
if (first == NULL)
last = NULL;
return true;
}
LinkedList.h
~~~~~~~~~~~
#include \"LinkedList.h\"
LinkedList::LinkedList()
{
first = last = NULL;
}
LinkedList::~LinkedList()
{
while (first != NULL)
{
Node *temp;
temp = first;
first = first->next;
free(temp);
}
last = NULL;
}
void LinkedList::insertAtBack(int valueToInsert)
{
Node *temp = (Node *)malloc(sizeof(Node));
temp->val = valueToInsert;
temp->next = NULL;
if (last == NULL)
first = last = temp;
else
{
last->next = temp;
last = temp;
}
}
bool LinkedList::removeFromBack()
{
if (first == NULL)
return false;
else if (first == last)
{
free(first);
first = last = NULL;
}
else
{
Node *temp;
temp = first;
while (temp->next != last)
temp = temp->next;
last = temp;
temp = temp->next;
free(temp);
last->next = NULL;
}
return true;
}
void LinkedList::print()
{
Node *temp = first;
while (temp != last)
{
cout << temp->val << \" \";
temp = temp->next;
}
if (temp != NULL)
cout << temp->val;
}
bool LinkedList::isEmpty()
{
if (first == last)
return true;
return false;
}
int LinkedList::size()
{
int count = 0;
Node *temp = first;
if (temp == NULL)
return count;
while (temp != last)
{
count++;
temp = temp->next;
}
return count + 1;
}
void LinkedList::clear()
{
while (first != NULL)
{
Node *.
Implement the unsorted single linked list as we did in the class and .pdf
Implement the unsorted single linked list as we did in the class and implement the following
operations: 1.DeletelastDuplicat(): For any element in the linked list, if there are multiple copies
(> = 2 copies), delete the last copy. DeleteSecondlastDuplicat(): For any element in the linked
list, if there are multiple copies (> = 2 copies), delete the second last copy Test your program
with the following operations: a)insert 5 b)Insert 7 c)Insert 11 d)Insert 5 e)Insert f) Insert 5 g)
Print out the list h) Delete the last duplicate of 5 i)Print out the list i) Delete the last duplicate
of 11 k) Print out the list I) Insert 11 m) Insert 7 n) Print out the list O) Delete the second last
duplicate of 5 p) Print out the list q) Delete the second last duplicate of 7 r) Print out the list
Solution
#include
#include
#include
using namespace std;
struct node
{
int data;
struct node *next;
}*start;
class LinkedList
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos(int);
void delete_lastdup();
void delete_seclast();
int search(int);
void display();
int get_count(int);
LinkedList()
{
start = NULL;
}
};
int main()
{
int choice, pos, value, res=0;
LinkedList sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<>pos;
sl.delete_pos(pos);
break;
case 5:
cout<<\"Search element in Link List: \"<>value;
res=sl.search(value);
cout<<\"Element \"<data = value;
temp->next = NULL;
return temp;
}
}
//function to insert element at beginning
void LinkedList::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<next != NULL)
{
if(s->data == value)
count++;
s = s->next;
}
return count;
}
//function to insert node at last
void LinkedList::insert_last()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<>value;
c=get_count(value);
if(c<2)
{
cout<<\"duplicate does not exist\"<>value;
c=get_count(value);
x=c-1;
if(c<2)
{
cout<<\"duplicate does not exist\"<data == value)
{
f++;
res=pos;
if(f==x)
break;
}
s = s->next;
}
delete_pos(res);
}
}
//delete element at p.
Write a program to implement below operations with both singly and d.pdf
Write a program to implement below operations with both singly and doubly linked list. Use
inheritance to define singly linked list and doubly linked list. Add Node() Delete Node() Update
Node() Delete All() Size()
Solution
#include
using namespace std;
class List;
class Node
{
friend class List;
protected:
int Data;
Node *Link;
};
class List:public Node
{
friend class Node;
private:
Node *Start;
public:
List()
{
Start=NULL;
}
Node Insert(int x);
Node Delete(int &x);
void Display();
};
Node List::Insert(int x)
{
Node *New=new Node;
New->Data=x;
New->Link=Start;
Start=New;
return *this;
}
Node List::Delete(int &x)//deletes first node
{
Node *Del=Start;
Start=Start->Link;
delete Del;
return *this;
}
void List::Display()
{
Node *P=Start;
while(P!=NULL)
{
cout<Data<<\" \";
P=P->Link;
}
}
int main()
{
List L;
L.Insert(4);
L.Insert(64);
L.Insert(3);
L.Insert(90);
L.Insert(66);
L.Insert(13);
L.Display();
}
Double Linked List.
Implement the member function void insertAfterHead(int d) of the Lin.pdf
Implement the member function void insertAfterHead(int d) of the LinkedList class . The job of
the function is to insert a new node with data d right after the head node. Your header will be
void LinkedList::insertAfterHead(int d)
The function does nothing if called on an empty list.
My incorrect code. I am having trouble with this last line.
void LinkedList::insertAfterHead(int d)
{
if(headPtr!= null)
{
head_>next = new Node
new Node->next =headPtr->next
}
Node * temp = headPtr;
Node * nodeToInsert = new Node() ;
nodeToInsert->data=d ;
nodeToInsert->next=temp ;
headPtr=nodeToInsert;
}
}
Solution
Hi Friend please find my implementation
Please let me know in case of any issue.
void LinkedList::insertAfterHead(int d)
{
// Case 1: Header Node is null then add at front
if(headPtr == null)
{
headPtr = new Node(d);
}else{
Node *newNode = new Node(d); //creating new node
newNode->setNext(headPtr->getNext()); // pointing newNode\'s next to head\'s next
headPtr.setNext(newNode); // pointing head\'s next to newNode
}
}
}.
This assignment and the next (#5) involve design and development of a.pdf
This assignment and the next (#5) involve design and development of a sequential
non contiguous and dynamic datastructure called LinkedList. A linked list object is
a container consisting of connected ListNode objects. As before, we are not going
to use pre-fabricated classes from the c++ library, but construct the LinkedList
ADT from scratch.
The first step is construction and testing of the ListNode class. A ListNode object
contains a data field and a pointer to the next ListNode object (note the recursive
definition).
#This assignment requires you to
1. Read the Assignment 4 Notes
2. Watch the Assignment 4 Support video
3. Implement the following methods of the ListNode class
-custom constructor
-setters for next pointer and data
4. Implement the insert and remove method in the main program
5. Scan the given template to find the above //TODO and implement the code
needed
//TODO in ListNodecpp.h file
public: ListNode(T idata, ListNode<T> * newNext);
public: void setNext(ListNode<T> * newNext);
public: void setData(T newData);
// TODO in main program
void remove(ListNode<int> * &front,int value)
void insert(ListNode<int> * &front,int value)
# The driver is given ListNodeMain.cpp is given to you that does the following
tests
1. Declares a pointer called front to point to a ListNode of datatype integer
2. Constructs four ListNodes with data 1,2,4 and adds them to form a linked
list.
3. Inserts ListNode with data 3 to the list
4. Removes node 1 and adds it back to test removing and adding the first
element
5. Removes node 3 to test removing a middle node
6. Removes node 4 to test removing the last node
7. Attempt to remove a non existent node
8. Remove all existing nodes to empty the list
9. Insert node 4 and then node 1 to test if insertions preserve order
10.Print the list
Main.cpp
#include <iostream>
#include "ListNodecpp.h"
// REMEMBER each ListNode has two parts : a data field
// and an address field. The address is either null or points to the next node
//in the chain
//Requires: integer value for searching, address of front
//Effects: traverses the list node chain starting from front until the end comparing search value
with listnode getData. Returns the original search value if found, if not adds +1 to indicate not
found
//Modifies: Nothing
int search(ListNode<int> * front, int value);
//Requires: integer value for inserting, address of front
//Effects: creates a new ListNode with value and inserts in proper position (increasing order)in
the chain. If chain is empty, adds to the beginning
//Modifies: front, if node is added at the beginning.
//Also changes the next pointer of the previous node to point to the
//newly inserted list node. the next pointer of the newly inserted pointer
//points to what was the next of the previous node.
//This way both previous and current links are adjusted
//******** NOTE the use of & in passing pointer to front as parameter -
// Why do you think this is needed ?**********
void insert(ListNode<int> * &fr.
C++ Background Circular Linked List A circular linked list.pdf
C++
Background:
Circular Linked List: A circular linked list is a linked list where a non-empty list has no null pointers.
Unless empty, each node has a pointer to the next node, and the last node points back to the first
node.
Assigment:
Write a cpp program that will serve the purpose of a test driver for previously written CLinkedList.h
file. Your program will:
1) Create a choice menu and prompt the user for input. Must be case insensitive!
2) Read the input and call for functions outside of main, in order to perform operations chosen by
the user. These functions involve: Inserting Interger, Removing Interger, Forward Print and
Backward Print.
Requirements and Notes:
1. Forwards Print does not require a subfunction in order to produce output. All the other
operations must call corresponding subfunctions.
2. Nodes of the circular list must be arranged in ascending order.
3. User Input must be processed case insensitive, and implemented using the loop.
4. Document your code completely.
5. CLinkedList.h file contains 3 classes.
- Circular linked lists class with following member functions: constructor, copy constructor,
destructor, assignment operator, insert and remove.
- Node class included in the file header.
- A list iterator class provides a public interface to the list. The pointer points at nodes in the linked
list. Its member functions are as follows:
Constructor: Assigns the linked list data member to the parameter, a reference to a circular linked
list.
begin() sets the iterator to the first node of the linked list (or NULL if the list is empty)
isEmpty() returns whether or not the wrapped linked list is empty
isFirstNode() returns whether the present node is the first node of the linked list
isLastNode() returns whether the present node is the last node of the linked list
operator*() returns the data of the node currently pointed at. (You need 2)
operator++() pre-increment operator advances the pointer to the next node in the list, if there is
one
operator++(int) post-increment operator advances the pointer to the next node in the list, if there
is one
6. Insert function must give feedback where it says the position of where the int was inserted for
example: "Inserting 25 in the middle."
7. Remove function must give either one of these types of feedback:
- "Removing 25" if the int given by the user was found in the list
-"Cannot find 25" if it was not. The program will then move the user back to the choice menu.
Files:
// File: Node.h
// Singly-linked list node definition/implementation (also good for circular)
#ifndef NODE_H
#define NODE_H
// Need to prototype template classes if they are to be friends
template <typename eltType> class CLinkedList;
template <typename eltType> class CListItr;
template <typename eltType> class Node
{ private:
Node(eltType info, Node* link = NULL ) :
data(info), next(link)
{};
eltType data;
Node *next;
friend class CLinkedList<eltType>;
friend class CListItr<eltType>;
};
#endif
// File: CLinkedList.h
.
Background Circular Linked List A circular linked list is .pdf
Background:
Circular Linked List: A circular linked list is a linked list where a non-empty list has no null pointers.
Unless empty, each node has a pointer to the next node, and the last node points back to the first
node.
Assigment:
Write a cpp program that will serve the purpose of a test driver for previously written CLinkedList.h
file. Your program will:
1) Create a choice menu and prompt the user for input. Must be case insensitive!
2) Read the input and call for functions outside of main, in order to perform operations chosen by
the user. These functions involve: Inserting Interger, Removing Interger, Forward Print and
Backward Print.
Requirements and Notes:
1. Forwards Print does not require a subfunction in order to produce output. All the other
operations must call corresponding subfunctions.
2. Nodes of the circular list must be arranged in ascending order.
3. User Input must be processed case insensitive, and implemented using the loop.
4. Document your code completely.
5. CLinkedList.h file contains 3 classes.
- Circular linked lists class with following member functions: constructor, copy constructor,
destructor, assignment operator, insert and remove.
- Node class included in the file header.
- A list iterator class provides a public interface to the list. The pointer points at nodes in the linked
list. Its member functions are as follows:
Constructor: Assigns the linked list data member to the parameter, a reference to a circular linked
list.
begin() sets the iterator to the first node of the linked list (or NULL if the list is empty)
isEmpty() returns whether or not the wrapped linked list is empty
isFirstNode() returns whether the present node is the first node of the linked list
isLastNode() returns whether the present node is the last node of the linked list
operator*() returns the data of the node currently pointed at. (You need 2)
operator++() pre-increment operator advances the pointer to the next node in the list, if there is
one
operator++(int) post-increment operator advances the pointer to the next node in the list, if there
is one
6. Insert function must give feedback where it says the position of where the int was inserted for
example: "Inserting 25 in the middle."
7. Remove function must give either one of these types of feedback:
- "Removing 25" if the int given by the user was found in the list
-"Cannot find 25" if it was not. The program will then move the user back to the choice menu.
Files:
// File: Node.h
// Singly-linked list node definition/implementation (also good for circular)
#ifndef NODE_H
#define NODE_H
// Need to prototype template classes if they are to be friends
template <typename eltType> class CLinkedList;
template <typename eltType> class CListItr;
template <typename eltType> class Node
{ private:
Node(eltType info, Node* link = NULL ) :
data(info), next(link)
{};
eltType data;
Node *next;
friend class CLinkedList<eltType>;
friend class CListItr<eltType>;
};
#endif
// File: CLinkedList.h
// C.
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdf
SOURCE CODE:
import java.util.Iterator;
public class CircularLinkedList implements Iterable {
Node head , tail;
int size;
CircularLinkedList() {
head = null;
tail = null;
size = 0;
}
public boolean add(E e) {
Node ele = new Node(e);
ele.next = head;
if(head == null)
{
head = ele;
ele.next = head;
tail = head;
}
else
{
tail.next = ele;
tail = ele;
}
size++;
return true;
}
public boolean add(int index, E e){
Node ele = new Node(e);
Node ptr = head;
index = index - 1 ;
for (int i = 1; i < size - 1; i++)
{
if (i == index)
{
Node tmp = ptr.next;
ptr.next = ele;
ele.next = tmp;
break;
}
ptr = ptr.next;
}
size++ ;
return true;
}
private Node getNode(int index ) {
return null;
}
public E remove(int index) {
Node ret;
if (size == 1 && index == 1)
{
ret = head;
head = null;
tail = null;
size = 0;
return ret.getElement();
}
if (index == 1)
{
ret = head;
head = head.next;
tail.next = head;
size--;
return ret.getElement();
}
if (index == size)
{
Node s = head;
Node t = head;
while (s != tail)
{
t = s;
s = s.next;
}
ret = tail;
tail = head;
tail = t;
size --;
return ret.getElement();
}
Node ptr = head;
index = index - 1 ;
for (int i = 1; i < size - 1; i++)
{
if (i == index)
{
Node tmp = ptr.next;
tmp = tmp.next;
ptr.next = tmp;
break;
}
ptr = ptr.next;
}
size-- ;
return ptr.getElement();
}
public String toString()
{
Node current = head;
String result = \"\";
if(size == 0){
return \"\";
}
if(size == 1) {
return head.getElement().toString();
}
else{
do{
result = result + current.getElement().toString();
result = result + \" ==> \";
current = current.next;
} while(current != head);
}
return result;
}
public Iterator iterator() {
return new ListIterator();
}
private class ListIterator implements Iterator{
Node nextItem;
Node prev;
int index;
@SuppressWarnings(\"unchecked\")
public ListIterator(){
nextItem = (Node) head;
index = 0;
}
public boolean hasNext() {
return size != 0;
}
public E next() {
prev = nextItem;
nextItem = nextItem.next;
index = (index + 1) % size;
return prev.getElement();
}
public void remove() {
int target;
if(nextItem == head) {
target = size - 1;
} else{
target = index - 1;
index--;
}
CircularLinkedList.this.remove(target); //calls the above class
}
}
// Solve the problem in the main method
// The answer of n = 13, k = 2 is
// the 11th person in the ring (index 10)
public static void main(String[] args){
CircularLinkedList l = new CircularLinkedList();
int n=13;
int k=2;
for(int i=1;i<=n;i++)
l.add(Integer.valueOf(i));
int j = 13,i=0;
while(j>0)
{
System.out.println(l.toString());
i = i + k;
if(i>j)
i = k;
l.remove(i);
j--;
}
}
}
OUTPUT:
1 ==> 2 ==> 3 ==> 4 ==> 5 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 5 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 12 ==> 13 ==>
1 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 12 ==> 13 ==>
1 ==> 4.
Hi,I have added the methods and main class as per your requirement.pdf
Hi,
I have added the methods and main class as per your requirement. it is working fine now.
Highlighted the code changes.
MyLinkedListTest.java
public class MyLinkedListTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
MyLinkedList list = new MyLinkedList();
list.addFirst(\"AAAAA\");
list.add(\"1\");
list.add(\"2\");
list.add(\"3\");
list.addLast(\"ZZZZZ\");
System.out.println(\"Linked List Elements : \"+list.toString());
System.out.println(\"First element: \"+list.getFirst());
System.out.println(\"Second element: \"+list.getLast());
System.out.println(\"Removed First Element: \"+list.removeFirst());
System.out.println(\"Now Linked List Elements : \"+list.toString());
System.out.println(\"Removed Last Element: \"+list.removeLast());
System.out.println(\"Now Linked List Elements : \"+list.toString());
System.out.println(\"Removed all element: \");
list.removeAll();
System.out.println(\"Now Linked List Elements : \"+list.toString());
}
}
MyLinkedList.java
public class MyLinkedList extends MyAbstractList {
private Node head, tail;
/** Create a default list */
public MyLinkedList() {
}
/** Create a list from an array of objects */
public MyLinkedList(E[] objects) {
super(objects);
}
/** Return the head element in the list */
public E getFirst() {
if (size == 0) {
return null;
}
else {
return (E)head.element;
}
}
/** Return the last element in the list */
public E getLast() {
if (size == 0) {
return null;
}
else {
return (E)tail.element;
}
}
/** Add an element to the beginning of the list */
public void addFirst(E e) {
Node newNode = new Node(e); // Create a new node
newNode.next = head; // link the new node with the head
head = newNode; // head points to the new node
size++; // Increase list size
if (tail == null) // the new node is the only node in list
tail = head;
}
/** Add an element to the end of the list */
public void addLast(E e) {
Node newNode = new Node(e); // Create a new for element e
if (tail == null) {
head = tail = newNode; // The new node is the only node in list
}
else {
tail.next = newNode; // Link the new with the last node
tail = tail.next; // tail now points to the last node
}
size++; // Increase size
}
/** Add a new element at the specified index in this list
* The index of the head element is 0 */
public void add(int index, E e) {
if (index == 0) {
addFirst(e);
}
else if (index >= size) {
addLast(e);
}
else {
Node current = head;
for (int i = 1; i < index; i++) {
current = current.next;
}
Node temp = current.next;
current.next = new Node(e);
(current.next).next = temp;
size++;
}
}
/** Remove the head node and
* return the object that is contained in the removed node. */
public E removeFirst() {
if (size == 0) {
return null;
}
else {
Node temp = head;
head = head.next;
size--;
if (head == null) {
tail = null;
}
return (E)temp.element;
}
}
/** Remove all elements from list */
public void removeAll() {
while(true) {
if (size == 0) {
break;
}
else {
Node temp = head;
head =.
Exception to indicate that Singly LinkedList is empty. .pdf
/**
* Exception to indicate that Singly LinkedList is empty.
*/
class LinkedListEmptyException extends RuntimeException {
public LinkedListEmptyException() {
super();
}
public LinkedListEmptyException(String message) {
super(message);
}
}
/**
* Node class, which holds data and contains next which points to next Node.
*/
class Node {
public int data; // data in Node.
public Node next; // points to next Node in list.
/**
* Constructor
*/
public Node(int data) {
this.data = data;
}
/**
* Display Node\'s data
*/
public void displayNode() {
System.out.print(data + \" \");
}
}
/**
* Singly LinkedList class
*/
class LinkedList {
private Node first; // ref to first link on list
/**
* LinkedList constructor
*/
public LinkedList() {
first = null;
}
/**
* Insert New Node at first position
*/
public void insertFirst(int data) {
Node newNode = new Node(data); // Creation of New Node.
newNode.next = first; // newLink ---> old first
first = newNode; // first ---> newNode
}
/**
* Method deletes specific Node from Singly LinkedList in java.
*/
public Node deleteSpecificNode(int deleteKey) {
// Case1: when there is no element in LinkedList
if (first == null) { // means LinkedList in empty, throw exception.
throw new LinkedListEmptyException(
\"LinkedList doesn\'t contain any Nodes.\");
}
// Case2: when there is only one element in LinkedList- check whether we
// have to delete that Node or not.
if (first.data == deleteKey) { // means LinkedList consists of only one
// element, delete that.
Node tempNode = first; // save reference to first Node in tempNode-
// so that we could return saved reference.
first = first.next;
System.out.println(\"Node with data=\" + tempNode.data
+ \" was found on first and has been deleted.\");
return tempNode; // return deleted Node.
}
// Case3: when there are atLeast two elements in LinkedList
Node previous = null;
Node current = first;
while (current != null) {
if (current.data == deleteKey) {
System.out.println(\"Node with data=\" + current.data
+ \" has been deleted.\");
previous.next = current.next; // make previous node\'s next point
// to current node\'s next.
return current; // return deleted Node.
} else {
if (current.next == null) { // Means Node wasn\'t found.
System.out.println(\"Node with data=\" + deleteKey
+ \" wasn\'t found for deletion.\");
return null;
}
previous = current;
current = current.next; // move to next node.
}
}
return null;
}
/**
* Display Singly LinkedList
*/
public void displayLinkedList() {
System.out.print(\"Displaying LinkedList [first--->last]: \");
Node tempDisplay = first; // start at the beginning of linkedList
while (tempDisplay != null) { // Executes until we don\'t find end of
// list.
tempDisplay.displayNode();
tempDisplay = tempDisplay.next; // move to next Node
System.out.print(\"-->\");
}
System.out.println();
}
}
/**
* Main class - To test LinkedList.
*/
public class SinglyLinkedListDeleteNodeExample {
public static void main(String[] args) {
LinkedList linkedList = new LinkedList(); /.
C# code pleaseWrite a program that creates a link list object of 1.pdf
C# code please
Write a program that creates a link list object of 10 characters, then creates a second list object
containing a copy of the first list but in reverse order.
Solution
using System;
class LinkedList
{
private char data;
private LinkedList next;
public LinkedList()
{
data = \'c\';
next = null;
}
public LinkedList(char value)
{
data = value;
next = null;
}
public LinkedList Append(char value)
{
LinkedList node = new LinkedList(value);
if(this.next == null)
{
// Easy to handle
node.next = null; // already set in constructor
this.next = node;
}
else
{
// Insert in the middle
LinkedList temp = this.next;
node.next = temp;
this.next = node;
}
return node;
}
public void Display(LinkedList node)
{
if(node == null)
node = this;
System.Console.WriteLine(\"\ \ LinkedList:\ \ \");
while(node != null)
{
System.Console.Write(node.data+\" -> \");
node = node.next;
}
System.Console.Write(\"\ \");
}
public LinkedList Reverse_with_copy(LinkedList head)
{
LinkedList p = head;
LinkedList newhead = null;
while(true)
{
if(p == null)
return newhead;
LinkedList newnode = new LinkedList(p.data);
newnode.next = newhead;
newhead = newnode;
p = p.next;
}
}
}
class Program
{
static void Main(string[] args)
{
LinkedList head = new LinkedList(\'a\');
LinkedList p = head.Append(\'c\');
p = p.Append(\'e\');
p = p.Append(\'h\');
p = p.Append(\'b\');
p = p.Append(\'d\');
p = p.Append(\'f\');
p = p.Append(\'g\');
head.Display(null);
LinkedList newhead = head.Reverse_with_copy(head);
newhead.Display(null);
}
}
/* sample output
*/.
Java AssignmentUsing the ListNode.java file below Write method.pdf
Java Assignment
Using the ListNode.java file below
Write methods called min and max that return the smallest and largest values in the linked list.
These methods will be added to your ListNode class. For example if a variable called list stores
{11, -7, 3, 42, 0, 14], the call of list.min() should return -7 and the call of list.max() should return
42. If the list is empty, return -1. Print the returned value.
Write a method called insertNode that inserts a new node anywhere in your linked list. Display
your linked list with new value.
Write a program to test these methods to ensure accuracy and successful implementation. Upload
your modified version of the ListNode java file only.
Note: Original code should still be included. You will make additions and slight modifications
where necessary. Throw exceptions where you think is necessary. // Listlode is a class for storing
a single node of a linked // list. This node class is for a list of integer values. public class Listlode
\{ public int data; //data stored in this node public Listliode front;//points to head node public
Listliode next; /f link to next node in the list // post: constructs a node with data and null link
public Listlode() \{ 3. // post: constructs a node with given data and null link: public Listlode(int
data) \{ this(data, null); 3 // post: constructs a node with given data and given link. public
Listlode(int data, Listliode next) \{ this.data = data; this. next = next; 3 public String toString() \{
if (front = null) : \} else \{ String result = " ["+ front data; Listliode current = front. next; while
(current != null) \{ result +=m,m+ current data, current = current. next; 3 result += " ]n - return
result; 3. }// post: appends the given value to the end of the list public void add(int value) \&
puolic void aod if (front = nult) \{. front = new Listlode (value); 3 else \{ Listlode current =
front; whistiode current = front; while (current next I= null) \{ current = current. next; 3 current.
next = new Listliode (value ); 3. 3 J// post : returns the position of the first occurrence of the
given /l value (-1 if not found ) public void remove (int index) \{ if ( index =){ \} else \{ Listiode
current = nodeAt ( index - 1); current. next = current. next. next, 3 3 3// pre : <=i< size() // post:
returns a reference to the node at the given index public Listlode nodeAt (int index) : List Node
current = front; for (int i=0;i< index; i++) \{ current = current. next. \}. return current; 3.
There are a couple of new methods that you will be writing for this pr.pdf
There are a couple of new methods that you will be writing for this project. Some are easy, some
are hard. I have provided code that tests most of the methods by calling them from the main
method in the file ListTest.java. The test file will only work when you have done all the
methods. In COMP182LinkedList.java I have provided the signature (definition and input
parameters) for these methods. At this point to make sure you can run the file
(COMP182LinkedList.java that you downloaded from Cavas) I have added template values as
return types of the methods. For example, if the method returns an int then I added return 0 as the
return value. Here are the methods are as follows: Anything getFixst () Anything getLast () void
add (Anything value) void addafter (1nt index, Anyehtng value) Anything set(int index,
Rnything aewvalue) void removeAl1 (Anything vaiue) lastIndex (Anything value)
COMP182IinkedIi ateAnything; elone boolean equala (object in) CoMP182IinkedList
KAnythang? gplat () boolean hascycle () Node reveraeliat () Node oddeventiat () Node
deleteDuplicates () boolean ispalindrome () "For the last two methods, you need to add proper
testing to ListTest Java Method Specifications Here are more details for implementing each of
these methods. You need to complete all the following methods in the COMP182LinkedList
class. You can write the methods in any order you wish, but I suggest you do them in the order
they are listed. In particular, make sure all your methods work for empty lists, lists of different
sizes, etc as you can see from the sample test cases provided in ListTest.java. While grading your
project, we will make changes to these values! Also, make sure that your solutions do not modify
the original lists (unless you are specifically instructed to do so). roid main(String[] args) You
can use this method in the ListTest class to create lists as needed and test each of the methods
listed above. I have provided a few test cases, but you may want to add more to some of the
method tests. Until you get add working, you will need to use addFirst to create lists to test your
other methods. Anything getFirsto This method returns the value stored in the first node an the
list. It should prit an error message and seturn null if the list is empty. Anything getLasto This
method returns the value stored in the last node in the list. It should print an error mesiage and
retuin noll if the list is emipty. void add(Anything value) Thus method adds a nade containing
new yalue to the end of the last. This method returns the value stored in the first node in the list.
It should print an error message and return null if the list is empty. Anything getLast0 This
method returns the value stored in the last node in the list. It should print an error message and
retum null if the list is empty: void add(Anything value) This method adds a node containing
new value to the end of the list. void addAfter(int index, Anything value) This method adds a
node contai.
In this assignment you will implement insert() method for a singly l.pdf
In this assignment you will implement insert() method for a singly linked Link list. The code
MyLinkedlist.java is given , it uses generic type as the linked list can be created with any object
type. Some methods like add() and toString() are already implemented. The MyLinkedList class
has a private nested class called Node.
The objective of this assignment is to implement the insert() method that takes two inputs an
element of generic type to be inserted and an index (value of integer type) at which it should be
inserted. For this assignment we will assume the first element has the index 0. if the given index
is less than zero do nothing but if it is greater than the size of the list, insert the element at the
end of the list. if the index is between 0 and size , insert it in the appropriate location. You insert
code should correctly update the theSize data member of the linked list. Return type for insert()
method is boolean (true or false) depending on whether the insertion was successful or not. Use
the following method header.
}
Main.java
//add necessary libraries
public class Main
{
//add your function here
public static void main (String [] args)
{
}
}
MyLinkedList.java
public class MyLinkedList {
// A private nested Node class
private static class Node{
public AnyType data; // Data members are public, this is fine as the Node class itself is
private
public Node next;
public Node(AnyType d, Node n)
{
data = d;
next=n;
}
@Override
public String toString() {
return data.toString();
}
}
// Data Members
private Node head; // A node pointer to the first item in the List
private int theSize; // a integer variable to hold the size of the List
public MyLinkedList() {
doClear();
}
public void clear() {
doClear();
}
private void doClear() {
head = null;
theSize =0 ;
}
// An add method that will always add at the beginning of the List
public boolean add(AnyType x) {
if(head == null) // List is empty
{
head = new Node(x, null);
theSize++;
return true;
}
else // List has at least one item lets get to the end of it
{
Node newnode = new Node(x, head);
head = newnode;
theSize++;
return true;
}
}
@Override
public String toString() {
// This to String method will print the List from head to the end.
String theList = "";
if(head==null)
return theList;
Node cur = head;
while(cur.next!=null) {
theList = theList + cur.toString() + " ";
cur= cur.next;
}
return theList + cur.toString();
}
public int getTheSize() {
return theSize;
}
}
/*****************************************************************************
*
*
* SOLUTION CODE BELOW THIS HEADER
*
*****************************************************************************/
/*****************************************************************************
*
*
* SOLUTION CODE ABOVE THIS HEADER
*
*****************************************************************************/
}
Current file: Main.java Load default template... //add necessary Libraries public class Main \{
//add your function here public static vo.
Write a function to merge two doubly linked lists. The input lists ha.pdf
Write a function to merge two doubly linked lists. The input lists have their elements in sorted
order, from lowest to highest. The output list should also be sorted from lowest to highest. Your
algorithm should run in linear time on the length of the output list. Provide an algorithm for your
function Implement and show some samples of your running function
Solution
The algorithm for LinkedList MergeSort is as follows.
The trick in this algorithm is to use a local list to store the value which is pointing to the actual
list to be returned as a result of the function
Step1: START
Step2: GET inputs of list1 and list2
Step3: INITIALIZE mergelist
STEP4: SET mylist = mergelist
Step5: WHILE list1 OR list2 is EMPTY
DO
IF (list1 AND list2) are NOT EMPTY
IF list1.value > list2.value
mylist.next = list2
ELSE
mylist.next = list1
ELSE IF list1 is EMPTY
mylist.next = list2
ELSE
mylist.next = list1
Step6: RETURN mergelist
Step7: STOP
Sample program for the same implemented in C++
//====================================================================
========
// Name : DoublyLinkedList.cpp
// Author : Kaju
// Version : 0.1
// Copyright : This is just an example code
// Description : MergeSort in C++, Ansi-style
//====================================================================
========
/*
* C++ Program to Implement Doubly Linked List
*/
#include
#include
#include
/*
* Node Declaration
*/
using namespace std;
// struct declaration for node which will hold the integer data with links to previous data and next
data
struct node
{
int data;
struct node *next;
struct node *prev;
};
/*
Class Declaration
*/
class DoublyLinkedList
{
private:
struct node *start; // collection of all the nodes
public:
void create(int value);
int peek();
int delete_head();
void display();
int count();
void mergeSort(DoublyLinkedList list1, DoublyLinkedList list2);
DoublyLinkedList()
{
start = NULL;
}
};
/*
* Add data into the list
*/
void DoublyLinkedList::create(int value)
{
struct node *s, *temp;
temp = new(struct node);
temp->data = value;
temp->next = NULL;
if (start == NULL)
{
temp->prev = NULL;
start = temp;
}
else
{
s = start;
while (s->next != NULL)
s = s->next;
s->next = temp;
temp->prev = s;
}
}
/*
* Deletion of the first element from the list
* store the first element in a temp node and then remove it from start.
*/
int DoublyLinkedList::delete_head()
{
struct node *tmp, *q;
int value;
tmp = start;
if(start->next!=NULL)
{
start = start->next;
start->prev = NULL;
}
else
start = NULL;
value = tmp->data;
free(tmp);
return value;
}
/*
* return the first element of Doubly Link List
*/
int DoublyLinkedList::peek()
{
struct node *q;
if (start == NULL)
{
cout<<\"List is empty\"<data;
}
}
/*
* Display elements of Doubly Link List
*/
void DoublyLinkedList::display()
{
struct node *q;
if (start == NULL)
{
cout<<\"List is empty\"<data;
q = q->next;
if(q != NULL)
{
cout<<\", \";
}
}
cout<<\"]\"<next;
cnt++;
}
return cnt;
}
/*
* MergeSort - takes two input lists and then based on the.
For this micro assignment, you must implement two Linked List functi.docx
For this micro assignment, you must implement two Linked List functions. We will use the following
example Linked List:
2 0 -1 5 7
getElementAt(index)
This function should return the element (i.e. value) of the Nth item inside the linked list. For example,
on the Linked List above, getElementAt(0) should return 2; getElementAt(3) should return 5.
addElementAt(value, location)
This function should insert a new value at the given location. Note that the location supplied must be
within bounds of the LinkedList. For example, we cannot call addElementAt(4, 11) on the above Linked
List because 11 is beyond the size of the Linked List.
Here are some examples. If we call addElementAt(0, 1), the above Linked List would now look like:
1 2 0 -1 5 7
If we again call addElementAt(2, 123), we would get:
1 2 123 0 -1 5 7
Grading
Your submission will be graded based on the following:
1. [7] Your solution does not cause any runtime issues and your file passes all test cases
2. [3] Your code contains good style. For example,
You provide meaningful variable names
You provide sufficient and meaningful comments
Your code is well structured
@@@@@@@@@@@@@@@@@@@@@@@@
#ifndef LINKED_LIST_H
#define LINKED_LIST_H
#include
#include
#include "LinkedListNode.h"
#include
using namespace std;
template
class LinkedList
{
private:
//points to the front of the linked list
LinkedListNode *_front = nullptr;
//keeping track of size in a variable eliminates need to continually
//count LL boxes.
int _size = 0;
protected:
//creates a new LinkedListNode for us
virtual LinkedListNode *createNode(T value)
{
return new LinkedListNode < T > { value };
}
public:
//default constructor
LinkedList()
{
_front = nullptr;
}
//copy constructor
LinkedList(const LinkedList &other)
{
for (int i = 0; i < other.getSize(); i++)
{
addElement(other.getElementAt(i));
}
}
//move constructor
LinkedList(LinkedList &&other)
{
//take other's data
_front = other._front;
_size = other._size;
//reset other's pointers
other._front = nullptr;
}
//initializer list constructor
LinkedList(initializer_list values)
{
for (auto item : values)
{
addElement(item);
}
}
//Always remember to clean up pointers in destructor!
virtual ~LinkedList()
{
LinkedListNode *current = _front;
while (current != nullptr)
{
LinkedListNode *temp = current->getNext();
delete current;
current = temp;
}
}
//will return true if the LL is empty.
virtual bool isEmpty() const
{
return _size == 0;
}
//returns the size of the LL.
virtual int getSize() const
{
return _size;
}
.
Using visual studio 2022- a C# windows form application- and your Doub.pdf
Using visual studio 2022, a C# windows form application, and your DoubleLinkedClass and
DoubleLinkedNode classes from project 5, implement a DequeueClass, a StackClass, and a
QueueClass. Do not use any arrays, lists, dictionaries, or other built in data structures, only
instances of your linkedLists classes from project 5. The dequeue class needs to contain a
reference to an instance of your DoubleLinkedList class, with the QueueClass and StackClass
inheriting from the Dequeue class. Your Stack and Queue pop and push need to be one-line calls
to the Dequeue popLeft, pushLeft, popRight, pushRight. Do not copy the code from the dequeue
class to implement the Stack and Queue.
DoubleLinkedClasses From2263Project5
internal class DoubleLinkedList<T>
{
public DoubleLinkedListNode<T> firstNode = null;
public DoubleLinkedListNode<T> lastNode = null;
public DoubleLinkedListNode<T> currentNode = null;
public int nodeNumber = 0;
public DoubleLinkedList()
{
}
// creates first node in list with firstValue
public DoubleLinkedList(T firstValue)
{
firstNode = new DoubleLinkedListNode<T>(firstValue);
lastNode = firstNode;
currentNode = firstNode;
nodeNumber = 1;
}
public DoubleLinkedListNode<T> GetCurrentNode()
{
return currentNode;
}
public void InsertFirst(T value)
{
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
if (firstNode == null)
{
firstNode = newNode;
lastNode = firstNode;
currentNode = firstNode;
}
else
{
newNode.next = firstNode;
firstNode.previous = newNode;
firstNode = newNode;
currentNode = firstNode;
}
nodeNumber++;
}
public void InsertBeforeFirst(T value)
{
if (firstNode == null)
{
InsertFirst(value);
return;
}
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
newNode.next = firstNode;
firstNode.previous = newNode;
firstNode = newNode;
nodeNumber++;
}
public void InsertAfterLast(T value)
{
if (lastNode == null)
{
InsertFirst(value);
return;
}
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
lastNode.next = newNode;
newNode.previous = lastNode;
lastNode = newNode;
currentNode = lastNode;
nodeNumber++;
}
public void InsertAfterCurrent(T value)
{
if (currentNode == null)
{
InsertFirst(value);
return;
}
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
newNode.next = currentNode.next;
newNode.previous = currentNode;
if (currentNode.next != null)
{
currentNode.next.previous = newNode;
}
currentNode.next = newNode;
currentNode = newNode;
if (lastNode == currentNode.previous)
{
lastNode = currentNode;
}
nodeNumber++;
}
public int NumberOfNodesInList()
{
return nodeNumber;
}
public void DeleteFirst()
{
if (firstNode == null)
{
return;
}
if (firstNode.next == null)
{
firstNode = null;
lastNode = null;
currentNode = null;
}
else
{
firstNode = firstNode.next;
firstNode.previous = null;
currentNode = firstNode;
}
nodeNumber--;
}
public void DeleteLast()
{
if (lastNode == null)
{
return;
}
if (lastNode.previous == null)
{
firstNode = null;
lastNode = null;
currentNode = null.
Qestion Please add pre-condition, post-conditions and descriptions .pdf
Qestion: Please add pre-condition, post-conditions and descriptions for each member function of
the LINKED_LIST_CLASS. Answer with your new version of the program.
#include
using namespace std;
class LIST_NODE
{
public:
int data; // data element of node
LIST_NODE *next; // pointer element of node
};
class LINKED_LIST_CLASS
{
public:
LINKED_LIST_CLASS(); // default constructor
LINKED_LIST_CLASS(LINKED_LIST_CLASS &); // copy constructor
~LINKED_LIST_CLASS(); // destructor
void Add(int); // mutator
void Print(); // accessor
LIST_NODE * Search(int); // accessor
void Remove(int); // mutator
bool Is_Empty(); // accessor
private:
LIST_NODE *front; // pointer to front of list
};
LINKED_LIST_CLASS::LINKED_LIST_CLASS()
{
cout << endl << \"The default constructor has been called.\ \";
front = new LIST_NODE;
front->next = 0; // initialize the next field to null
front->data = -10000;
}
LINKED_LIST_CLASS::LINKED_LIST_CLASS(LINKED_LIST_CLASS & org)
{
cout << endl << \"The copy constructor has been called.\ \";
front = new LIST_NODE;
front->next = 0;
front->data = -10000;
LIST_NODE *p = org.front->next;
LIST_NODE *back = 0;
while(p!=0)
{
if (back == 0)
{
front->next = new LIST_NODE;
back = front->next;
back->next = 0;
back->data = p->data;
}
else
{
back->next = new LIST_NODE;
back = back->next;
back->data = p->data;
back->next = 0;
}
p=p->next;
}
}
LINKED_LIST_CLASS::~LINKED_LIST_CLASS()
{
cout << endl << \"The destructor has been called.\ \";
while (front->next != 0)
{
LIST_NODE *p = front->next;
front->next = front->next->next;
delete p;
}
delete front;
front = 0;
}
void LINKED_LIST_CLASS::Add(int item)
{
LIST_NODE *p = new LIST_NODE;
p->data = item;
if (front->next== 0) // empty list
{
front->next = p;
p->next = 0;
}
else // list has information and is not empty
{
p->next = front->next;
front->next = p;
}
}
void LINKED_LIST_CLASS::Print()
{
cout << endl;
for(LIST_NODE *p = front->next; p != 0; p = p->next)
{
cout << p->data;
if (p->next != 0)
{
cout << \"-->\";
}
}
cout<next; p!=0; p=p->next)
{
if (p->data == key)
return p;
}
return 0; // key not found in list
}
void LINKED_LIST_CLASS::Remove(int key)
{
LIST_NODE *p = Search(key);
if (Is_Empty())
{
cout << key << \" is not in the list. No removal performed!\ \";
}
else
{
LIST_NODE *q = front;
while (q->next->data != key)
{
q = q->next;
}
q->next = p->next; // CRITICAL STEP!!!!
delete p;
}
}
bool LINKED_LIST_CLASS::Is_Empty()
{
return front->next == 0;
}
int main()
{
LINKED_LIST_CLASS L1;
L1.Add(5);
L1.Add(10);
L1.Add(29);
L1.Print();
LINKED_LIST_CLASS L2 = L1;
L2.Print();
L1.Remove(10);
L1.Print();
return 0;
}
Solution
#include
using namespace std;
class LIST_NODE
{
public:
int data; // data element of node
LIST_NODE *next; // pointer element of node
};
class LINKED_LIST_CLASS
{
public:
LINKED_LIST_CLASS(); // default constructor
LINKED_LIST_CLASS(LINKED_LIST_CLASS &); // copy constructor
~LINKED_LIST_CLASS(); // destructor
void Add(int); // mutator
void Print(); // accessor
LIST_NODE * Search(int); // ac.
In C++Write a recursive function to determine whether or not a Lin.pdf
In C++
Write a recursive function to determine whether or not a Linked List is in sorted order (smallest
value to largest value).
Add the following function prototypes to your List class under the section for access functions,
then implement the functions below the class definition:
public:
/**Access Functions*/
bool isSorted();
//Wrapper function that calls the isSorted helper function to determine whether
//a list is sorted in ascending order.
//We will consider that a list is trivially sorted if it is empty.
//Therefore, no precondition is needed for this function
private:
bool isSorted(Nodeptr node);
//Helper function for the public isSorted() function.
//Recursively determines whether a list is sorted in ascending order.
#include //for NULL
#include
#include
using namespace std;
template //list stores generic list data, not any specific C++ type
class List
{
private:
struct Node
{
listdata data;
Node* next;
Node* previous;
Node(listdata data): data(data), next(NULL), previous(NULL){}
};
typedef struct Node* Nodeptr;
Nodeptr first;
Nodeptr last;
Nodeptr iterator;
int size;
public:
/**Constructors and Destructors*/
List();
//Default constructor; initializes and empty list
//Postcondition: numeric values equated to zero, or strings should be empty.
List(const List &list);
~List();
//Destructor. Frees memory allocated to the list
//Postcondition: position NodePtr at next Node
/**Accessors*/
listdata getFirst();
//Returns the first element in the list
//Precondition:NodePtr points to the first node on list
listdata getLast();
//Returns the last element in the list
//Precondition: make new node first on the list
listdata getIterator();
bool isEmpty();
//Determines whether a list is empty.
int getSize();
//Returns the size of the list
/**Manipulation Procedures*/
void startIterator();
void advanceIterator();
void removeLast();
//Removes the value of the last element in the list
//Precondition: list is not empty, not the first element.
//Postcondition: one remaining node
void removeIterator();
void removeFirst();
//Removes the value of the first element in the list
//Precondition: list is not empty
//Postcondition: no nodes left
void insertLast(listdata data);
//Inserts a new element at the end of the list
//If the list is empty, the new element becomes both first and last
//Postcondition: next equal to null
void insertFirst(listdata data);
//Inserts a new element at the start of the list
//If the list is empty, the new element becomes both first and last
//Postcondition:point nodePtr next node on list
/**Additional List Operations*/
bool offEnd();
void printList();
//Prints to the console the value of each element in the list sequentially
//and separated by a blank space
//Prints nothing if the list is empty
void insertIterator(listdata data);
bool operator==(const List &list);
};
// constructor definition
template
List::List(): first(NULL), last(NULL), iterator(NULL), size(0) {}
template
List::List(const List &list): size(list.size)
{
if(list..
Exercise 7-15 During October- Wichita Light Company experiences the fo.docx
Exercise 7-15
During October, Wichita Light Company experiences the following transactions in establishing a petty cash fund.
Journalize the entries in October that pertain to the petty cash fund. (Credit account titles are automatically indented when amount is entered. Do not indent manually.)
Date
Account Titles and Explanation
Debit
Credit
Oct. 1
Oct. 31
Exercise 7-15 During October, Wichita Light Company experiences the following transactions in establishing a petty cash fund. Oct. 1 A petty cash fund is established with a check for $150 issued to the petty cash custodian. 31 A check was written to reimburse the fund and increase the fund to $200. A count of the petty cash fund disclosed the following items: Currency $59.00 Coins 0.70 Expenditure receipts (vouchers): Supplies $26.10 Telephone, Internet, and fax 16.40 Postage 39.70 Freight-Out 6.80 Journalize the entries in October that pertain to the petty cash fund. (Credit account titles are automatically indented when amount is entered. Do not indent manually.) Date Account Titles and Explanation Debit Credit Oct. 1
Solution
Oct1 Petty cash Dr 150
to bank 150
(being fund created)
Oct 31 Supplies Dr 26.10
Telephone, int.. Dr 16.40
Postage Dr 39.70
Freight Out Dr 6.80
Cash short & excess Dr 1.30
To petty cash 90.30
(being expenses during the month)
Petty cash Dr 140.30
To Bank 140.30
(being amount re-imbursed and increased)
.
Exercise 4-3 (Part Level Submission) The adjusted trial balance column.docx
Exercise 4-3 (Part Level Submission) The adjusted trial balance columns of the worksheet for Albanese Company are as follows. No common stock was issued during April ALBANESE COMPANY Worksheet (partial) For the Month Ended April 30, 2014 Adjusted Trial Balance Account Titles Dr 7,442 7,840 2,280 23,000 Cash Accounts Receivable Prepaid Rent Equipment Accumulated Depreciation-Equip Notes Payable Accounts Payable Common Stock Retained Earnings Dividends Service Revenue Salaries and Wages Expense Rent Expense Depreciation Expense Interest Expense Interest Payable Totals 4,800 5,700 5,672 22,000 4,000 3,000 12,590 9,840 760 600 57 57 54,819 54,819
Solution
Answer:
.
More Related Content
Similar to Everything compiles and everything runs correctly except my insertionS.docx
Implement the unsorted single linked list as we did in the class and .pdf
Implement the unsorted single linked list as we did in the class and implement the following
operations: 1.DeletelastDuplicat(): For any element in the linked list, if there are multiple copies
(> = 2 copies), delete the last copy. DeleteSecondlastDuplicat(): For any element in the linked
list, if there are multiple copies (> = 2 copies), delete the second last copy Test your program
with the following operations: a)insert 5 b)Insert 7 c)Insert 11 d)Insert 5 e)Insert f) Insert 5 g)
Print out the list h) Delete the last duplicate of 5 i)Print out the list i) Delete the last duplicate
of 11 k) Print out the list I) Insert 11 m) Insert 7 n) Print out the list O) Delete the second last
duplicate of 5 p) Print out the list q) Delete the second last duplicate of 7 r) Print out the list
Solution
#include
#include
#include
using namespace std;
struct node
{
int data;
struct node *next;
}*start;
class LinkedList
{
public:
node* create_node(int);
void insert_begin();
void insert_pos();
void insert_last();
void delete_pos(int);
void delete_lastdup();
void delete_seclast();
int search(int);
void display();
int get_count(int);
LinkedList()
{
start = NULL;
}
};
int main()
{
int choice, pos, value, res=0;
LinkedList sl;
start = NULL;
while (1)
{
cout<>choice;
switch(choice)
{
case 1:
cout<<\"Inserting Node at Beginning: \"<>pos;
sl.delete_pos(pos);
break;
case 5:
cout<<\"Search element in Link List: \"<>value;
res=sl.search(value);
cout<<\"Element \"<data = value;
temp->next = NULL;
return temp;
}
}
//function to insert element at beginning
void LinkedList::insert_begin()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *p;
temp = create_node(value);
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
p = start;
start = temp;
start->next = p;
}
cout<<\"Element Inserted at beginning\"<next != NULL)
{
if(s->data == value)
count++;
s = s->next;
}
return count;
}
//function to insert node at last
void LinkedList::insert_last()
{
int value;
cout<<\"Enter the value to be inserted: \";
cin>>value;
struct node *temp, *s;
temp = create_node(value);
s = start;
while (s->next != NULL)
{
s = s->next;
}
temp->next = NULL;
s->next = temp;
cout<<\"Element Inserted at last\"<>value;
struct node *temp, *s, *ptr;
temp = create_node(value);
cout<<\"Enter the postion at which node to be inserted: \";
cin>>pos;
int i;
s = start;
while (s != NULL)
{
s = s->next;
counter++;
}
if (pos == 1)
{
if (start == NULL)
{
start = temp;
start->next = NULL;
}
else
{
ptr = start;
start = temp;
start->next = ptr;
}
}
else if (pos > 1 && pos <= counter)
{
s = start;
for (i = 1; i < pos; i++)
{
ptr = s;
s = s->next;
}
ptr->next = temp;
temp->next = s;
}
else
{
cout<<\"Positon out of range\"<>value;
c=get_count(value);
if(c<2)
{
cout<<\"duplicate does not exist\"<>value;
c=get_count(value);
x=c-1;
if(c<2)
{
cout<<\"duplicate does not exist\"<data == value)
{
f++;
res=pos;
if(f==x)
break;
}
s = s->next;
}
delete_pos(res);
}
}
//delete element at p.
Write a program to implement below operations with both singly and d.pdf
Write a program to implement below operations with both singly and doubly linked list. Use
inheritance to define singly linked list and doubly linked list. Add Node() Delete Node() Update
Node() Delete All() Size()
Solution
#include
using namespace std;
class List;
class Node
{
friend class List;
protected:
int Data;
Node *Link;
};
class List:public Node
{
friend class Node;
private:
Node *Start;
public:
List()
{
Start=NULL;
}
Node Insert(int x);
Node Delete(int &x);
void Display();
};
Node List::Insert(int x)
{
Node *New=new Node;
New->Data=x;
New->Link=Start;
Start=New;
return *this;
}
Node List::Delete(int &x)//deletes first node
{
Node *Del=Start;
Start=Start->Link;
delete Del;
return *this;
}
void List::Display()
{
Node *P=Start;
while(P!=NULL)
{
cout<Data<<\" \";
P=P->Link;
}
}
int main()
{
List L;
L.Insert(4);
L.Insert(64);
L.Insert(3);
L.Insert(90);
L.Insert(66);
L.Insert(13);
L.Display();
}
Double Linked List.
Implement the member function void insertAfterHead(int d) of the Lin.pdf
Implement the member function void insertAfterHead(int d) of the LinkedList class . The job of
the function is to insert a new node with data d right after the head node. Your header will be
void LinkedList::insertAfterHead(int d)
The function does nothing if called on an empty list.
My incorrect code. I am having trouble with this last line.
void LinkedList::insertAfterHead(int d)
{
if(headPtr!= null)
{
head_>next = new Node
new Node->next =headPtr->next
}
Node * temp = headPtr;
Node * nodeToInsert = new Node() ;
nodeToInsert->data=d ;
nodeToInsert->next=temp ;
headPtr=nodeToInsert;
}
}
Solution
Hi Friend please find my implementation
Please let me know in case of any issue.
void LinkedList::insertAfterHead(int d)
{
// Case 1: Header Node is null then add at front
if(headPtr == null)
{
headPtr = new Node(d);
}else{
Node *newNode = new Node(d); //creating new node
newNode->setNext(headPtr->getNext()); // pointing newNode\'s next to head\'s next
headPtr.setNext(newNode); // pointing head\'s next to newNode
}
}
}.
This assignment and the next (#5) involve design and development of a.pdf
This assignment and the next (#5) involve design and development of a sequential
non contiguous and dynamic datastructure called LinkedList. A linked list object is
a container consisting of connected ListNode objects. As before, we are not going
to use pre-fabricated classes from the c++ library, but construct the LinkedList
ADT from scratch.
The first step is construction and testing of the ListNode class. A ListNode object
contains a data field and a pointer to the next ListNode object (note the recursive
definition).
#This assignment requires you to
1. Read the Assignment 4 Notes
2. Watch the Assignment 4 Support video
3. Implement the following methods of the ListNode class
-custom constructor
-setters for next pointer and data
4. Implement the insert and remove method in the main program
5. Scan the given template to find the above //TODO and implement the code
needed
//TODO in ListNodecpp.h file
public: ListNode(T idata, ListNode<T> * newNext);
public: void setNext(ListNode<T> * newNext);
public: void setData(T newData);
// TODO in main program
void remove(ListNode<int> * &front,int value)
void insert(ListNode<int> * &front,int value)
# The driver is given ListNodeMain.cpp is given to you that does the following
tests
1. Declares a pointer called front to point to a ListNode of datatype integer
2. Constructs four ListNodes with data 1,2,4 and adds them to form a linked
list.
3. Inserts ListNode with data 3 to the list
4. Removes node 1 and adds it back to test removing and adding the first
element
5. Removes node 3 to test removing a middle node
6. Removes node 4 to test removing the last node
7. Attempt to remove a non existent node
8. Remove all existing nodes to empty the list
9. Insert node 4 and then node 1 to test if insertions preserve order
10.Print the list
Main.cpp
#include <iostream>
#include "ListNodecpp.h"
// REMEMBER each ListNode has two parts : a data field
// and an address field. The address is either null or points to the next node
//in the chain
//Requires: integer value for searching, address of front
//Effects: traverses the list node chain starting from front until the end comparing search value
with listnode getData. Returns the original search value if found, if not adds +1 to indicate not
found
//Modifies: Nothing
int search(ListNode<int> * front, int value);
//Requires: integer value for inserting, address of front
//Effects: creates a new ListNode with value and inserts in proper position (increasing order)in
the chain. If chain is empty, adds to the beginning
//Modifies: front, if node is added at the beginning.
//Also changes the next pointer of the previous node to point to the
//newly inserted list node. the next pointer of the newly inserted pointer
//points to what was the next of the previous node.
//This way both previous and current links are adjusted
//******** NOTE the use of & in passing pointer to front as parameter -
// Why do you think this is needed ?**********
void insert(ListNode<int> * &fr.
C++ Background Circular Linked List A circular linked list.pdf
C++
Background:
Circular Linked List: A circular linked list is a linked list where a non-empty list has no null pointers.
Unless empty, each node has a pointer to the next node, and the last node points back to the first
node.
Assigment:
Write a cpp program that will serve the purpose of a test driver for previously written CLinkedList.h
file. Your program will:
1) Create a choice menu and prompt the user for input. Must be case insensitive!
2) Read the input and call for functions outside of main, in order to perform operations chosen by
the user. These functions involve: Inserting Interger, Removing Interger, Forward Print and
Backward Print.
Requirements and Notes:
1. Forwards Print does not require a subfunction in order to produce output. All the other
operations must call corresponding subfunctions.
2. Nodes of the circular list must be arranged in ascending order.
3. User Input must be processed case insensitive, and implemented using the loop.
4. Document your code completely.
5. CLinkedList.h file contains 3 classes.
- Circular linked lists class with following member functions: constructor, copy constructor,
destructor, assignment operator, insert and remove.
- Node class included in the file header.
- A list iterator class provides a public interface to the list. The pointer points at nodes in the linked
list. Its member functions are as follows:
Constructor: Assigns the linked list data member to the parameter, a reference to a circular linked
list.
begin() sets the iterator to the first node of the linked list (or NULL if the list is empty)
isEmpty() returns whether or not the wrapped linked list is empty
isFirstNode() returns whether the present node is the first node of the linked list
isLastNode() returns whether the present node is the last node of the linked list
operator*() returns the data of the node currently pointed at. (You need 2)
operator++() pre-increment operator advances the pointer to the next node in the list, if there is
one
operator++(int) post-increment operator advances the pointer to the next node in the list, if there
is one
6. Insert function must give feedback where it says the position of where the int was inserted for
example: "Inserting 25 in the middle."
7. Remove function must give either one of these types of feedback:
- "Removing 25" if the int given by the user was found in the list
-"Cannot find 25" if it was not. The program will then move the user back to the choice menu.
Files:
// File: Node.h
// Singly-linked list node definition/implementation (also good for circular)
#ifndef NODE_H
#define NODE_H
// Need to prototype template classes if they are to be friends
template <typename eltType> class CLinkedList;
template <typename eltType> class CListItr;
template <typename eltType> class Node
{ private:
Node(eltType info, Node* link = NULL ) :
data(info), next(link)
{};
eltType data;
Node *next;
friend class CLinkedList<eltType>;
friend class CListItr<eltType>;
};
#endif
// File: CLinkedList.h
.
Background Circular Linked List A circular linked list is .pdf
Background:
Circular Linked List: A circular linked list is a linked list where a non-empty list has no null pointers.
Unless empty, each node has a pointer to the next node, and the last node points back to the first
node.
Assigment:
Write a cpp program that will serve the purpose of a test driver for previously written CLinkedList.h
file. Your program will:
1) Create a choice menu and prompt the user for input. Must be case insensitive!
2) Read the input and call for functions outside of main, in order to perform operations chosen by
the user. These functions involve: Inserting Interger, Removing Interger, Forward Print and
Backward Print.
Requirements and Notes:
1. Forwards Print does not require a subfunction in order to produce output. All the other
operations must call corresponding subfunctions.
2. Nodes of the circular list must be arranged in ascending order.
3. User Input must be processed case insensitive, and implemented using the loop.
4. Document your code completely.
5. CLinkedList.h file contains 3 classes.
- Circular linked lists class with following member functions: constructor, copy constructor,
destructor, assignment operator, insert and remove.
- Node class included in the file header.
- A list iterator class provides a public interface to the list. The pointer points at nodes in the linked
list. Its member functions are as follows:
Constructor: Assigns the linked list data member to the parameter, a reference to a circular linked
list.
begin() sets the iterator to the first node of the linked list (or NULL if the list is empty)
isEmpty() returns whether or not the wrapped linked list is empty
isFirstNode() returns whether the present node is the first node of the linked list
isLastNode() returns whether the present node is the last node of the linked list
operator*() returns the data of the node currently pointed at. (You need 2)
operator++() pre-increment operator advances the pointer to the next node in the list, if there is
one
operator++(int) post-increment operator advances the pointer to the next node in the list, if there
is one
6. Insert function must give feedback where it says the position of where the int was inserted for
example: "Inserting 25 in the middle."
7. Remove function must give either one of these types of feedback:
- "Removing 25" if the int given by the user was found in the list
-"Cannot find 25" if it was not. The program will then move the user back to the choice menu.
Files:
// File: Node.h
// Singly-linked list node definition/implementation (also good for circular)
#ifndef NODE_H
#define NODE_H
// Need to prototype template classes if they are to be friends
template <typename eltType> class CLinkedList;
template <typename eltType> class CListItr;
template <typename eltType> class Node
{ private:
Node(eltType info, Node* link = NULL ) :
data(info), next(link)
{};
eltType data;
Node *next;
friend class CLinkedList<eltType>;
friend class CListItr<eltType>;
};
#endif
// File: CLinkedList.h
// C.
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdf
SOURCE CODE:
import java.util.Iterator;
public class CircularLinkedList implements Iterable {
Node head , tail;
int size;
CircularLinkedList() {
head = null;
tail = null;
size = 0;
}
public boolean add(E e) {
Node ele = new Node(e);
ele.next = head;
if(head == null)
{
head = ele;
ele.next = head;
tail = head;
}
else
{
tail.next = ele;
tail = ele;
}
size++;
return true;
}
public boolean add(int index, E e){
Node ele = new Node(e);
Node ptr = head;
index = index - 1 ;
for (int i = 1; i < size - 1; i++)
{
if (i == index)
{
Node tmp = ptr.next;
ptr.next = ele;
ele.next = tmp;
break;
}
ptr = ptr.next;
}
size++ ;
return true;
}
private Node getNode(int index ) {
return null;
}
public E remove(int index) {
Node ret;
if (size == 1 && index == 1)
{
ret = head;
head = null;
tail = null;
size = 0;
return ret.getElement();
}
if (index == 1)
{
ret = head;
head = head.next;
tail.next = head;
size--;
return ret.getElement();
}
if (index == size)
{
Node s = head;
Node t = head;
while (s != tail)
{
t = s;
s = s.next;
}
ret = tail;
tail = head;
tail = t;
size --;
return ret.getElement();
}
Node ptr = head;
index = index - 1 ;
for (int i = 1; i < size - 1; i++)
{
if (i == index)
{
Node tmp = ptr.next;
tmp = tmp.next;
ptr.next = tmp;
break;
}
ptr = ptr.next;
}
size-- ;
return ptr.getElement();
}
public String toString()
{
Node current = head;
String result = \"\";
if(size == 0){
return \"\";
}
if(size == 1) {
return head.getElement().toString();
}
else{
do{
result = result + current.getElement().toString();
result = result + \" ==> \";
current = current.next;
} while(current != head);
}
return result;
}
public Iterator iterator() {
return new ListIterator();
}
private class ListIterator implements Iterator{
Node nextItem;
Node prev;
int index;
@SuppressWarnings(\"unchecked\")
public ListIterator(){
nextItem = (Node) head;
index = 0;
}
public boolean hasNext() {
return size != 0;
}
public E next() {
prev = nextItem;
nextItem = nextItem.next;
index = (index + 1) % size;
return prev.getElement();
}
public void remove() {
int target;
if(nextItem == head) {
target = size - 1;
} else{
target = index - 1;
index--;
}
CircularLinkedList.this.remove(target); //calls the above class
}
}
// Solve the problem in the main method
// The answer of n = 13, k = 2 is
// the 11th person in the ring (index 10)
public static void main(String[] args){
CircularLinkedList l = new CircularLinkedList();
int n=13;
int k=2;
for(int i=1;i<=n;i++)
l.add(Integer.valueOf(i));
int j = 13,i=0;
while(j>0)
{
System.out.println(l.toString());
i = i + k;
if(i>j)
i = k;
l.remove(i);
j--;
}
}
}
OUTPUT:
1 ==> 2 ==> 3 ==> 4 ==> 5 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 5 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 8 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 11 ==> 12 ==> 13 ==>
1 ==> 3 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 12 ==> 13 ==>
1 ==> 4 ==> 6 ==> 7 ==> 9 ==> 10 ==> 12 ==> 13 ==>
1 ==> 4.
Hi,I have added the methods and main class as per your requirement.pdf
Hi,
I have added the methods and main class as per your requirement. it is working fine now.
Highlighted the code changes.
MyLinkedListTest.java
public class MyLinkedListTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
MyLinkedList list = new MyLinkedList();
list.addFirst(\"AAAAA\");
list.add(\"1\");
list.add(\"2\");
list.add(\"3\");
list.addLast(\"ZZZZZ\");
System.out.println(\"Linked List Elements : \"+list.toString());
System.out.println(\"First element: \"+list.getFirst());
System.out.println(\"Second element: \"+list.getLast());
System.out.println(\"Removed First Element: \"+list.removeFirst());
System.out.println(\"Now Linked List Elements : \"+list.toString());
System.out.println(\"Removed Last Element: \"+list.removeLast());
System.out.println(\"Now Linked List Elements : \"+list.toString());
System.out.println(\"Removed all element: \");
list.removeAll();
System.out.println(\"Now Linked List Elements : \"+list.toString());
}
}
MyLinkedList.java
public class MyLinkedList extends MyAbstractList {
private Node head, tail;
/** Create a default list */
public MyLinkedList() {
}
/** Create a list from an array of objects */
public MyLinkedList(E[] objects) {
super(objects);
}
/** Return the head element in the list */
public E getFirst() {
if (size == 0) {
return null;
}
else {
return (E)head.element;
}
}
/** Return the last element in the list */
public E getLast() {
if (size == 0) {
return null;
}
else {
return (E)tail.element;
}
}
/** Add an element to the beginning of the list */
public void addFirst(E e) {
Node newNode = new Node(e); // Create a new node
newNode.next = head; // link the new node with the head
head = newNode; // head points to the new node
size++; // Increase list size
if (tail == null) // the new node is the only node in list
tail = head;
}
/** Add an element to the end of the list */
public void addLast(E e) {
Node newNode = new Node(e); // Create a new for element e
if (tail == null) {
head = tail = newNode; // The new node is the only node in list
}
else {
tail.next = newNode; // Link the new with the last node
tail = tail.next; // tail now points to the last node
}
size++; // Increase size
}
/** Add a new element at the specified index in this list
* The index of the head element is 0 */
public void add(int index, E e) {
if (index == 0) {
addFirst(e);
}
else if (index >= size) {
addLast(e);
}
else {
Node current = head;
for (int i = 1; i < index; i++) {
current = current.next;
}
Node temp = current.next;
current.next = new Node(e);
(current.next).next = temp;
size++;
}
}
/** Remove the head node and
* return the object that is contained in the removed node. */
public E removeFirst() {
if (size == 0) {
return null;
}
else {
Node temp = head;
head = head.next;
size--;
if (head == null) {
tail = null;
}
return (E)temp.element;
}
}
/** Remove all elements from list */
public void removeAll() {
while(true) {
if (size == 0) {
break;
}
else {
Node temp = head;
head =.
Exception to indicate that Singly LinkedList is empty. .pdf
/**
* Exception to indicate that Singly LinkedList is empty.
*/
class LinkedListEmptyException extends RuntimeException {
public LinkedListEmptyException() {
super();
}
public LinkedListEmptyException(String message) {
super(message);
}
}
/**
* Node class, which holds data and contains next which points to next Node.
*/
class Node {
public int data; // data in Node.
public Node next; // points to next Node in list.
/**
* Constructor
*/
public Node(int data) {
this.data = data;
}
/**
* Display Node\'s data
*/
public void displayNode() {
System.out.print(data + \" \");
}
}
/**
* Singly LinkedList class
*/
class LinkedList {
private Node first; // ref to first link on list
/**
* LinkedList constructor
*/
public LinkedList() {
first = null;
}
/**
* Insert New Node at first position
*/
public void insertFirst(int data) {
Node newNode = new Node(data); // Creation of New Node.
newNode.next = first; // newLink ---> old first
first = newNode; // first ---> newNode
}
/**
* Method deletes specific Node from Singly LinkedList in java.
*/
public Node deleteSpecificNode(int deleteKey) {
// Case1: when there is no element in LinkedList
if (first == null) { // means LinkedList in empty, throw exception.
throw new LinkedListEmptyException(
\"LinkedList doesn\'t contain any Nodes.\");
}
// Case2: when there is only one element in LinkedList- check whether we
// have to delete that Node or not.
if (first.data == deleteKey) { // means LinkedList consists of only one
// element, delete that.
Node tempNode = first; // save reference to first Node in tempNode-
// so that we could return saved reference.
first = first.next;
System.out.println(\"Node with data=\" + tempNode.data
+ \" was found on first and has been deleted.\");
return tempNode; // return deleted Node.
}
// Case3: when there are atLeast two elements in LinkedList
Node previous = null;
Node current = first;
while (current != null) {
if (current.data == deleteKey) {
System.out.println(\"Node with data=\" + current.data
+ \" has been deleted.\");
previous.next = current.next; // make previous node\'s next point
// to current node\'s next.
return current; // return deleted Node.
} else {
if (current.next == null) { // Means Node wasn\'t found.
System.out.println(\"Node with data=\" + deleteKey
+ \" wasn\'t found for deletion.\");
return null;
}
previous = current;
current = current.next; // move to next node.
}
}
return null;
}
/**
* Display Singly LinkedList
*/
public void displayLinkedList() {
System.out.print(\"Displaying LinkedList [first--->last]: \");
Node tempDisplay = first; // start at the beginning of linkedList
while (tempDisplay != null) { // Executes until we don\'t find end of
// list.
tempDisplay.displayNode();
tempDisplay = tempDisplay.next; // move to next Node
System.out.print(\"-->\");
}
System.out.println();
}
}
/**
* Main class - To test LinkedList.
*/
public class SinglyLinkedListDeleteNodeExample {
public static void main(String[] args) {
LinkedList linkedList = new LinkedList(); /.
C# code pleaseWrite a program that creates a link list object of 1.pdf
C# code please
Write a program that creates a link list object of 10 characters, then creates a second list object
containing a copy of the first list but in reverse order.
Solution
using System;
class LinkedList
{
private char data;
private LinkedList next;
public LinkedList()
{
data = \'c\';
next = null;
}
public LinkedList(char value)
{
data = value;
next = null;
}
public LinkedList Append(char value)
{
LinkedList node = new LinkedList(value);
if(this.next == null)
{
// Easy to handle
node.next = null; // already set in constructor
this.next = node;
}
else
{
// Insert in the middle
LinkedList temp = this.next;
node.next = temp;
this.next = node;
}
return node;
}
public void Display(LinkedList node)
{
if(node == null)
node = this;
System.Console.WriteLine(\"\ \ LinkedList:\ \ \");
while(node != null)
{
System.Console.Write(node.data+\" -> \");
node = node.next;
}
System.Console.Write(\"\ \");
}
public LinkedList Reverse_with_copy(LinkedList head)
{
LinkedList p = head;
LinkedList newhead = null;
while(true)
{
if(p == null)
return newhead;
LinkedList newnode = new LinkedList(p.data);
newnode.next = newhead;
newhead = newnode;
p = p.next;
}
}
}
class Program
{
static void Main(string[] args)
{
LinkedList head = new LinkedList(\'a\');
LinkedList p = head.Append(\'c\');
p = p.Append(\'e\');
p = p.Append(\'h\');
p = p.Append(\'b\');
p = p.Append(\'d\');
p = p.Append(\'f\');
p = p.Append(\'g\');
head.Display(null);
LinkedList newhead = head.Reverse_with_copy(head);
newhead.Display(null);
}
}
/* sample output
*/.
Java AssignmentUsing the ListNode.java file below Write method.pdf
Java Assignment
Using the ListNode.java file below
Write methods called min and max that return the smallest and largest values in the linked list.
These methods will be added to your ListNode class. For example if a variable called list stores
{11, -7, 3, 42, 0, 14], the call of list.min() should return -7 and the call of list.max() should return
42. If the list is empty, return -1. Print the returned value.
Write a method called insertNode that inserts a new node anywhere in your linked list. Display
your linked list with new value.
Write a program to test these methods to ensure accuracy and successful implementation. Upload
your modified version of the ListNode java file only.
Note: Original code should still be included. You will make additions and slight modifications
where necessary. Throw exceptions where you think is necessary. // Listlode is a class for storing
a single node of a linked // list. This node class is for a list of integer values. public class Listlode
\{ public int data; //data stored in this node public Listliode front;//points to head node public
Listliode next; /f link to next node in the list // post: constructs a node with data and null link
public Listlode() \{ 3. // post: constructs a node with given data and null link: public Listlode(int
data) \{ this(data, null); 3 // post: constructs a node with given data and given link. public
Listlode(int data, Listliode next) \{ this.data = data; this. next = next; 3 public String toString() \{
if (front = null) : \} else \{ String result = " ["+ front data; Listliode current = front. next; while
(current != null) \{ result +=m,m+ current data, current = current. next; 3 result += " ]n - return
result; 3. }// post: appends the given value to the end of the list public void add(int value) \&
puolic void aod if (front = nult) \{. front = new Listlode (value); 3 else \{ Listlode current =
front; whistiode current = front; while (current next I= null) \{ current = current. next; 3 current.
next = new Listliode (value ); 3. 3 J// post : returns the position of the first occurrence of the
given /l value (-1 if not found ) public void remove (int index) \{ if ( index =){ \} else \{ Listiode
current = nodeAt ( index - 1); current. next = current. next. next, 3 3 3// pre : <=i< size() // post:
returns a reference to the node at the given index public Listlode nodeAt (int index) : List Node
current = front; for (int i=0;i< index; i++) \{ current = current. next. \}. return current; 3.
There are a couple of new methods that you will be writing for this pr.pdf
There are a couple of new methods that you will be writing for this project. Some are easy, some
are hard. I have provided code that tests most of the methods by calling them from the main
method in the file ListTest.java. The test file will only work when you have done all the
methods. In COMP182LinkedList.java I have provided the signature (definition and input
parameters) for these methods. At this point to make sure you can run the file
(COMP182LinkedList.java that you downloaded from Cavas) I have added template values as
return types of the methods. For example, if the method returns an int then I added return 0 as the
return value. Here are the methods are as follows: Anything getFixst () Anything getLast () void
add (Anything value) void addafter (1nt index, Anyehtng value) Anything set(int index,
Rnything aewvalue) void removeAl1 (Anything vaiue) lastIndex (Anything value)
COMP182IinkedIi ateAnything; elone boolean equala (object in) CoMP182IinkedList
KAnythang? gplat () boolean hascycle () Node reveraeliat () Node oddeventiat () Node
deleteDuplicates () boolean ispalindrome () "For the last two methods, you need to add proper
testing to ListTest Java Method Specifications Here are more details for implementing each of
these methods. You need to complete all the following methods in the COMP182LinkedList
class. You can write the methods in any order you wish, but I suggest you do them in the order
they are listed. In particular, make sure all your methods work for empty lists, lists of different
sizes, etc as you can see from the sample test cases provided in ListTest.java. While grading your
project, we will make changes to these values! Also, make sure that your solutions do not modify
the original lists (unless you are specifically instructed to do so). roid main(String[] args) You
can use this method in the ListTest class to create lists as needed and test each of the methods
listed above. I have provided a few test cases, but you may want to add more to some of the
method tests. Until you get add working, you will need to use addFirst to create lists to test your
other methods. Anything getFirsto This method returns the value stored in the first node an the
list. It should prit an error message and seturn null if the list is empty. Anything getLasto This
method returns the value stored in the last node in the list. It should print an error mesiage and
retuin noll if the list is emipty. void add(Anything value) Thus method adds a nade containing
new yalue to the end of the last. This method returns the value stored in the first node in the list.
It should print an error message and return null if the list is empty. Anything getLast0 This
method returns the value stored in the last node in the list. It should print an error message and
retum null if the list is empty: void add(Anything value) This method adds a node containing
new value to the end of the list. void addAfter(int index, Anything value) This method adds a
node contai.
In this assignment you will implement insert() method for a singly l.pdf
In this assignment you will implement insert() method for a singly linked Link list. The code
MyLinkedlist.java is given , it uses generic type as the linked list can be created with any object
type. Some methods like add() and toString() are already implemented. The MyLinkedList class
has a private nested class called Node.
The objective of this assignment is to implement the insert() method that takes two inputs an
element of generic type to be inserted and an index (value of integer type) at which it should be
inserted. For this assignment we will assume the first element has the index 0. if the given index
is less than zero do nothing but if it is greater than the size of the list, insert the element at the
end of the list. if the index is between 0 and size , insert it in the appropriate location. You insert
code should correctly update the theSize data member of the linked list. Return type for insert()
method is boolean (true or false) depending on whether the insertion was successful or not. Use
the following method header.
}
Main.java
//add necessary libraries
public class Main
{
//add your function here
public static void main (String [] args)
{
}
}
MyLinkedList.java
public class MyLinkedList {
// A private nested Node class
private static class Node{
public AnyType data; // Data members are public, this is fine as the Node class itself is
private
public Node next;
public Node(AnyType d, Node n)
{
data = d;
next=n;
}
@Override
public String toString() {
return data.toString();
}
}
// Data Members
private Node head; // A node pointer to the first item in the List
private int theSize; // a integer variable to hold the size of the List
public MyLinkedList() {
doClear();
}
public void clear() {
doClear();
}
private void doClear() {
head = null;
theSize =0 ;
}
// An add method that will always add at the beginning of the List
public boolean add(AnyType x) {
if(head == null) // List is empty
{
head = new Node(x, null);
theSize++;
return true;
}
else // List has at least one item lets get to the end of it
{
Node newnode = new Node(x, head);
head = newnode;
theSize++;
return true;
}
}
@Override
public String toString() {
// This to String method will print the List from head to the end.
String theList = "";
if(head==null)
return theList;
Node cur = head;
while(cur.next!=null) {
theList = theList + cur.toString() + " ";
cur= cur.next;
}
return theList + cur.toString();
}
public int getTheSize() {
return theSize;
}
}
/*****************************************************************************
*
*
* SOLUTION CODE BELOW THIS HEADER
*
*****************************************************************************/
/*****************************************************************************
*
*
* SOLUTION CODE ABOVE THIS HEADER
*
*****************************************************************************/
}
Current file: Main.java Load default template... //add necessary Libraries public class Main \{
//add your function here public static vo.
Write a function to merge two doubly linked lists. The input lists ha.pdf
Write a function to merge two doubly linked lists. The input lists have their elements in sorted
order, from lowest to highest. The output list should also be sorted from lowest to highest. Your
algorithm should run in linear time on the length of the output list. Provide an algorithm for your
function Implement and show some samples of your running function
Solution
The algorithm for LinkedList MergeSort is as follows.
The trick in this algorithm is to use a local list to store the value which is pointing to the actual
list to be returned as a result of the function
Step1: START
Step2: GET inputs of list1 and list2
Step3: INITIALIZE mergelist
STEP4: SET mylist = mergelist
Step5: WHILE list1 OR list2 is EMPTY
DO
IF (list1 AND list2) are NOT EMPTY
IF list1.value > list2.value
mylist.next = list2
ELSE
mylist.next = list1
ELSE IF list1 is EMPTY
mylist.next = list2
ELSE
mylist.next = list1
Step6: RETURN mergelist
Step7: STOP
Sample program for the same implemented in C++
//====================================================================
========
// Name : DoublyLinkedList.cpp
// Author : Kaju
// Version : 0.1
// Copyright : This is just an example code
// Description : MergeSort in C++, Ansi-style
//====================================================================
========
/*
* C++ Program to Implement Doubly Linked List
*/
#include
#include
#include
/*
* Node Declaration
*/
using namespace std;
// struct declaration for node which will hold the integer data with links to previous data and next
data
struct node
{
int data;
struct node *next;
struct node *prev;
};
/*
Class Declaration
*/
class DoublyLinkedList
{
private:
struct node *start; // collection of all the nodes
public:
void create(int value);
int peek();
int delete_head();
void display();
int count();
void mergeSort(DoublyLinkedList list1, DoublyLinkedList list2);
DoublyLinkedList()
{
start = NULL;
}
};
/*
* Add data into the list
*/
void DoublyLinkedList::create(int value)
{
struct node *s, *temp;
temp = new(struct node);
temp->data = value;
temp->next = NULL;
if (start == NULL)
{
temp->prev = NULL;
start = temp;
}
else
{
s = start;
while (s->next != NULL)
s = s->next;
s->next = temp;
temp->prev = s;
}
}
/*
* Deletion of the first element from the list
* store the first element in a temp node and then remove it from start.
*/
int DoublyLinkedList::delete_head()
{
struct node *tmp, *q;
int value;
tmp = start;
if(start->next!=NULL)
{
start = start->next;
start->prev = NULL;
}
else
start = NULL;
value = tmp->data;
free(tmp);
return value;
}
/*
* return the first element of Doubly Link List
*/
int DoublyLinkedList::peek()
{
struct node *q;
if (start == NULL)
{
cout<<\"List is empty\"<data;
}
}
/*
* Display elements of Doubly Link List
*/
void DoublyLinkedList::display()
{
struct node *q;
if (start == NULL)
{
cout<<\"List is empty\"<data;
q = q->next;
if(q != NULL)
{
cout<<\", \";
}
}
cout<<\"]\"<next;
cnt++;
}
return cnt;
}
/*
* MergeSort - takes two input lists and then based on the.
For this micro assignment, you must implement two Linked List functi.docx
For this micro assignment, you must implement two Linked List functions. We will use the following
example Linked List:
2 0 -1 5 7
getElementAt(index)
This function should return the element (i.e. value) of the Nth item inside the linked list. For example,
on the Linked List above, getElementAt(0) should return 2; getElementAt(3) should return 5.
addElementAt(value, location)
This function should insert a new value at the given location. Note that the location supplied must be
within bounds of the LinkedList. For example, we cannot call addElementAt(4, 11) on the above Linked
List because 11 is beyond the size of the Linked List.
Here are some examples. If we call addElementAt(0, 1), the above Linked List would now look like:
1 2 0 -1 5 7
If we again call addElementAt(2, 123), we would get:
1 2 123 0 -1 5 7
Grading
Your submission will be graded based on the following:
1. [7] Your solution does not cause any runtime issues and your file passes all test cases
2. [3] Your code contains good style. For example,
You provide meaningful variable names
You provide sufficient and meaningful comments
Your code is well structured
@@@@@@@@@@@@@@@@@@@@@@@@
#ifndef LINKED_LIST_H
#define LINKED_LIST_H
#include
#include
#include "LinkedListNode.h"
#include
using namespace std;
template
class LinkedList
{
private:
//points to the front of the linked list
LinkedListNode *_front = nullptr;
//keeping track of size in a variable eliminates need to continually
//count LL boxes.
int _size = 0;
protected:
//creates a new LinkedListNode for us
virtual LinkedListNode *createNode(T value)
{
return new LinkedListNode < T > { value };
}
public:
//default constructor
LinkedList()
{
_front = nullptr;
}
//copy constructor
LinkedList(const LinkedList &other)
{
for (int i = 0; i < other.getSize(); i++)
{
addElement(other.getElementAt(i));
}
}
//move constructor
LinkedList(LinkedList &&other)
{
//take other's data
_front = other._front;
_size = other._size;
//reset other's pointers
other._front = nullptr;
}
//initializer list constructor
LinkedList(initializer_list values)
{
for (auto item : values)
{
addElement(item);
}
}
//Always remember to clean up pointers in destructor!
virtual ~LinkedList()
{
LinkedListNode *current = _front;
while (current != nullptr)
{
LinkedListNode *temp = current->getNext();
delete current;
current = temp;
}
}
//will return true if the LL is empty.
virtual bool isEmpty() const
{
return _size == 0;
}
//returns the size of the LL.
virtual int getSize() const
{
return _size;
}
.
Using visual studio 2022- a C# windows form application- and your Doub.pdf
Using visual studio 2022, a C# windows form application, and your DoubleLinkedClass and
DoubleLinkedNode classes from project 5, implement a DequeueClass, a StackClass, and a
QueueClass. Do not use any arrays, lists, dictionaries, or other built in data structures, only
instances of your linkedLists classes from project 5. The dequeue class needs to contain a
reference to an instance of your DoubleLinkedList class, with the QueueClass and StackClass
inheriting from the Dequeue class. Your Stack and Queue pop and push need to be one-line calls
to the Dequeue popLeft, pushLeft, popRight, pushRight. Do not copy the code from the dequeue
class to implement the Stack and Queue.
DoubleLinkedClasses From2263Project5
internal class DoubleLinkedList<T>
{
public DoubleLinkedListNode<T> firstNode = null;
public DoubleLinkedListNode<T> lastNode = null;
public DoubleLinkedListNode<T> currentNode = null;
public int nodeNumber = 0;
public DoubleLinkedList()
{
}
// creates first node in list with firstValue
public DoubleLinkedList(T firstValue)
{
firstNode = new DoubleLinkedListNode<T>(firstValue);
lastNode = firstNode;
currentNode = firstNode;
nodeNumber = 1;
}
public DoubleLinkedListNode<T> GetCurrentNode()
{
return currentNode;
}
public void InsertFirst(T value)
{
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
if (firstNode == null)
{
firstNode = newNode;
lastNode = firstNode;
currentNode = firstNode;
}
else
{
newNode.next = firstNode;
firstNode.previous = newNode;
firstNode = newNode;
currentNode = firstNode;
}
nodeNumber++;
}
public void InsertBeforeFirst(T value)
{
if (firstNode == null)
{
InsertFirst(value);
return;
}
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
newNode.next = firstNode;
firstNode.previous = newNode;
firstNode = newNode;
nodeNumber++;
}
public void InsertAfterLast(T value)
{
if (lastNode == null)
{
InsertFirst(value);
return;
}
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
lastNode.next = newNode;
newNode.previous = lastNode;
lastNode = newNode;
currentNode = lastNode;
nodeNumber++;
}
public void InsertAfterCurrent(T value)
{
if (currentNode == null)
{
InsertFirst(value);
return;
}
DoubleLinkedListNode<T> newNode = new DoubleLinkedListNode<T>(value);
newNode.next = currentNode.next;
newNode.previous = currentNode;
if (currentNode.next != null)
{
currentNode.next.previous = newNode;
}
currentNode.next = newNode;
currentNode = newNode;
if (lastNode == currentNode.previous)
{
lastNode = currentNode;
}
nodeNumber++;
}
public int NumberOfNodesInList()
{
return nodeNumber;
}
public void DeleteFirst()
{
if (firstNode == null)
{
return;
}
if (firstNode.next == null)
{
firstNode = null;
lastNode = null;
currentNode = null;
}
else
{
firstNode = firstNode.next;
firstNode.previous = null;
currentNode = firstNode;
}
nodeNumber--;
}
public void DeleteLast()
{
if (lastNode == null)
{
return;
}
if (lastNode.previous == null)
{
firstNode = null;
lastNode = null;
currentNode = null.
Qestion Please add pre-condition, post-conditions and descriptions .pdf
Qestion: Please add pre-condition, post-conditions and descriptions for each member function of
the LINKED_LIST_CLASS. Answer with your new version of the program.
#include
using namespace std;
class LIST_NODE
{
public:
int data; // data element of node
LIST_NODE *next; // pointer element of node
};
class LINKED_LIST_CLASS
{
public:
LINKED_LIST_CLASS(); // default constructor
LINKED_LIST_CLASS(LINKED_LIST_CLASS &); // copy constructor
~LINKED_LIST_CLASS(); // destructor
void Add(int); // mutator
void Print(); // accessor
LIST_NODE * Search(int); // accessor
void Remove(int); // mutator
bool Is_Empty(); // accessor
private:
LIST_NODE *front; // pointer to front of list
};
LINKED_LIST_CLASS::LINKED_LIST_CLASS()
{
cout << endl << \"The default constructor has been called.\ \";
front = new LIST_NODE;
front->next = 0; // initialize the next field to null
front->data = -10000;
}
LINKED_LIST_CLASS::LINKED_LIST_CLASS(LINKED_LIST_CLASS & org)
{
cout << endl << \"The copy constructor has been called.\ \";
front = new LIST_NODE;
front->next = 0;
front->data = -10000;
LIST_NODE *p = org.front->next;
LIST_NODE *back = 0;
while(p!=0)
{
if (back == 0)
{
front->next = new LIST_NODE;
back = front->next;
back->next = 0;
back->data = p->data;
}
else
{
back->next = new LIST_NODE;
back = back->next;
back->data = p->data;
back->next = 0;
}
p=p->next;
}
}
LINKED_LIST_CLASS::~LINKED_LIST_CLASS()
{
cout << endl << \"The destructor has been called.\ \";
while (front->next != 0)
{
LIST_NODE *p = front->next;
front->next = front->next->next;
delete p;
}
delete front;
front = 0;
}
void LINKED_LIST_CLASS::Add(int item)
{
LIST_NODE *p = new LIST_NODE;
p->data = item;
if (front->next== 0) // empty list
{
front->next = p;
p->next = 0;
}
else // list has information and is not empty
{
p->next = front->next;
front->next = p;
}
}
void LINKED_LIST_CLASS::Print()
{
cout << endl;
for(LIST_NODE *p = front->next; p != 0; p = p->next)
{
cout << p->data;
if (p->next != 0)
{
cout << \"-->\";
}
}
cout<next; p!=0; p=p->next)
{
if (p->data == key)
return p;
}
return 0; // key not found in list
}
void LINKED_LIST_CLASS::Remove(int key)
{
LIST_NODE *p = Search(key);
if (Is_Empty())
{
cout << key << \" is not in the list. No removal performed!\ \";
}
else
{
LIST_NODE *q = front;
while (q->next->data != key)
{
q = q->next;
}
q->next = p->next; // CRITICAL STEP!!!!
delete p;
}
}
bool LINKED_LIST_CLASS::Is_Empty()
{
return front->next == 0;
}
int main()
{
LINKED_LIST_CLASS L1;
L1.Add(5);
L1.Add(10);
L1.Add(29);
L1.Print();
LINKED_LIST_CLASS L2 = L1;
L2.Print();
L1.Remove(10);
L1.Print();
return 0;
}
Solution
#include
using namespace std;
class LIST_NODE
{
public:
int data; // data element of node
LIST_NODE *next; // pointer element of node
};
class LINKED_LIST_CLASS
{
public:
LINKED_LIST_CLASS(); // default constructor
LINKED_LIST_CLASS(LINKED_LIST_CLASS &); // copy constructor
~LINKED_LIST_CLASS(); // destructor
void Add(int); // mutator
void Print(); // accessor
LIST_NODE * Search(int); // ac.
In C++Write a recursive function to determine whether or not a Lin.pdf
In C++
Write a recursive function to determine whether or not a Linked List is in sorted order (smallest
value to largest value).
Add the following function prototypes to your List class under the section for access functions,
then implement the functions below the class definition:
public:
/**Access Functions*/
bool isSorted();
//Wrapper function that calls the isSorted helper function to determine whether
//a list is sorted in ascending order.
//We will consider that a list is trivially sorted if it is empty.
//Therefore, no precondition is needed for this function
private:
bool isSorted(Nodeptr node);
//Helper function for the public isSorted() function.
//Recursively determines whether a list is sorted in ascending order.
#include //for NULL
#include
#include
using namespace std;
template //list stores generic list data, not any specific C++ type
class List
{
private:
struct Node
{
listdata data;
Node* next;
Node* previous;
Node(listdata data): data(data), next(NULL), previous(NULL){}
};
typedef struct Node* Nodeptr;
Nodeptr first;
Nodeptr last;
Nodeptr iterator;
int size;
public:
/**Constructors and Destructors*/
List();
//Default constructor; initializes and empty list
//Postcondition: numeric values equated to zero, or strings should be empty.
List(const List &list);
~List();
//Destructor. Frees memory allocated to the list
//Postcondition: position NodePtr at next Node
/**Accessors*/
listdata getFirst();
//Returns the first element in the list
//Precondition:NodePtr points to the first node on list
listdata getLast();
//Returns the last element in the list
//Precondition: make new node first on the list
listdata getIterator();
bool isEmpty();
//Determines whether a list is empty.
int getSize();
//Returns the size of the list
/**Manipulation Procedures*/
void startIterator();
void advanceIterator();
void removeLast();
//Removes the value of the last element in the list
//Precondition: list is not empty, not the first element.
//Postcondition: one remaining node
void removeIterator();
void removeFirst();
//Removes the value of the first element in the list
//Precondition: list is not empty
//Postcondition: no nodes left
void insertLast(listdata data);
//Inserts a new element at the end of the list
//If the list is empty, the new element becomes both first and last
//Postcondition: next equal to null
void insertFirst(listdata data);
//Inserts a new element at the start of the list
//If the list is empty, the new element becomes both first and last
//Postcondition:point nodePtr next node on list
/**Additional List Operations*/
bool offEnd();
void printList();
//Prints to the console the value of each element in the list sequentially
//and separated by a blank space
//Prints nothing if the list is empty
void insertIterator(listdata data);
bool operator==(const List &list);
};
// constructor definition
template
List::List(): first(NULL), last(NULL), iterator(NULL), size(0) {}
template
List::List(const List &list): size(list.size)
{
if(list..
Similar to Everything compiles and everything runs correctly except my insertionS.docx (20)
Implement the unsorted single linked list as we did in the class and .pdf
Implement the unsorted single linked list as we did in the class and .pdf
Write a program to implement below operations with both singly and d.pdf
Write a program to implement below operations with both singly and d.pdf
Implement the member function void insertAfterHead(int d) of the Lin.pdf
Implement the member function void insertAfterHead(int d) of the Lin.pdf
This assignment and the next (#5) involve design and development of a.pdf
This assignment and the next (#5) involve design and development of a.pdf
C++ Background Circular Linked List A circular linked list.pdf
C++ Background Circular Linked List A circular linked list.pdf
Background Circular Linked List A circular linked list is .pdf
Background Circular Linked List A circular linked list is .pdf
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdf
SOURCE CODEimport java.util.Iterator;public class CircularLinke.pdf
Hi,I have added the methods and main class as per your requirement.pdf
Hi,I have added the methods and main class as per your requirement.pdf
Exception to indicate that Singly LinkedList is empty. .pdf
Exception to indicate that Singly LinkedList is empty. .pdf
C# code pleaseWrite a program that creates a link list object of 1.pdf
C# code pleaseWrite a program that creates a link list object of 1.pdf
Java AssignmentUsing the ListNode.java file below Write method.pdf
Java AssignmentUsing the ListNode.java file below Write method.pdf
There are a couple of new methods that you will be writing for this pr.pdf
There are a couple of new methods that you will be writing for this pr.pdf
In this assignment you will implement insert() method for a singly l.pdf
In this assignment you will implement insert() method for a singly l.pdf
Write a function to merge two doubly linked lists. The input lists ha.pdf
Write a function to merge two doubly linked lists. The input lists ha.pdf
For this micro assignment, you must implement two Linked List functi.docx
For this micro assignment, you must implement two Linked List functi.docx
Using visual studio 2022- a C# windows form application- and your Doub.pdf
Using visual studio 2022- a C# windows form application- and your Doub.pdf
Qestion Please add pre-condition, post-conditions and descriptions .pdf
Qestion Please add pre-condition, post-conditions and descriptions .pdf
In C++Write a recursive function to determine whether or not a Lin.pdf
In C++Write a recursive function to determine whether or not a Lin.pdf
More from todd401
Exercise 7-15 During October- Wichita Light Company experiences the fo.docx
Exercise 7-15
During October, Wichita Light Company experiences the following transactions in establishing a petty cash fund.
Journalize the entries in October that pertain to the petty cash fund. (Credit account titles are automatically indented when amount is entered. Do not indent manually.)
Date
Account Titles and Explanation
Debit
Credit
Oct. 1
Oct. 31
Exercise 7-15 During October, Wichita Light Company experiences the following transactions in establishing a petty cash fund. Oct. 1 A petty cash fund is established with a check for $150 issued to the petty cash custodian. 31 A check was written to reimburse the fund and increase the fund to $200. A count of the petty cash fund disclosed the following items: Currency $59.00 Coins 0.70 Expenditure receipts (vouchers): Supplies $26.10 Telephone, Internet, and fax 16.40 Postage 39.70 Freight-Out 6.80 Journalize the entries in October that pertain to the petty cash fund. (Credit account titles are automatically indented when amount is entered. Do not indent manually.) Date Account Titles and Explanation Debit Credit Oct. 1
Solution
Oct1 Petty cash Dr 150
to bank 150
(being fund created)
Oct 31 Supplies Dr 26.10
Telephone, int.. Dr 16.40
Postage Dr 39.70
Freight Out Dr 6.80
Cash short & excess Dr 1.30
To petty cash 90.30
(being expenses during the month)
Petty cash Dr 140.30
To Bank 140.30
(being amount re-imbursed and increased)
.
Exercise 4-3 (Part Level Submission) The adjusted trial balance column.docx
Exercise 4-3 (Part Level Submission) The adjusted trial balance columns of the worksheet for Albanese Company are as follows. No common stock was issued during April ALBANESE COMPANY Worksheet (partial) For the Month Ended April 30, 2014 Adjusted Trial Balance Account Titles Dr 7,442 7,840 2,280 23,000 Cash Accounts Receivable Prepaid Rent Equipment Accumulated Depreciation-Equip Notes Payable Accounts Payable Common Stock Retained Earnings Dividends Service Revenue Salaries and Wages Expense Rent Expense Depreciation Expense Interest Expense Interest Payable Totals 4,800 5,700 5,672 22,000 4,000 3,000 12,590 9,840 760 600 57 57 54,819 54,819
Solution
Answer:
.
examples of how being familiar with and following digital forensic bes.docx
examples of how being familiar with and following digital forensic best practices AND criminal justice standards would benefit you, even if you are working in a non-criminal justice digital forensics position.
Solution
Forensic rhetoric , as coined in Aristotle\'s On Rhetoric , encompasses any discussion of past action including legal discourse—the primary setting for the emergence of rhetoricas a discipline and theory. This contrasts with deliberative rhetoric and epideictic rhetoric, which are reserved for discussions concerning future and present actions respectively.
In contemporary times, the word forensic is commonly associated with criminal and civil law referring specifically to forensic science. It is important to note that the term forensic associated with criminal investigation exists because forensic (or judicial) rhetoric first existed.
Since forensic rhetoric’s original purpose was to win courtroom cases, legal aids have been trained in it since legal freedoms emerged. Because in early law courts, citizens were expected to represent themselves and training in forensic rhetoric was very beneficial. In ancient Athens, litigants in a private law suit and defendants in a criminal prosecution were expected to handle their own case before the court - a practice that Aristotle approved of. The hearings would consist of questions addressed to the litigant/defendant and were asked by a member of the Court, or the litigants could ask one another; these circumstances did not call for legal or oratorical talent - therefore oratory or legalism was not expected, encouraged, or appreciated. After the time of Solon, the Court of Areopagus was replaced and the litigant/defendant would deliver a prepared speech before the courts to try and sway the jury; they expected dramatic and brilliant oratorical displays. Now, listeners appreciated oratorical and even legalistic niceties, such as appeals to passion, piety, and prejudice. It was at this point in Athens history where the forensic speech-writer made his first appearance. The speech-writer would prepare an address which the litigant/defendant memorized and delivered before the court. Forensic speech-writing and oratory soon became an essential part of general rhetoric. After the nineteenth century, forensic rhetoric “became the exclusive province of lawyers,†as it essentially remains today. These people were experts in the court system and dominated forensic rhetoric, since it is tied to past events—thus the relationship between law and rhetoric was solidified.
.
Est 12-16 AM edugen-wileyplus-com Open Assignment t experience please.docx
Est 12:16 AM edugen.wileyplus.com Open Assignment t experience please view on your desktop. ort by type Sort by date Problem 11-2A (Part Level Submission) The stockholders\' equity accounts of Miley Corporation on January 1, 2014, were as follows. Preferred Stock (796, $100 par noncumulative, 4,300 shares authorized) Common Stock ($3 stated 793,680 value, 330,700 shares authorized) Paid-in Capital in Excess of Par Value-Preferred Stock Paid-in Capital in Excess of Stated Value- Common Stock Retained Earnings Treasury Stock (4,300 common shares) 10,320 5 529,120 4,400 During 2014, the corporation had the following transactions and events pertaining to its stockholders\' equity. reb. i Issued 4,600 shares of common stock for $32,200. a20 Purchased 1,750 additional shares of common treasury stock at $7 per share Oct. 1 Declared a 7% cash dividend on preferred stock, payable November 1. No Paid the dividend declared on October 1 Dec. 1 Declared a $0.70 per share cash dividend to common stockholders of record on December 15, payable December 31, 2014. Dec 31 Determined that net income for the year was $283,900. Paid the dividend declared on December 1. Journalize the transactions. (Record entries in the order displayed in the problem statement. Credit account titles are automatically indented when amount is entered. Do not indent manually.) 2.200
Solution
Entry is given below
.
examples of materials that have directional properties as a single cry.docx
examples of materials that have directional properties as a single crystal but are isotropic in their polycrystalline form.
Solution
Liquid crystals (LCs) are matter in a state that has properties between those of conventional liquid and those of solid crystal. [1] For instance, a liquid crystal may flow like a liquid, but its molecules may be oriented in a crystal-like way. There are many different types of liquid-crystal phases, which can be distinguished by their different optical properties (such as birefringence). When viewed under a microscope using a polarized light source, different liquid crystal phases will appear to have distincttextures. The contrasting areas in the textures correspond to domains where the liquid-crystal molecules are oriented in different directions. Within a domain, however, the molecules are well ordered. LC materials may not always be in a liquid-crystal phase (just as water may turn into ice or steam).
Liquid crystals can be divided into thermotropic, lyotropic and metallotropic phases. Thermotropic and lyotropic liquid crystals consist of organic molecules. Thermotropic LCs exhibit a phase transition into the liquid-crystal phase as temperature is changed. Lyotropic LCs exhibit phase transitions as a function of both temperature and concentration of the liquid-crystal molecules in a solvent (typically water). Metallotropic LCs are composed of both organic and inorganic molecules; their liquid-crystal transition depends not only on temperature and concentration, but also on the inorganic-organic composition ratio.
Examples of liquid crystals can be found both in the natural world and in technological applications. Most contemporary electronic displays use liquid crystals. Lyotropic liquid-crystalline phases are abundant in living systems. For example, many proteins and cell membranes are liquid crystals. Other well-known examples of liquid crystals are solutions ofsoap and various related detergents, as well as the tobacco mosaic virus.
.
Examine the importance for business financial leaders to recognize the.docx
Examine the importance for business financial leaders to recognize the firm’s foreign currency exposure.
Solution
Foreign currency exposure means the financial risk that exists when a financial transaction is denominated in a currency other than that of the base currency of the firm.
It is important for the business financial leaders to recognize the firm’s foreign currency exposure so as to see the possible opportunities of arbitrage by holding one currency and releasing other.
If a firm has to involve in the international trade (exports / imports) then it should be having an idea about the advantages and disadvantages of functioning in the currencies of the particular markets.
Foreign exchange exposure is classified into three types viz. Transaction, Translation and Economic Exposure.
Transaction Exposure also referred to as conversion exposure or cash flow exposure. It concerns the actual cash flows involved in setting transactions denominated in a foreign currency. These could include : sales receipts, payments for goods and services, receipt and/or payment of dividends, servicing loan arrangements as regards interest and capital .
Translation exposure is also referred to as accounting exposure or balance sheet exposure. The restatement of foreign currency financial statements in terms of a reporting currency is termed translation. The exposure arises from the periodic need to report consolidated worldwide operations of a group in one reporting currency and to give some indication of the financial position of that group at those times in that currency.
Economic exposure or operational exposure moves outside of the accounting context and has to do with the strategic evaluation of foreign transactions and relationships. It concerns the implications of any changes in future cash flows which may arise on particular transactions of an enterprise because of changes in exchange rates, or on its operating position within its chosen markets. Its determination requires an understanding of the structure of the markets in which an enterprise and its competitors obtain capital, labour, materials, services and customers. Identification of this exposure focuses attention on that component of an enterprise\'s value that is dependent on or vulnerable to future exchange rate movements. This has bearing on a corporation\'s commitment, competitiveness and viability in its involvement in both foreign and domestic markets. Thus, economic exposure refers to the possibility that the value of the enterprise, defined as the net present value of future after tax cash flows, will change when exchange rates change.
.
Examine the primary reasons why project management causes a cultural c.docx
Examine the primary reasons why project management causes a cultural change and the impact of that change on integrative information technology. Support your response with at least one (1) example of a cultural change that project management can cause.
The literature affirms that project sponsorship is a major component for the successful completion of projects. Select an organization where you would aspire to serve as a CIO. Explore the role of a project sponsor, and highlight the significant reasons why such a position is pivotal to your organization’s success. Provide a rationale for your response.
Solution
Change management is a systematic approach to dealing with change both from the perspective of an organization and the individual.
A somewhat ambiguous term, change management has at least three different aspects, including: adapting to change, controlling change, and effecting change. A proactive approach to dealing with change is at the core of all three aspects.
n an information technology (IT) system environment, change management refers to a systematic approach to keeping track of the details of the system (for example, what operating system release is running on each computer and which fixes have been applied).
Change management is an important part of project management. The project manager must examine the proposed change and determine the effect the change will have on the project as a whole before allowing the change request to be implemented.
The best projects, and the best organisations, have strong leaders. People who are champions for change, authentic, fearless, loyal, fun and great at creating teams who collectively want to succeed. They take their work seriously, but not themselves and they are the future of your organisation.
CIO:
Given their difference to business as usual, they are a perfect place to instill new behaviours, try out different ideas or provide teams with the time and support to innovate. These people should be given the chance to transform your organisation and they can do that through sponsoring or managing your projects.
All of the ingredients required to change your culture can be addressed through the normal course of business, however if you’re struggling to get started, then your projects could be a perfect place to start.
.
Fal or - Seawat A pur ture Chapter Review Speaking1- How is a mixture.docx
Fal or , Seawat A pur ture Chapter Review Speaking1. How is a mixture determined to be hetero gels? sols? How stan geneous? are 25. A m 2. What are the phases of matter that form at property of the liquids in an emulsion would see work against their forming any kind of mixture? gels and sols different? 26 A h 1o 3. Wha 27. Ae 4. How can you tell that a rock is a heterogeneous mixture? s What property do colloidal dispersions and solutions share19. that other kinds of mixtures do not? loidal dispersion? sion and a colloidal dispersion? are mixed in heterogeneous alloys? used to classify the solution? that a solution was formed and not a new compound? often preferred to pure metals? 30 6 What is one property of skim milk indicating that it is a col- 472 37 How might you visually tell the difference between a suspen- OuWhat can happen when metals with very different-sized atoms 474 474 474 9. Which part of a solution is the solvent? How is this information 10. When you mix a solid and a liquid, w 11. What are solutions of different metals called? Why a 2. Why is it not 1heule electrially polar? hat are two indications are they possible to have a solid-in-gas solution? 14. Why is solvation of a solute particle an important step jowing the solute? What do we call the solution pr sadlving dis lution process for 5.What kind of solvent in of solvent could dissolve a nonpolar like sul
Solution
Ans 1 . A homogeneous mixture is that in which components of mixture are present in same proportion ,that is , uniform composition through the mixture .For example , water , air , vinegar are homogeneous mixtures.
While a heterogeneous mixture is that in which components of mixture are not present in same proportion , that is , non-uniform compostion throughout the mixture . For example , sand , granite , blood are heterogeneous mixtures .
So, on the basis of this , we can determine a mixture to be homogeneous or heterogeneous by checking the composition of mixture whether it is uniform or not .
.
Explain three advantages and one disadvantage to CONSUMER from standar.docx
Explain three advantages and one disadvantage to CONSUMER from standardization and
interchangeability of the mechanical components?
Solution
Globalization pulls the countries out, from their detachment into the competitive world. A journey towards new collaborations and unity, it has changed the world into a global village. Both distance and isolation have been terrifically reduced.
Globalization integrates trade, technology, investments, and the mobile factors of production like labor and capital. All types of goods ranging from Coca-Cola, Sprite, Louis Philippe shirts, Marie Claire bags, Police sunglasses, to Adidas and Nike shoes are all available in every market globally, all credit to globalization.
Globalization has been quite a debatable subject. While some are of the opinion that it has a lot of ill-effects upon the society, there exists others who feel exactly the opposite. Some opine that it has made life extremely easier and comfortable. It has however affected the consumers and businesses differently. For a better picture, let us take a look at some of the advantages and disadvantages of globalization.
Advantages of Globalization:
Resources of different countries are used for producing goods and services they are able to do most efficiently.
Consumers to get much wider variety of products to choose from.
Consumers get the product they want at more competitive prices.
Companies are able to procure input goods and services required at most competitive prices.
Companies get get access to much wider markets
It promotes understanding and goodwill among different countries.
Businesses and investors get much wider opportunities for investment.
Adverse impact of fluctuations in agricultural productions in one area can be reduced by pooling of production of different areas.
Disadvantages of Globalization:
Developed countries can stifle development of undeveloped and under-developed countries.
Economic depression in one country can trigger adverse reaction across the globe.
It can increase spread of communicable diseases.
Companies face much greater competition. This can put smaller companies, at a disadvantage as they do not have resources to compete at global scale.
.
Explain the various reasons why atoms and molecules form chemical bond.docx
Explain the various reasons why atoms and molecules form chemical bonds and explain the differences between different types of chemical bonds.
Solution
Answer :
A chemical bond is an attraction between atoms. This attraction may be seen as the result of different behaviors of the outermost or valence electrons of atoms. A chemical bond is a lasting attraction between atoms, ions or molecules that enables the formation of chemical compounds. The bond may result from the electrostatic force of attraction between oppositely charged ions as in ionic bonds; or through the sharing of electrons as in covalent bonds.
Differences between different types of chemical bonds :
.
Explain (in your own words) the concept colbertism and what-'s interes.docx
Explain (in your own words) the concept colbertism and what\'s interesting about it..
Solution
Colbertism in France
In France, which was to become in the seventeenth century the home par excellence of the despotic nation-state, the promising cloth trade and other commerce and industry in Lyons and the Languedoc region in the south were crippled by the devastating religious wars in the last four decades of the sixteenth century. In addition to the devastation and the killing and emigration of skilled Huguenot craftsmen to England, high taxes to finance the war served to cripple French economic growth. Then, the politique party, riding to power on the promise of ending religious strife, ushered in the unchecked reign of royal absolutism.
Crippling regulation of French industry had begun in the late fifteenth century, when the king issued scores of guild charters, conferring the power to control and to set standards of quality in the different occupations upon urban guilds and their officials. The Crown conferred cartellizing privileges on the guilds while levying taxes upon them in exchange. A major reason why Lyons had flourished during the sixteenth century was that it was granted a special exemption from guild rule and guild restrictions.
By the end of the sixteenth century and the religious wars, the old regulations were still in place, ready to be enforced. The new absolute monarchy was ready to enforce them and carry them further. Thus, in 1581, King Henry III ordered all the artisans of France to join and group themselves into guilds, whose orders were to be enforced. All except Parisian and Lyonnaise craftsmen were forced to confine their activity to their current towns; in that way, mobility in French industry was brought to an end. In 1597, Henry IV re-enacted and strengthened these laws, and proceeded to enforce them thoroughly.
The result of this network of restriction was the total crippling of economic and industrial growth in France. The typical ploy of preserving
.
Explain the 3 Emissive flat-panel devices- electroluminescent- plasma.docx
Explain the 3 Emissive flat-panel devices: electroluminescent, plasma display and field-emission display with detail to the use of phosfur if used
Solution
Electroluminescent Display
An electroluminescent screen is a flat screen that is made by sandwiching a layer of electroluminescent material between two conductive layers. When a current is circulated on the material, it emits radiation in the form of visible light. Electroluminescence is an optical and electrical phenomenon in which light is generated from an electric current. Electroluminescent materials contain a certain amount of phosphor material and emit light when an electric current passes (do not confuse phosphur with the chemical element phosphorus). Phosphur are electroluminescent and are not necessarily composed of the phosphor element. Phosphur materials contain a carrier material such as: oxides, oxynitrides, nitrides, sulfur, among others, which are doped with small amounts of rare earths or transition metal ions.
plasma display
Plasma screens are devices formed by glass panels divided into cells and containing a mixture of noble gases that when excited by electricity, become plasma (hence the name) and phosphur materials begin to emit light. Plasma screens are also formed by pixels, where each pixel has three separate cells in which there is different colored phosphur material: red, blue and green, where they are mixed to create the final color of the pixel.
field-emission display
A field emission screen is a flat screen technology that uses large area electron emission sources to provide electrons that strike the phosphur material to produce a color image. An field-emission display consists of a matrix of cathode ray tubes, where each tube produces a subpixel grouped three by three to form red-green-blue RGB pixels. The field-emission display combine the advantages of CRTs, that is, high contrast levels and rapid response tempos, with the advantage of packaged LCD.
.
Experimental Questions 1- Which types of compounds have the strongest.docx
Experimental Questions 1. Which types of compounds have the strongest intermolecular forces? How can certain physical properties give an indication of the strength of intermolecular forces of compounds? 2. 3. Relate molecular polarity to the intermolecular forces of the molecule. 4. Relate intermolecular forces of the molecule to physical properties such as evaporation and viscosity.
Solution
1. The strongest intermolecular force is hydrogen bonding. Thus the compounds that can form H- bonds each other have the strongest intermolecular forces.
2. When intermolecular forces increases the molecules fells greater attraction among themselves. This means we have to supply more energy to separate them. This result in higher in the physical property. Thus if stronger intermolecular forces are existing we can expect that boiling point , melting point for that sample will increase. Again in case of freezing we have to restrict the movements of the molecules.Thus when stronger forces are there there are already some restriction in the movements and so freezing point is higher. In other words we can say that molecules where there is lower intermolecular forces we have to lower the temperature more to freeze it.
3. When polarity of the molecules increases this gives greater intermolecular forces and thus higher physical properties. This is because each molecular dipole allign themselves with others in such. a way that
(+)vely charged part attract the (-)vely charged part and this result long range intermolecular forces. This gives higher intermolecular forces.
4. Evaporation means escape of molecules from the liquis phase. When there is strong intermolecular force exists this means the molecules attract each other more. Thus escape from liquid phase is less. But when intermolecular force is weaker then molecules can escape easily. This means lower the intermolecular force higher the evaporation rate.
Again Viscosity is the resistance of a liquid to flow. When attraction is more among the molecules they resist the flow of other molecules. This implies higher viscosity. For example ethanol , CH3CH2OH, has the viscosity 1.07 mPa.s and ethylene glycol, HOCH2CH2OH , has 16.2 mPa.s. We can see that in case of ethanol there is only one OH group. But in case of ethylene glycol there is 2 OH group that can form strong H bonding. This results higher attraction among ethylene glycol moecules and so higher viscosity.
.
Explain how dopants affect the conductivity of a solid- how one can ma.docx
Explain how dopants affect the conductivity of a solid, how one can make a material n type or p type and which dopants are likely to render a material ptype or n type.
Explain how dopants affect the conductivity of a solid, how one can make a material n type or p type and which dopants are likely to render a material ptype or n type.
Solution
semiconductors which are made up of pure silicon or germanium without any impurities are called Intrinsic semiconductors. Semiconductors which are doped with some kind of impurity to improve their fuctioning or conductivity or resistivity etc are called extrinsic semiconductors.
There are two types of semiconductors which are
1) p-type semiconductors - in these types of semiconductors the doping material which is used is a trivalent substance. In a normal Si/Ge semiconductors, these are tetravalent which means these contains four electrons in their outermost shell and when a trivalent substance replaces a Si/Ge atom in the crystal it creates a HOLES, these show the lack of electron or can be realted to positive charge. Thats why such semiconductrs are known as p-type semiconductrs. The trivalent substance which is doped must belong to the III group, for example Aluminium( Al ), indium( In ) etc.
2) n-type semiconductors - in these types of semiconductors the doping material which is used is a pentavalent substance. In a normal Si/Ge semiconductors, these are tetravalent which means these contains four electrons in their outermost shell and when a trivalent substance replaces a Si/Ge atom in the crystal, so there will be an extra electron, these show the lack of electron or can be realted to positive charge. Thats why such semiconductrs are known as n-type semiconductrs. The pentavalent substance which is doped must belong to the V group, for example phosphorous( P ), arsenic ( As )etc
.
Explain how SSL protocol is used to ensure the confidentiality and int.docx
Explain how SSL protocol is used to ensure the confidentiality and integrity of the Internet traffic.
Solution
SSL uses a combination of public-key and symmetric-key encryption to secure a connection between two machines, typically a Web or mail server and a client machine, communicating over the Internet or an internal network.
Using the OSI reference model as context, SSL runs above the TCP/IP protocol, which is responsible for the transport and routing of data over a network, and below higher-level protocols such as HTTP and IMAP, encrypting the data of network connections in the application layer of the Internet Protocol suite. The \"sockets\" part of the term refers to the sockets method of passing data back and forth between a client and a server program in a network, or between program layers in the same computer.
The Transport Layer Security (TLS) protocol evolved from SSL and has largely superseded it, although the terms SSL or SSL/TLS are still commonly used; SSL is often used to refer to what is actually TLS. The combination of SSL/TLS is the most widely deployed security protocol used today and is found in applications such as Web browsers, email and basically any situation where data needs to be securely exchanged over a network, like file transfers, VPN connections, instant messaging and voice over IP.
The SSL protocol includes two sub-protocols: the record protocol and the \"handshake\" protocol. These protocols allow a client to authenticate a server and establish an encrypted SSL connection. In what\'s referred to as the \"initial handshake process,\" a server that supports SSL presents its digital certificate to the client to authenticate the server\'s identity. Server certificates follow the X.509 certificate format that is defined by the Public-Key Cryptography Standards (PKCS). The authentication process uses public-key encryption to validate the digital certificate and confirm that a server is in fact the server it claims to be.
Once the server has been authenticated, the client and server establish cipher settings and a shared key to encrypt the information they exchange during the remainder of the session. This provides data confidentiality and integrity. This whole process is invisible to the user.
For example, if a webpage requires an SSL connection, the URL will change from HTTP to HTTPS and a padlock icon appears in the browser once the server has been authenticated.
The handshake also allows the client to authenticate itself to the server. In this case, after server authentication is successfully completed, the client must present its certificate to the server to authenticate the client\'s identity before the encrypted SSL session can be established.
.
explain how revenues and expenditures are classified in the General Fu.docx
explain how revenues and expenditures are classified in the General Fund.
Solution
General Fund
General fund is used to account for the general administration and traditional services of government or government organisations. Traditional services include transportation services for public, health and welfare services for public, maintenance of infrastructure used by public in general like road, etc.
Operative statement accounts of General Fund record the Revenues and Other Financing Sources and Expenditures and Other Financing Uses.
Other Financing Sources means transfer of funds from other funds and long term borrowings.
Other Financing Uses means transfer to other fund and payment of borrowings.
Revenues-
Revenues are recognised when it is measurable and it is available to pay for current period obligations.
Classification of Revenue-
By Fund
By Sources-
Taxes- (Ad valorem and Self – assessing)- Ad valorem taxes are taxes which assessed on the value of underlying property, like property tax.
Self-assessing taxes are based on income and sales.
Special Assessment Tax- It is based on certain particular properties that receive a particular benefit which all taxpayers not receive in general.
License and Permits- Revenue from license and permits like business license, liquor license, vehicle license and building permits etc.
Intergovernmental revenues- Grants received from governments.
Charges for Services- Charges received from services rendered to public.
Fines and Forfeits- Fines imposed by courts for violation of law and forfeits are amounts which arise from deposits for breach of contracts.
Miscellaneous- Which does not fall in any above category.
Expenses-
Expenses are recorded when it is incurred and expected to be paid from current available resources
Classification of Expenditures-
Function- Expenditures towards major areas of services
Organisation Unit- Expenditures for particular department or unit
Character of Expenditures- Which period is benefitted by the expenditures , past current or future
Object
.
Experiment# Kinetics of an Iodine Clock Reaction 1- A color change wil.docx
Experiment# Kinetics of an Iodine Clock Reaction
1: A color change will occur in Kinetics of an Iodine Clock Reaction that signifies the end of a trial. What chemical change occurs that causes the color change?
2: The same amount of thiosulfate ion is added to each trail to delay the onset of the color change. Calculate the initial molarity of S2O3 2- in each trail given that each trail has 1.00mL of 0.010M Na2S2O3 and the total volume of 7.00mL.
Solution
In Iodine clock reaction, all the colourless reactants react to form iodine which is identified by starch indicatin by the formation of a blue-black colour after a some period of time.
The reactant are hydrogen peroxide which is identified using dilute sulphuric acid, small quantities of starch and sodium thiosulphate.
Hydrogen peroxide reacts with potassium iodide to form iodine.
H 2 O 2(aq) + 2I - (aq) + 2H + (aq) ------------> 2H 2 O (l) + I 2(aq)
The iodine formed reacts with sodium thiosulphate to form iodide ion
I 2 (aq) + Na 2 S 2 O 3(aq) ---------> 2NaI (aq) + S 4 O 6 2- (aq)
When all the sodium thioulphate is consumed then the left over iodine reacts with iodide to form triodide ion which reacts with starch indicator to form a blue-black colour complex.
I 2 + I - ----> I 3 - + starch -------> blue-black colour
The only source of thiosulphate ions is sodium thiosulphate so,
number of moles of thiosulphate = number of moles of sodium thiosulphate
Vol of Na 2 S 2 O 3 in lts = 0.001 lt
Molarity of Na 2 S 2 O 3 = 0.01 M
No. of moles of sodium thiosulphate = Molarity (mol/lt) of Na 2 S 2 O 3 X Vol of Na 2 S 2 O 3 in lts =
= 0.01 M x 0.001 lts = 10 -5 moles of Na 2 S 2 O 3 = 10 -5 moles of S 2 O 3 2- .
Total volume in lts = 0.007 lts
Molarity of thiosulphate initially = No. of moles of S 2 O 3 2- ./ total Vol in lts
= 10 -5 moles of S 2 O 3 2- ./ 0.007 lts = 1.428 x 10 -3 moles/lt or M of S 2 O 3 2- .
Initial molarity of S 2 O 3 2- .= 1.43 x 10 -3 M
.
Enhance the ButtonViewer program so that it prints the time at which t.docx
Enhance the ButtonViewer program so that it prints the time at which the button was clicked.
This is the ButtonViewer I have:
import java.awt.event.ActionListener;
import javax.swing.JButton;
import javax.swing.JFrame;
/**
This program demonstrates how to install an action listener.
*/
public class ButtonViewer
{
private static final int FRAME_WIDTH = 100;
private static final int FRAME_HEIGHT = 60;
public static void main(String[] args)
{
JFrame frame = new JFrame();
JButton button = new JButton(\"Click me!\");
frame.add(button);
ActionListener listener = new ClickListener();
button.addActionListener(listener);
frame.setSize(FRAME_WIDTH, FRAME_HEIGHT);
frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
frame.setVisible(true);
}
}
Click Listener:
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
/**
An action listener that prints a message.
*/
public class ClickListener implements ActionListener
{
public void actionPerformed(ActionEvent event)
{
System.out.println(\"I was clicked.\");
}
}
Solution
Answer for Question:
I have updated the code to print the time when button was clicked this is the below code in
I have ran it it\'s working fine.
import java.awt.event.ActionListener;
import javax.swing.JButton;
import javax.swing.JFrame;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.text.SimpleDateFormat;
import java.util.Calendar;
class ClickListener implements ActionListener
{
public void actionPerformed(ActionEvent event)
{
Calendar cal = Calendar.getInstance();
SimpleDateFormat sdf = new SimpleDateFormat(\"HH:mm:ss\");
System.out.println( \"I was clicked at :\"+sdf.format(cal.getTime()) );
}
}
public class ButtonViewer
{
private static final int FRAME_WIDTH = 100;
private static final int FRAME_HEIGHT = 60;
public static void main(String[] args)
{
JFrame frame = new JFrame();
JButton button = new JButton(\"Click me!\");
frame.add(button);
ActionListener listener = new ClickListener();
button.addActionListener(listener);
frame.setSize(FRAME_WIDTH, FRAME_HEIGHT);
frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
frame.setVisible(true);
}
}
.
Explain covalent bond- Explain Metallic bond and what important proper.docx
Explain covalent bond?
Explain Metallic bond and what important property derives from it in metals?
Solution
Covalent bonding occurs when pairs of electrons are shared by atoms. Atoms will covalently bond with other atoms in order to gain more stability, which is gained by forming a full electron shell. By sharing their outer most (valence) electrons, atoms can fill up their outer electron shell and gain stability. Nonmetals will readily form covalent bonds with other nonmetals in order to obtain stability, and can form anywhere between one to three covalent bonds with other nonmetals depending on how many valence electrons they posses. Although it is said that atoms share electrons when they form covalent bonds, they do not usually share the electrons equally.
Link : http://chemwiki.ucdavis.edu/Theoretical_Chemistry/Chemical_Bonding/General_Principles/Covalent_Bonds
Metallic bond is the reaction between molecules within metals called alkali reactive force. It was first discovered by K. Manishekar. It is the sharing of a sea of delocalised electrons amongst a lattice of positive ions, where the electrons act as a \"glue\" giving the substance a definite structure.
The electrons and the positive ions in the metal have a strong attractive force between them. Therefore metals often have high melting or boiling points. The principle is similar to that of ionic bonds.
The metallic bond accounts for many physical characteristics of metals, such as strength, malleability, ductility, luster, conduction of heat and electricity.
Because the electrons move independently of the positive ions in a sea of negative charge, the metal gains some electrical conductivity. It allows the energy to pass quickly through the electrons generating a current. Heat conduction works on the same principle - the free electrons can transfer the energy at a faster rate than other substances such as those which are covalently bonded, as these have their electrons fixed into position. There also are few non-metals which conduct electricity: graphite (because, like metals, they have free electrons), and molten and aqueous ionic compounds which have free moving ions
Link : https://simple.wikipedia.org/wiki/Metallic_bond
.
English Read the sentences- Which sentence contains a nonrestrictive.docx
English
Read the sentences.
Which sentence contains a nonrestrictive clause that requires commas?
Solution
B. sentence 2
.
More from todd401 (20)
Exercise 7-15 During October- Wichita Light Company experiences the fo.docx
Exercise 7-15 During October- Wichita Light Company experiences the fo.docx
Exercise 4-3 (Part Level Submission) The adjusted trial balance column.docx
Exercise 4-3 (Part Level Submission) The adjusted trial balance column.docx
examples of how being familiar with and following digital forensic bes.docx
examples of how being familiar with and following digital forensic bes.docx
Est 12-16 AM edugen-wileyplus-com Open Assignment t experience please.docx
Est 12-16 AM edugen-wileyplus-com Open Assignment t experience please.docx
examples of materials that have directional properties as a single cry.docx
examples of materials that have directional properties as a single cry.docx
Examine the importance for business financial leaders to recognize the.docx
Examine the importance for business financial leaders to recognize the.docx
Examine the primary reasons why project management causes a cultural c.docx
Examine the primary reasons why project management causes a cultural c.docx
Fal or - Seawat A pur ture Chapter Review Speaking1- How is a mixture.docx
Fal or - Seawat A pur ture Chapter Review Speaking1- How is a mixture.docx
Explain three advantages and one disadvantage to CONSUMER from standar.docx
Explain three advantages and one disadvantage to CONSUMER from standar.docx
Explain the various reasons why atoms and molecules form chemical bond.docx
Explain the various reasons why atoms and molecules form chemical bond.docx
Explain (in your own words) the concept colbertism and what-'s interes.docx
Explain (in your own words) the concept colbertism and what-'s interes.docx
Explain the 3 Emissive flat-panel devices- electroluminescent- plasma.docx
Explain the 3 Emissive flat-panel devices- electroluminescent- plasma.docx
Experimental Questions 1- Which types of compounds have the strongest.docx
Experimental Questions 1- Which types of compounds have the strongest.docx
Explain how dopants affect the conductivity of a solid- how one can ma.docx
Explain how dopants affect the conductivity of a solid- how one can ma.docx
Explain how SSL protocol is used to ensure the confidentiality and int.docx
Explain how SSL protocol is used to ensure the confidentiality and int.docx
explain how revenues and expenditures are classified in the General Fu.docx
explain how revenues and expenditures are classified in the General Fu.docx
Experiment# Kinetics of an Iodine Clock Reaction 1- A color change wil.docx
Experiment# Kinetics of an Iodine Clock Reaction 1- A color change wil.docx
Enhance the ButtonViewer program so that it prints the time at which t.docx
Enhance the ButtonViewer program so that it prints the time at which t.docx
Explain covalent bond- Explain Metallic bond and what important proper.docx
Explain covalent bond- Explain Metallic bond and what important proper.docx
English Read the sentences- Which sentence contains a nonrestrictive.docx
English Read the sentences- Which sentence contains a nonrestrictive.docx
Recently uploaded
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
How to Make a Field invisible in Odoo 17
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Unit 8 - Information and Communication Technology (Paper I).pdf
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Andreas Schleicher presents at the OECD webinar ‘Digital devices in schools: detrimental distraction or secret to success?’ on 27 May 2024. The presentation was based on findings from PISA 2022 results and the webinar helped launch the PISA in Focus ‘Managing screen time: How to protect and equip students against distraction’ https://www.oecd-ilibrary.org/education/managing-screen-time_7c225af4-en and the OECD Education Policy Perspective ‘Students, digital devices and success’ can be found here - https://oe.cd/il/5yV
How to Create Map Views in the Odoo 17 ERP
The map views are useful for providing a geographical representation of data. They allow users to visualize and analyze the data in a more intuitive manner.
Cambridge International AS A Level Biology Coursebook - EBook (MaryFosbery J...
for studentd in cabridge board
Sectors of the Indian Economy - Class 10 Study Notes pdf
The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension.
For more information, visit-www.vavaclasses.com
Home assignment II on Spectroscopy 2024 Answers.pdf
Answers to Home assignment on UV-Visible spectroscopy: Calculation of wavelength of UV-Visible absorption
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdfFundacja Rozwoju Społeczeństwa Przedsiębiorczego
Wolontariat grupowySupporting (UKRI) OA monographs at Salford.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
Model Attribute Check Company Auto Property
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
Synthetic Fiber Construction in lab .pptx
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Ethnobotany and Ethnopharmacology ......
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
Recently uploaded (20)
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Cambridge International AS A Level Biology Coursebook - EBook (MaryFosbery J...
Cambridge International AS A Level Biology Coursebook - EBook (MaryFosbery J...
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
Sectors of the Indian Economy - Class 10 Study Notes pdf
Sectors of the Indian Economy - Class 10 Study Notes pdf
Home assignment II on Spectroscopy 2024 Answers.pdf
Home assignment II on Spectroscopy 2024 Answers.pdf
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
ESC Beyond Borders _From EU to You_ InfoPack general.pdf
Everything compiles and everything runs correctly except my insertionS.docx
- 1. Everything compiles and everything runs correctly except my insertionSort(). When the user selects it in the app class it just list the last input the user made instead of showing the sorted list. HELP PLEASE! public void insertionSort(DoublyLinkedList dd) { DoublyLinkedList newLink = dd; DoublyLinkedList temp = first; if( extra == null ) //if empty list, { first = newLink;//newLink <--last first.next = null; first.previous = null; } else{ DoublyLinkedList previous=null; DoublyLinkedList next=first.next; DoublyLinkedList current=first; for(int i=0;temp.next!=null;i++){ if(Integer.parseInt(temp.dData.getId()) < Integer.parseInt(newLink.dData.getId())){ current=temp; previous=temp.previous; next=temp.next; } temp=temp.next;} newLink.previous=temp; newLink.next=temp.next; temp.next=newLink; next.previous=newLink; } Solution Try this code:-
- 2. void insertionsort(node **d) { int n; node *cur; cur=*d; if(cur->next==Null) return; node *ptr, *tmp; cur=cur->next; while(cur!=NULL) { n=0; ptr=cur; tmp=cur->prev; cur=cur->next; while(tmp!=NULL && tmp->data->ptr->data) { n++; tmp=tmp->prev; } if(n) { ptr->prev->next=ptr->next;