Using visual studio 2022- a C# windows form application- and your Doub.pdf
•
0 likes•12 views
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.
Report
Share
Report
Share
Download to read offline
Recommended
Can someone help me to fix the code please package dlist i.pdf
Can someone help me to fix the code please?
package dlist;
import java.util.Iterator;
public class DList implements Iterable<String> {
private static class DListNode {
public String data;
public DListNode next;
public DListNode previous;
}
private DListNode nil;
private int size;
public DList() {
nil = new DListNode();
nil.previous = nil;
nil.next = nil;
nil.data = null;
size = 0;
}
public void addFirst(String elem) {
DListNode newNode = new DListNode();
newNode.data = elem;
newNode.next = nil.next;
newNode.previous = nil;
nil.next.previous = newNode;
nil.next = newNode;
size++;
}
public void addLast(String elem) {
DListNode newNode = new DListNode();
newNode.data = elem;
newNode.next = nil;
newNode.previous = nil.previous;
nil.previous.next = newNode;
nil.previous = newNode;
size++;
}
public String getFirst() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
return nil.next.data;
}
public String getLast() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
return nil.previous.data;
}
public String removeFirst() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
DListNode first = nil.next;
first.next.previous = nil;
nil.next = first.next;
size--;
return first.data;
}
public String removeLast() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
DListNode last = nil.previous;
last.previous.next = nil;
nil.previous = last.previous;
size--;
return last.data;
}
public String get(int index) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
DListNode node = nil.next;
for (int i = 0; i < index; i++) {
node = node.next;
}
return node.data;
}
public String set(int index, String value) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
DListNode node = nil.next;
for (int i = 0; i < index; i++) {
node = node.next;
}
String oldValue = node.data;
node.data = value;
return oldValue;
}
public boolean contains(Object obj) {
DListNode node = nil.next;
while (node != nil) {
if (node.data.equals(obj)) {
return true;
}
node = node.next;
}
return false;
}
public int size() {
return size;
}
public int indexOf(Object obj)
{
int index = 0;
DListNode node = nil.next;
while (node != nil)
{
if (node.data.equals(obj))
{
return index;
}
index++;
node = node.next;
}
return -1;
}
@Override
public Iterator<String> iterator()
{
return new DListIterator();
}
private class DListIterator implements Iterator<String>
{
private DListNode pointer;
public DListIterator()
{
if(nil.next==nil)
{
pointer = nil;
}
else
pointer=nil.next;
}
public boolean hasNext()
{
return pointer != nil;
}
}
}.
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.
Create a new java class called ListNode. Implement ListNode as a gen.pdf
Create a new java class called ListNode. Implement ListNode as a generic version of IntNode.
public class ListNode { }
Create a generic class called Queue, which is a linked list implementation of a queue data type.
Queue must have the following methods:
• public void enqueue(T value){} This method should add a new node to the back of the queue.
• public T dequeue(){} This method should remove a node from the front of the queue and return
its value
• public T peek(){} This method should return the value of the front node without removing it
from the queue
Create a new generic class called Stack, which is a linked list implementation of a stack data
type. Stack must have the following methods:
• public void push(T value){} This method should add a new node to the top of the stack.
• public T pop(){} This method should remove a node from the top of the stack and return its
integer value
• public T peek(){} This method should return the integer value of the top node without
removing it from the stack
Solution
import java.util.Iterator;
public class LinkedList extends AbstractList {
private ListNode front; // refers to first node in list (null if empty)
public LinkedList() {
front = null; // null front means empty
}
public void add(int index, E value) {
if (index == 0) {
// insert at the front
front = new ListNode(value, front);
} else {
ListNode current = goTo(index - 1);
ListNode newNode = new ListNode(value, current.next);
current.next = newNode;
}
}
public E get(int index) {
ListNode current = goTo(index);
return current.data;
}
public int indexOf(E value) {
int index = 0;
ListNode current = front;
while (current != null) {
if (current.data == value) {
return index;
}
index++;
current = current.next;
}
return -1;
}
public Iterator iterator() {
return new LinkedListIterator();
}
public void remove(int index) {
if (index == 0) {
// removing from the front
front = front.next;
} else {
ListNode current = goTo(index - 1);
current.next = current.next.next; // deletes the node
}
}
public void set(int index, E value) {
ListNode current = goTo(index);
current.data = value;
}
public int size() {
int count = 0;
ListNode current = front;
while (current != null) {
current = current.next;
count++;
}
return count;
}
public String toString() {
if (front == null) {
return \"[]\";
} else {
String result = \"[\" + front.data;
ListNode current = front.next;
while (current != null) {
result += \", \" + current.data;
current = current.next;
}
result += \"]\";
return result;
}
}
private ListNode goTo(int index) {
ListNode current = front;
for (int i = 0; i < index; i++) {
current = current.next;
}
return current;
}
public class ListNode {
public E data;
public ListNode next;
public ListNode(E data) {
this.data = data;
this.next = null;
}
public ListNode(E data, ListNode next) {
this.data = data;
this.next = next;
}
}
private class LinkedListIterator implements Iterator {
private ListNode current; // current position in list
public LinkedListIterator() {
current = f.
fix the error - class Node{ int data- Node next-.pdf
fix the error :
class Node{
int data;
Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class singlelinkedlist {
public Node head = null;
public Node tail = null;
public void addNode(int data) {
Node newNode = new Node(data);
if(head == null) {
head = newNode;
tail = newNode;
}
else {
tail.next = newNode;
tail = newNode;
}
}
public void sortList() {
Node current = head, index = null;
int temp;
if(head == null) {
return;
}
else {
while(current != null) {
index = current.next;
while(index != null) {
if(current.data > index.data) {
temp = current.data;
current.data = index.data;
index.data = temp;
}
index = index.next;
}
current = current.next;
}
}
}
public void display() {
Node current = head;
if(head == null) {
System.out.println("List is empty");
return;
}
while(current != null) {
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
}
public class JavaApplication46 {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO code application logic here
SortList sList = new SortList();
sList.addNode(9);
sList.addNode(7);
sList.addNode(2);
sList.addNode(5);
sList.addNode(4);
System.out.println("Original list: ");
sList.display();
sList.sortList();
System.out.println("Sorted list: ");
sList.display();
}
}.
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Assignment isPage 349-350 #4 and #5 Use the Linked List lab.pdf
Assignment is:
\"Page 349-350 #4 and #5 Use the \"Linked List lab\" you have been working on in class and add
the two functions the questions are asking you to develop: divideMid and divideAt. Be sure to
include comments Use meaningful identifier names (constants where appropriate) Turn in .cpp
file AND Turn in a \"print-screen\' of your output (press \"print-screen\' on keyboard, then
\'paste\' in MS-Word)\"
How do you solve QUESTION #4 in the book data structures using c++ by D.S. Malik in Visiual
Studios using the linked list below with what is being asked? Please need help
Linked list :
#include
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *first, *last;
int num;
createList(first, last);
int choice;
while(true)
{
cout<<\"1. Insert Front.\ 2. Insert Last.\ 3. Delete Front.\ 4. Delete Last.\ 5. Print List.\ 6. Exit.\
\";
cout<<\"Enter your choice: \";
cin>>choice;
switch(choice)
{
case 1: insertFront(first); break;
case 2: insertBack(last); break;
case 3: deleteFirst(first); break;
case 4: deleteLast(last, first); break;
case 5: printList(first); break;
case 6: return 0;
default: cout<<\"Invalid menu option. Try again.\"<>number;
while (number != -999)
{
newNode = new nodeType; // create new node
newNode->info = number;
newNode->link = NULL;
if (first == NULL)
{
first = newNode;
last = newNode;
}
else
{
last->link = newNode;
last = newNode;
}
cout<<\"Enter an integer (-999 to stop): \";
cin>>number;
} // end of while-loop
} // end of build list function
void deleteFirst(nodeType*& first)
{
nodeType *temp;
temp= first;
first= temp->link;
delete temp;
return;
}
void deleteLast(nodeType*& last, nodeType* current)
{
nodeType *temp;
while(current->link != NULL)
{
temp=current;
current=current->link;
}
temp=last;
current->link=NULL;
delete temp;
last = current;
return;
}
void insertFront(nodeType*& front)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= front;
front= newNode;
return;
}
void insertBack(nodeType*& last)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= NULL;
last->link= newNode;
last = newNode;
return;
}
void printList(nodeType*& first)
{
cout<<\"Inside printList...printing linked list...\ \"<info << \" \";
current = current->link;
}
cout<
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *firs.
Recommended
Can someone help me to fix the code please package dlist i.pdf
Can someone help me to fix the code please?
package dlist;
import java.util.Iterator;
public class DList implements Iterable<String> {
private static class DListNode {
public String data;
public DListNode next;
public DListNode previous;
}
private DListNode nil;
private int size;
public DList() {
nil = new DListNode();
nil.previous = nil;
nil.next = nil;
nil.data = null;
size = 0;
}
public void addFirst(String elem) {
DListNode newNode = new DListNode();
newNode.data = elem;
newNode.next = nil.next;
newNode.previous = nil;
nil.next.previous = newNode;
nil.next = newNode;
size++;
}
public void addLast(String elem) {
DListNode newNode = new DListNode();
newNode.data = elem;
newNode.next = nil;
newNode.previous = nil.previous;
nil.previous.next = newNode;
nil.previous = newNode;
size++;
}
public String getFirst() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
return nil.next.data;
}
public String getLast() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
return nil.previous.data;
}
public String removeFirst() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
DListNode first = nil.next;
first.next.previous = nil;
nil.next = first.next;
size--;
return first.data;
}
public String removeLast() {
if (size == 0) {
throw new RuntimeException("DList is empty");
}
DListNode last = nil.previous;
last.previous.next = nil;
nil.previous = last.previous;
size--;
return last.data;
}
public String get(int index) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
DListNode node = nil.next;
for (int i = 0; i < index; i++) {
node = node.next;
}
return node.data;
}
public String set(int index, String value) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}
DListNode node = nil.next;
for (int i = 0; i < index; i++) {
node = node.next;
}
String oldValue = node.data;
node.data = value;
return oldValue;
}
public boolean contains(Object obj) {
DListNode node = nil.next;
while (node != nil) {
if (node.data.equals(obj)) {
return true;
}
node = node.next;
}
return false;
}
public int size() {
return size;
}
public int indexOf(Object obj)
{
int index = 0;
DListNode node = nil.next;
while (node != nil)
{
if (node.data.equals(obj))
{
return index;
}
index++;
node = node.next;
}
return -1;
}
@Override
public Iterator<String> iterator()
{
return new DListIterator();
}
private class DListIterator implements Iterator<String>
{
private DListNode pointer;
public DListIterator()
{
if(nil.next==nil)
{
pointer = nil;
}
else
pointer=nil.next;
}
public boolean hasNext()
{
return pointer != nil;
}
}
}.
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.
Create a new java class called ListNode. Implement ListNode as a gen.pdf
Create a new java class called ListNode. Implement ListNode as a generic version of IntNode.
public class ListNode { }
Create a generic class called Queue, which is a linked list implementation of a queue data type.
Queue must have the following methods:
• public void enqueue(T value){} This method should add a new node to the back of the queue.
• public T dequeue(){} This method should remove a node from the front of the queue and return
its value
• public T peek(){} This method should return the value of the front node without removing it
from the queue
Create a new generic class called Stack, which is a linked list implementation of a stack data
type. Stack must have the following methods:
• public void push(T value){} This method should add a new node to the top of the stack.
• public T pop(){} This method should remove a node from the top of the stack and return its
integer value
• public T peek(){} This method should return the integer value of the top node without
removing it from the stack
Solution
import java.util.Iterator;
public class LinkedList extends AbstractList {
private ListNode front; // refers to first node in list (null if empty)
public LinkedList() {
front = null; // null front means empty
}
public void add(int index, E value) {
if (index == 0) {
// insert at the front
front = new ListNode(value, front);
} else {
ListNode current = goTo(index - 1);
ListNode newNode = new ListNode(value, current.next);
current.next = newNode;
}
}
public E get(int index) {
ListNode current = goTo(index);
return current.data;
}
public int indexOf(E value) {
int index = 0;
ListNode current = front;
while (current != null) {
if (current.data == value) {
return index;
}
index++;
current = current.next;
}
return -1;
}
public Iterator iterator() {
return new LinkedListIterator();
}
public void remove(int index) {
if (index == 0) {
// removing from the front
front = front.next;
} else {
ListNode current = goTo(index - 1);
current.next = current.next.next; // deletes the node
}
}
public void set(int index, E value) {
ListNode current = goTo(index);
current.data = value;
}
public int size() {
int count = 0;
ListNode current = front;
while (current != null) {
current = current.next;
count++;
}
return count;
}
public String toString() {
if (front == null) {
return \"[]\";
} else {
String result = \"[\" + front.data;
ListNode current = front.next;
while (current != null) {
result += \", \" + current.data;
current = current.next;
}
result += \"]\";
return result;
}
}
private ListNode goTo(int index) {
ListNode current = front;
for (int i = 0; i < index; i++) {
current = current.next;
}
return current;
}
public class ListNode {
public E data;
public ListNode next;
public ListNode(E data) {
this.data = data;
this.next = null;
}
public ListNode(E data, ListNode next) {
this.data = data;
this.next = next;
}
}
private class LinkedListIterator implements Iterator {
private ListNode current; // current position in list
public LinkedListIterator() {
current = f.
fix the error - class Node{ int data- Node next-.pdf
fix the error :
class Node{
int data;
Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class singlelinkedlist {
public Node head = null;
public Node tail = null;
public void addNode(int data) {
Node newNode = new Node(data);
if(head == null) {
head = newNode;
tail = newNode;
}
else {
tail.next = newNode;
tail = newNode;
}
}
public void sortList() {
Node current = head, index = null;
int temp;
if(head == null) {
return;
}
else {
while(current != null) {
index = current.next;
while(index != null) {
if(current.data > index.data) {
temp = current.data;
current.data = index.data;
index.data = temp;
}
index = index.next;
}
current = current.next;
}
}
}
public void display() {
Node current = head;
if(head == null) {
System.out.println("List is empty");
return;
}
while(current != null) {
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
}
public class JavaApplication46 {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
// TODO code application logic here
SortList sList = new SortList();
sList.addNode(9);
sList.addNode(7);
sList.addNode(2);
sList.addNode(5);
sList.addNode(4);
System.out.println("Original list: ");
sList.display();
sList.sortList();
System.out.println("Sorted list: ");
sList.display();
}
}.
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Data Structures and Agorithm: DS 05 Doubly Linked List.pptx
Assignment isPage 349-350 #4 and #5 Use the Linked List lab.pdf
Assignment is:
\"Page 349-350 #4 and #5 Use the \"Linked List lab\" you have been working on in class and add
the two functions the questions are asking you to develop: divideMid and divideAt. Be sure to
include comments Use meaningful identifier names (constants where appropriate) Turn in .cpp
file AND Turn in a \"print-screen\' of your output (press \"print-screen\' on keyboard, then
\'paste\' in MS-Word)\"
How do you solve QUESTION #4 in the book data structures using c++ by D.S. Malik in Visiual
Studios using the linked list below with what is being asked? Please need help
Linked list :
#include
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *first, *last;
int num;
createList(first, last);
int choice;
while(true)
{
cout<<\"1. Insert Front.\ 2. Insert Last.\ 3. Delete Front.\ 4. Delete Last.\ 5. Print List.\ 6. Exit.\
\";
cout<<\"Enter your choice: \";
cin>>choice;
switch(choice)
{
case 1: insertFront(first); break;
case 2: insertBack(last); break;
case 3: deleteFirst(first); break;
case 4: deleteLast(last, first); break;
case 5: printList(first); break;
case 6: return 0;
default: cout<<\"Invalid menu option. Try again.\"<>number;
while (number != -999)
{
newNode = new nodeType; // create new node
newNode->info = number;
newNode->link = NULL;
if (first == NULL)
{
first = newNode;
last = newNode;
}
else
{
last->link = newNode;
last = newNode;
}
cout<<\"Enter an integer (-999 to stop): \";
cin>>number;
} // end of while-loop
} // end of build list function
void deleteFirst(nodeType*& first)
{
nodeType *temp;
temp= first;
first= temp->link;
delete temp;
return;
}
void deleteLast(nodeType*& last, nodeType* current)
{
nodeType *temp;
while(current->link != NULL)
{
temp=current;
current=current->link;
}
temp=last;
current->link=NULL;
delete temp;
last = current;
return;
}
void insertFront(nodeType*& front)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= front;
front= newNode;
return;
}
void insertBack(nodeType*& last)
{
int num;
cout<<\"\ Enter the number to insert: \";
cin>>num;
nodeType *newNode = new nodeType;
newNode->info=num;
newNode->link= NULL;
last->link= newNode;
last = newNode;
return;
}
void printList(nodeType*& first)
{
cout<<\"Inside printList...printing linked list...\ \"<info << \" \";
current = current->link;
}
cout<
#include
using namespace std;
struct nodeType
{
int info;
nodeType *link;
};
void createList(nodeType*& first, nodeType*& last);
void printList(nodeType*& first);
void insertFront(nodeType*& first);
void insertBack(nodeType*& last);
void deleteFirst(nodeType*& first);
void deleteLast(nodeType*& last, nodeType* first);
int main()
{
nodeType *firs.
So I have this code(StackInAllSocks) and I implemented the method but.pdf
So I have this code( StackInAllSocks ) and I implemented the method but I can't seem to figure
out why there isn't anything showing up on the console. It should pop,peek and push b using the
methods from the class called ArrayListTen . The ArrayListTen works fine and compiles the
tested code of Rigth# but for StackInAllSocks it doesn't complete at all. note that file
VodeDodeis not to be changed is just a Node storage area of the array list.
Did I implement the method on StackInAllSocks correctly? if so, should I not use the method
from the ArrayListTen .?
__________________________________________________________________________
: the code is : VodeDodeis
class VodeDode<T> {
private T data;
private VodeDode<T> next;
private VodeDode<T> prev;
public VodeDode(T data) {
this.data = data;
this.next = null;
this.prev = null;}
public T getData() {
return data;}
public void setData(T data) {
this.data = data;}
public VodeDode<T> getNext() {
return this.next;}
public void setNext(VodeDode<T> next) {
this.next = next;}
public VodeDode<T> getPrev() {
return this.prev;}
public void setPrev(VodeDode<T> prev) {
this.prev = prev;}
@Override
public String toString() {
return data.toString();}}
_________________________________________________________________________
CODE that works fine called ArrayListTen:
import java.util.Iterator;
public class ArrayListTen<T> implements Iterable<T> {
private VodeDode<T> head; //beginning of list
private VodeDode<T> tail; //end of list
private int size;
private VodeDode<T> new_item;
public ArrayListTen( ){
this.head = null;
this.tail = null;
this.size = 0;}
public int lenght() {
return size ;}
public T getBegin() {
if (this.head != null) {
return head.getData();}
else { return null;}}
public void addBegin(T value) {
VodeDode<T> newVodeDode =new VodeDode<T>(value);
if (this.head== null) {
head = newVodeDode;
tail =newVodeDode;}
else {VodeDode<T> temp = head;
head = newVodeDode;
head.setNext(temp);}
size++;}
public T removeBegin() {
if(this.head == null) {
return null;}
else {T current = head.getData();
if (tail == head) {
tail = null;
head = null;
} else {
head = head.getNext();
head.setPrev(null);}size--;
return current;}}
public T getEnd() {
if (tail != null) {
return tail.getData();
} else {
return null;}}
public void addEnd(T value) {
VodeDode<T> newVodeDode = new VodeDode<T>(value);
if (this.tail == null) {
head = newVodeDode;
tail = newVodeDode;
} else {
newVodeDode.setPrev(tail);
tail.setNext(newVodeDode);
tail = newVodeDode;}
size++;}
public T removeEnd() {
if(this.tail == null) {
return null;}
else {
T current = tail.getData();//was head.
if (head == tail) {
head = null;
tail = null;
} else {
tail = tail.getPrev();
tail.setNext(null);}
size--;
return current;}}
public T removeBN(T value) {
VodeDode<T> currVodeDode = head;
VodeDode<T> prevVodeDode = null;
while(currVodeDode != null){
if(currVodeDode.getData().equals(value)){
if(prevVodeDode != null){
prevVodeDode.setNext(currVodeDode.getNext());}
else{
head = curr.
.NET 2015: Будущее рядом
В последнее время экосистема .NET развивается очень динамично: постоянно появляются новые технологии и инструменты, а старые обзаводятся новыми возможностями. Уследить за всем очень сложно, поэтому в этом докладе мы постараемся обзорно взглянуть на текущее состояние платформы .NET, а также на то, что нас ждёт в ближайшем будущем. Будем говорить про грядущий C#7, про кроссплатформенность и нативную компиляцию, про новый .NET Core 5 и ASP.NET 5, про новые инструменты для разработчиков и последние анонсы от Microsoft.
Need help finishing this doubly linked list code- Commented lines are.docx
Need help finishing this doubly linked list code.
Commented lines are what's needed, also add the following recursive methods: findFirstNodeWithValue() and getDisplayString() that returns a string containing the strings in the list separated by spaces
Code in C# language only, please.
internal class DoubleLinkedList {
public DoubleLinkedListNode? firstNode = null;
public DoubleLinkedListNode? lastNode = null;
public DoubleLinkedListNode? currentNode = null;
// other class level variables needed?
public DoubleLinkedList() {
// creates first node in list with firstValue
}
public DoubleLinkedList(string firstValue) {
// methods and features to add:
// get current node reference
// insert node before first
// delete first node
// insert node after last
// delete last node
// insert node after current - uses multiple methods
// delete current
// move current to next node
// move current to previous node
// recursive: find node with value - return reference or null
// recursive: get display string
}
}
/*******************************
* double Linked List Node - needs to be made generic
* class is incomplete
* *****************************/
internal class DoubleLinkedListNode {
public string? value = null;
public DoubleLinkedListNode? nextNode = null;
public DoubleLinkedListNode? previousNode = null;
public DoubleLinkedListNode(string v) {
value = v.ToLower();
}
private DoubleLinkedListNode() {
value = null;
}
}
.
In the class we extensively discussed a node class called IntNode in.pdf
In the class we extensively discussed a node class called IntNode in which each linked list node
contains an integer and each node is linked forward to the next element in the list. Implement a
node class called DoublyIntNode in which each node contains an integer number and each node
is linked not only forward to the next element in the list but also backward to the previous
element in the list. Your implementation of DoublyIntNode should adapt and implement all the
methods of IntNode including the following methods:
Constructor for DoublyIntNode
addNodeAfter, removeNodeAfter
getData, setData
getForeLink, setForeLink
getBackLink, setBackLink
listCopy
listCopyWithTail
listLength
listPart
listPosition
listSearch
IntNode and Node classes:
public class IntNode{
private int data;
private IntNode link;
// methods here
}
public class Node {
private E data;
private Node link;
// methods here
}
Solution
program
#include
using namespace std;
struct list
{
struct list *prev;
int data;
struct list *next;
}
*node = NULL, *first = NULL, *last = NULL, *node1 = NULL, *node2 = NULL;
class Dlist
{
public:
void insert_beg() {
list *addBeg = new list;
cout << \"Enter value for the node:\" << endl;
cin >> addBeg->data;
if(first == NULL) {
addBeg->prev = NULL;
addBeg->next = NULL;
first = addBeg;
last = addBeg;
cout << \"Linked list Created!\" << endl;
}
else {
addBeg->prev = NULL;
first->prev = addBeg;
addBeg->next = first;
first = addBeg;
cout << \"Data Inserted at the beginning of the Linked list!\" << endl;
}
}
void insert_end() {
list *addEnd = new list;
cout << \"Enter value for the node:\" << endl;
cin >> addEnd->data;
if(first == NULL) {
addEnd->prev = NULL;
addEnd->next = NULL;
first = addEnd;
last = addEnd;
cout << \"Linked list Created!\" << endl;
}
else {
addEnd->next = NULL;
last->next = addEnd;
addEnd->prev = last;
last = addEnd;
cout << \"Data Inserted at the end of the Linked list!\" << endl;
}
}
void display() {
node = first;
cout << \"List of data in Linked list in Ascending order!\" << endl;
while(node != NULL) {
cout << node->data << endl;
node = node->next;
}
node = last;
cout << \"List of data in Linked list in Descending order!\" << endl;
while(node != NULL) {
cout << node->data << endl;
node = node->prev;
}
}
void del()
{
int count = 0, number, i;
node = node1 = node2 = first;
for(node = first; node != NULL; node = node->next)
cout << \"Enter value for the node:\" << endl;
count++;
display();
cout << count << \" nodes available here!\" << endl;
cout << \"Enter the node number which you want to delete:\" << endl;
cin >> number;
if(number != 1)
{
if(number < count && number > 0)
{
for(i = 2; i <= number; i++)
node = node->next;
for(i = 2; i <= number-1; i++)
node1 = node1->next;
for(i = 2; i <= number+1; i++)
node2 = node2->next;
node2->prev = node1;
node1->next = node2;
node->prev = NULL;
node->next = NULL;
node = NULL;
}
else if(number == count)
{
node = last;
last = node->prev;
last->next = NULL;
node = NULL;
}
else
cout << \"Invalid node.
I need help coding a doubly linked list from this unfinished code- Eve.docx
I need help coding a doubly linked list from this unfinished code.
Everything commented out is what needs to be added. This is done using C# in a Visual Studio Windows Form App.
internal class DoubleLinkedList {
public DoubleLinkedListNode? firstNode = null;
public DoubleLinkedListNode? lastNode = null;
public DoubleLinkedListNode? currentNode = null;
// other class level variables needed?
public DoubleLinkedList() {
// creates first node in list with firstValue
}
public DoubleLinkedList(string firstValue) {
// methods and features to add:
// get current node reference
// insert node before first
// delete first node
// insert node after last
// delete last node
// insert node after current - uses multiple methods
// delete current
// move current to next node
// move current to previous node
// recursive: find node with value - return reference or null
// recursive: get display string
}
}
/*******************************
* double Linked List Node - needs to be made generic
* class is incomplete
* *****************************/
internal class DoubleLinkedListNode {
public string? value = null;
public DoubleLinkedListNode? nextNode = null;
public DoubleLinkedListNode? previousNode = null;
public DoubleLinkedListNode(string v) {
value = v.ToLower();
}
private DoubleLinkedListNode() {
value = null;
}
}
.
I need help implementing a Stack with this java programming assignme.pdf
I need help implementing a Stack with this java programming assignment:
Given a doubly linked list (code provided below) implement a Stack. You must use the doubly
link list class and utilize it as an object in your implementation of the stack.
A Stack is a Last in First Out (LiFO) structure which translates to the processes of outputting the
last element which was inputted in the collection. The Stack is based on the process of putting
things on top of one another and taking the item on top (think of a stack of papers).
Operations to implement:
push (E): Add an element to the start of the sequence
pop: Remove an element from the start of the sequence
Peek: Return the first element of the sequence without removing it
atIndex(x): Return the element at the given index (x) Or throw an exception if it is out of bound
(if you can control the user input then do that instead)
Size: Return the size of the Stack
isEmpty: Boolean, returns true if the Stack is empty
Empty: Empty the Stack
Code Part 1:
public class DoublyLinkedList{
private DNode head;
private DNode tail;
private int size;
public DoublyLinkedList(){ // construct an empty list
this.tail = new DNode (null, null, this.head);
this.head = new DNode (null, this.tail, null);
this.size = 0;
}
public DoublyLinkedList(DNode next){ // constructs a list
// out of a single node
this.tail = new DNode (null, null, next);
this.head = new DNode (null, next, null);
next.changeNext(this.tail);
next.changePrev(this.head);
this.size = 1;
}
public DoublyLinkedList(Object [] objectArray){ // construct a list out of
// an array
this.tail = new DNode (null, null, this.head);
this.head = new DNode (null, this.tail, null);
DNode temp = this.head;
for (Object e : objectArray)
{
//Anonomus function
new DNode (e, temp.getNext(),temp).insertBetweenNodes(temp, temp.getNext());
temp = temp.getNext();
this.size += 1;
}
}
public void addToFrontofList(Object toAdd){ // Appends the begining
// of the list
DNode temp = new DNode (toAdd, this.head.getNext(), this.head);
this.head.getNext().changePrev(temp);
this.head.changeNext(temp);
this.size += 1;
}
public void addToendofList (Object toAdd) // appends the end of the list
// with a node
{
DNode temp = new DNode (toAdd, this.tail, this.tail.getPrev());
this.tail.getPrev().changeNext(temp);
this.tail.changePrev(temp);
this.size += 1;
}
public void insertAfterNode(DNode current, Object input)// Inserts a new
// a new node after
// current node
{
current.insertAfterNode(input);
this.size += 1;
}
public int getSize() // returns the size of the list
{
return this.size;
}
public String toString()
{
String result = \"\";
for (DNode temp = this.head.getNext();
temp.hasNext(); temp = temp.getNext())
{
result += temp.getValue();
result += \" -> \";
}
result += \"End of list\";
return result;
}
}
and code part2:
public class DNode{
private Object e; // place holder for the type of object the
//collection is storing
private DNode next; // reference to the next node in the sequence
// of.
Add delete at a position to the code and display it to the code- class.pdf
Add delete at a position to the code and display it to the code:
class listnodes {
int data;
listnodes link;
listnodes() {
data = 0;
link = null;
}
listnodes(int d, listnodes l) {
data = d;
link = l;
}
}
class singlelinkedlist {
public listnodes insertnode(int data, listnodes head) {
listnodes newnode = new listnodes(data, null);
newnode.link = head;
head = newnode;
return head;
}
public listnodes insertAtPosition(listnodes head, int data, int position) {
listnodes newnode = new listnodes(data, null);
listnodes previous = head;
int count = 1;
while (count <= position - 1) {
previous = previous.link;
count++;
}
listnodes current = previous.link;
newnode.link = current;
previous.link = newnode;
return head;
}
public listnodes deletefirst(listnodes head) {
listnodes pre = head;
head = head.link;
pre.link = null;
return pre;
}
public void display(listnodes head) {
listnodes current = head;
while (current.link != null) {
System.out.print(current.data + "-->");
current = current.link;
}
System.out.print(current.data);
}
}
public class LinkedList {
public static void main(String[] args) {
listnodes head=new listnodes(10,null);
singlelinkedlist sl=new singlelinkedlist();
sl.display(head);
System.out.println("\nInsert at front");
listnodes newhead=sl.insertnode(20, head);
sl.display(newhead);
System.out.println("\nInsert at a position");
sl.insertAtPosition(newhead, 40, 1);
sl.display(newhead);
System.out.println("\nDelete first");
listnodes newhead2=sl.deletefirst(newhead);
sl.display(newhead2);
}
}
.
Help I keep getting the same error when running a code. Below is the.pdf
Help I keep getting the same error when running a code. Below is the code and the instructions
about the code.
import java.util.Arrays;
public class Album implements Comparable {
private final int id;
private final String[] artists;
private final int numSongs;
public Album(int id, String title, String[] artists, int numSongs) {
this.id = id;
this.artists = new String[]{Arrays.toString(artists)};
this.numSongs = numSongs;
}
public int getId() {
return id;
}
@Override
public int compareTo(Album other) {
return Integer.compare(this.numSongs, other.numSongs);
}
@Override
public String toString() {
StringBuilder artistNames = new StringBuilder();
for (String artist : artists) {
artistNames.append(artist).append(", ");
}
artistNames.delete(artistNames.length() - 2, artistNames.length());
return "ID: " + id + " -- " + numSongs + " songs -- [" + artistNames + "]";
}
}
import java.util.Random;
public class DoublyLinkedList {
private static class Node {
T data;
Node prev;
Node next;
Node(T data) {
this.data = data;
}
}
private Node head;
private Node tail;
private int size;
public DoublyLinkedList() {
head = null;
tail = null;
size = 0;
}
public Node append(T data) {
Node newNode = new Node<>(data);
if (head == null) {
head = newNode;
} else {
tail.next = newNode;
newNode.prev = tail;
}
tail = newNode;
size++;
return newNode;
}
public Node insert(int location, T data) {
if (location < 0 || location > size) {
throw new IllegalArgumentException("Invalid location");
}
Node newNode = new Node<>(data);
if (location == 0) {
newNode.next = head;
if (head != null) {
head.prev = newNode;
}
head = newNode;
if (tail == null) {
tail = newNode;
}
} else if (location == size) {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
newNode.prev = current.prev;
newNode.next = current;
current.prev.next = newNode;
current.prev = newNode;
}
size++;
return newNode;
}
public Node delete(int location) {
if (location < 0 || location >= size) {
throw new IllegalArgumentException("Invalid location");
}
Node deletedNode;
if (location == 0) {
deletedNode = head;
head = head.next;
if (head != null) {
head.prev = null;
} else {
tail = null;
}
} else if (location == size - 1) {
deletedNode = tail;
tail = tail.prev;
tail.next = null;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
deletedNode = current;
current.prev.next = current.next;
current.next.prev = current.prev;
}
size--;
return deletedNode;
}
public int getIndex(T data) {
Node current = head;
for (int i = 0; i < size; i++) {
if (current.data.equals(data)) {
return i;
}
current = current.next;
}
return -1;
}
@Override
public String toString() {
StringBuilder result = new StringBuilder();
Node current = head;
while (current != null) {
result.append(current.data).append(" -> ");
current = current.next;
}
result.append("NULL");
return result.toString();
}
public Node shuffle() {
Random r.
DoublyList-cpp- #include -DoublyList-h- using namespace std- void Doub.pdf
DoublyList.cpp:
#include "DoublyList.h"
using namespace std;
void DoublyList::insertFront(int newData)
{
if (first == nullptr)
{
first = new DLLNode(newData, nullptr, nullptr);
last = first;
// Common error: Forgetting to reset pointer last.
}
else
{
first = new DLLNode(newData, nullptr, first);
first->getNext()->setPrev(first);
// Common error: Forgetting to connect pointer
// prev of what is now the second node to the
// new first node.
}
++count;
}
void DoublyList::printForward() const
{
DLLNode* current = first;
while (current != nullptr)
{
cout << current->getData() << " ";
current = current->getNext();
}
}
void DoublyList::printReverse() const
{
DLLNode* current = last;
while (current != nullptr)
{
cout << current->getData() << " ";
current = current->getPrev();
}
}
void DoublyList::clearList()
{
DLLNode* temp = first;
while (first != nullptr)
{
first = first->getNext();
delete temp;
temp = first;
}
last = nullptr;
// Don't forget to reset pointer last to nullptr.
count = 0;
}
DoublyList::~DoublyList()
{
if (first != nullptr)
clearList();
}
DoublyList.h
#ifndef DOUBLYLIST_H
#define DOUBLYLIST_H
#include <string>
#include <iostream>
class DLLNode
{
public:
DLLNode() : data(0), prev(nullptr), next(nullptr) {}
DLLNode(int theData, DLLNode* prevLink, DLLNode* nextLink)
: data(theData), prev(prevLink), next(nextLink) {}
int getData() const { return data; }
DLLNode* getPrev() const { return prev; }
DLLNode* getNext() const { return next; }
void setData(int theData) { data = theData; }
void setPrev(DLLNode* prevLink) { prev = prevLink; }
void setNext(DLLNode* nextLink) { next = nextLink; }
~DLLNode(){}
private:
int data; // To simplify, we are using only one piece of data.
DLLNode* prev;
DLLNode* next;
};
class DoublyList
{
public:
DoublyList() : first(nullptr), last(nullptr), count(0) {}
void insertFront(int newData);
void printForward() const;
void printReverse() const;
void rotateNodesRight(int);
void clearList();
~DoublyList();
private:
// Pointer to the first node in the list.
DLLNode*first;
// Pointer to the last node in the list.
DLLNode*last;
// Number of nodes in the list.
int count;
};
#endif
Main.cpp
#include "DoublyList.h"
#include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<vector<int>> data = {
{25, 76, 35, 67, 15, 98},
{1, 2, 3, 4, 5, 6, 7, 8, 9},
{10, 20},
{34, 56, 78, 12, 89, 34, 76, 28, 54, 22, 41},
{123, 873, 619},
};
vector<int> nodesToRotate = { 2, 3, 1, 9, 2 };
{
DoublyList doublyList;
int vectorSize = static_cast<int>(data.size());
for (int i = 0; i < vectorSize; ++i)
{
int innerSize = static_cast<int>(data[i].size());
for (int j = innerSize - 1; j >= 0; --j)
doublyList.insertFront(data[i].at(j));
cout << "Rotate right: " << nodesToRotate[i] << "\n";
cout << " List is: ";
doublyList.printForward();
cout << "\n";
doublyList.rotateNodesRight(nodesToRotate[i]);
cout << "After rotating:";
cout << "\n Print forward: ";
doublyList.printForward();
cout << "\nPrint backwards: ";
doublyList.printReverse(.
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
*/.
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;
}
.
could you implement this function please, im having issues with it..pdf
could you implement this function please, im having issues with it.
void makeList (const ListNode::value_type [],const size_t& count)
class ListNode
{
public:
typedef int value_type;
ListNode (value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; }
//Assessor
value_type getDatum () const { return datum; }
ListNode const* getNext () const { return next; }
//Mutator
void setDatum (const value_type& d) {datum = d; }
ListNode* getNext () { return next; }
void setNext (ListNode* new_link) {next = new_link; }
private:
value_type datum;
ListNode* next;
};
class LinkedList
{
public:
LinkedList ();
virtual ~LinkedList ();
void insertItem (ListNode::value_type);
void makeList (const ListNode::value_type [],const size_t& count);
void deleteList ();
//The following friend function is implemented in lablinklist.cpp
friend std::ostream& operator<<(std::ostream&, const LinkedList&);
private:
ListNode* head;
};
This is the pseudocode, but i still have a hard time undertanding it.
Creating a List (makeList(const ListNode::value_type [],const size_t& count)) This function
receives an array in the order that we want to add it to the linkedlist. Index 0 will be the head
node, index n will be the last node.
First, create a node initialized with a data value and a NULL pointer. Set the \"head\" to point to
the first node. Set up a current-pointer to the first node (or \"head\"). Get a data value for the next
node. While more nodes to add { Create a new node initialized with the data value and a NULL
pointer. Set the current-pointer link member (\"next\") to the new node. Set the current-pointer to
point to the new node. Get a data value for the next node. }
Thanks.
Solution
//linkedList.h
#ifndef LINKEDLIST_H
#define LINKEDLIST_H
#include
#include
class ListNode
{
public:
typedef int value_type;
ListNode(value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; }
//Assessor
value_type getDatum() const { return datum; }
ListNode const* getNext() const { return next; }
//Mutator
void setDatum(const value_type& d) { datum = d; }
ListNode* getNext() { return next; }
void setNext(ListNode* new_link) { next = new_link; }
private:
value_type datum;
ListNode* next;
};
class LinkedList
{
public:
LinkedList();
virtual ~LinkedList();
void insertItem(ListNode::value_type);
void makeList(const ListNode::value_type[], const size_t& count);
void deleteList();
//The following friend function is implemented in lablinklist.cpp
friend std::ostream& operator<<(std::ostream&, const LinkedList&);
private:
ListNode* head;
};
#endif
-------------------------------------------------------------
//linkedList.cpp
#include \"linkedlist.h\"
LinkedList::LinkedList()
{
head = NULL;
}
LinkedList::~LinkedList()
{
ListNode *tmp = head;
while (tmp != NULL)
{
head = head->getNext();
delete tmp;
tmp = head;
}
}
void LinkedList::insertItem(ListNode::value_type item)
{
ListNode *newNode,*cur = head;
newNode = new ListNode;
newNode->setDatum(item);
newNode->setNext(NULL);.
import java-util-Iterator- import java-util-NoSuchElementException- im.pdf
import java.util.Iterator;
import java.util.NoSuchElementException;
import lab4.util.List;
public class SinglyLinkedList<E> implements List<E> {
@SuppressWarnings("hiding")
private class SinglyLinkedListIterator<E> implements Iterator<E>{
private Node<E> nextNode;
@SuppressWarnings("unchecked")
public SinglyLinkedListIterator() {
this.nextNode = (Node<E>) header.getNext();
}
@Override
public boolean hasNext() {
return nextNode != null;
}
@Override
public E next() {
if (this.hasNext()) {
E result = this.nextNode.getElement();
this.nextNode = this.nextNode.getNext();
return result;
}
else {
throw new NoSuchElementException();
}
}
}
private static class Node<E> {
private E element;
private Node<E> next;
public Node(E element, Node<E> next) {
super();
this.element = element;
this.next = next;
}
public Node() {
super();
}
public E getElement() {
return element;
}
public void setElement(E element) {
this.element = element;
}
public Node<E> getNext() {
return next;
}
public void setNext(Node<E> next) {
this.next = next;
}
}
private Node<E> header;
private int currentSize;
public SinglyLinkedList() {
this.header = new Node<>();
this.currentSize = 0;
}
@Override
public int size() {
return this.currentSize;
}
@Override
public boolean isEmpty() {
return this.size() == 0;
}
@Override
public boolean contains(E e) {
return this.firstIndexOf(e) >= 0;
}
@Override
public int firstIndexOf(E e) {
int i = 0;
for (Node<E> temp = this.header.getNext(); temp != null;
temp = temp.getNext(), ++i) {
if (temp.getElement().equals(e)) {
return i;
}
}
// not found
return -1;
}
@Override
public void add(E e) {
if (this.isEmpty()) {
this.header.setNext(new Node<E>(e, null));
this.currentSize++;
}
else {
Node<E>temp= this.header.getNext();
while (temp.getNext() != null) {
temp = temp.getNext();
}
Node<E> newNode = new Node<>(e, null);
temp.setNext(newNode);
this.currentSize++;
}
}
@Override
public void add(E e, int index) {
if ((index < 0) || (index > this.currentSize)) {
throw new IndexOutOfBoundsException();
}
if (index == this.currentSize) {
this.add(e);
}
else {
Node<E> temp = null;
if (index == 0) {
temp = this.header;
}
else {
temp = this.getPosition(index -1);
}
Node<E> newNode = new Node<>();
newNode.setElement(e);
newNode.setNext(temp.getNext());
temp.setNext(newNode);
this.currentSize++;
}
}
@Override
public E get(int position) {
if ((position < 0) || position >= this.currentSize) {
throw new IndexOutOfBoundsException();
}
Node<E> temp = this.getPosition(position);
return temp.getElement();
}
private Node<E> getPosition(int index){
int currentPosition=0;
Node<E> temp = this.header.getNext();
while(currentPosition != index) {
temp = temp.getNext();
currentPosition++;
}
return temp;
}
@Override
public boolean remove(int index) {
if ((index < 0) || (index >= this.currentSize)){
throw new IndexOutOfBoundsException();
}
else {
Node<E> temp = this.header;
int currentPosition =0;
Node<E> target = null;
while (currentPosition != index) {
temp = temp.getNext();
currentPosit.
import java-util--- public class MyLinkedList{ public static void.pdf
import java.util.*; public class MyLinkedList{ public static void main(String[] args){ } } //copy
MyList to here interface MyList extends Collection { /* MyList will inherite all methods from
Collection public boolean add(E e); public boolean addAll(Collection extends E> c); public void
clear(); public boolean contains(Object o); public boolean containsAll(Collection> c); public
boolean isEmpty(); public boolean remove(Object o); public boolean removeAll(Collection> c);
public boolean retainAll(Collection> c); public int size(); public Object[] toArray(); public T[]
toArray(T[] arr); */ //abstract method public void add(int index, E e); public E get(int index);
public int indexOf(Object e); public int lastIndexOf(E e); public E remove(int index); public E
set(int index, E e); //default method @Override public default boolean add(E e){ add(size(), e);
return true; } @Override public default boolean isEmpty(){ return size()==0; } @Override
public default boolean remove(Object e){ if(indexOf(e) >= 0){ remove(indexOf(e)); return true;
} else{ return false; } } @Override public default boolean containsAll(Collection> c){
for(Object e : c){ if(!contains(e)){ return false; } } return true; } @Override public default
boolean addAll( Collection extends E> c){ for(E e : c){ add(e); } return true; } /* removeAll:
this[1,1,2,3] c[1,2,4] this.removeAll(c) [3] */ @Override public default boolean removeAll(
Collection> c){ for(Object e : c){ while(contains(e)){ this.remove(e); } } return true; } /*
retainAll this[1,1,2,3] c[1,2,4] this.retainAll(c) [1,1,2] */ @Override public default boolean
retainAll( Collection> c){ for(E e : this){ if(!c.contains(e)){ this.remove(e); } } return true; }
@Override public default Object[] toArray(){ Object[] results = new Object[size()]; int i = 0;
for(E e : this){ results[i++] = e; } return results; } /* T[] array */ @Override public default T[]
toArray(T[] array){ int i = 0; for(E e : this){ array[i++] = (T)e; } return array; } } class
TwoWayLinkedList implements MyList { //inner static class Node public class Node { E
element; Node next; Node previous; public Node(E e){ element = e; } } private Node head, tail;
private int size = 0; public TwoWayLinkedList(){ /* head = null; tail = null; size = 0; */ } public
TwoWayLinkedList(E[] objects){ } public E getFirst(){ return null; } public E getLast(){ return
null; } public void addFirst(E e){ } public void addLast(E e){ } public E removeFirst(){ return
null; } public E removeLast(){ return null; } @Override public void add(int index, E e){ }
@Override public E remove(int index){ return null; } @Override public void clear(){ }
@Override public boolean contains(Object e){ return false; } @Override public E get(int index){
return null; } @Override public int indexOf(Object e){ return -1; } @Override public int
lastIndexOf(Object e){ return -1; } @Override public E set(int index, E e){ return null; }
@Override public int size(){ return size; } //toString() @Override public String.
Effective C#
Charla de Effectice C# en #dotNetSpain2015 https://www.desarrollaconmicrosoft.com/Dotnetspain2015
Please help write BinaryTree-java Thank you! Create a class BinaryTr.pdf
Please help write BinaryTree.java Thank you!
Create a class BinaryTree. A class that implements the ADT binary tree.
import java.util.Iterator;
import java.util.NoSuchElementException;
import StackAndQueuePackage.*;
public class BinaryTree <T> implements BinaryTreeInterface<T>
{
private BinaryNode<T> root;
public BinaryTree()
{
root = null;
} // end default constructor
public BinaryTree(T rootData)
{
root = new BinaryNode<>(rootData);
} // end constructor
public BinaryTree(T rootData, BinaryTree<T> leftTree,
BinaryTree<T> rightTree)
{
privateSetTree(rootData, leftTree, rightTree);
} // end constructor
public void setTree(T rootData)
{
root = new BinaryNode<>(rootData);
} // end setTree
public void setTree(T rootData, BinaryTreeInterface<T> leftTree,
BinaryTreeInterface<T> rightTree)
{
privateSetTree(rootData, (BinaryTree<T>)leftTree,
(BinaryTree<T>)rightTree);
} // end setTree
private void privateSetTree(T rootData, BinaryTree<T> leftTree,
BinaryTree<T> rightTree)
{
root = new BinaryNode<>(rootData);
if ((leftTree != null) && !leftTree.isEmpty())
root.setLeftChild(leftTree.root);
if ((rightTree != null) && !rightTree.isEmpty())
{
if (rightTree != leftTree)
root.setRightChild(rightTree.root);
else
root.setRightChild(rightTree.root.copy());
} // end if
if ((leftTree != null) && (leftTree != this))
leftTree.clear();
if ((rightTree != null) && (rightTree != this))
rightTree.clear();
} // end privateSetTree
//...
private class PreorderIterator implements Iterator<T>
{
private StackInterface<BinaryNode<T>> nodeStack;
public PreorderIterator()
{
nodeStack = new LinkedStack<>();
if (root != null)
nodeStack.push(root);
} // end default constructor
public boolean hasNext()
{
return !nodeStack.isEmpty();
} // end hasNext
public T next()
{
BinaryNode<T> nextNode;
if (hasNext())
{
nextNode = nodeStack.pop();
BinaryNode<T> leftChild = nextNode.getLeftChild();
BinaryNode<T> rightChild = nextNode.getRightChild();
// Push into stack in reverse order of recursive calls
if (rightChild != null)
nodeStack.push(rightChild);
if (leftChild != null)
nodeStack.push(leftChild);
}
else
{
throw new NoSuchElementException();
}
return nextNode.getData();
} // end next
public void remove()
{
throw new UnsupportedOperationException();
} // end remove
} // end PreorderIterator
public void iterativePreorderTraverse ()
{
StackInterface<BinaryNode<T>> nodeStack = new LinkedStack<>();
if (root != null)
nodeStack.push(root);
BinaryNode<T> nextNode;
while (!nodeStack.isEmpty())
{
nextNode = nodeStack.pop();
BinaryNode<T> leftChild = nextNode.getLeftChild();
BinaryNode<T> rightChild = nextNode.getRightChild();
// Push into stack in reverse order of recursive calls
if (rightChild != null)
nodeStack.push(rightChild);
if (leftChild != null)
nodeStack.push(leftChild);
System.out.print(nextNode.getData() + " ");
} // end while
} // end iterativePreorderTraverse
private class InorderIterator implements Iterator<T>
{
private StackInterface<BinaryNode<T>> nodeStack;
private BinaryNode<T> cu.
Using your understanding of Hardy-Weinberg proportions- which of the f.pdf
Using your understanding of Hardy-Weinberg proportions, which of the following statements
is/are true? A. Population heterozygosity is highest when p = q = 0.5. B. If a population is not in
Hardy-Weinberg proportions, the genotype frequencies will not add up to 1. C. Hardy-Weinberg
frequencies refer to expected allele frequencies based on actual genotype frequencies. D. Rare
alleles are found primarily in heterozygotes..
Using the summary table above- match the sources of variation with the.pdf
Using the summary table above, match the sources of variation with the appropriate significance
values Drag and drop options on the right-hand side and submit. For keyboard navigation.
SHOW MORE.
More Related Content
Similar to Using visual studio 2022- a C# windows form application- and your Doub.pdf
So I have this code(StackInAllSocks) and I implemented the method but.pdf
So I have this code( StackInAllSocks ) and I implemented the method but I can't seem to figure
out why there isn't anything showing up on the console. It should pop,peek and push b using the
methods from the class called ArrayListTen . The ArrayListTen works fine and compiles the
tested code of Rigth# but for StackInAllSocks it doesn't complete at all. note that file
VodeDodeis not to be changed is just a Node storage area of the array list.
Did I implement the method on StackInAllSocks correctly? if so, should I not use the method
from the ArrayListTen .?
__________________________________________________________________________
: the code is : VodeDodeis
class VodeDode<T> {
private T data;
private VodeDode<T> next;
private VodeDode<T> prev;
public VodeDode(T data) {
this.data = data;
this.next = null;
this.prev = null;}
public T getData() {
return data;}
public void setData(T data) {
this.data = data;}
public VodeDode<T> getNext() {
return this.next;}
public void setNext(VodeDode<T> next) {
this.next = next;}
public VodeDode<T> getPrev() {
return this.prev;}
public void setPrev(VodeDode<T> prev) {
this.prev = prev;}
@Override
public String toString() {
return data.toString();}}
_________________________________________________________________________
CODE that works fine called ArrayListTen:
import java.util.Iterator;
public class ArrayListTen<T> implements Iterable<T> {
private VodeDode<T> head; //beginning of list
private VodeDode<T> tail; //end of list
private int size;
private VodeDode<T> new_item;
public ArrayListTen( ){
this.head = null;
this.tail = null;
this.size = 0;}
public int lenght() {
return size ;}
public T getBegin() {
if (this.head != null) {
return head.getData();}
else { return null;}}
public void addBegin(T value) {
VodeDode<T> newVodeDode =new VodeDode<T>(value);
if (this.head== null) {
head = newVodeDode;
tail =newVodeDode;}
else {VodeDode<T> temp = head;
head = newVodeDode;
head.setNext(temp);}
size++;}
public T removeBegin() {
if(this.head == null) {
return null;}
else {T current = head.getData();
if (tail == head) {
tail = null;
head = null;
} else {
head = head.getNext();
head.setPrev(null);}size--;
return current;}}
public T getEnd() {
if (tail != null) {
return tail.getData();
} else {
return null;}}
public void addEnd(T value) {
VodeDode<T> newVodeDode = new VodeDode<T>(value);
if (this.tail == null) {
head = newVodeDode;
tail = newVodeDode;
} else {
newVodeDode.setPrev(tail);
tail.setNext(newVodeDode);
tail = newVodeDode;}
size++;}
public T removeEnd() {
if(this.tail == null) {
return null;}
else {
T current = tail.getData();//was head.
if (head == tail) {
head = null;
tail = null;
} else {
tail = tail.getPrev();
tail.setNext(null);}
size--;
return current;}}
public T removeBN(T value) {
VodeDode<T> currVodeDode = head;
VodeDode<T> prevVodeDode = null;
while(currVodeDode != null){
if(currVodeDode.getData().equals(value)){
if(prevVodeDode != null){
prevVodeDode.setNext(currVodeDode.getNext());}
else{
head = curr.
.NET 2015: Будущее рядом
В последнее время экосистема .NET развивается очень динамично: постоянно появляются новые технологии и инструменты, а старые обзаводятся новыми возможностями. Уследить за всем очень сложно, поэтому в этом докладе мы постараемся обзорно взглянуть на текущее состояние платформы .NET, а также на то, что нас ждёт в ближайшем будущем. Будем говорить про грядущий C#7, про кроссплатформенность и нативную компиляцию, про новый .NET Core 5 и ASP.NET 5, про новые инструменты для разработчиков и последние анонсы от Microsoft.
Need help finishing this doubly linked list code- Commented lines are.docx
Need help finishing this doubly linked list code.
Commented lines are what's needed, also add the following recursive methods: findFirstNodeWithValue() and getDisplayString() that returns a string containing the strings in the list separated by spaces
Code in C# language only, please.
internal class DoubleLinkedList {
public DoubleLinkedListNode? firstNode = null;
public DoubleLinkedListNode? lastNode = null;
public DoubleLinkedListNode? currentNode = null;
// other class level variables needed?
public DoubleLinkedList() {
// creates first node in list with firstValue
}
public DoubleLinkedList(string firstValue) {
// methods and features to add:
// get current node reference
// insert node before first
// delete first node
// insert node after last
// delete last node
// insert node after current - uses multiple methods
// delete current
// move current to next node
// move current to previous node
// recursive: find node with value - return reference or null
// recursive: get display string
}
}
/*******************************
* double Linked List Node - needs to be made generic
* class is incomplete
* *****************************/
internal class DoubleLinkedListNode {
public string? value = null;
public DoubleLinkedListNode? nextNode = null;
public DoubleLinkedListNode? previousNode = null;
public DoubleLinkedListNode(string v) {
value = v.ToLower();
}
private DoubleLinkedListNode() {
value = null;
}
}
.
In the class we extensively discussed a node class called IntNode in.pdf
In the class we extensively discussed a node class called IntNode in which each linked list node
contains an integer and each node is linked forward to the next element in the list. Implement a
node class called DoublyIntNode in which each node contains an integer number and each node
is linked not only forward to the next element in the list but also backward to the previous
element in the list. Your implementation of DoublyIntNode should adapt and implement all the
methods of IntNode including the following methods:
Constructor for DoublyIntNode
addNodeAfter, removeNodeAfter
getData, setData
getForeLink, setForeLink
getBackLink, setBackLink
listCopy
listCopyWithTail
listLength
listPart
listPosition
listSearch
IntNode and Node classes:
public class IntNode{
private int data;
private IntNode link;
// methods here
}
public class Node {
private E data;
private Node link;
// methods here
}
Solution
program
#include
using namespace std;
struct list
{
struct list *prev;
int data;
struct list *next;
}
*node = NULL, *first = NULL, *last = NULL, *node1 = NULL, *node2 = NULL;
class Dlist
{
public:
void insert_beg() {
list *addBeg = new list;
cout << \"Enter value for the node:\" << endl;
cin >> addBeg->data;
if(first == NULL) {
addBeg->prev = NULL;
addBeg->next = NULL;
first = addBeg;
last = addBeg;
cout << \"Linked list Created!\" << endl;
}
else {
addBeg->prev = NULL;
first->prev = addBeg;
addBeg->next = first;
first = addBeg;
cout << \"Data Inserted at the beginning of the Linked list!\" << endl;
}
}
void insert_end() {
list *addEnd = new list;
cout << \"Enter value for the node:\" << endl;
cin >> addEnd->data;
if(first == NULL) {
addEnd->prev = NULL;
addEnd->next = NULL;
first = addEnd;
last = addEnd;
cout << \"Linked list Created!\" << endl;
}
else {
addEnd->next = NULL;
last->next = addEnd;
addEnd->prev = last;
last = addEnd;
cout << \"Data Inserted at the end of the Linked list!\" << endl;
}
}
void display() {
node = first;
cout << \"List of data in Linked list in Ascending order!\" << endl;
while(node != NULL) {
cout << node->data << endl;
node = node->next;
}
node = last;
cout << \"List of data in Linked list in Descending order!\" << endl;
while(node != NULL) {
cout << node->data << endl;
node = node->prev;
}
}
void del()
{
int count = 0, number, i;
node = node1 = node2 = first;
for(node = first; node != NULL; node = node->next)
cout << \"Enter value for the node:\" << endl;
count++;
display();
cout << count << \" nodes available here!\" << endl;
cout << \"Enter the node number which you want to delete:\" << endl;
cin >> number;
if(number != 1)
{
if(number < count && number > 0)
{
for(i = 2; i <= number; i++)
node = node->next;
for(i = 2; i <= number-1; i++)
node1 = node1->next;
for(i = 2; i <= number+1; i++)
node2 = node2->next;
node2->prev = node1;
node1->next = node2;
node->prev = NULL;
node->next = NULL;
node = NULL;
}
else if(number == count)
{
node = last;
last = node->prev;
last->next = NULL;
node = NULL;
}
else
cout << \"Invalid node.
I need help coding a doubly linked list from this unfinished code- Eve.docx
I need help coding a doubly linked list from this unfinished code.
Everything commented out is what needs to be added. This is done using C# in a Visual Studio Windows Form App.
internal class DoubleLinkedList {
public DoubleLinkedListNode? firstNode = null;
public DoubleLinkedListNode? lastNode = null;
public DoubleLinkedListNode? currentNode = null;
// other class level variables needed?
public DoubleLinkedList() {
// creates first node in list with firstValue
}
public DoubleLinkedList(string firstValue) {
// methods and features to add:
// get current node reference
// insert node before first
// delete first node
// insert node after last
// delete last node
// insert node after current - uses multiple methods
// delete current
// move current to next node
// move current to previous node
// recursive: find node with value - return reference or null
// recursive: get display string
}
}
/*******************************
* double Linked List Node - needs to be made generic
* class is incomplete
* *****************************/
internal class DoubleLinkedListNode {
public string? value = null;
public DoubleLinkedListNode? nextNode = null;
public DoubleLinkedListNode? previousNode = null;
public DoubleLinkedListNode(string v) {
value = v.ToLower();
}
private DoubleLinkedListNode() {
value = null;
}
}
.
I need help implementing a Stack with this java programming assignme.pdf
I need help implementing a Stack with this java programming assignment:
Given a doubly linked list (code provided below) implement a Stack. You must use the doubly
link list class and utilize it as an object in your implementation of the stack.
A Stack is a Last in First Out (LiFO) structure which translates to the processes of outputting the
last element which was inputted in the collection. The Stack is based on the process of putting
things on top of one another and taking the item on top (think of a stack of papers).
Operations to implement:
push (E): Add an element to the start of the sequence
pop: Remove an element from the start of the sequence
Peek: Return the first element of the sequence without removing it
atIndex(x): Return the element at the given index (x) Or throw an exception if it is out of bound
(if you can control the user input then do that instead)
Size: Return the size of the Stack
isEmpty: Boolean, returns true if the Stack is empty
Empty: Empty the Stack
Code Part 1:
public class DoublyLinkedList{
private DNode head;
private DNode tail;
private int size;
public DoublyLinkedList(){ // construct an empty list
this.tail = new DNode (null, null, this.head);
this.head = new DNode (null, this.tail, null);
this.size = 0;
}
public DoublyLinkedList(DNode next){ // constructs a list
// out of a single node
this.tail = new DNode (null, null, next);
this.head = new DNode (null, next, null);
next.changeNext(this.tail);
next.changePrev(this.head);
this.size = 1;
}
public DoublyLinkedList(Object [] objectArray){ // construct a list out of
// an array
this.tail = new DNode (null, null, this.head);
this.head = new DNode (null, this.tail, null);
DNode temp = this.head;
for (Object e : objectArray)
{
//Anonomus function
new DNode (e, temp.getNext(),temp).insertBetweenNodes(temp, temp.getNext());
temp = temp.getNext();
this.size += 1;
}
}
public void addToFrontofList(Object toAdd){ // Appends the begining
// of the list
DNode temp = new DNode (toAdd, this.head.getNext(), this.head);
this.head.getNext().changePrev(temp);
this.head.changeNext(temp);
this.size += 1;
}
public void addToendofList (Object toAdd) // appends the end of the list
// with a node
{
DNode temp = new DNode (toAdd, this.tail, this.tail.getPrev());
this.tail.getPrev().changeNext(temp);
this.tail.changePrev(temp);
this.size += 1;
}
public void insertAfterNode(DNode current, Object input)// Inserts a new
// a new node after
// current node
{
current.insertAfterNode(input);
this.size += 1;
}
public int getSize() // returns the size of the list
{
return this.size;
}
public String toString()
{
String result = \"\";
for (DNode temp = this.head.getNext();
temp.hasNext(); temp = temp.getNext())
{
result += temp.getValue();
result += \" -> \";
}
result += \"End of list\";
return result;
}
}
and code part2:
public class DNode{
private Object e; // place holder for the type of object the
//collection is storing
private DNode next; // reference to the next node in the sequence
// of.
Add delete at a position to the code and display it to the code- class.pdf
Add delete at a position to the code and display it to the code:
class listnodes {
int data;
listnodes link;
listnodes() {
data = 0;
link = null;
}
listnodes(int d, listnodes l) {
data = d;
link = l;
}
}
class singlelinkedlist {
public listnodes insertnode(int data, listnodes head) {
listnodes newnode = new listnodes(data, null);
newnode.link = head;
head = newnode;
return head;
}
public listnodes insertAtPosition(listnodes head, int data, int position) {
listnodes newnode = new listnodes(data, null);
listnodes previous = head;
int count = 1;
while (count <= position - 1) {
previous = previous.link;
count++;
}
listnodes current = previous.link;
newnode.link = current;
previous.link = newnode;
return head;
}
public listnodes deletefirst(listnodes head) {
listnodes pre = head;
head = head.link;
pre.link = null;
return pre;
}
public void display(listnodes head) {
listnodes current = head;
while (current.link != null) {
System.out.print(current.data + "-->");
current = current.link;
}
System.out.print(current.data);
}
}
public class LinkedList {
public static void main(String[] args) {
listnodes head=new listnodes(10,null);
singlelinkedlist sl=new singlelinkedlist();
sl.display(head);
System.out.println("\nInsert at front");
listnodes newhead=sl.insertnode(20, head);
sl.display(newhead);
System.out.println("\nInsert at a position");
sl.insertAtPosition(newhead, 40, 1);
sl.display(newhead);
System.out.println("\nDelete first");
listnodes newhead2=sl.deletefirst(newhead);
sl.display(newhead2);
}
}
.
Help I keep getting the same error when running a code. Below is the.pdf
Help I keep getting the same error when running a code. Below is the code and the instructions
about the code.
import java.util.Arrays;
public class Album implements Comparable {
private final int id;
private final String[] artists;
private final int numSongs;
public Album(int id, String title, String[] artists, int numSongs) {
this.id = id;
this.artists = new String[]{Arrays.toString(artists)};
this.numSongs = numSongs;
}
public int getId() {
return id;
}
@Override
public int compareTo(Album other) {
return Integer.compare(this.numSongs, other.numSongs);
}
@Override
public String toString() {
StringBuilder artistNames = new StringBuilder();
for (String artist : artists) {
artistNames.append(artist).append(", ");
}
artistNames.delete(artistNames.length() - 2, artistNames.length());
return "ID: " + id + " -- " + numSongs + " songs -- [" + artistNames + "]";
}
}
import java.util.Random;
public class DoublyLinkedList {
private static class Node {
T data;
Node prev;
Node next;
Node(T data) {
this.data = data;
}
}
private Node head;
private Node tail;
private int size;
public DoublyLinkedList() {
head = null;
tail = null;
size = 0;
}
public Node append(T data) {
Node newNode = new Node<>(data);
if (head == null) {
head = newNode;
} else {
tail.next = newNode;
newNode.prev = tail;
}
tail = newNode;
size++;
return newNode;
}
public Node insert(int location, T data) {
if (location < 0 || location > size) {
throw new IllegalArgumentException("Invalid location");
}
Node newNode = new Node<>(data);
if (location == 0) {
newNode.next = head;
if (head != null) {
head.prev = newNode;
}
head = newNode;
if (tail == null) {
tail = newNode;
}
} else if (location == size) {
tail.next = newNode;
newNode.prev = tail;
tail = newNode;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
newNode.prev = current.prev;
newNode.next = current;
current.prev.next = newNode;
current.prev = newNode;
}
size++;
return newNode;
}
public Node delete(int location) {
if (location < 0 || location >= size) {
throw new IllegalArgumentException("Invalid location");
}
Node deletedNode;
if (location == 0) {
deletedNode = head;
head = head.next;
if (head != null) {
head.prev = null;
} else {
tail = null;
}
} else if (location == size - 1) {
deletedNode = tail;
tail = tail.prev;
tail.next = null;
} else {
Node current = head;
for (int i = 0; i < location; i++) {
current = current.next;
}
deletedNode = current;
current.prev.next = current.next;
current.next.prev = current.prev;
}
size--;
return deletedNode;
}
public int getIndex(T data) {
Node current = head;
for (int i = 0; i < size; i++) {
if (current.data.equals(data)) {
return i;
}
current = current.next;
}
return -1;
}
@Override
public String toString() {
StringBuilder result = new StringBuilder();
Node current = head;
while (current != null) {
result.append(current.data).append(" -> ");
current = current.next;
}
result.append("NULL");
return result.toString();
}
public Node shuffle() {
Random r.
DoublyList-cpp- #include -DoublyList-h- using namespace std- void Doub.pdf
DoublyList.cpp:
#include "DoublyList.h"
using namespace std;
void DoublyList::insertFront(int newData)
{
if (first == nullptr)
{
first = new DLLNode(newData, nullptr, nullptr);
last = first;
// Common error: Forgetting to reset pointer last.
}
else
{
first = new DLLNode(newData, nullptr, first);
first->getNext()->setPrev(first);
// Common error: Forgetting to connect pointer
// prev of what is now the second node to the
// new first node.
}
++count;
}
void DoublyList::printForward() const
{
DLLNode* current = first;
while (current != nullptr)
{
cout << current->getData() << " ";
current = current->getNext();
}
}
void DoublyList::printReverse() const
{
DLLNode* current = last;
while (current != nullptr)
{
cout << current->getData() << " ";
current = current->getPrev();
}
}
void DoublyList::clearList()
{
DLLNode* temp = first;
while (first != nullptr)
{
first = first->getNext();
delete temp;
temp = first;
}
last = nullptr;
// Don't forget to reset pointer last to nullptr.
count = 0;
}
DoublyList::~DoublyList()
{
if (first != nullptr)
clearList();
}
DoublyList.h
#ifndef DOUBLYLIST_H
#define DOUBLYLIST_H
#include <string>
#include <iostream>
class DLLNode
{
public:
DLLNode() : data(0), prev(nullptr), next(nullptr) {}
DLLNode(int theData, DLLNode* prevLink, DLLNode* nextLink)
: data(theData), prev(prevLink), next(nextLink) {}
int getData() const { return data; }
DLLNode* getPrev() const { return prev; }
DLLNode* getNext() const { return next; }
void setData(int theData) { data = theData; }
void setPrev(DLLNode* prevLink) { prev = prevLink; }
void setNext(DLLNode* nextLink) { next = nextLink; }
~DLLNode(){}
private:
int data; // To simplify, we are using only one piece of data.
DLLNode* prev;
DLLNode* next;
};
class DoublyList
{
public:
DoublyList() : first(nullptr), last(nullptr), count(0) {}
void insertFront(int newData);
void printForward() const;
void printReverse() const;
void rotateNodesRight(int);
void clearList();
~DoublyList();
private:
// Pointer to the first node in the list.
DLLNode*first;
// Pointer to the last node in the list.
DLLNode*last;
// Number of nodes in the list.
int count;
};
#endif
Main.cpp
#include "DoublyList.h"
#include <iostream>
#include <vector>
using namespace std;
int main()
{
vector<vector<int>> data = {
{25, 76, 35, 67, 15, 98},
{1, 2, 3, 4, 5, 6, 7, 8, 9},
{10, 20},
{34, 56, 78, 12, 89, 34, 76, 28, 54, 22, 41},
{123, 873, 619},
};
vector<int> nodesToRotate = { 2, 3, 1, 9, 2 };
{
DoublyList doublyList;
int vectorSize = static_cast<int>(data.size());
for (int i = 0; i < vectorSize; ++i)
{
int innerSize = static_cast<int>(data[i].size());
for (int j = innerSize - 1; j >= 0; --j)
doublyList.insertFront(data[i].at(j));
cout << "Rotate right: " << nodesToRotate[i] << "\n";
cout << " List is: ";
doublyList.printForward();
cout << "\n";
doublyList.rotateNodesRight(nodesToRotate[i]);
cout << "After rotating:";
cout << "\n Print forward: ";
doublyList.printForward();
cout << "\nPrint backwards: ";
doublyList.printReverse(.
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
*/.
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;
}
.
could you implement this function please, im having issues with it..pdf
could you implement this function please, im having issues with it.
void makeList (const ListNode::value_type [],const size_t& count)
class ListNode
{
public:
typedef int value_type;
ListNode (value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; }
//Assessor
value_type getDatum () const { return datum; }
ListNode const* getNext () const { return next; }
//Mutator
void setDatum (const value_type& d) {datum = d; }
ListNode* getNext () { return next; }
void setNext (ListNode* new_link) {next = new_link; }
private:
value_type datum;
ListNode* next;
};
class LinkedList
{
public:
LinkedList ();
virtual ~LinkedList ();
void insertItem (ListNode::value_type);
void makeList (const ListNode::value_type [],const size_t& count);
void deleteList ();
//The following friend function is implemented in lablinklist.cpp
friend std::ostream& operator<<(std::ostream&, const LinkedList&);
private:
ListNode* head;
};
This is the pseudocode, but i still have a hard time undertanding it.
Creating a List (makeList(const ListNode::value_type [],const size_t& count)) This function
receives an array in the order that we want to add it to the linkedlist. Index 0 will be the head
node, index n will be the last node.
First, create a node initialized with a data value and a NULL pointer. Set the \"head\" to point to
the first node. Set up a current-pointer to the first node (or \"head\"). Get a data value for the next
node. While more nodes to add { Create a new node initialized with the data value and a NULL
pointer. Set the current-pointer link member (\"next\") to the new node. Set the current-pointer to
point to the new node. Get a data value for the next node. }
Thanks.
Solution
//linkedList.h
#ifndef LINKEDLIST_H
#define LINKEDLIST_H
#include
#include
class ListNode
{
public:
typedef int value_type;
ListNode(value_type d = value_type(), ListNode* n = NULL) { datum = d; next = n; }
//Assessor
value_type getDatum() const { return datum; }
ListNode const* getNext() const { return next; }
//Mutator
void setDatum(const value_type& d) { datum = d; }
ListNode* getNext() { return next; }
void setNext(ListNode* new_link) { next = new_link; }
private:
value_type datum;
ListNode* next;
};
class LinkedList
{
public:
LinkedList();
virtual ~LinkedList();
void insertItem(ListNode::value_type);
void makeList(const ListNode::value_type[], const size_t& count);
void deleteList();
//The following friend function is implemented in lablinklist.cpp
friend std::ostream& operator<<(std::ostream&, const LinkedList&);
private:
ListNode* head;
};
#endif
-------------------------------------------------------------
//linkedList.cpp
#include \"linkedlist.h\"
LinkedList::LinkedList()
{
head = NULL;
}
LinkedList::~LinkedList()
{
ListNode *tmp = head;
while (tmp != NULL)
{
head = head->getNext();
delete tmp;
tmp = head;
}
}
void LinkedList::insertItem(ListNode::value_type item)
{
ListNode *newNode,*cur = head;
newNode = new ListNode;
newNode->setDatum(item);
newNode->setNext(NULL);.
import java-util-Iterator- import java-util-NoSuchElementException- im.pdf
import java.util.Iterator;
import java.util.NoSuchElementException;
import lab4.util.List;
public class SinglyLinkedList<E> implements List<E> {
@SuppressWarnings("hiding")
private class SinglyLinkedListIterator<E> implements Iterator<E>{
private Node<E> nextNode;
@SuppressWarnings("unchecked")
public SinglyLinkedListIterator() {
this.nextNode = (Node<E>) header.getNext();
}
@Override
public boolean hasNext() {
return nextNode != null;
}
@Override
public E next() {
if (this.hasNext()) {
E result = this.nextNode.getElement();
this.nextNode = this.nextNode.getNext();
return result;
}
else {
throw new NoSuchElementException();
}
}
}
private static class Node<E> {
private E element;
private Node<E> next;
public Node(E element, Node<E> next) {
super();
this.element = element;
this.next = next;
}
public Node() {
super();
}
public E getElement() {
return element;
}
public void setElement(E element) {
this.element = element;
}
public Node<E> getNext() {
return next;
}
public void setNext(Node<E> next) {
this.next = next;
}
}
private Node<E> header;
private int currentSize;
public SinglyLinkedList() {
this.header = new Node<>();
this.currentSize = 0;
}
@Override
public int size() {
return this.currentSize;
}
@Override
public boolean isEmpty() {
return this.size() == 0;
}
@Override
public boolean contains(E e) {
return this.firstIndexOf(e) >= 0;
}
@Override
public int firstIndexOf(E e) {
int i = 0;
for (Node<E> temp = this.header.getNext(); temp != null;
temp = temp.getNext(), ++i) {
if (temp.getElement().equals(e)) {
return i;
}
}
// not found
return -1;
}
@Override
public void add(E e) {
if (this.isEmpty()) {
this.header.setNext(new Node<E>(e, null));
this.currentSize++;
}
else {
Node<E>temp= this.header.getNext();
while (temp.getNext() != null) {
temp = temp.getNext();
}
Node<E> newNode = new Node<>(e, null);
temp.setNext(newNode);
this.currentSize++;
}
}
@Override
public void add(E e, int index) {
if ((index < 0) || (index > this.currentSize)) {
throw new IndexOutOfBoundsException();
}
if (index == this.currentSize) {
this.add(e);
}
else {
Node<E> temp = null;
if (index == 0) {
temp = this.header;
}
else {
temp = this.getPosition(index -1);
}
Node<E> newNode = new Node<>();
newNode.setElement(e);
newNode.setNext(temp.getNext());
temp.setNext(newNode);
this.currentSize++;
}
}
@Override
public E get(int position) {
if ((position < 0) || position >= this.currentSize) {
throw new IndexOutOfBoundsException();
}
Node<E> temp = this.getPosition(position);
return temp.getElement();
}
private Node<E> getPosition(int index){
int currentPosition=0;
Node<E> temp = this.header.getNext();
while(currentPosition != index) {
temp = temp.getNext();
currentPosition++;
}
return temp;
}
@Override
public boolean remove(int index) {
if ((index < 0) || (index >= this.currentSize)){
throw new IndexOutOfBoundsException();
}
else {
Node<E> temp = this.header;
int currentPosition =0;
Node<E> target = null;
while (currentPosition != index) {
temp = temp.getNext();
currentPosit.
import java-util--- public class MyLinkedList{ public static void.pdf
import java.util.*; public class MyLinkedList{ public static void main(String[] args){ } } //copy
MyList to here interface MyList extends Collection { /* MyList will inherite all methods from
Collection public boolean add(E e); public boolean addAll(Collection extends E> c); public void
clear(); public boolean contains(Object o); public boolean containsAll(Collection> c); public
boolean isEmpty(); public boolean remove(Object o); public boolean removeAll(Collection> c);
public boolean retainAll(Collection> c); public int size(); public Object[] toArray(); public T[]
toArray(T[] arr); */ //abstract method public void add(int index, E e); public E get(int index);
public int indexOf(Object e); public int lastIndexOf(E e); public E remove(int index); public E
set(int index, E e); //default method @Override public default boolean add(E e){ add(size(), e);
return true; } @Override public default boolean isEmpty(){ return size()==0; } @Override
public default boolean remove(Object e){ if(indexOf(e) >= 0){ remove(indexOf(e)); return true;
} else{ return false; } } @Override public default boolean containsAll(Collection> c){
for(Object e : c){ if(!contains(e)){ return false; } } return true; } @Override public default
boolean addAll( Collection extends E> c){ for(E e : c){ add(e); } return true; } /* removeAll:
this[1,1,2,3] c[1,2,4] this.removeAll(c) [3] */ @Override public default boolean removeAll(
Collection> c){ for(Object e : c){ while(contains(e)){ this.remove(e); } } return true; } /*
retainAll this[1,1,2,3] c[1,2,4] this.retainAll(c) [1,1,2] */ @Override public default boolean
retainAll( Collection> c){ for(E e : this){ if(!c.contains(e)){ this.remove(e); } } return true; }
@Override public default Object[] toArray(){ Object[] results = new Object[size()]; int i = 0;
for(E e : this){ results[i++] = e; } return results; } /* T[] array */ @Override public default T[]
toArray(T[] array){ int i = 0; for(E e : this){ array[i++] = (T)e; } return array; } } class
TwoWayLinkedList implements MyList { //inner static class Node public class Node { E
element; Node next; Node previous; public Node(E e){ element = e; } } private Node head, tail;
private int size = 0; public TwoWayLinkedList(){ /* head = null; tail = null; size = 0; */ } public
TwoWayLinkedList(E[] objects){ } public E getFirst(){ return null; } public E getLast(){ return
null; } public void addFirst(E e){ } public void addLast(E e){ } public E removeFirst(){ return
null; } public E removeLast(){ return null; } @Override public void add(int index, E e){ }
@Override public E remove(int index){ return null; } @Override public void clear(){ }
@Override public boolean contains(Object e){ return false; } @Override public E get(int index){
return null; } @Override public int indexOf(Object e){ return -1; } @Override public int
lastIndexOf(Object e){ return -1; } @Override public E set(int index, E e){ return null; }
@Override public int size(){ return size; } //toString() @Override public String.
Effective C#
Charla de Effectice C# en #dotNetSpain2015 https://www.desarrollaconmicrosoft.com/Dotnetspain2015
Please help write BinaryTree-java Thank you! Create a class BinaryTr.pdf
Please help write BinaryTree.java Thank you!
Create a class BinaryTree. A class that implements the ADT binary tree.
import java.util.Iterator;
import java.util.NoSuchElementException;
import StackAndQueuePackage.*;
public class BinaryTree <T> implements BinaryTreeInterface<T>
{
private BinaryNode<T> root;
public BinaryTree()
{
root = null;
} // end default constructor
public BinaryTree(T rootData)
{
root = new BinaryNode<>(rootData);
} // end constructor
public BinaryTree(T rootData, BinaryTree<T> leftTree,
BinaryTree<T> rightTree)
{
privateSetTree(rootData, leftTree, rightTree);
} // end constructor
public void setTree(T rootData)
{
root = new BinaryNode<>(rootData);
} // end setTree
public void setTree(T rootData, BinaryTreeInterface<T> leftTree,
BinaryTreeInterface<T> rightTree)
{
privateSetTree(rootData, (BinaryTree<T>)leftTree,
(BinaryTree<T>)rightTree);
} // end setTree
private void privateSetTree(T rootData, BinaryTree<T> leftTree,
BinaryTree<T> rightTree)
{
root = new BinaryNode<>(rootData);
if ((leftTree != null) && !leftTree.isEmpty())
root.setLeftChild(leftTree.root);
if ((rightTree != null) && !rightTree.isEmpty())
{
if (rightTree != leftTree)
root.setRightChild(rightTree.root);
else
root.setRightChild(rightTree.root.copy());
} // end if
if ((leftTree != null) && (leftTree != this))
leftTree.clear();
if ((rightTree != null) && (rightTree != this))
rightTree.clear();
} // end privateSetTree
//...
private class PreorderIterator implements Iterator<T>
{
private StackInterface<BinaryNode<T>> nodeStack;
public PreorderIterator()
{
nodeStack = new LinkedStack<>();
if (root != null)
nodeStack.push(root);
} // end default constructor
public boolean hasNext()
{
return !nodeStack.isEmpty();
} // end hasNext
public T next()
{
BinaryNode<T> nextNode;
if (hasNext())
{
nextNode = nodeStack.pop();
BinaryNode<T> leftChild = nextNode.getLeftChild();
BinaryNode<T> rightChild = nextNode.getRightChild();
// Push into stack in reverse order of recursive calls
if (rightChild != null)
nodeStack.push(rightChild);
if (leftChild != null)
nodeStack.push(leftChild);
}
else
{
throw new NoSuchElementException();
}
return nextNode.getData();
} // end next
public void remove()
{
throw new UnsupportedOperationException();
} // end remove
} // end PreorderIterator
public void iterativePreorderTraverse ()
{
StackInterface<BinaryNode<T>> nodeStack = new LinkedStack<>();
if (root != null)
nodeStack.push(root);
BinaryNode<T> nextNode;
while (!nodeStack.isEmpty())
{
nextNode = nodeStack.pop();
BinaryNode<T> leftChild = nextNode.getLeftChild();
BinaryNode<T> rightChild = nextNode.getRightChild();
// Push into stack in reverse order of recursive calls
if (rightChild != null)
nodeStack.push(rightChild);
if (leftChild != null)
nodeStack.push(leftChild);
System.out.print(nextNode.getData() + " ");
} // end while
} // end iterativePreorderTraverse
private class InorderIterator implements Iterator<T>
{
private StackInterface<BinaryNode<T>> nodeStack;
private BinaryNode<T> cu.
Similar to Using visual studio 2022- a C# windows form application- and your Doub.pdf (20)
So I have this code(StackInAllSocks) and I implemented the method but.pdf
So I have this code(StackInAllSocks) and I implemented the method but.pdf
Need help finishing this doubly linked list code- Commented lines are.docx
Need help finishing this doubly linked list code- Commented lines are.docx
In the class we extensively discussed a node class called IntNode in.pdf
In the class we extensively discussed a node class called IntNode in.pdf
I need help coding a doubly linked list from this unfinished code- Eve.docx
I need help coding a doubly linked list from this unfinished code- Eve.docx
I need help implementing a Stack with this java programming assignme.pdf
I need help implementing a Stack with this java programming assignme.pdf
Add delete at a position to the code and display it to the code- class.pdf
Add delete at a position to the code and display it to the code- class.pdf
Help I keep getting the same error when running a code. Below is the.pdf
Help I keep getting the same error when running a code. Below is the.pdf
DoublyList-cpp- #include -DoublyList-h- using namespace std- void Doub.pdf
DoublyList-cpp- #include -DoublyList-h- using namespace std- void Doub.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
For this micro assignment, you must implement two Linked List functi.docx
For this micro assignment, you must implement two Linked List functi.docx
could you implement this function please, im having issues with it..pdf
could you implement this function please, im having issues with it..pdf
import java-util-Iterator- import java-util-NoSuchElementException- im.pdf
import java-util-Iterator- import java-util-NoSuchElementException- im.pdf
import java-util--- public class MyLinkedList{ public static void.pdf
import java-util--- public class MyLinkedList{ public static void.pdf
Please help write BinaryTree-java Thank you! Create a class BinaryTr.pdf
Please help write BinaryTree-java Thank you! Create a class BinaryTr.pdf
More from acteleshoppe
Using your understanding of Hardy-Weinberg proportions- which of the f.pdf
Using your understanding of Hardy-Weinberg proportions, which of the following statements
is/are true? A. Population heterozygosity is highest when p = q = 0.5. B. If a population is not in
Hardy-Weinberg proportions, the genotype frequencies will not add up to 1. C. Hardy-Weinberg
frequencies refer to expected allele frequencies based on actual genotype frequencies. D. Rare
alleles are found primarily in heterozygotes..
Using the summary table above- match the sources of variation with the.pdf
Using the summary table above, match the sources of variation with the appropriate significance
values Drag and drop options on the right-hand side and submit. For keyboard navigation.
SHOW MORE.
Using PowerPoint draft an academic poster critically analysing and ill.pdf
Using PowerPoint draft an academic poster critically analysing and illustrating an aspect of any
of the theories explaining consumer behaviour covered in B206 Block 4, for example:
the impact of roles and/or groups, including the family and social class
culture
opinion leaders..
Using the life cycle image above to help you define meiosis- haplece a.pdf
Using the life cycle image above to help you define meiosis, haplece and fertilization in this
figure of Altermation of Generations in plants. Using the life cycle image above to help you
define meiosis, haploid and fertilization in this figure of Alternation of Generations in nlante
Describe endosymbiosis and secondary endosymbiosis in your own words. In angiosperms,
pollen grains are released from the .... land on the stichy... and develop a tube down the length of
the style to the ovules. anthers ... stigma carpels ... receptacles filaments ... ovary anthers ... sepal
Question 38 (4 points) Match each statement with a group of plants. Lycophytes 1. the simplest
plants 2. common vascular plant that Bryophytes produces haplaid speres.
Using the Influence tactic known as pressure usually Involves Multiple.pdf
Using the Influence tactic known as pressure usually Involves Multiple Choice the target
becoming committed to the Influence request legitimate power to gather benefits over the long
term. the use of threats and demands. the promise of some type of resource the target wants.
enlisting other people to help Influence the target..
Using the information below- please prepare the 2020 and 2021 Balance.pdf
Using the information below, please prepare the 2020 and 2021 Balance Sheet and Profit & Loss
Statement and the Cash Flow Statement using the Indirect Method for 2021. Thowendeuns 34
All tangible assets are presented in the Balance Sheet net of amortizacion.
Using the following national income accounting data- compute (a) GDP-.pdf
Using the following national income accounting data. compute (a) GDP. (b) NDP, and (c) Ni.
All figures are in bilions. Instructions: Round your answers to 1 decimal place. a. G D P = $
bilion b. NDP = $ billion C. N I = $ bilion.
Using the company Netflix- Based on your prior research- determine.pdf
Using the company Netflix.
Based on your prior research, determine potential risk factors for not meeting each of the project
objectives. Develop a contingency plan for each of the potential risks. Add the potential risks and
contingency plan to your Wk 4 - Apply: Project Plan assignment. Create a 12-to 14-slide
presentation with detailed speaker notes and visuals on every slide in which you: - Identify the
organization's information presented in Wk 1. - Synthesize the SWOT analysis and market trend
research. - Explain how the project objectives will advance the organizational goals. - Assess
how success will be measured. - Evaluate the value this project will bring to the organization. -
Identify project metrics, timelines, and responsible parties. - Develop a contingency plan for each
of the potential risk factors for not meeting each of the project objectives. ( T ).
Using the code below- I need help with creating code for the following.pdf
Using the code below, I need help with creating code for the following:
1) Write Python code to plot the images from the first epoch. Take a screenshot of the images
from the first epoch.
2) Write Python code to plot the images from the last epoch. Take a screenshot of the images
from the last epoch.
#Step 1: Import the required Python libraries:
import numpy as np
import matplotlib.pyplot as plt
import keras
from keras.layers import Input, Dense, Reshape, Flatten, Dropout
from keras.layers import BatchNormalization, Activation, ZeroPadding2D
from keras.layers import LeakyReLU
from keras.layers.convolutional import UpSampling2D, Conv2D
from keras.models import Sequential, Model
from keras.optimizers import Adam,SGD
from keras.datasets import cifar10
#Step 2: Load the data.
#Loading the CIFAR10 data
(X, y), (_, _) = keras.datasets.cifar10.load_data()
#Selecting a single class of images
#The number was randomly chosen and any number
#between 1 and 10 can be chosen
X = X[y.flatten() == 8]
#Step 3: Define parameters to be used in later processes.
#Defining the Input shape
image_shape = (32, 32, 3)
latent_dimensions = 100
#Step 4: Define a utility function to build the generator.
def build_generator():
model = Sequential()
#Building the input layer
model.add(Dense(128 * 8 * 8, activation="relu",
input_dim=latent_dimensions))
model.add(Reshape((8, 8, 128)))
model.add(UpSampling2D())
model.add(Conv2D(128, kernel_size=3, padding="same"))
model.add(BatchNormalization(momentum=0.78))
model.add(Activation("relu"))
model.add(UpSampling2D())
model.add(Conv2D(64, kernel_size=3, padding="same"))
model.add(BatchNormalization(momentum=0.78))
model.add(Activation("relu"))
model.add(Conv2D(3, kernel_size=3, padding="same"))
model.add(Activation("tanh"))
#Generating the output image
noise = Input(shape=(latent_dimensions,))
image = model(noise)
return Model(noise, image)
#Step 5: Define a utility function to build the discriminator.
def build_discriminator():
#Building the convolutional layers
#to classify whether an image is real or fake
model = Sequential()
model.add(Conv2D(32, kernel_size=3, strides=2,
input_shape=image_shape, padding="same"))
model.add(LeakyReLU(alpha=0.2))
model.add(Dropout(0.25))
model.add(Conv2D(64, kernel_size=3, strides=2, padding="same"))
model.add(ZeroPadding2D(padding=((0,1),(0,1))))
model.add(BatchNormalization(momentum=0.82))
model.add(LeakyReLU(alpha=0.25))
model.add(Dropout(0.25))
model.add(Conv2D(128, kernel_size=3, strides=2, padding="same"))
model.add(BatchNormalization(momentum=0.82))
model.add(LeakyReLU(alpha=0.2))
model.add(Dropout(0.25))
model.add(Conv2D(256, kernel_size=3, strides=1, padding="same"))
model.add(BatchNormalization(momentum=0.8))
model.add(LeakyReLU(alpha=0.25))
model.add(Dropout(0.25))
#Building the output layer
model.add(Flatten())
model.add(Dense(1, activation='sigmoid'))
image = Input(shape=image_shape)
validity = model(image)
return Model(image, validity)
#Step 6: Define a utility function to display th.
Using the code below- I need help with the following 3 things- 1) Writ.pdf
Using the code below, I need help with the following 3 things:
1) Write Python code to plot the images from the first epoch. Take a screenshot of the images
from the first epoch.
2) Write Python code to plot the images from the last epoch. Take a screenshot of the images
from the last epoch.
3) Comment on the network performance.
#Step 1: Import the required Python libraries:
import numpy as np
import matplotlib.pyplot as plt
import keras
from keras.layers import Input, Dense, Reshape, Flatten, Dropout
from keras.layers import BatchNormalization, Activation, ZeroPadding2D
from keras.layers import LeakyReLU
from keras.layers.convolutional import UpSampling2D, Conv2D
from keras.models import Sequential, Model
from keras.optimizers import Adam,SGD
from keras.datasets import cifar10
#Step 2: Load the data.
#Loading the CIFAR10 data
(X, y), (_, _) = keras.datasets.cifar10.load_data()
#Selecting a single class of images
#The number was randomly chosen and any number
#between 1 and 10 can be chosen
X = X[y.flatten() == 8]
#Step 3: Define parameters to be used in later processes.
#Defining the Input shape
image_shape = (32, 32, 3)
latent_dimensions = 100
#Step 4: Define a utility function to build the generator.
def build_generator():
model = Sequential()
#Building the input layer
model.add(Dense(128 * 8 * 8, activation="relu",
input_dim=latent_dimensions))
model.add(Reshape((8, 8, 128)))
model.add(UpSampling2D())
model.add(Conv2D(128, kernel_size=3, padding="same"))
model.add(BatchNormalization(momentum=0.78))
model.add(Activation("relu"))
model.add(UpSampling2D())
model.add(Conv2D(64, kernel_size=3, padding="same"))
model.add(BatchNormalization(momentum=0.78))
model.add(Activation("relu"))
model.add(Conv2D(3, kernel_size=3, padding="same"))
model.add(Activation("tanh"))
#Generating the output image
noise = Input(shape=(latent_dimensions,))
image = model(noise)
return Model(noise, image)
#Step 5: Define a utility function to build the discriminator.
def build_discriminator():
#Building the convolutional layers
#to classify whether an image is real or fake
model = Sequential()
model.add(Conv2D(32, kernel_size=3, strides=2,
input_shape=image_shape, padding="same"))
model.add(LeakyReLU(alpha=0.2))
model.add(Dropout(0.25))
model.add(Conv2D(64, kernel_size=3, strides=2, padding="same"))
model.add(ZeroPadding2D(padding=((0,1),(0,1))))
model.add(BatchNormalization(momentum=0.82))
model.add(LeakyReLU(alpha=0.25))
model.add(Dropout(0.25))
model.add(Conv2D(128, kernel_size=3, strides=2, padding="same"))
model.add(BatchNormalization(momentum=0.82))
model.add(LeakyReLU(alpha=0.2))
model.add(Dropout(0.25))
model.add(Conv2D(256, kernel_size=3, strides=1, padding="same"))
model.add(BatchNormalization(momentum=0.8))
model.add(LeakyReLU(alpha=0.25))
model.add(Dropout(0.25))
#Building the output layer
model.add(Flatten())
model.add(Dense(1, activation='sigmoid'))
image = Input(shape=image_shape)
validity = model(image)
return Model(image, validity)
#Step 6: Define a .
Using the assigned class reading- -SOCIAL CONTROL THEORIES OF URBAN PO.pdf
Using the assigned class reading, "SOCIAL CONTROL THEORIES OF URBAN POLITICS"
by HARVEY BOULAY. please explain the following:
1. What is Social Control Theory?
2. How do landlords voluntarily or involuntarily becoming engines of inequality within cities?
3. Through the lens of Social Control Theory, can the dynamics between landlords and tenants
evoke police brutality, if so explain how?.
Using the areas in Figure (the Empirical Rule)- find the areas between.pdf
Using the areas in Figure (the Empirical Rule), find the areas between z = 2 and z = 3.
Using sources from the Internet- identify some of the problems facing.pdf
Using sources from the Internet, identify some of the problems facing the company you choose,
which is either transitioning to or operating as a virtual organization! Whether by operating as a
virtual organization. Old problems can be eliminated or vice versa, there are new problems that
arise?.
Using Python- Prompt the user to enter a word and a single character-.pdf
Using Python:
Prompt the user to enter a word and a single character. You can always assume the user will
provide you with a valid word and a single character.
Next, examine the word and determine how many times the character has been used in the word.
Make your program case insensitive. For example:.
Using putty with Bash shell- I am trying to complete the following-.pdf
Using putty with Bash shell:
I am trying to complete the following:
Create a variable and set it equal to $1 ($1 is the value of the first item from the command line,
we will learn more about this later, but for now, we will use it to make testing easier.)
Display an introductory message including the path from the variable in step 1. The format is:
Let me determine some facts about /somepath ...
Use an if to determine whether the item indicated in the path exists. Display a message indicating
whether it does or does not exist. If it does exist, include in the message whether it is a file or
directory. If the item does not exist, return an exit status of 1. Refer to the sample output for
format and wording.
I have coded this so far, but get an error
What am I doing wrong?
path=' $1 ' echo "Let me determine some facts about /path..." if [ - d \$path ] then \#path exists
and is a Directory echo "\$path exist.s" else \#path exists and is a Eile elso "\$path is a file" else
Decho"\$path does not exist" exit 1 fi.
Using linux - For each environment variable below- state whether it is.pdf
Using linux
. For each environment variable below, state whether it is a local or global environment variable.
Note that local environment variables in this problem also have all capital letters.
a. BASH
b. COLUMNS
c. COLORTERM
d. DISPLAY
e. EUID
f. HOSTNAME
g. LOGNAME
h. PS1
i. SHELLOPTS
j. TERM.
Using Java and the parboiled Java library Write a BNF grammar for the.pdf
Using Java and the parboiled Java library
Write a BNF grammar for the language consisting of your first name, space, and last name
Examples:
David Beckham
John Anderson
Bruce Wayne
When your program receives an input in the mentioned format above, it should run using the
grammar without any errors and draw the parse tree.
When submitting, include screenshots of the input and output (parse tree) processes and your
program folder along with its source files in a zipped file. You should submit that compressed
(zipped) file on canvas.
My name is Will Smith. Please help me write a BNF grammar for the language. My name is Will
Smith. Please make sure the output of the program has a parse tree in it.
using basic python P4-16 Factoring of integers- Write a program that a.pdf
using basic python
P4.16 Factoring of integers. Write a program that asks the user for an integer and then prints out
all its factors. For example, when the user enters 150 , the program should print 2 3 5 5.
using C# language- a WPF application will be made with the application.pdf
using C# language, a WPF application will be made with the application being able to add a
person, edit the person's details, delete the person's details, add a studen, edit the student's details,
delete the student's details, to view all the records, to view a specific record, and delete all the
records.
eate a WPF application (C\# language) that would satisfy the following requirements below: 1.
The application must have a main menu that allows the user to choose his/her action. 2. When
the user selects "Exit" menu, the application will exit or will be terminated. 3. When the user
selects "Person" menu, the screen will display submenu for person maintenance. a. When the
user selects "Add Person" submenu, the application allows the user to add person record (last
name, given name, middle name). b. When the user selects "Edit Person" submenu, the
application allows the user to edit person record (last name, given name, middle name) by person
id. c. When the user selects "Delete Person" submenu, the application allows the user to delete
person record (including student record) by person id. 4. When the user selects "tudent", the
screen clears and will display submenu for student maintenance. a. When the user selects "Add
Student" submenu, the application allows the user to add student record to existing person
(student number, program, year) by person id. b. When the user selects "Edit Student" submenu,
the application allows the user to edit student record (student number, program, year) by person
id. c. When the user selects "Delete Student" submenu, the application allows the user to delete
student record only (not including person record) by person id..
Using a waterfall framework is suitable for a project involving which.pdf
Using a waterfall framework is suitable for a project involving which criteria?
A. a simple project with a large team
B. a project with evolving requirements and incremental deliveries
C. a complicated project with a small team
D. a project with a fixed scope and a highly dedicated customer.
More from acteleshoppe (20)
Using your understanding of Hardy-Weinberg proportions- which of the f.pdf
Using your understanding of Hardy-Weinberg proportions- which of the f.pdf
Using the summary table above- match the sources of variation with the.pdf
Using the summary table above- match the sources of variation with the.pdf
Using PowerPoint draft an academic poster critically analysing and ill.pdf
Using PowerPoint draft an academic poster critically analysing and ill.pdf
Using the life cycle image above to help you define meiosis- haplece a.pdf
Using the life cycle image above to help you define meiosis- haplece a.pdf
Using the Influence tactic known as pressure usually Involves Multiple.pdf
Using the Influence tactic known as pressure usually Involves Multiple.pdf
Using the information below- please prepare the 2020 and 2021 Balance.pdf
Using the information below- please prepare the 2020 and 2021 Balance.pdf
Using the following national income accounting data- compute (a) GDP-.pdf
Using the following national income accounting data- compute (a) GDP-.pdf
Using the company Netflix- Based on your prior research- determine.pdf
Using the company Netflix- Based on your prior research- determine.pdf
Using the code below- I need help with creating code for the following.pdf
Using the code below- I need help with creating code for the following.pdf
Using the code below- I need help with the following 3 things- 1) Writ.pdf
Using the code below- I need help with the following 3 things- 1) Writ.pdf
Using the assigned class reading- -SOCIAL CONTROL THEORIES OF URBAN PO.pdf
Using the assigned class reading- -SOCIAL CONTROL THEORIES OF URBAN PO.pdf
Using the areas in Figure (the Empirical Rule)- find the areas between.pdf
Using the areas in Figure (the Empirical Rule)- find the areas between.pdf
Using sources from the Internet- identify some of the problems facing.pdf
Using sources from the Internet- identify some of the problems facing.pdf
Using Python- Prompt the user to enter a word and a single character-.pdf
Using Python- Prompt the user to enter a word and a single character-.pdf
Using putty with Bash shell- I am trying to complete the following-.pdf
Using putty with Bash shell- I am trying to complete the following-.pdf
Using linux - For each environment variable below- state whether it is.pdf
Using linux - For each environment variable below- state whether it is.pdf
Using Java and the parboiled Java library Write a BNF grammar for the.pdf
Using Java and the parboiled Java library Write a BNF grammar for the.pdf
using basic python P4-16 Factoring of integers- Write a program that a.pdf
using basic python P4-16 Factoring of integers- Write a program that a.pdf
using C# language- a WPF application will be made with the application.pdf
using C# language- a WPF application will be made with the application.pdf
Using a waterfall framework is suitable for a project involving which.pdf
Using a waterfall framework is suitable for a project involving which.pdf
Recently uploaded
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
Home assignment II on Spectroscopy 2024 Answers.pdf
Answers to Home assignment on UV-Visible spectroscopy: Calculation of wavelength of UV-Visible absorption
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal labor is also termed spontaneous labor, defined as the natural physiological process through which the fetus, placenta, and membranes are expelled from the uterus through the birth canal at term (37 to 42 weeks
2024.06.01 Introducing a competency framework for languag learning materials ...
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
The French Revolution Class 9 Study Material pdf free download
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
1.4 modern child centered education - mahatma gandhi-2.pptx
Child centred education is an educational approach that priorities the interest, needs and abilities of the child in the learning process.
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.
The Challenger.pdf DNHS Official Publication
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Event Link:-
https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-exploring-gemini-ai-and-integration-with-mulesoft/
Agenda
● Java 17 Upgrade Overview
● Why and by when do customers need to upgrade to Java 17?
● Is there any immediate impact to upgrading to Mule Runtime 4.6 and beyond?
● Which MuleSoft products are in scope?
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/
YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Shyam Raj Prasad-
https://www.linkedin.com/in/shyam-raj-prasad/
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.
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
CACJapan - GROUP Presentation 1- Wk 4.pdf
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...Nguyen Thanh Tu Collection
https://app.box.com/s/hqnndn05v4q5a4k4jd597rkdbda0fniiBiological Screening of Herbal Drugs in detailed.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
Chapter -12, Antibiotics (One Page Notes).pdf
This is a notes for the D.Pharm students and related to the antibiotic drugs.
Recently uploaded (20)
Home assignment II on Spectroscopy 2024 Answers.pdf
Home assignment II on Spectroscopy 2024 Answers.pdf
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal Labour/ Stages of Labour/ Mechanism of Labour
2024.06.01 Introducing a competency framework for languag learning materials ...
2024.06.01 Introducing a competency framework for languag learning materials ...
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Group Presentation 2 Economics.Ariana Buscigliopptx
Group Presentation 2 Economics.Ariana Buscigliopptx
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk - How can education support child empowerment.pptx
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
Using visual studio 2022- a C# windows form application- and your Doub.pdf
- 1. 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;
- 2. 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)
- 3. { 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; }
- 4. nodeNumber--; } public void DeleteLast() { if (lastNode == null) { return; } if (lastNode.previous == null) { firstNode = null; lastNode = null; currentNode = null; } else { lastNode = lastNode.previous; lastNode.next = null; currentNode = lastNode; } nodeNumber--; } public void DeleteCurrent() { if (currentNode == null) { return; } if (currentNode.previous == null) { DeleteFirst(); return; } if (currentNode.next == null) { DeleteLast(); return; } currentNode.previous.next = currentNode.next; currentNode.next.previous = currentNode.previous; currentNode = currentNode.next;
- 5. nodeNumber--; } public void MoveToNext() { if (currentNode == null || currentNode.next == null) { return; } currentNode = currentNode.next; } public void MoveToPrevious() { if (currentNode == null || currentNode.previous == null) { return; } currentNode = currentNode.previous; } public DoubleLinkedListNode<T> Find(T value) { return FindRecursive(firstNode, value); } private DoubleLinkedListNode<T> FindRecursive(DoubleLinkedListNode<T> node, T value) { if (node == null) { return null; } if (node.value.Equals(value)) { return node; } return FindRecursive(node.next, value); } public string GetDisplayString() { if (firstNode == null)
- 6. { return ""; } return GetDisplayStringRecursive(firstNode); } private string GetDisplayStringRecursive(DoubleLinkedListNode<T> node) { if (node == null) { return ""; } string result = node.value.ToString() + " "; result += GetDisplayStringRecursive(node.next); return result; } } internal class DoubleLinkedListNode<T> { public T value; public DoubleLinkedListNode<T> next = null; public DoubleLinkedListNode<T> previous = null; public DoubleLinkedListNode(T value) { this.value = value; previous = null; next = null; } private DoubleLinkedListNode() { value = default(T); } } Develop a test harness, that allows testing rapid, but effective testing of your classes, including inserting and deleting 6 or more integers, including completely filling, completely emptying, and then refilling your data structures