include ltinitializer_listgt include ltiostreamgt .pdf

•

0 likes•4 views

#include <initializer_list> #include <iostream> #include <iterator> #include <utility> /************************************************************/ template<typename T> struct ListNode { ListNode () : data () { } ListNode (const T& v) : data (v) { } ListNode (const T& v, ListNode* n, ListNode* p) : data (v), next (n), prev (p) { } // unhooks the range [begin,end] from a linked list // NOTE: will lose reference to begin and end if you // are not keeping track of it! // // - does not create any new nodes // - does not destroy any existing nodes // - begin is start of range to remove // - end is inclusive end of range to remove // // [5] static void unhook_range (ListNode* begin, ListNode* end) { // TODO } // inserts the range [first,last] before this // NOTE: does not create any new nodes, does not destroy any existing nodes // // [5] void hook_range (ListNode* first, ListNode* last) { // TODO } // insert first before this void hook (ListNode* first) { hook_range (first, first); } // unhooks current node from linked list void unhook () { ListNode::unhook_range (this, this); } T data; ListNode* next{nullptr}; ListNode* prev{nullptr}; }; Please complete the implementation of the missing part marked TODO..

Education

$#include <initializer_list> #include <iostream> #include <iterator> #include <utility> /************************************************************/ template<typename T> struct ListNode { ListNode () : data () { } ListNode (const T& v) : data (v) { } ListNode (const T& v, ListNode* n, ListNode* p) : data (v), next (n), prev (p) { } // unhooks the range [begin,end] from a linked list // NOTE: will lose reference to begin and end if you // are not keeping track of it! // // - does not create any new nodes // - does not destroy any existing nodes // - begin is start of range to remove // - end is inclusive end of range to remove // // [5] static void unhook_range (ListNode* begin, ListNode* end) { // TODO } // inserts the range [first,last] before this // NOTE: does not create any new nodes, does not destroy any existing nodes // // [5] void hook_range (ListNode* first, ListNode* last) { // TODO } // insert first before this$

$void hook (ListNode* first) { hook_range (first, first); } // unhooks current node from linked list void unhook () { ListNode::unhook_range (this, this); } T data; ListNode* next{nullptr}; ListNode* prev{nullptr}; }; Please complete the implementation of the missing part marked TODO.$

Similar to include ltinitializer_listgt include ltiostreamgt .pdf

There are a number of errors in the following program. All errors are located in main() and structure definitions. Function declarations and definitions are correct! Locate all errors, fix them (as shown below), run the program and save its output as a comment at the end of the source file. Example: int num = 10; int *ptr; num = &ptr; // <== Error: Comment the line and write the correct line below // Write a short justification where appropriate // num = &ptr; // Error #1 ptr = &num; Name: */ #include <stdio.h> #include <string.h> #include <stdlib.h> #include <time.h> #define DUMMY_TRAILER '\177' // octal ASCII code of the // last character in the ASCII table #define NUM_CITIES 10 typedef struct { char name[12]; int temperature[5]; } CITY; // Stack and Queue Node typedef struct node NODE; struct node { CITY city; node *next; }; // Doubly Linked List Node typedef struct d_node D_NODE; struct d_node { CITY city; NODE *forw; NODE *back; }; // Stack Functions NODE *push(NODE *stack, const CITY *pStu); NODE *pop(NODE **stack); // Queue Functions void enqueue(NODE **queue, NODE **rear, const CITY *pStu); NODE *dequeue(NODE **queue, NODE **rear); // Doubly Linked List Functions D_NODE *init_list(void); int insert(D_NODE *list, const CITY *pStu); void traverse_forw(D_NODE *list); void traverse_back(D_NODE *list); // Other Functions void printCity(const CITY *pCity); int main (void) { CITY cList[NUM_CITIES] = { {"Cupertino", {88, 89, 87, 85, 89}}, {"Flagstaff", {81, 80, 88, 89, 89}}, {"Los Angeles", {87, 88, 89, 89, 90}}, {"Philadelphia", {96, 99, 99, 90, 95}}, {"Phoenix", {106, 109, 109, 100, 105}}, {"Portland", {89, 90, 85, 89, 90}}, {"Reno", {108, 105, 109, 100, 108}}, {"Salem", {85, 90, 85, 89, 90}}, {"Tucson", {107, 100, 109, 100, 108}}, {"Yreka", {101, 109, 100, 108, 109}} }; NODE *stack = NULL; NODE *top = NULL; NODE *queue = NULL, *rear = NULL; NODE *front; D_NODE *list; list = init_list(); // build stack and queue with data from an array of CITY structures srand((unsigned int)time(NULL)); int count = rand() % 10; for ( int n = 0; n < count; n++) { int i = rand() % NUM_CITIES; int duplicate = insert(list, &cList[i]); if(duplicate) { // already in the list! push(stack, &cList[i]); enqueue(&queue, &rear, cList[i]); } } // display list printf("\nLIST contents (forwards):\n"); traverse_forw(list); printf("\nLIST contents (backwards):\n"); traverse_back(list); // display stack if (top) { printf("\nSTACK contents from top to bottom:\n"); while ((top = pop(stack))) { printCity(top->city); } } else printf ("Empty Stack!\n"); // display queue if (front) { printf("\nQUEUE contents from front to rear:\n"); while ((front = dequeue( queue, rear))) { printCity(front->city); } } else printf ("Empty Queue!\n"); return 0; } /*************************************************** Displays the fileds of a CIS_CLASS structure Pre pCls - a pointer to a CIS_CLASS structure Post */ void printCity(const CITY *pCity) { printf("%-20s %3d\n", pCity->name, pCity->temperatur.

There are a number of errors in the following program- All errors are.docx

clarkjanyce

Week 2 - Advanced C++list1.txt312220131197.docx

melbruce90096

__MACOSX._assign3assign3.DS_Store__MACOSXassign3._.D.docx

odiliagilby

main.cpp /* Build and procees a sorted linked list of Patient objects. The list is sorted in ascending order by name. Assume that the name is unique. */ #include <iostream> #include <iomanip> #include <fstream> #include <sstream> #include <string> #include <cctype> #include "LinkedList.h" using namespace std; void buildList(const string &filename, LinkedList &list); void deleteManager(LinkedList &list); void searchManager(const LinkedList &list); void displayManager(const LinkedList &list); int main() { string inputFileName; LinkedList list; cout << "Enter file name: "; getline(cin, inputFileName); buildList(inputFileName, list); displayManager(list); searchManager(list); deleteManager(list); displayManager(list); return 0; } /* This function reads data from a file and inserts them into a sorted linked list. The list is sorted in ascending order by name */ void buildList(const string &filename, LinkedList &list) { ifstream inFile(filename); cout << "Reading data from "" << filename << ""n"; if(!inFile) { cout << "Error opening the input file: ""<< filename << """ << endl; exit(EXIT_FAILURE); } string id; int year; string name; int amount; string line; while (getline(inFile, line)) { stringstream temp(line); temp >> id >> year; temp.ignore(); getline(temp, name, ';'); temp >> amount; // create a Sales object and initialize it with data from file /* Write your code here */ // call insert to insert this new Sales object into the sorted list /* Write your code here */ } inFile.close(); } /* Delete manager: delete items from the list until the user enters Q to quit deleting Input Parameter: list */ void deleteManager(LinkedList &list) { string target = ""; cout << " Delete" << endl; cout << "========" << endl; while(target != "Q") { cout << "Enter a name (or Q to stop deleting):" << endl; getline(cin, target); target[0] = toupper(target[0]); if(target != "Q") { if(list.deleteNode(target)) cout << target << " has been deleted!" << endl; else cout << target << " not found!" << endl; } } cout << "___________________END DELETE SECTION_____" << endl; } /* Search manager: search the list until the user enters Q to quit searching Input Parameter: list */ void searchManager(const LinkedList &list) { string target = ""; Sales obj; cout << " Search" << endl; cout << "========" << endl; /* Write your code here */ cout << "___________________END SEARCH SECTION _____" << endl; } /* Display manager: all, average, or year hired reports including header and footer where appropriate, depending on the user's choice; displays the number of nodes (always) Input Parameter: list */ void displayManager(const LinkedList &list) { // Sub-functions of displayManager() void showMenu(void); string getOption(void); void showHeader(string line); string line = "==== ==================== =============n"; string option; showMenu(); option = getOption(); while(option[0] != 'Q') { switch (option[0]) { case 'A': showHeader(line); list.displayList(); cout << line; break; case 'G': cou.

maincpp Build and procees a sorted linked list of Patie.pdf

adityastores21

This assignment and the next (#5) involve design and development of a sequential non contiguous and dynamic datastructure called LinkedList. A linked list object is a container consisting of connected ListNode objects. As before, we are not going to use pre-fabricated classes from the c++ library, but construct the LinkedList ADT from scratch. The first step is construction and testing of the ListNode class. A ListNode object contains a data field and a pointer to the next ListNode object (note the recursive definition). #This assignment requires you to 1. Read the Assignment 4 Notes 2. Watch the Assignment 4 Support video 3. Implement the following methods of the ListNode class -custom constructor -setters for next pointer and data 4. Implement the insert and remove method in the main program 5. Scan the given template to find the above //TODO and implement the code needed //TODO in ListNodecpp.h file public: ListNode(T idata, ListNode<T> * newNext); public: void setNext(ListNode<T> * newNext); public: void setData(T newData); // TODO in main program void remove(ListNode<int> * &front,int value) void insert(ListNode<int> * &front,int value) # The driver is given ListNodeMain.cpp is given to you that does the following tests 1. Declares a pointer called front to point to a ListNode of datatype integer 2. Constructs four ListNodes with data 1,2,4 and adds them to form a linked list. 3. Inserts ListNode with data 3 to the list 4. Removes node 1 and adds it back to test removing and adding the first element 5. Removes node 3 to test removing a middle node 6. Removes node 4 to test removing the last node 7. Attempt to remove a non existent node 8. Remove all existing nodes to empty the list 9. Insert node 4 and then node 1 to test if insertions preserve order 10.Print the list Main.cpp #include <iostream> #include "ListNodecpp.h" // REMEMBER each ListNode has two parts : a data field // and an address field. The address is either null or points to the next node //in the chain //Requires: integer value for searching, address of front //Effects: traverses the list node chain starting from front until the end comparing search value with listnode getData. Returns the original search value if found, if not adds +1 to indicate not found //Modifies: Nothing int search(ListNode<int> * front, int value); //Requires: integer value for inserting, address of front //Effects: creates a new ListNode with value and inserts in proper position (increasing order)in the chain. If chain is empty, adds to the beginning //Modifies: front, if node is added at the beginning. //Also changes the next pointer of the previous node to point to the //newly inserted list node. the next pointer of the newly inserted pointer //points to what was the next of the previous node. //This way both previous and current links are adjusted //******** NOTE the use of & in passing pointer to front as parameter - // Why do you think this is needed ?********** void insert(ListNode<int> * &fr.

This assignment and the next (#5) involve design and development of a.pdf

EricvtJFraserr

StackInterface An interface for the ADT stack. Do not modif.pdf

ARCHANASTOREKOTA

AvlTree.h #ifndef AVL_TREE_H #define AVL_TREE_H #include "dsexceptions.h" #include <iostream> // For NULL #include <queue> // For level order printout #include <vector> #include <algorithm> // For max() function using namespace std; // AvlTree class // // CONSTRUCTION: with ITEM_NOT_FOUND object used to signal failed finds // // ******************PUBLIC OPERATIONS********************* // Programming Assignment Part I // bool empty( ) --> Test for empty tree @ root // int size( ) --> Quantity of elements in tree // int height( ) --> Height of the tree (null == -1) // void insert( x ) --> Insert x // void insert( vector<T> ) --> Insert whole vector of values // void remove( x ) --> Remove x (unimplemented) // bool contains( x ) --> Return true if x is present // Comparable findMin( ) --> Return smallest item // Comparable findMax( ) --> Return largest item // boolean isEmpty( ) --> Return true if empty; else false // void printTree( ) --> Print tree in sorted (in) order // void printPreOrder( ) --> Print tree in pre order // void printPostOrder( ) --> Print tree in post order // void printInOrder( ) --> Print tree in *in* order // Programming Assignment Part II (microassignment) // void makeEmpty( ) --> Remove and delete all items // void ~AvlTree( ) --> Big Five Destructor // AvlTree(const AvlTree &other) --> BigFive Copy Constructor // AvlTree(const AvlTree &&other) --> BigFive Move Constructor // AvlTree &operator= ( AvlTree & other ) --> Big Five Copy *assignment* operator // AvlTree &operator= ( AvlTree && other ) --> Big Five Move *assignment* operator // void printLevelOrder( ) --> Print tree in LEVEL order :-) // ******************ERRORS******************************** // Throws UnderflowException as warranted template <typename Comparable> class AvlTree { public: /** * Basic constructor for an empty tree */ AvlTree( ) : root( NULL ) { //cout << " [d] AvlTree constructor called. " << endl; } /** * Vector of data initializer (needed for move= operator rvalue) */ AvlTree( vector<Comparable> vals ) : root( NULL ) { insert(vals); } //******************************************************************************************* // START AVL TREES PART II - TODO: Implement // Other functions to look for include: clone, makeEmpty, printLevelOrder /** * Destroy contents of the AvlTree object - Big Five Destructor */ ~AvlTree( ) { //cout << " [d] AvlTree Destructor called. " << endl; // Empty out the AVL Tree and destroy all nodes (makeEmpty?) } /** * Copy other to new object - Big Five Copy Constructor */ AvlTree( const AvlTree &other ) : root( NULL ) { cout << " [d] Copy Constructor Called." << endl; // Copy contents of other to ourselves (maybe clone?) // Get a deep copy of other's tree } /* ...

AvlTree.h#ifndef AVL_TREE_H#define AVL_TREE_H#include d.docx

rock73

Fix my code: Code: /*************************************************************************** * A Linked List class with a private static inner Node class. * *****************************************************************************/ import java.util.*; public class MySingleLinkedList { private Node head; /** * Constructs an empty list */ public MySingleLinkedList() { head = null; } /** * Returns true if the list is empty * @return true/false - empty/not empty */ public boolean isEmpty() { return head == null; } /** * Inserts a new node at the beginning of this list. * @param item - element to add * */ public void addFirst(E item) { head = new Node(item, head); } /** * Returns the first element in the list. * @return the head of the list * @exception NoSuchElementException if an empty list */ public E getFirst() { if(head == null) throw new NoSuchElementException(); return head.data; } /** * Removes the first element in the list. * @return head of the list * */ public E removeFirst() { E tmp = getFirst(); head = head.next; return tmp; } /** * Inserts a new node to the end of this list. * @param item - the element to add at the end of list */ public void addLast(E item) { if( head == null) addFirst(item); else { Node tmp = head; while(tmp.next != null) tmp = tmp.next; tmp.next = new Node(item, null); } } /** * Removes all nodes from the list. * */ public void clear() { head = null; } /** * Inserts a new node after the first appearance of the node containing the key * @param key - the data of existing node included in the list * @param toInsert - the data of the new node to be inserted */ public void insertAfter(E key, E toInsert) { Node tmp = head; while(tmp != null && !tmp.data.equals(key)) tmp = tmp.next; if(tmp != null) tmp.next = new Node(toInsert, tmp.next); } /* * ================================ The following functions need to be filled =================================================== * */ /** * Returns the last element in the list. * @return last element in the list * @throws NoSuchElementException if the list is empty */ public E getLast() { // TODO: please fill your code here. Node tmp = head; while(tmp.next != null) { tmp = tmp.next; } return tmp.data; } /** * Returns true if this list contains the specified element. * @param item - element to be checked * @return True - if contained; otherwise False * */ public boolean contains(E item) { Node tmp = head; while (tmp != null && !tmp.data.equals(item)) tmp = tmp.next; if (tmp.data.equals(item) ) { return true; } return false; } /** * Returns the data at the specified position in the list. * @param the position index * @return the data contained at the given position index * @throws IndexOutOfBoundsException if pos is larger than the size of list * */ public E get(int pos) { Node tmp = head; int i = 0; while (i < pos) { i++; tmp = tmp.next; } return tmp.data; } /** * Inserts a new node before the first appearance of the node containing the key. * @param key the data of existing.

Fix my codeCode.pdf

Conint29

How do you stop infinite loop? Because I believe that it is making an infinite circular list. c++ code: Here is the list class: #ifndef LIN_J_LIST #define LIN_J_LIST typedef unsigned int uint; #include #include using namespace std; /** * a simplified generic singly linked list class to illustrate C++ concepts * @author Jerry Lin * @version 2/17/17 */ template< typename Object > class List { private: /** * A class to store data and provide a link to the next node in the list */ class Node { public: /** * The constructor * @param data the data to be stored in this node */ explicit Node( const Object & data ) : data{ data }, next{ nullptr } {} Object data; Node * next; }; public: /** * The constructor for an empty list */ List() : size{ 0 }, first{ nullptr }, last{ nullptr } {} /** * the copy constructor-creates and copy the list */ List( List && rhs ) = delete; List( const List & rhs ) { count = 0; size = 0; if(rhs.size != 0) { push_front(rhs.front()); Node * current = rhs.first; Node * tempNode = first; size++; while(current->next != nullptr) { current = current->next; Node *newNode = new Node(current->data); //transfer the data. basic op. count++; tempNode->next = newNode; last = newNode; tempNode = tempNode->next; size++; } } // you document and implement this method } /** * the operator= method-copies the list */ List & operator=( List && rhs) = delete; List & operator=( const List & rhs ) { count = 0; size = 0; if( size != 0 ) { Node * current = first; Node * temp; while( current != nullptr ) { temp = current; current = current->next; delete temp; } } if(rhs.size!= 0) { push_front(rhs.front()); Node * current = rhs.first; Node * tempNode = first; //create a temporary to store size++; while(current -> next != nullptr) { current = current->next; Node *newNode = new Node(current->data); //transfer the data. basic op count++; tempNode->next = newNode; last = newNode; tempNode = tempNode -> next; size++; } } return *this; // you document and implement this method } /** * accessor * @return count */ int get_count() const { return count; } /** * The destructor that gets rid of everything that\'s in the list and * resets it to empty. If the list is already empty, do nothing. */ ~List() { if( size != 0 ) { Node * current = first; Node * temp; while( current != nullptr ) { temp = current; current = current->next; delete temp; } } } /** * Put a new element onto the beginning of the list * @param item the data the new element will contain */ void push_front( const Object& item ) { Node * new_node = new Node( item );//basic op. if(is_empty()) { last = new_node; } else { new_node->next = first; } first = new_node; size++; /* you complete the rest */ } /** * Remove the element that\'s at the front of the list. Causes an * assertion error if the list is empty. */ void pop_front() { assert( !is_empty() ); Node * temp = first; if( first == last ) { first = last = nullptr; } else { first = first->next; } delete temp; size--; } /** * Accessor to return the da.

How do you stop infinite loop Because I believe that it is making a.pdf

feelinggift

please read below it will tell you what we are using /** * LinkedList.java * * Replace all //TODO tags with your code * * Note that below the "//TODO" tag there may be * something like "return null;", "return 0;", etc. * That line is just "stubbed in" so the class * will compile. When you add your code (one or many * statements), you will want to delete the "stubbed" line. * By "stubbed in" we mean "mocked" or "faked in" temporarily. * * When testing, construct using the static factory methods: LinkedList.newEmpty() LinkedList.from(arrayElements) */ package model.list; import java.lang.reflect.Array; import java.util.concurrent.atomic.AtomicInteger; import java.util.function.BiFunction; import java.util.function.Consumer; import java.util.function.Function; import model.linearpub.DynamicList; import model.linearpub.StructureIterator; //This class is NOT java.util.LinkedList public class LinkedList<E> implements DynamicList<E> { //--------------------------------- // Instance Variables //TODO - declare instance variable(s) //--------------------------------- // Private Constructor /** Constructs and returns new LinkedList (no args constructor) */ private LinkedList() { } //-------------------- List Statistics --------------------- /** * Return number of elements in this list. */ @Override public int size() { //TODO return 0; } /** * Return true is this list contains no elements. */ @Override public boolean isEmpty() { //TODO return false; } //------------------ Accessing Elements -------------------- /** * Return element at given index. * Throws IndexOutOfBoundsException if passed index is invalid. */ @Override public E get(int index) { //TODO return null; } /** * Return first element * Throws RuntimeException if list is empty */ @Override public E first() { //TODO return null; } /** * Return last element * Throws RuntimeException if list is empty */ @Override public E last() { //TODO return null; } /** * Return a new list containing the elements of this list * between the given index "start" (inclusive) and * the given index "stop" (exclusive). * Throws IndexOutOfBoundsException if either passed index is invalid. */ @Override public DynamicList<E> subList(int start, int stop) { //TODO return null; } /** * Return index of first matching element (where searchFct outputs true) * Return -1 if no match * Example usage (first list of integers, then employees): * index = list.find(eaInteger -> eaInteger == 10); * index = employeeList.find(employee -> employee .getFirstName().equals("Kofi")); */ @Override public int findFirst(Function<E, Boolean> searchFct) { //TODO return 0; } /** * Return index of last matching element (where searchFct outputs true) * E.g., if searching for employee with name "Kofi" and there is a match * at index=3 and index=8, findLast will return 8 (the last matching index). * Hint: start search at end of list and work backwards through list. * Return -1 if no match */ @Override public int findLast(Function<E, Boolean> searchFct.

please read below it will tell you what we are using L.pdf

ankit11134

1 #include #include #include /* Link list node */ struct node { int data; struct node* next; }; /* Given a reference (pointer to pointer) to the head of a list and an int, push a new node on the front of the list. */ void push(struct node** head_ref, int new_data) { /* allocate node */ struct node* new_node = (struct node*) malloc(sizeof(struct node)); /* put in the data */ new_node->data = new_data; /* link the old list off the new node */ new_node->next = (*head_ref); /* move the head to point to the new node */ (*head_ref) = new_node; } /* Takes head pointer of the linked list and index as arguments and return data at index*/ int GetNth(struct node* head, int index) { struct node* current = head; int count = 0; /* the index of the node we\'re currently looking at */ while (current != NULL) { if (count == index) return(current->data); count++; current = current->next; } /* if we get to this line, the caller was asking for a non-existent element so we assert fail */ assert(0); } /* Drier program to test above function*/ int main() { /* Start with the empty list */ struct node* head = NULL; /* Use push() to construct below list 1->12->1->4->1 */ push(&head, 1); push(&head, 4); push(&head, 1); push(&head, 12); push(&head, 1); /* Check the count function */ printf(\"Element at index 3 is %d\", GetNth(head, 3)); getchar(); } 2 #include #include #include /* Link list node */ struct node { int data; struct node* next; }; /* Given a reference (pointer to pointer) to the head of a list and an int, push a new node on the front of the list. */ void push(struct node** head_ref, int new_data) { /* allocate node */ struct node* new_node = (struct node*) malloc(sizeof(struct node)); /* put in the data */ new_node->data = new_data; /* link the old list off the new node */ new_node->next = (*head_ref); /* move the head to point to the new node */ (*head_ref) = new_node; } /* Takes head pointer of the linked list and index as arguments and return data at index*/ int GetNth(struct node* head, int index) { struct node* current = head; int count = 0; /* the index of the node we\'re currently looking at */ while (current != NULL) { if (count == index) return(current->data); count++; current = current->next; } /* if we get to this line, the caller was asking for a non-existent element so we assert fail */ assert(0); } /* Drier program to test above function*/ int main() { /* Start with the empty list */ struct node* head = NULL; /* Use push() to construct below list 1->12->1->4->1 */ push(&head, 1); push(&head, 4); push(&head, 1); push(&head, 12); push(&head, 1); /* Check the count function */ printf(\"Element at index 3 is %d\", GetNth(head, 3)); getchar(); } Solution 1 #include #include #include /* Link list node */ struct node { int data; struct node* next; }; /* Given a reference (pointer to pointer) to the head of a list and an int, push a new node on the front of the list. */ void push(struct node** head_ref, int new_data) { /* allocate node */ struct node*.

1#include stdio.h#include stdlib.h#include assert.h .pdf

sudhinjv

Using C++ I keep getting message: \'head does not name a type\' \'teal does not name a type\' Where do I place this code in my program: /*search and delete with respect to location as current, head and tail //define below 2 lines in LinkedList() function head = new NodeType; tail = new NodeType; void UnsorderedType::DeleteItem(ItemType item) { NodeType *tempLocation, *location; bool stop = false; if(!isEmpty()) { location = head; tempLocation = head->link; while (templocation != tail && !stop) { if (templocation->info == item) stop = true; else { location = templocation; templocation = templocation->link; } } if (!stop) cout << \"The node to delete is not in the list!\" << endl; else { location->link = templocation->link; delete templocation; count--; } } else { cout << \"The list is empty!\" << endl; } }*/ /Problem and code: Implement the UnsortedList class to store a list of strings that are input into the list from data2.txt. - create a main.cpp file that gets the numbers from the file - insert the word \"cat\" into the list - insert another word \"antibacterial\" into the list - delete the word \"letter\" from the list - print out the following: --the entire list - the greatest - the least 2. Attach the main.cpp, UnsortedList.cpp, the ItemType.h, and the output file one called outfile1.txt - Yes you need to make your program output an \"outfile1.txt\" 3. Implement the UnsortedList class to store a list of numbers that are input into the list from data.txt. - create a main.cpp file that gets the numbers from the file - insert the number 7 into the list - insert another number 300 into the list - delete the number 6 from the list - print out the following: --the entire list - the greatest - the least 2. Attach the main.cpp, UnsortedList.cpp, the ItemType.h, and the output file two called outfile2.txt - Yes you need to make your program output an \"outfile2.txt\" data.txt super formula travel free thick Josephine Clara education data2.txt super formula travel free thick Josephine Clara education //My main.cpp //-------------------------------------------------------------- // Test driver for Linked List UnsortedType list // Navarr Barnier // Your class CS3350 TTh 1:00 // Due date: Thursday, September 13, 2012 // // Compile command: g++ hw2.cpp ch03-UnsortedType.cpp ch03-ItemType.cpp // Input file name: hw2.txt // Contains list of commands to add items to list, split original // list into two lists, print each list and get the length of // each list. // Output: The result of each command is displayed on the screen. // Filename: hw2.cpp //-------------------------------------------------------------- #include #include #include #include #include #include \"ItemType.h\" using namespace std; void PrintList(UnsortedType&); void SplitList(UnsortedType&, ItemType); ItemType GetItem(ItemType& item, bool& found); int main() { ifstream inFile; // file containing operations ofstream outFS; // Output file stream string data; // operation to be executed s.

Using C++I keep getting messagehead does not name a type.pdf

alokkesh1

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) Do not work together; no two people should have identical work!?!? 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 #5 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 dele.

Assignment is Page 349-350 #4 and #5 Use the Linked Lis.pdf

formicreation

C++ problem Part 1: Recursive Print (40 pts) Please write the recursive List reverse print function, whose iterative version we wrote in class. Below are the function signatures for the functions you are going to need: public: /**Additional Operations*/ void print_reverse(); //Wrapper function that calls the reverse helper function to print a list in reverse //prints nothing if the List is empty private: void reverse(Nodeptr node); //Helper function for the public printReverse() function. //Recursively prints the data in a List in reverse. Why do we need the private helper function here? Since we are going to be reversing our list node by node, in a recursive fashion, we want to pass a one node at a time to our reverse function. However, since our nodes are private, we cannot access them if we call the function inside of main. Add these function signatures to your List.h file along with your other function prototypes inside the class definition. Make sure that you place the reverse function inside the private portion of your List class definition and the print_reverse function prototype to the public portion of your List class definition. Now, implement these two functions inside of List.h, under your section for additional operations. Important: Test each function carefully inside of your ListTest.cpp to make sure that it is working properly. Part 2: Adding an Index to Your List Nodes (20 pts) Next, you will add the following functions to your List.h /**Accessor Functions*/ int get_index(); //Indicates the index of the Node where the iterator is currently pointing //Nodes are numbered from 1 to length of the list //Pre: length != 0 //Pre: !off_end() ... int List::get_index() { //Implement the function here } /**Manipulation Procedures*/ void scroll_to_index(int index); //Moves the iterator to the node whose index is specified by the user //Pre: length != 0 ... void scroll_to_index(int index) { //Implement function here } Part 3: Implementing Search as Part of Your List (40 pts) Now, we are going to add two search functions to our List so that we can search for elements in our List. The first of these functions is going to be a simple linear search function. You will need to add the following function prototype and function definition to your List.h: /**Additional Operations*/ int linear_search(listitem item); //Searchs the list, element by element, from the start of the List to the end of the List //Returns the index of the element, if it is found in the List //Returns -1 if the element is not in the List //Pre: length != 0 ... int List::linear_search(listitem item) { //Implement the function here } You are also going to add a function to perform recursive binary search on your List. You will need to add the following function prototype and function definition to your List.h: int binary_search(int low, int high, listitem item); //Recursively searchs the list by dividing the search space in half //Returns the index of the element, if it is fo.

C++ problemPart 1 Recursive Print (40 pts)Please write the recu.pdf

callawaycorb73779

linked List.docx vhjgvjhvgjhjhbbjkhkjhkjh

vasavim9

please read the steps below and it will tell you what we using /** * DynamicArray.java * * Replace all //TODO tags with your code * * Note that below the "//TODO" tag there may be * something like "return null;", "return 0;", etc. * That line is just "stubbed in" so the class * will compile. When you add your code (one or many * statements), you will want to delete the "stubbed" line. * By "stubbed in" we mean "mocked" or "faked in" temporarily. * * When testing, construct using the static factory methods: DynamicList.newEmpty() DynamicList.fromGrowthFactor(growthFactor) DynamicList.from(arrayElements) */ package model.list; import java.lang.reflect.Array; import java.util.concurrent.atomic.AtomicInteger; import java.util.function.BiFunction; import java.util.function.Consumer; import java.util.function.Function; import model.linearpub.DynamicList; import model.linearpub.StructureIterator; public class DynamicArray<E> implements DynamicList<E> { //--------------------------------- // Instance Variables //TODO - declare instance variable(s) //--------------------------------- // Private Constructors /** Constructs and returns new DynamicArray (no args constructor) */ private DynamicArray() { this(defaultGrowthFactor()); } /** Constructs and returns new DynamicArray with "aGrowthFactor" */ private DynamicArray(double aGrowthFactor) { //TODO -- this is the constructor that should //initialize the dynamic array as needed } //------------------------------------------------ public static double defaultGrowthFactor() { //TODO - replace 0 with a good growth factor return 0; } protected static int defaultInitialCapacity() { //TODO - replace 0 with a good initial capacity return 0; } //-------------------- List Statistics --------------------- /** * Return number of elements in this list. */ @Override public int size() { //TODO return 0; } /** * Return true is this list contains no elements. */ @Override public boolean isEmpty() { //TODO return false; } //------------------ Accessing Elements -------------------- /** * Return element at given index. * Throws IndexOutOfBoundsException if passed index is invalid. */ @Override public E get(int index) { //TODO return null; } /** * Return first element * Throws RuntimeException if list is empty */ @Override public E first() { //TODO return null; } /** * Return last element * Throws RuntimeException if list is empty */ @Override public E last() { //TODO return null; } /** * Return a new list containing the elements of this list * between the given index "start" (inclusive) and * the given index "stop" (exclusive). * Throws IndexOutOfBoundsException if either passed index is invalid. */ @Override public DynamicList<E> subList(int start, int stop) { //TODO return null; } /** * Return index of first matching element (where searchFct outputs true) * Return -1 if no match * Example usage (first list of integers, then employees): * index = list.find(eaInteger -> eaInteger == 10); * index = employeeList.find(emplo.

please read the steps below and it will tell you what we usi.pdf

aggarwalopticalsco

C program to insert a node in doubly linked list

Sourav Gayen

we using java code /** * DynamicArray.java * * Replace all //TODO tags with your code * * Note that below the "//TODO" tag there may be * something like "return null;", "return 0;", etc. * That line is just "stubbed in" so the class * will compile. When you add your code (one or many * statements), you will want to delete the "stubbed" line. * By "stubbed in" we mean "mocked" or "faked in" temporarily. * * When testing, construct using the static factory methods: DynamicList.newEmpty() DynamicList.fromGrowthFactor(growthFactor) DynamicList.from(arrayElements) */ package model.list; import java.lang.reflect.Array; import java.util.concurrent.atomic.AtomicInteger; import java.util.function.BiFunction; import java.util.function.Consumer; import java.util.function.Function; import model.linearpub.DynamicList; import model.linearpub.StructureIterator; public class DynamicArray<E> implements DynamicList<E> { //--------------------------------- // Instance Variables //TODO - declare instance variable(s) //--------------------------------- // Private Constructors /** Constructs and returns new DynamicArray (no args constructor) */ private DynamicArray() { this(defaultGrowthFactor()); } /** Constructs and returns new DynamicArray with "aGrowthFactor" */ private DynamicArray(double aGrowthFactor) { //TODO -- this is the constructor that should //initialize the dynamic array as needed } //------------------------------------------------ public static double defaultGrowthFactor() { //TODO - replace 0 with a good growth factor return 0; } protected static int defaultInitialCapacity() { //TODO - replace 0 with a good initial capacity return 0; } //-------------------- List Statistics --------------------- /** * Return number of elements in this list. */ @Override public int size() { //TODO return 0; } /** * Return true is this list contains no elements. */ @Override public boolean isEmpty() { //TODO return false; } //------------------ Accessing Elements -------------------- /** * Return element at given index. * Throws IndexOutOfBoundsException if passed index is invalid. */ @Override public E get(int index) { //TODO return null; } /** * Return first element * Throws RuntimeException if list is empty */ @Override public E first() { //TODO return null; } /** * Return last element * Throws RuntimeException if list is empty */ @Override public E last() { //TODO return null; } /** * Return a new list containing the elements of this list * between the given index "start" (inclusive) and * the given index "stop" (exclusive). * Throws IndexOutOfBoundsException if either passed index is invalid. */ @Override public DynamicList<E> subList(int start, int stop) { //TODO return null; } /** * Return index of first matching element (where searchFct outputs true) * Return -1 if no match * Example usage (first list of integers, then employees): * index = list.find(eaInteger -> eaInteger == 10); * index = employeeList.find(employee -> employee .getFirstName().equals("Kofi.

we using java code DynamicArrayjava Replace all .pdf

gudduraza28

1. The design of a singly-linked list below is a picture of the function that needs to be used below is the code of the above picture: #include <string> #include <iostream> #include <cmath> #include <cstdio> #include <algorithm> using namespace std; #define defaultSize 100 void Assert(bool val, string s) { if (!val) { // Assertion failed -- close the program cout << "Assertion Failed: " << s << endl; exit(-1); } } template <typename E> class Link { public: E element; // Value for this node Link *next; // Pointer to next node in list // Constructors Link(const E& elemval, Link<E>* nextval = NULL) { element = elemval; next = nextval; } Link(Link<E>* nextval =NULL) { next = nextval; } }; template <typename E> class LList: public Link<E> { private: Link<E>* head;// Intialization helper method Link<E>* tail;// Pointer to last element Link<E>* curr;// Access to current element int cnt;// Size of list void init(){// Intialization helper method curr = tail = head = new Link<E>; cnt = 0; } void removeall() {// Return link nodes to free store while(head != NULL) { curr = head; head = head->next; delete curr; } } public: LList(int size=defaultSize) { init(); }// Constructor ~LList() { removeall(); }// Destructor void print() const;// Print list contents void clear() { removeall(); init(); }// Clear list // Insert "it" at current position void insert(const E& it) { curr->next = new Link<E>(it, curr->next); if (tail == curr) tail = curr->next; // New tail cnt++; } void append(const E& it) { // Append "it" to list tail = tail->next = new Link<E>(it, NULL); cnt++; } // Remove and return current element E remove() { Assert(curr->next != NULL, "No element"); E it = curr->next->element; // Remember value Link<E>* ltemp = curr->next; // Remember link node if (tail == curr->next) tail = curr; // Reset tail curr->next = curr->next->next; // Remove from list delete ltemp; // Reclaim space cnt--; // Decrement the count return it; } void moveToStart()// Place curr at list start { curr = head; } void moveToEnd() // Place curr at list end { curr = tail; } void prev(){ if (curr == head) return; Link<E>* temp = head; while (temp->next!=curr) temp=temp->next; curr = temp; } void next(){ if (curr != tail) curr = curr->next; } int length() const { return cnt; } int currPos() const { Link<E>* temp = head; int i; for (i=0; curr != temp; i++) temp = temp->next; return i; } void moveToPos(int pos){ Assert ((pos>=0)&&(pos<=cnt), "Position out of range"); curr = head; for(int i=0; i<pos; i++) curr = curr->next; } const E& getValue() const { Assert(curr->next != NULL, "No value"); return curr->next->element; } }; completed this code to fulfill the requirement below: Write a function to insert an integer into a singly-linked list of elements arranged from largest to smallest. Requires that elements remain ordered after insertion. 2. The design of array-based stack below is a picture of the function that needs to be used below is the code of the above picture: #include <string.h> #.

1- The design of a singly-linked list below is a picture of the functi (1).pdf

afgt2012

C++11

Sasha Goldshtein

Similar to include ltinitializer_listgt include ltiostreamgt .pdf (20)

There are a number of errors in the following program- All errors are.docx

Week 2 - Advanced C++list1.txt312220131197.docx

__MACOSX._assign3assign3.DS_Store__MACOSXassign3._.D.docx

maincpp Build and procees a sorted linked list of Patie.pdf

This assignment and the next (#5) involve design and development of a.pdf

StackInterface An interface for the ADT stack. Do not modif.pdf

AvlTree.h#ifndef AVL_TREE_H#define AVL_TREE_H#include d.docx

Fix my codeCode.pdf

How do you stop infinite loop Because I believe that it is making a.pdf

please read below it will tell you what we are using L.pdf

1#include stdio.h#include stdlib.h#include assert.h .pdf

Using C++I keep getting messagehead does not name a type.pdf

Assignment is Page 349-350 #4 and #5 Use the Linked Lis.pdf

C++ problemPart 1 Recursive Print (40 pts)Please write the recu.pdf

linked List.docx vhjgvjhvgjhjhbbjkhkjhkjh

please read the steps below and it will tell you what we usi.pdf

C program to insert a node in doubly linked list

we using java code DynamicArrayjava Replace all .pdf

1- The design of a singly-linked list below is a picture of the functi (1).pdf

C++11

More from abidtelecom

Think of an organization with which you have been affiliated.pdf

include ltinitializer_listgt include ltiostreamgt .pdf

Recommended

Recommended

More Related Content

Similar to include ltinitializer_listgt include ltiostreamgt .pdf

Similar to include ltinitializer_listgt include ltiostreamgt .pdf (20)

More from abidtelecom

More from abidtelecom (20)

Recently uploaded

Recently uploaded (20)

include ltinitializer_listgt include ltiostreamgt .pdf