public class SLLT { protected SLLNodeT head, tail; pub.pdf

•

0 likes•2 views

public class SLL { protected SLLNode head, tail; public SLL() { head = tail = null; } public void addToTail(T e){ SLLNode newNode = new SLLNode(e); if(head == null) head = tail = newNode; else{ tail.next = newNode; tail = tail.next; } } public void addToHead(T e) { SLLNode newNode = new SLLNode(e, head); if(head == null) tail = newNode; head = newNode; } public String toString(){ if (head == null) return "[]"; String out = "["; SLLNode p = head; while (p.next != null){ out += p.info + " "; p = p.next; } out += p.info + "]"; return out; } } public class SLLNode { protected T info; protected SLLNode next; public SLLNode() { this(null, null); } public SLLNode(T e) { this(e, null); } public SLLNode(T e, SLLNode ptr) { info = e; next = ptr; } } public class SortedSLL> extends SLL{ public void insert(T e){ } public void merge(SortedSLL list){ } } public class SortedSLL T extends Comparable T extends SLLT{ public void insert (T e) \{ \} public void merge(SortedSLL T list) \{ \} public class SortedSLL T extends Comparable T extends SLLT{ public void insert ( T e) \{ \} public void merge(SortedSLL T list) \{ \} \} ublic class SLLT{ protected SLLNodeT head, tail; public SLL() \{ head = tail = null; \} public void addToTail( T e) \{ SLLNode newNode = new SLLNodeT(e); if ( head == null) head = tail = newNode; else\{ tail. next = newNode; tail = tail. next; \} \} public void addToHead( T e) \{ SLLNode T newNode = new SLLNodeT(e, head ); if (head == null) tail = newNode; head = newNode; \} public string tostring()\{ if (head == null) return "[]"; String out = "["; SLLNode Tp= head; while (p.next != null) \{ out +=p.info +" "; p=p next; \} out += p.info + "]"; return out; \} ublic class SLLNode T{ protected T info; protected SLLNode T next; public SLLNode() \{ this(null, null); \} public SLLNode( T e) \{ this (e, null); \} public SLLNode( T e, SLLNode T ptr ){ info =e; next =ptr; \} Write a subclass of SLL named SortedSLL that represents a sorted SinglyLinkedList (sorted in nondecending order). The class should contain the following methods: 1- [40 Points] void insert ( T e) that inserts an SLLNode in its correct position so that the resulting list remains sorted. Make sure to consider special cases such as: - The list is empty. - The list has one element. - The inserted element is smaller than the head, or larger than the tail.. 2- [60 Points] void merge(SortedSLL T list) that merges the calling list with the argument list. Note that this can be done by calling the insert method for each element in list, but this is highly ineffiecient, answer the following question: Q2.1: What is the complexity of this approach? Explain. [10 Points] Instead, you should come up with a solution that traverse both lists just one time. Furthermore, the argument list should be empty after the merge is completed. Q2.2: What is the complexity of this approach? Explain. [10 Points] Hint: Make sure the class SortedSLL accepts types T that is comparable. You can do this by writing .

Education

ptr ){ info =e; next =ptr; }
Write a subclass of SLL named SortedSLL that represents a sorted SinglyLinkedList (sorted in
nondecending order). The class should contain the following methods: 1- [40 Points] void insert
( T e) that inserts an SLLNode in its correct position so that the resulting list remains sorted.
Make sure to consider special cases such as: - The list is empty. - The list has one element. - The
inserted element is smaller than the head, or larger than the tail.. 2- [60 Points] void
merge(SortedSLL T list) that merges the calling list with the argument list. Note that this can be
done by calling the insert method for each element in list, but this is highly ineffiecient, answer
the following question: Q2.1: What is the complexity of this approach? Explain. [10 Points]
Instead, you should come up with a solution that traverse both lists just one time. Furthermore,
the argument list should be empty after the merge is completed. Q2.2: What is the complexity of
this approach? Explain. [10 Points] Hint: Make sure the class SortedSLL accepts types T that is
comparable. You can do this by writing the class header as follows: public class SortedSLL T
extends Comparable T extends SLLT Notes: - Do not use additional data structures: e.g. arrays,
arraylists, strings, etc. - For the insert method, your solution should be adding a node to a list,
without re-creating the list, and without using a helper data structure or a sorting algorithm. - Use
the attached SLL and SLLNode classes. DO NOT modify these two classes. - Write your code in
the attached SortedSLL class, you can add helper methods, but DO NOT change the header of
insert and merge methods.

Similar to public class SLLT { protected SLLNodeT head, tail; pub.pdf

Linked list

Arbind Mandal

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(); } }.

fix the error - class Node{ int data- Node next-.pdf

AKVIGFOEU

dynamicList.ppt

ssuser0be977

Data structure

Arvind Kumar

You can list anything, it doesnt matter. I just want to see code f.pdf

fashionbigchennai

please help me in C++ Objective: Create a singly linked list of numbers based upon user input. Program logic: Ask for a number, add that number to the front of the list, print the list. Repeat until they enter -1 for the number. . Sample Input: 10, 15, 5, 2, 4, -1 Output: 4, 2, 5, 15, 10 Solution #include #include using namespace std; // It contains the value and the pointer to the next element in the list. struct element { int value; struct element *next; }; struct element *head = NULL; // The list is stored in the object of this class. class linkedlist { public: // To display list, we first see if head is NULL, // If head is NULL it means the list is empty. // Then we traverse along the list and display each item, until the next pointer is NULL. void display() { if(head == NULL){ cout << \"The list is empty\ \"; } else { struct element *temp; temp = head; while(temp != NULL){ cout << temp->value << \" \" ; temp = temp->next; } cout << \"\ \"; } } // To add an element to the list,create a newElement and store the value. // If head is NULL, add the newElement to the head. // To add an element at the starting of the list. // The next pointer of the newElement must point to the old head. // The new head must be pointed to the newElement. void add(int a){ struct element *newElement; newElement = (struct element *)malloc(sizeof(struct element)); newElement->value = a; newElement->next = NULL; if(head == NULL) { head = newElement; } else { newElement->next = head; head = newElement; } } }; int main() { // Create an object of the class linkedlist. linkedlist l = linkedlist(); int a; do { cout << \"Enter a number : \"; cin >> a; if(a!=-1) { // If the number is -1 do not add it to the list. l.add(a); // Add the number to the list. } l.display(); // Display the list. } while(a!=-1); // Keep asking for a number until -1 is pressed. return 0; }.

please help me in C++Objective Create a singly linked list of num.pdf

aminbijal86

Solution : class IntNode { int data; public IntNode next,head; public IntNode(int value) { data=value; next=null; } public void setNext(IntNode n) { next=n; } public int getData() { return data; } public IntNode getNext() { return(next); } } public class CircularLinkedList { public static void main(String[] args) { //test your code here } //private variables: private IntNode head; private IntNode tail; //constructor public CircularLinkedList(){ //empty linked list head=null; tail=null; } //add a node to the end of the list public void add(int value){ //create new Node IntNode newNode=new IntNode(value); //if list is empty if (isEmpty()){ //set new node as head head=newNode; //set next link to the head newNode.setNext(head); //set tail as the head tail=head; }else{ //set next link of the tail to the new node tail.setNext(newNode); //set next link of the new node to the head newNode.setNext(head); //update tail - new node is the new list tail tail=newNode; } } //check if linked list is empty public boolean isEmpty(){ if (head ==null) return true; else return false; } //print the values in the linked list public void print(){ //if list is empty if(isEmpty()){ System.out.println(\"empty\ \"); return; } //if list has one node if (head.getNext() == head) { System.out.println(head.getData()); return; } //start from the head node IntNode currentNode=head; while(currentNode.getNext() != head){ //print the value of the current node System.out.print(currentNode.getData() +\"\\t\"); //go to the next node currentNode=currentNode.getNext(); } System.out.print(currentNode.getData()); System.out.println(); } public IntNode delete() { if(head.next == null) tail = null; IntNode temp = head; head = head.next; return temp; } // end delete }.

Solutionclass IntNode { int data; public IntNode next,head;.pdf

rakeshankur

Consider four protons at rest at the corners of a square. The protons are bound together so they cannot move. Then the bonds holding one of the protons break so that proton is free to move. Determine that proton\'s acceleration (both direction and magnitude) at the instant after it is no longer bound as well as its speed when it has moved far away. You know the proton\'s charge, its mass, and the length of the sides of the square. Solution Here we need to note that the like charges repel each other, hence the proton will be pushed away along the diagonal of the square. We will assume that the mass of the proton is Mp and charge is q while the length of the side of the square is a. The net force due to the proton diagonally opposite would be along the diagonal, and also due to the other two charges. Hence the net force would be: 2kq22/a2 + kq2/2a2 = (kq2/a2)[22 + 1/2] along the diagonal. The acceleration would be given as: Force / mass = (kq2/Mpa2)[22 + 1/2] So as to determine the speed of the proton once it gets far away, we will use the prinicple of conservation of energy. Hence the initial potential energy of the proton would be equal to its final kinetic energy hence giving us the speed. That is. 2kq2/a + kq2/a2 = (kq2/a)[2 + 1/2] = Mpv2/2 or, V = sqrt[(2kq2/Mpa)[2 + 1/2]] which is the required expression for the speed of the proton..

Create your own Linked list from scratch (singly linked list).So.pdf

arumugambags

#include #include \"linkylist.h\" #include #include #include #include using namespace std; int main(int argc, char *argv[]) { //node* head = new node; LinkedList list(1); ifstream infile1 (argv[1]); //make sure the file opens properly and read the contents of the file in to a list if(!infile1) { cout<<\"Your Testfile could not be opened!\"<>users; if (users.find(\"I\")!=string::npos) { //int spot = atoi((users[3]).c_str()); string pot = string(users.substr(2)); stringstream spot(pot); string data; cin>>data; insertAfter(list.getNode(spot),data); } /*else if (users.find(\"D\")!=string::npos) { int spoty = atoi((users[3]).c_str()); deleteNode(spoty); }*/ else if (users==\"L\") { list.traverse_and_print(); } } return 0; #include using namespace std; class Node { friend class LinkedList; private: int value; /* data, can be any data type, but use integer for easiness */ Node *Next; /* pointer to the next node */ public: /* Constructors with No Arguments */ Node(void) : Next(NULL) { } /* Constructors with a given value */ Node(int val) : value(val), Next(NULL) { } /* Constructors with a given value and a link of the next node */ Node(int val, Node* next) : value(val), Next(next) {} /* Getters */ int getValue(void) { return value; } Node* getNext(void) { return Next; } }; /* definition of the linked list class */ class LinkedList { private: /* pointer of head node */ Node *Head; /* pointer of tail node */ Node *Tail; public: /* Constructors with a given value of a list node */ LinkedList(int val); /* Destructor */ ~LinkedList(void); /* Function to append a node to the end of a linked list */ void tailAppend(string val); /* Remove a node with a specific value if it exists */ void remove(int val); void insertAfter(Node* afterMe, string val); Node* getNode(int pos); /* Traversing the list and printing the value of each node */ void traverse_and_print(); }; #include #include \"linkylist.h\" #include using namespace std; LinkedList::LinkedList(int val) { /* Create a new node, acting as both the head and tail node */ Head = new Node(val); Tail = Head; } Node* LinkedList::getNode(int pos) { Node* p = Head; /* Counter */ while (pos--) { if (p != NULL) p = p->Next; else return NULL; } return p; } void LinkedList::insertAfter(Node* afterMe, string val) { if(afterme != NULL) { afterMe->Next = new Node(val, afterMe->Next); } } LinkedList::~LinkedList() { } void LinkedList::tailAppend(string val) { /* The list is empty? */ if (Head == NULL) { /* the same to create a new list with a given value */ Tail = Head = new Node(val); } else { /* Append the new node to the tail */ Tail->Next = new Node(val); /* Update the tail pointer */ Tail = Tail->Next; } } void LinkedList::remove(int val) { Node *pPre = NULL, *pDel = NULL; /* Check whether it is the head node? if it is, delete and update the head node */ if (Head->value == val) { /* point to the node to be deleted */ pDel = Head; /* update */ Head = pDel->Next; delete pDel; return; } pPre = Head; pDel = Head->Next; /*.

#include sstream #include linkylist.h #include iostream.pdf

aravlitraders2012

CSE240 Doubly Linked Lists

Garrett Gutierrez

137 Lab-2.2.pdf

21E135MAHIESHWARJ

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); } } .

Add delete at a position to the code and display it to the code- class.pdf

yrajjoshi

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.

So I have this code(StackInAllSocks) and I implemented the method but.pdf

aksahnan

I need to fill-in //TODO\'s in .cpp file and in .h file Could someone help me at least with few of them to give me an idea how deal with it. ***SinglyLinkedList.cpp #include #include #include \"SinglyLinkedList.h\" void test_constructor() { SinglyLinkedList lst = {100, 200, 300, 400, 500}; assert(*lst.at(0) == 100); assert(*lst.at(1) == 200); assert(*lst.at(2) == 300); assert(*lst.at(3) == 400); assert(*lst.at(4) == 500); assert(lst.size() == 5); } void test_remove() { SinglyLinkedList lst = {100, 200, 300, 400, 500}; lst.remove(2); assert(*lst.at(0) == 100); assert(*lst.at(1) == 200); assert(*lst.at(2) == 400); assert(*lst.at(3) == 500); assert(lst.size() == 4); } void test_insert() { // TODO } void test_push_back() { // TODO } void test_push_front() { // TODO } void test_append() { // TODO } void test_sum() { // TODO } int main() { test_constructor(); test_remove(); test_insert(); test_push_back(); test_push_front(); test_append(); test_sum(); } ***SinglyLinkedList.h #include #include template class SinglyLinkedList { // Nested class representing the nodes in the list. class SinglyLinkedListNode { public: // The value stored in this node. T value; // The next node in the sequence. SinglyLinkedListNode *next; SinglyLinkedListNode(T value) : value(value), next(nullptr) {} SinglyLinkedListNode(T value, SinglyLinkedListNode *next) : value(value), next(next) {} // Return the size (length) of the linked list. std::size_t size(); }; SinglyLinkedListNode *head; SinglyLinkedListNode *tail; public: // Constructs a new SinglyLinkedList from an initializer_list of type T[]. // This is mostly for convenience, especially when testing. SinglyLinkedList(std::initializer_list items) : head(nullptr), tail(nullptr) { if (items.size() == 0) { return; } // initializer_lists were designed to be used iteratively, // so thats what we do. // Can you think of how to write this recursively? auto it = items.begin(); while (it != items.end()) { this->push_back(*it++); } } // Return a pointer to the value at the given index. // If the index is larger than the size of the list, // return a nullptr. // // ASIDE: We will cover exceptions later. T* at(std::size_t i); // Pushes a new node onto the back of the list. void push_back(T value); // Pushes a new node onto the front of the list. void push_front(T value); // Return the size (length) of the linked list. std::size_t size(); // Remove the specified node from the list. void remove(std::size_t i); // Insert the value at the index. void insert(std::size_t i, T value); // Append the given list to this one. void append(SinglyLinkedList list); }; template T* SinglyLinkedList::at(std::size_t i) { // TODO } template void SinglyLinkedList::push_back(T value) { // TODO // Make sure that this is a O(1) operation! } template void SinglyLinkedList::push_front(T value) { // TODO // Make sure that this is a O(1) operation! } template void SinglyLinkedList::remove(std::size_t i) { // TODO // Don\'t forget to not only unlink the node, b.

I need to fill-in TODOs in .cpp file and in .h file Could some.pdf

forladies

I am Susan C. I am a C Homework Help Expert at programminghomeworkhelp.com. I hold a PhD. in Programming, Leeds University UK. I have been helping students with their homework for the past 12 years. I solve assignments related to C Programming. Visit programminghomeworkhelp.com or email support@programminghomeworkhelp.com.You can also call on +1 678 648 4277 for any assistance with C Programming assignments.

C Programming Homework Help

Programming Homework Help

Linked lists

GowriKumar Chandramouli

Rewrite this code so it can use a generic type instead of integers. This means we can use any data type with it. For example: LinkedList = new LinkedLIst<>(); public class Main { public static void main(String[] args) { /* * Expected output: * * The list: 8 -> 1 -> 5 -> 3 -> 6 * Size: 5 * Head: 8 * Tail: 6 * Removeing 1... * The list: 8 -> 5 -> 3 -> 6 * Size: 4 * Head: 8 * Tail: 6 * Removeing head... * The list: 5 -> 3 -> 6 * Size: 3 * Head: 5 * Tail: 6 * Removeing tail... * The list: 5 -> 3 * Size: 2 * Head: 5 * Tail: 3 */ LinkedList list = new LinkedList(); list.append(5); list.append(3); list.append(6); list.prepend(1); list.prepend(8); printListDetails(list); System.out.println("Removeing 1..."); list.removeByValue(1); printListDetails(list); System.out.println("Removeing head..."); list.removeHead(); printListDetails(list); System.out.println("Removeing tail..."); list.removeTail(); printListDetails(list); } public static void printListDetails(LinkedList list) { System.out.println("The list: " + list.toString()); System.out.println("Size: " + list.size()); System.out.println("Head: " + list.getHead()); System.out.println("Tail: " + list.getTail()); } } ________________________________________ public class LinkedList { private Node head; private Node tail; private int size; public LinkedList() { head = null; tail = null; size = 0; } public void append(int data) { Node newNode = new Node(data); if (head == null) { head = newNode; } else { tail.next = newNode; } tail = newNode; size++; } public void prepend(int data) { Node newNode = new Node(data); if (head == null) { head = newNode; tail = newNode; } else { newNode.next = head; head = newNode; } size++; } public int getHead() { return head.data; } public int getTail() { return tail.data; } public int size() { return size; } public void removeByValue(int data) { Node current = head; while (current.next != null && current.next.data != data) { current = current.next; } if (current.next != null) { current.next = current.next.next; size--; if (current.next == null) { tail = current; } } } public int removeHead() { int removedData = head.data; head = head.next; size--; if (head == null) { tail = null; } return removedData; } public int removeTail() { int removedData = tail.data; if (head == tail) { head = null; tail = null; } else { Node current = head; while (current.next != tail) { current = current.next; } tail = current; tail.next = null; } size--; return removedData; } @Override public String toString() { StringBuilder builder = new StringBuilder(); Node current = head; while (current != null) { builder.append(current.data); if (current.next != null) { builder.append(" -> "); } current = current.next; } return builder.toString(); } private class Node { public Node next; public int data; public Node(int data) { this.data = data; } } }.

Rewrite this code so it can use a generic type instead of integers. .pdf

alphaagenciesindia

Linked Stack program.docx

kudikalakalabharathi

Data Structures in C++ I am really new to C++, so links are really hard topic for me. It would be nice if you can provide explanations of what doubly linked lists are and of some of you steps... Thank you In this assignment, you will implement a doubly-linked list class, together with some list operations. To make things easier, you’ll implement a list of int, rather than a template class. Solution A variable helps us to identify the data. For ex: int a = 5; Here 5 is identified through variable a. Now, if we have collection of integers, we need some representation to identify them. We call it array. For ex: int arr[5] This array is nothing but a Data Structure. So, a Data Structure is a way to group the data. There are many Data Structures available like Arrays, Linked List, Doubly-Linked list, Stack, Queue, etc. Doubly-Linked list are the ones where you can traverse from the current node both in left and right directions. Why so many different types of Data Structures are required ? Answer is very simple, grouping of data, storage of data and accessing the data is different. For example, in case of Arrays we store all the data in contiguous locations. What if we are not able to store the data in contiguous locations because we have huge data. Answer is go for Linked List/Doubly-Linked list. Here we can store the data anywhere and link the data through pointers. I will try to provide comments for the code you have given. May be this can help you. #pragma once /* dlist.h Doubly-linked lists of ints */ #include class dlist { public: dlist() { } // Here we are creating a NODE, it has a integer value and two pointers. // One pointer is to move to next node and other to go back to previous node. struct node { int value; node* next; node* prev; }; // To return head pointer, i.e. start of the Doubly-Linked list. node* head() const { return _head; } // To return Tail pointer, i.e. end of the Doubly-Linked list. node* tail() const { return _tail; } // **** Implement ALL the following methods **** // Returns the node at a particular index (0 is the head). node* at(int index){ int cnt = 0; struct node* tmp = head(); while(tmp!=NULL) { if (cnt+1 == index) return tmp; tmp = tmp->next; } } // Insert a new value, after an existing one void insert(node *previous, int value){ // check if the given previous is NULL if (previous == NULL) { printf(\"the given previous node cannot be NULL\"); return; } // allocate new node struct node* new_node =(struct node*) malloc(sizeof(struct node)); // put in the data new_node->data = new_data; // Make next of new node as next of previous new_node->next = previous->next; // Make the next of previous as new_node previous->next = new_node; // Make previous as previous of new_node new_node->prev = previous; // Change previous of new_node\'s next node if (new_node->next != NULL) new_node->next->prev = new_node; } // Delete the given node void del(node* which){ struct node* head_ref = head(); /* base case */ if(*head_ref == NUL.

Data Structures in C++I am really new to C++, so links are really .pdf

rohit219406

Please finish the int LLInsert function. typedef struct STUDENT { char *Netid; int Midterm; int Final; } STUDENT; typedef char* LLKey; typedef STUDENT LLValue; typedef struct LLNode { LLKey Key; LLValue Value; struct LLNode *Next; } LLNode; typedef struct LL { LLNode *Head; int Count; } LL; // // LLCreate: dynamically creates and returns an empty linked-list: // LL *LLCreate() { LL *list; list = (LL *) malloc(sizeof(LL)); list->Head = NULL; list->Count = 0; return list; } // // LLCompareKeys: compares key1 and key2, returning // value < 0 if key1 < key2 // 0 if key1 == key2 // value > 0 if key1 > key2 // int LLCompareKeys(LLKey key1, LLKey key2) { // NOTE: with STUDENTs, keys are Netids, so use strcmp. if (strcmp(key1, key2) < 0) return -1; else if (strcmp(key1, key2) == 0) return 0; else return 1; } // // LLInsert: inserts the given (key, value) pair into the linked-list such // that the new key is in ascending order with respect to the other keys. // Returns true (non-zero) if the insert was successful, returns false (0) // if the given key is already in the list -- and the given (key, value) // pair is not inserted. // int LLInsert(LL *list, LLKey key, LLValue value) { return 1; // insert was successful: } // inputs and discards the remainder of the current line for the // given input stream, including the EOL character(s): void skipRestOfInput(FILE *stream) { char restOfLine[256]; int rolLength = sizeof(restOfLine) / sizeof(restOfLine[0]); fgets(restOfLine, rolLength, stream); } int main(int argc, char *argv[]) { char netid[16]; int mid, fnl, added; STUDENT s; LL *list = LLCreate(); LLNode *cur = NULL; memdebug_init(0); // 1 => interactive; switch to 0 inside zyLabs scanf(\"%s %d %d\", netid, &mid, &fnl); skipRestOfInput(stdin); while (netid[0] != \'#\') { s.Netid = (char *)malloc((strlen(netid)+1) * sizeof(char)); strcpy(s.Netid, netid); s.Midterm = mid; s.Final = fnl; // add to end of list: LLNode *node; node = (LLNode *) malloc(sizeof(LLNode)); node->Key = s.Netid; node->Value = s; node->Next = NULL; if (cur == NULL) // first time: { list->Head = node; cur = node; } else // new node follows current: { cur->Next = node; cur = node; } list->Count++; scanf(\"%s %d %d\", netid, &mid, &fnl); skipRestOfInput(stdin); } // // now call insert function to see if it works: // scanf(\"%s %d %d\", netid, &mid, &fnl); skipRestOfInput(stdin); s.Netid = (char *)malloc((strlen(netid) + 1) * sizeof(char)); strcpy(s.Netid, netid); s.Midterm = mid; s.Final = fnl; added = LLInsert(list, s.Netid, s); if (!added) { printf(\"**not inserted**\ \"); } else { printf(\"**inserted**\ \"); } // output contents of list: printf(\">>Count=%d\ \", list->Count); cur = list->Head; while (cur != NULL) { printf(\">>%s: %d,%d\ \", cur->Value.Netid, cur->Value.Midterm, cur->Value.Final); cur = cur->Next; } return 0; } Solution PROGRAM CODE: #include #include #include typedef struct STUDENT { char *Netid; int Midterm; int Final; } STUDENT; typedef char* LLKey; typedef STUDENT.

Please finish the int LLInsert function.typedef struct STUDENT {.pdf

fortmdu

Similar to public class SLLT { protected SLLNodeT head, tail; pub.pdf (20)

Linked list

fix the error - class Node{ int data- Node next-.pdf

dynamicList.ppt

Data structure

You can list anything, it doesnt matter. I just want to see code f.pdf

please help me in C++Objective Create a singly linked list of num.pdf

Solutionclass IntNode { int data; public IntNode next,head;.pdf

Create your own Linked list from scratch (singly linked list).So.pdf

#include sstream #include linkylist.h #include iostream.pdf

CSE240 Doubly Linked Lists

137 Lab-2.2.pdf

Add delete at a position to the code and display it to the code- class.pdf

So I have this code(StackInAllSocks) and I implemented the method but.pdf

I need to fill-in TODOs in .cpp file and in .h file Could some.pdf

C Programming Homework Help

Linked lists

Rewrite this code so it can use a generic type instead of integers. .pdf

Linked Stack program.docx

Data Structures in C++I am really new to C++, so links are really .pdf

Please finish the int LLInsert function.typedef struct STUDENT {.pdf

More from clarityvision

Q1:How would this be explained in the witness box, how would this look on the front page of tomorrows newspaper, and how would I explain this to my family? This is the three quick tests applies when an executive may not have time for a long ethical assessment process and he/she needs to respond quickly to an ethical crisis. A- True B-False Q8:A conflict is actual when a personal interest leads a person to act against the interests of an employer or another person whose interests the person is obligated to serve. One the other hand, a situation constitutes a potential conflict of interest when there is the possibility that a person will fail to fulfill an obligation to act in the interests of another, even though the person has not yet done so. A-True B-False Q12:What are the kinds of conflict of interest? A-Exercising biased judgment, engaging in direct competition, misusing a position, and violating confidentiality. B-Exercising biased judgment, engaging in direct competition, and stealing from the company. C-Misusing a position, violating confidentiality and benefiting from the companys perks. D-None of the above. Q13 :Kohlberg's moral development stages in humans states that: A-At the earliest phase the child defers to physical superiority, and does not understand that others have consciousness and desires. The second phase has proper action serving to satisfy the persons own needs. Subsequent phases progress through loyalty and affection within the sphere of immediate family and friends. Then, there is a quantum lift in moral understanding that has the person trying to develop impartial points of view, using self justified moral principles. At last stage is that of seeing moral principles as being universal and consistent. B-A child goes into two phases. The first phase, a child will learn right and wrong based on rewards punishments. The second phase, a child acquired his/her moral understanding through applying the morals of his family members. C-A child has three stages of moral development. First, he/she accepts the moral understanding of his family. Second, he/she acquires moral principles from school and friends. Third, he/she develop his/her personal moral principles based on what he/she acquired from family and school. D-None of the above. Q15:What was/were the reasons of the collapse of Enron? A-The conflict of interests between the two roles played by Arthur Anderson, as auditor but also as consultant to Enron, and the lack of attention shown by members of the Enron board of directors to the off-books financial entities with which Enron did business. B-The bad economy at that time. C-The arrogance of the top managers and their beliefs that they do no wrong..

Q1How would this be explained in the witness box, how would this lo.pdf

clarityvision

Professor Lessiarty directs an underground network of n criminal masterminds called Lessiartys Web. He has heard that famed detective Sherlatch Houses is hot on his trail and needs to decide whether to issue an attack on detective Houses. Professor Lessiarty decides to consult with the Web and compiles a list of n polls, where each poll is a tuple matching a different Web members name with their integer opinion on the topic. Opinion +x means they are for attacking Houses with strength x, while opinion x means they are against attacking Houses with strength x. Lessiarty wants to generate a list containing the names of the lg n Web members that have the strongest opinions (breaking ties arbitrarily), so he can arrange a secret meeting to discuss with them further. Describe an O(n)-time algorithm to generate Lessiartys list..

Professor Lessiarty directs an underground network of n criminal maste.pdf

clarityvision

Shell to be modified #include #include #include #include #include #include #include #include // Simplifed xv6 shell. #define MAXARGS 10 // All commands have at least a type. Have looked at the type, the code // typically casts the *cmd to some specific cmd type. struct cmd { int type; // ' ' (exec), | (pipe), '<' or '>' for redirection }; struct execcmd { int type; // ' ' char *argv[MAXARGS]; // arguments to the command to be exec-ed }; struct redircmd { int type; // < or > struct cmd *cmd; // the command to be run (e.g., an execcmd) char *file; // the input/output file int mode; // the mode to open the file with int fd; // the file descriptor number to use for the file }; struct pipecmd { int type; // | struct cmd *left; // left side of pipe struct cmd *right; // right side of pipe }; int fork1(void); // Fork but exits on failure. struct cmd *parsecmd(char*); // Execute cmd. Never returns. void runcmd(struct cmd *cmd) { int p[2], r; struct execcmd *ecmd; struct pipecmd *pcmd; struct redircmd *rcmd; if(cmd == 0) exit(0); switch(cmd->type){ default: fprintf(stderr, "unknown runcmd\n"); exit(-1); case ' ': ecmd = (struct execcmd*)cmd; if(ecmd->argv[0] == 0) exit(0); fprintf(stderr, "exec not implemented\n"); // Your code here ... break; case '>': case '<': rcmd = (struct redircmd*)cmd; fprintf(stderr, "redir not implemented\n"); // Your code here ... runcmd(rcmd->cmd); break; case '|': pcmd = (struct pipecmd*)cmd; fprintf(stderr, "pipe not implemented\n"); // Your code here ... break; } exit(0); } int getcmd(char *buf, int nbuf) { if (isatty(fileno(stdin))) fprintf(stdout, "$ "); memset(buf, 0, nbuf); fgets(buf, nbuf, stdin); if(buf[0] == 0) // EOF return -1; return 0; } int main(void) { static char buf[100]; int fd, r; // Read and run input commands. while(getcmd(buf, sizeof(buf)) >= 0){ if(buf[0] == 'c' && buf[1] == 'd' && buf[2] == ' '){ // Clumsy but will have to do for now. // Chdir has no effect on the parent if run in the child. buf[strlen(buf)-1] = 0; // chop \n if(chdir(buf+3) < 0) fprintf(stderr, "cannot cd %s\n", buf+3); continue; } if(fork1() == 0) runcmd(parsecmd(buf)); wait(&r); } exit(0); } int fork1(void) { int pid; pid = fork(); if(pid == -1) perror("fork"); return pid; } struct cmd* execcmd(void) { struct execcmd *cmd; cmd = malloc(sizeof(*cmd)); memset(cmd, 0, sizeof(*cmd)); cmd->type = ' '; return (struct cmd*)cmd; } struct cmd* redircmd(struct cmd *subcmd, char *file, int type) { struct redircmd *cmd; cmd = malloc(sizeof(*cmd)); memset(cmd, 0, sizeof(*cmd)); cmd->type = type; cmd->cmd = subcmd; cmd->file = file; cmd->mode = (type == '<') ? O_RDONLY : O_WRONLY|O_CREAT|O_TRUNC; cmd->fd = (type == '<') ? 0 : 1; return (struct cmd*)cmd; } struct cmd* pipecmd(struct cmd *left, struct cmd *right) { struct pipecmd *cmd; cmd = malloc(sizeof(*cmd)); memset(cmd, 0, sizeof(*cmd)); cmd->type = '|'; cmd->left = left; cmd->right = right; return (struct cmd*)cmd; } // Parsing char whitespace[] = " \t\r\n\v"; char symbols[] = "<|>"; int ge.

Shell to be modified#include stdlib.h #include unistd.h .pdf

clarityvision

Project: Advanced Inventory Management System Upgrade for ABC Biopharmaceuticals Ltd. Project Duration: 12-18 months Budget: $1 million (fixed) Project Description: ABC Biopharmaceuticals Ltd. specializes in manufacturing in vitro diagnostic rapid test kits for various diseases, including COVID-19, dengue, influenza, syphilis, and hepatitis A, B, and C. The company has recognized the need to modernize its inventory management system to improve operational efficiency, reduce costs, and ensure regulatory compliance. This project aims to design and implement a customized inventory management solution tailored to the specific needs of the biopharmaceutical industry. Project Objectives: Enhance Inventory Control: Implement a robust inventory management system to gain real-time visibility into inventory levels, track product expiration dates, and reduce inventory holding costs. Streamline Procurement Processes: Optimize procurement processes to ensure timely replenishment of stock, reduce lead times, and minimize excess inventory. Minimize Stockouts: Implement demand forecasting and replenishment algorithms to minimize the occurrence of stockouts and ensure product availability. Regulatory Compliance: Ensure the new system complies with relevant regulatory requirements for the biopharmaceutical industry, including traceability and reporting. Cost Reduction: Identify cost-saving opportunities by reducing overstocking and implementing efficient inventory practices. Technical Requirements: Inventory Management Software: Customized inventory tracking and management software Real-time inventory visibility Barcode scanning capability for product tracking Integration with accounting and procurement systems User-friendly interface for staff Demand Forecasting: Advanced demand forecasting algorithms Seasonal demand prediction Historical sales data analysis Forecast accuracy monitoring Procurement Optimization: Automated purchase order generation based on reorder points Supplier performance tracking Vendor management tools Supplier communication and collaboration features Regulatory Compliance: Serialization and traceability features Audit trail for compliance reporting Integration with relevant regulatory databases and reporting systems Data Security: Robust data encryption User authentication and access controls Regular security audits and updates Integration Capabilities Seamless integration with existing accounting, procurement, and ERP systems. API support for third-party integrations with regulatory databases and reporting tools. Reporting and Analytics Create customizable reports for inventory turnover, stockout analysis, supplier performance, and compliance reporting. Real-time analytics dashboard for insights. Scalability: Ability to scale the system as the company grows Support for adding new product lines or categories Technical Specification Programming Languages and Frameworks: Web-based application development using modern languages and framewo.

Project Advanced Inventory Management System Upgrade for ABCBio.pdf

clarityvision

Scenario 3 Capacity and Legality Micah was a talented tennis player and started playing competitively in 2019 when he was sixteen. Many of the tournaments required participants to sign an exculpatory clause in order to participate. One of Micah's parents signed the agreements. In 2021, Micah participated in the regional tennis championships in Columbus Georgia. During the event, several players crashed into each other and Micah sustained an injury to his back, leaving him partially paralyzed. Micah filed a negligence lawsuit against the tournament organizers. The organizers could not find the exculpatory clause that Micah signed for the event. The organizers argued that Micah must have signed the agreement to enter the tournament, but even if he had not signed one, his participation in the event demonstrated his intent to be bound by the terms of the agreement. Did Micah have contractual capacity to enter the contract in 2019? Why or why not? If Micah did not actually sign the exculpatory clause, could a court conclude that he impliedly accepted its terms by participating in the tournament? Why or why not? How would you rule in both of these situations? Support your answer with scholarly material and case law..

Scenario 3 Capacity and Legality Micah was a talented tennis player a.pdf

clarityvision

Scenario 2: Types of Contracts Dr. Brown was an adjunct instructor at North State University (NSU) in Michigan. Each semester, near the beginning of each term, the parties executed a written contract that always included the following provision: The parties acknowledge that this agreement may be cancelled by NSU or the instructor at any time before the first class session. In the spring semester of Browns sixth year, he filed a complaint with NSU claiming that one of his students, Sylvia Davis, had engaged in inappropriate and disruptive classroom conduct. Brown gave her an incomplete grade and asked NSU to request her to apologize as a condition of receiving a final grade. NSU claimed, and Brown denied, that he was told to assign Davis a grade if he wanted to teach in the fall. Toward the end of the semester, Brown was told which classes he would teach in the fall, but the parties did not sign a written contract. The Wednesday before classes began, NSU terminated him. Brown filed a suit against NSU and others, alleging breach of contract. Did the parties have a contract? If so, what type of contract did they have. Did NSU breach it? Explain..

Scenario 2 Types of Contracts Dr. Brown was an adjunct instructor at.pdf

clarityvision

PROJECT 2 Construction of a Medical Clinic Many people were severely and negatively affected by COVID-19 losing many loved ones. There is need to construct a medical clinic to service one community in which, many people had to travel a long distance in order to reach a clinic facility. Pay attention to the following project information: Cost R50 million Return on Investment 10% Time to market 36 months Risk factor Low Chances of success High There should be a minimum of 10 resources to manage this project. You have been given five resources. Add the remaining five resources. Resource Role Cost (per hour) 1. Project Manager Developing project documents R500 2. Accounts Manager Drawing up a budget R500 3. Human Resources Manager Determining employee availability R500 4. Salesperson Negotiating client requirements R300 5. Production Manager Managing the entire event R500 6. IT manager R500 7. operations manager R500 8. Staff manager R500 9. emergency R200 10. Administration R500 Question 6 Using any tool of your choice , create the RESPONSIBILITY MATRIX clearly determining the primary and support roles for each work item for your chosen project..

PROJECT 2Construction of a Medical ClinicMany people were severe.pdf

clarityvision

Procuring textiles made from recycled fibres Background The Ministry of Defence of the Kingdom of the Netherlands (MODNL) is a large public sector buyer, employing around 58,800 people across the army, air force, military police and other supporting roles. It is also is one of 45 public and private parties brought together by the Dutch Government's Circular Procurement Green Deal, which tasked participants with carrying out two circular procurement initiatives between 2013 and 2016 in order to increase knowledge and accelerate the transition to a circular economy. One area of focus identified by the MODNL was textiles, due to its need to equip its large numbers of personnel with uniforms and other textile products. Textile production is linked with a number of environmental and social problems. These impacts can vary depending on the type or mix of fibre that a product is made from, but in general, the energy to transform raw materials and manufacture new fibres in the production of textiles has a significant carbon footprint, and the eco-toxicity of many industrial inputs (such as dyes) can result in water, air and terrestrial pollution, damaging ecosystems as well as risking human health (particularly for workers in the supply-chain subject to inadequate working conditions). As such, textiles are ranked as the product category with the fourth greatest environmental impact, after food and drink, transport and housing.1 New textiles are normally derived from either natural fibres such as cotton (where water-use plus the pollution and emissions arising from fertilisers and pesticide production and use can be high) or synthetic fibres such as polyester or nylon, which are derived from fossil fuels. However, a third option - recycled fibres - also exists, and by seeking to procure textiles containing recycled content, the MODNL realised it would be able to drastically reduce the environmental impacts of its procurement, while also supporting manufacturers repurposing the vast amounts of textile waste created each year in Europe. Procurement Approach The MODNL began exploring the market for recycled textiles in January 2014 by publishing a Request for Information, and conducting an open meeting for sector-related suppliers. The aim of this market engagement was to assess possibilities for requiring recycled fibres to be used in the production of certain items. The market research SCM 322 02 Case demonstrated that manufacturers were able to meet requirements around the use of recycled content, and that to facilitate this, the MODNL should focus on functional instead of descriptive technical specifications i.e. focus on an items ability to perform its use rather than technical values such as tensile strength. As a result, the MODNL decided to pilot reused fibre requirements in three lots: towels and wash cloths, overalls, and scarves and handkerchiefs. Criteria used in the procurement process Subject matter of the contract Procuring towels and over.

Procuring textiles made from recycled fibresBackgroundThe Mini.pdf

clarityvision

Read the following excerpt and answer the questions that follow Please note all questions are based on the below The need to develop global managers has been widely recognised in literature (Holopainen and Bjorkman, 2005; Riusala, 2000 and Suutari, 1999). For example, 85 per cent of the Fortune 500 firms surveyed do not think that they have an adequate number of global leaders (Gregersen et all, 1998). International assignment is seen as one of the major tools and a powerful strategy for developing global leaders. In line with this, Derr (1993) states that expatriation is the top strategy for internationalising a young manager. The foreign assignment is also a good management tool as the assignment is generally a higher position than the previous domestic one and this makes the assignment an important learning opportunity for the expatriate. As organisations become globalised, there is an increasing challenge to use expatriates on international assignments to complete strategically critical tasks (Gregersen & Black 1992, Brewster 1998, Downes & Thomas 1999). Multinational corporations (MNCs) use expatriates, not only for corporate control and expertise reasons in vital global markets, but also to facilitate entry into new markets or to develop international management competencies (Bird & Dunbar 1991, Boyacigiller 1991, Rosenzweig 1994, Shaffer, Harrison & Gilley 1999, Forster 2000). While it is recognised that Human Resource Management (HRM) problems are more complex in the international environment, there is also increased evidence to suggest that the management of international human resources is increasingly being acknowledged as a major determinant of success or failure in international business (Tung 1984, Dowling 1999, Hiltrop 1999). For renowned and established MNCs, failure to be able to communicate and coordinate their activities in international business has the potential to plunge them into a crisis. The crises confronting MNCs includes failed assignments due to premature return of expatriates and the loss of their returned expatriates due to poor repatriation. These crises, due to poor expatriate management, can therefore threaten the organisations performance and capabilities in the international arena. Expatriates may be losing their security blanket, but the challenges and potential longterm rewards of taking an international assignment are growing. Most global organisations see international experience as a prerequisite for promotion to the top jobs. Although this experience can be gained from working in crossborder teams and projects, expatriation remains the preferred way of creating a global mindset amongst managers. However, there is a need for new skills and abilities amongst expatriates, and for far more careful planning and monitoring of assignments by organisational headquarters. The literature on expatriate management tends to take one of two perspectives. First, much literature focuses on the individual expatriate's.

Read the following excerpt and answer the questions that followPle.pdf

clarityvision

Question 4 Read the case study about Ms Zandi and then answer the following questions. Ms Zandi is the Grade 4 Social Science teacher at an urban school. She has 40 learners in her class who come from diverse backgrounds. Over the first term of the year, she has acquired an in- depth knowledge of her learners. She has become aware of the diversity amongst them in terms of language proficiency, reading and writing competence, interests, learning preferences, learning behaviours, attitudes to learning, motivational levels, prior knowledge and levels of achievement in 7 INC3701/103/2023 numeracy. She has one learner, Mbali, who is hearing impaired and underperforms in Social Sciences. Ms Zandi believes that Mbali can do better if given support. Three learners are new to the school. From her assessments, Ms Zandi realises that they are functioning below the grade level in Social Sciences. They have not mastered a lot of the content and skills in the Grade 2 and 3 Social Sciences curricula. They are struggling with reading and writing skills in the language of teaching and learning, which is English. Although they are working hard, they need to be closely supervised especially during group work, or they become playful and do not focus on the task at hand. Ms Zandi has four learners in her class who are highly motivated and have a special liking for, curiosity about, and interest in Social Sciences. Ms Zandi tries her best to stimulate them and provide them with a more enriching and expanded curriculum. Njabulo appears to have developmental delays and, speaking to his previous teachers, she learns that he has made progress but is below the grade level in most subjects. In addition, she has Karabo in her class, a pleasant child who tries hard when Ms Zandi works with him individually. He enjoys practical activities and working with manipulatives but is easily distracted. He has gaps in Social Sciences learning and has not mastered some of the content in the Grade 2 and 3 curricula. 4.1. What challenges does Ms Zandi face with the three new learners in her class? [3] 4.2. Which support do you think Mbali should be given and why? [3] 4.3. How would you support the four highly motivated learners in Ms Zandi's class who have a special interest in Social Sciences? Mention four ways. [4] 4.4 Identify five strategies you would suggest to Ms Zandi to ensure that all learners are included and that they are not prejudged based on how they are grouped. [10] [20] Question 4 Read the case study about Ms Zandi and then answer the following questions. Ms Zandi is the Grade 4 Social Science teacher at an urban school. She has 40 leamers in her class who come from diverse backgrounds: Over the first term of the year, she has acquired an in-depth knowledge of her learners. She has become aware of the diversity amongst them in terms of language proficiency, reading and writing competence, interests, learning prefertences, learning behaviours, atstudes to leaming. moti.

Question 4 Read the case study about Ms Zandi and then answer the fo.pdf

clarityvision

More from clarityvision (10)