3. Implement the UnsortedList class to store a list of numbers that .pdf

•

0 likes•2 views

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. There should be four files, the main.cpp, UnsortedList.cpp, ItemType.h, and the output file two called outfile2.txt - Yes you need to make your program output an \"outfile2.txt\" Contents of “data.txt 10 8 250 800 -1 6 Solution main.cpp: #include #include #include #include int main () { std::list mylist; std::list::iterator it; std::fstream myfile(\"data.txt\"); std::ofstream myfile1(\"output2.txt\"); int a; while (myfile >> a) { mylist.push_back(a); } it = mylist.begin(); std::cout << \'\ \'; std :: cout << \"Initial List:\"; for (it=mylist.begin(); it!=mylist.end(); ++it) std::cout << \' \' << *it; std::cout << \'\ \'; std::cout << \'\ \'; std :: cout << \"Insert 7:\"; mylist.insert (it,7); for (it=mylist.begin(); it!=mylist.end(); ++it) std::cout << \' \' << *it; std::cout << \'\ \'; std::cout << \'\ \'; std :: cout << \"Intest 300:\"; mylist.insert (it,300); for (it=mylist.begin(); it!=mylist.end(); ++it) std::cout << \' \' << *it; std::cout << \'\ \'; std::cout << \'\ \'; std :: cout << \"Delete 6:\"; mylist.remove(6); for (it=mylist.begin(); it!=mylist.end(); ++it) std::cout << \' \' << *it; std::cout << \'\ \'; std::cout << \'\ \'; std::cout << \"Final list:\"; for (it=mylist.begin(); it!=mylist.end(); ++it) std::cout << \' \' << *it; myfile1 << *it << std::endl; std::cout << \'\ \'; std::cout << \'\ \'; return 0; } UnsortedList.cpp: #include #include #include #include int main () { std::list mylist; std::list::iterator it; std::fstream myfile(\"output2.txt\"); int a; int largest; while (myfile >> a) { mylist.push_back(a); } it = mylist.begin(); for (it=mylist.begin(); it!=mylist.end(); ++it) if (*it>largest){ largest=*it; } std::cout <<\"Largest is:\"; std::cout <.

Education

$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. There should be four files, the main.cpp, UnsortedList.cpp, ItemType.h, and the output file two called outfile2.txt - Yes you need to make your program output an "outfile2.txt" Contents of “data.txt 10 8 250 800 -1 6 Solution main.cpp: #include #include #include #include int main () { std::list mylist; std::list::iterator it; std::fstream myfile("data.txt"); std::ofstream myfile1("output2.txt"); int a; while (myfile >> a) { mylist.push_back(a); } it = mylist.begin();$

std::cout << ' ';
std :: cout << "Initial List:";
for (it=mylist.begin(); it!=mylist.end(); ++it)
std::cout << ' ' << *it;
std::cout << ' ';
std::cout << ' ';
std :: cout << "Insert 7:";
mylist.insert (it,7);
for (it=mylist.begin(); it!=mylist.end(); ++it)
std::cout << ' ' << *it;
std::cout << ' ';
std::cout << ' ';
std :: cout << "Intest 300:";
mylist.insert (it,300);
for (it=mylist.begin(); it!=mylist.end(); ++it)
std::cout << ' ' << *it;
std::cout << ' ';
std::cout << ' ';
std :: cout << "Delete 6:";
mylist.remove(6);
for (it=mylist.begin(); it!=mylist.end(); ++it)
std::cout << ' ' << *it;
std::cout << ' ';
std::cout << ' ';
std::cout << "Final list:";
for (it=mylist.begin(); it!=mylist.end(); ++it)
std::cout << ' ' << *it;
myfile1 << *it << std::endl;
std::cout << ' ';
std::cout << ' ';
return 0;
}
UnsortedList.cpp:
#include
#include
#include

$#include int main () { std::list mylist; std::list::iterator it; std::fstream myfile("output2.txt"); int a; int largest; while (myfile >> a) { mylist.push_back(a); } it = mylist.begin(); for (it=mylist.begin(); it!=mylist.end(); ++it) if (*it>largest){ largest=*it; } std::cout <<"Largest is:"; std::cout <$

Similar to 3. Implement the UnsortedList class to store a list of numbers that .pdf

2.(Sorted list: array implementation)This sorted list ADT discussed in class should be extended by the addition of two new methods: //Interface: ArrayListADT //works for int public interface ArrayListADT { public boolean isEmpty(); //Method to determine whether the list is empty. public boolean isFull(); //Method to determine whether the list is full. public int listSize(); //Method to return the number of elements in the list. public int maxListSize(); //Method to return the maximum size of the list. public void print(); //Method to output the elements of the list. public boolean isItemAtEqual(int location, int item); //Method to determine whether item is the same as the item in the list at location. public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at the position public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list. public void removeAt(int location); //Method to remove the item from the list at location. public int retrieveAt(int location); //Method to retrieve the element from the list at location. public void replaceAt(int location, int repItem); //Method to replace the element in the list at location with repItem. public void clearList(); //Method to remove all the elements from the list. public int search(int searchItem); //Method to determine whether searchItem is in the list. public void remove(int removeItem); //Method to remove an item from the list. } //Class: ArrayListClass implements //Interface: ArrayListADT public abstract class ArrayListClass implements ArrayListADT { protected int length; //to store the length of the list protected int maxSize; //to store the maximum size of the list protected int[] list; //array to hold the list elements //Default constructor public ArrayListClass() { maxSize = 100; length = 0; list = new int[maxSize]; } //Alternate Constructor public ArrayListClass(int size) { if(size <= 0) { System.err.println(\"The array size must be positive. Creating an array of size 100.\"); maxSize = 100; } else maxSize = size; length = 0; list = new int[maxSize]; } public boolean isEmpty() { return (length == 0); } public boolean isFull() { return (length == maxSize); } public int listSize() { return length; } public int maxListSize() { return maxSize; } public void print() { for (int i = 0; i < length; i++) System.out.print(list[i] + \" \"); System.out.println(); } public boolean isItemAtEqual(int location, int item) { if (location < 0 || location >= length) { System.err.println(\"The location of the item to be compared is out of range.\"); return false; } return list[location]== item; } public void clearList() { for (int i = 0; i < length; i++) list[i] = 0; length = 0; System.gc(); //invoke the Java garbage collector } public void removeAt(int location) { if (location < 0 || location >= length) System.err.println(\"The location of the item to be removed is out of range.\"); else { for(int i = location; i < length - 1; i++) list[i] .

2.(Sorted list array implementation)This sorted list ADT discussed .pdf

arshin9

Describe a data structure that supports both removeMin() and removeMax() with O(log(n)) complexity. You need to show the implementation of insert(), removeMin(), and removeMax(), and prove their complexity. Hint: one can build on top of the heap. /*IF YOU WRITE CODE, PLEASE PROVIDE COMMENTS*/ I need to understand Describe a data structure that supports both removeMin() and removeMax() with O(log(n)) complexity. You need to show the implementation of insert(), removeMin(), and removeMax(), and prove their complexity. Hint: one can build on top of the heap. /*IF YOU WRITE CODE, PLEASE PROVIDE COMMENTS*/ I need to understand Describe a data structure that supports both removeMin() and removeMax() with O(log(n)) complexity. You need to show the implementation of insert(), removeMin(), and removeMax(), and prove their complexity. Hint: one can build on top of the heap. /*IF YOU WRITE CODE, PLEASE PROVIDE COMMENTS*/ I need to understand Solution The idea here is to use the concept of two binary heaps along with the concept of list(doubly linked list). The doubly linked list contains all input items and indexes of corresponding min and max heap nodes. The nodes of min and max heaps store addresses of nodes of doubly linked list. The root node of min heap stores the address of minimum item in doubly linked list. Similarly, root of max heap stores address of maximum item in doubly linked list. Following are the details of operations. 1) findMax(): We get the address of maximum value node from root of Max Heap. So this is a O(1) operation. 1) findMin(): We get the address of minimum value node from root of Min Heap. So this is a O(1) operation. 3) removeMin(): We get the address of minimum value node from root of Min Heap. We use this address to find the node in doubly linked list. From the doubly linked list, we get node of Max Heap. We delete node from all three. We can delete a node from doubly linked list in O(1) time. delete() operations for max and min heaps take O(Logn) time. 4) removeMax(): is similar to deleteMin() 5) Insert() We always insert at the beginning of linked list in O(1) time. Inserting the address in Max and Min Heaps take O(Logn) time. So overall complexity is O(Logn) #include #include #include // A node of doubly linked list struct LNode { int data; int minHeapIndex; int maxHeapIndex; struct LNode *next, *prev; }; // Structure for a doubly linked list struct List { struct LNode *head; }; // Structure for min heap struct MinHeap { int size; int capacity; struct LNode* *array; }; // Structure for max heap struct MaxHeap { int size; int capacity; struct LNode* *array; }; // The required data structure struct CDS { struct MinHeap* minHeap; struct MaxHeap* maxHeap; struct List* list; }; // A utility function to create a new List node struct LNode* newLNode(int data) { struct LNode* node = (struct LNode*) malloc(sizeof(struct LNode)); node->minHeapIndex = node->maxHeapIndex = -1; node->data = data; node->prev = node->next = NULL; retu.

Describe a data structure that supports both removeMin() and rem.pdf

arihantstoneart

You must implement the following functions. Name the functions exactly as instructed below, and provide the same arguments and call them in the same context as instructed. Failure to do so will result in points being deducted. You can use default or non-defualt variables, See lecture 06: 1. Write a function (call it get filehandle, and implement it as the same as above) 2. Write a function (call it get_fasta_lists, and implement it as the same as above) 3. Write a function (call it _verify_1ists, and implement it as the same as above) 4. Write a function (call it output_seq _statistics) that recelves three arguments. 1). The header list found in step 2 directly above. 2). The sequence list found in step 2 directly above. 3). The output filehandle the stats will be written too. This is the main function of this program, since it will print the top line of the output (see below), and esch sequence's numerical values. It will call two helper functions (_get__nebi_aceession and _get_num_nueleotides - see below) that will be called for each sequence prior to printing the data for each soquence out. I can call this function like this: 9 bend of the diat 1 process the sequencen and print out the data output_seq_atatiatics (1itt_headera, 1itht_segs, ih_out) 5. Write a function (call it _get_num_nucleotides) that recelves two arguments. 1). The character to find the occurrence of in the dna sequence, 2), The sequence data for that entry (string). I can call this function like this: a n t = get_num_nueleotides ( A , aeq) c n t = g e t num_nucleotides ( C , seq) The function should only take A , G , C , T , or N. If any other character is given other than that set, it should sys. exit ("Did not code this condition ") the program. Example, if I called this function like:_get__ _um_nucleotides (' Y ', seg) the function would sys, exit("Did not code this condition") 1. Write a function (call it get filehandle) that receives two arguments: 1). A file name 2), How to open a file for reading or writing ("r", or "w") in Python. The purpose of this function is to open the file name passed in, and passes back a a file object, aka the file handie or handle. You can call this function like this: \[ \begin{array}{l} \text { fh_in = get_filehandle }\left\{f i l e \_t o \_o p e n, " r *\right) \text { or } \\ \text { fh_out = get_filehandle(file_to_write, "w") } \end{array} \] When using open (), make sure to use try .. except .. except if the open was not successful the program should raise the right Exception(it should raise an oskmor si for when the file cannot be opened, and raise a valueEror se. when the wrong argument was passed for the opening mode, e.g. "mr" instead of " r "). We will test for things like a file that does not exist for opening, or the wrong open mode, e.g. mode='m'. See poan B for more information. All opening and closing of files in your program should use the get_filehandle function. Failure to do so will loose points. Make sure to dose yo.

You must implement the following functions- Name the functions exactly.docx

Sebastian6SWSlaterb

Lab_3: Objective: Experiment with Lists, Stacks, and Queues: Simulate an OS task manager Assignment: Using the startup code, implement the following: 1-Create List L1 of 10 elements (task IDs), e.g. L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10; 2-Insert a new list element in between (at every other element), such as: 1,100, 2,200, 3,300, 4,400, ... 10,1000; Simulate a new CPU core assignment: 3-Create another List L2, and extract the newly inserted elements into this new list L2 i.e. L1 should go back to the original list: L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 L2 should be: 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000 Start executing: 4-Create a Queue Q1 by extracting L1, and inserting L2 elements: i.e. Q should start with: 1,2,3, ... 10, and (10, 20 ... 100) will be inserted Q1=1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 100, 200, 300, 400, 500, 600, 700, 800, 900, 1000 Label tasks as finished with the possibility of revisiting a task, such as: 5-Create a Stack S1 which by deleting the elements of Q1 and inserting them in L1 6-Pop out all elements of the Stack, i.e. should end up with an empty stack Extra credit: Simulate a re-executed task, i.e. Pop out a task out of the Stack and reinsert, this simulate a failed task. 7-Verify the functionality and capture the results in a report form. List.h main.cpp #include "List.h" #include <stdlib.h> #include <iostream> using namespace std; template <typename Object> class Stack { public: bool isEmpty() const { return theList.empty(); } const Object& top() const { return theList.front(); } void push(const Object& x) { theList.push_front(x); } void pop(Object& x) { x = theList.front(); theList.pop_front(); } private: List<Object> theList; }; template <typename Object> class Queue { public: bool isEmpty() const { return theList.empty(); } const Object& getFront() const { return theList.front(); } void enqueue(const Object& x) { theList.push_back(x); } void dequeue(Object& x) { x = theList.front(); theList.pop_front(); } private: List<Object> theList; }; int main() { int i; const int N = 10; List<int> L1; Stack<int> S1; Queue<int> Q1; List<int>::iterator node; //Variable to keep track of the position as we traverse // List Section example: //Q1: Create List L1 of 10 elements, e.g. L1 = 1, 2, 3, 4, 5, 6, 7, 8, 9, 10; // create the list array as a starting point: for (i = N; i > 0; --i) { L1.push_front(i); } // show L1 with an iterator cout << "List L1 is:" << endl; for (auto it = L1.begin(); it != L1.end(); ++it) { cout << *it << ' '; } // Stack Section example: // // Stack to be created per the above assignment requirment cout << "\nStack S1 is:" << endl;; for (i = N - 1; i >= 0; --i) { S1.push(i); cout << S1.top() << " " << endl; } while (!S1.isEmpty()) { cout << S1.top() << endl; S1.pop(i); } // Queue section, to be created per the above assignment requirment // // return 0; } please answer with C++ code thank you! private: int theSize; Node *head.

Lab_3- Objective- Experiment with Lists- Stacks- and Queues- Simulate.docx

rennaknapp

Please help solve this in C++. So the program is working fine but when submitting it, it gives me a code -11, and I believe the problem is that after inserting the numbers it removes them one by one until the last in the list, and when it tries to remove the last number in the list that is when it counters the problem. Below is the full code but you just need to change something in the SortedNumberList.h file under the bool remove function. 4.18 LAB: Sorted number list implementation with linked lists Step 1: Inspect the Node.h file Inspect the class declaration for a doubly-linked list node in Node.h. Access Node.h by clicking on the orange arrow next to main.cpp at the top of the coding window. The Node class has three member variables: - a double data value, - a pointer to the next node, and - a pointer to the previous node. Each member variable is protected. So code outside of the class must use the provided getter and setter member functions to get or set a member variable. Node.h is read only, since no changes are required. Step 2: Implement the Insert() member function A class for a sorted, doubly-linked list is declared in SortedNumberList.h. Implement the SortedNumberList class's Insert() member function. The function must create a new node with the parameter value, then insert the node into the proper sorted position in the linked list. Ex: Suppose a SortedNumberList's current list is 2347.2586, then Insert(33.5) is called. A new node with data value 33.5 is created and inserted between 23 and 47.25, thus preserving the list's sorted order and yielding: 2335.547.2586Step 3: Test in develop mode Code in main() takes a space- separated list of numbers and inserts each into a SortedNumberList. The list is displayed after each insertion. Ex: If input is 77154263.5 then output is: List after inserting 77 : 77 List after inserting 15 : 1577 List after inserting -42 : -421577 List after inserting 63.5: -421563.577 Try various program inputs, ensuring that each outputs a sorted list. Step 4: Implement the Remove() member function Implement the SortedNumberList class's Remove(0 member function. The function takes a parameter for the number to be removed from the list. If the number does not exist in the list, the list is not changed and false is returned. Otherwise, the first instance of the number is removed from the list and true is returned. Uncomment the commented-out part in main() that reads a second input line and removes numbers from the list. Test in develop mode to ensure that insertion and removal both work properly, then submit code for grading. Ex: If input is 841972841961 then output is: List after inserting 84: 84 List after inserting 72 : 7284 List after inserting 19: 1972 84 List after inserting 61: 1961 : 72 8 List after removing 19: 6172 84 List after removing 84: 6172Current file: main.cpp - // Insert each value and show the sorted List's contents after each insertion sortedNumberList list; for (auto term : terms) { doubl.

Please help solve this in C++ So the program is working fin.pdf

ankit11134

To write a program that implements the following C++ concepts 1. Data Encapsulation 2. Instantiate classes 3. Composition Class 4. Aggregation Class 5. Dynamic Memory 6. File Stream Make a program that reads a file and can generate reports. Each file will have phone calls records (see section 4). The program will process the data gathering all minutes and total amount for each report. The program should have a menu (see section 1): 1. New Report – this option will ask a file name (TE??????.tel). This option will instantiate an object of Report class, loading the whole file into memory. 2. Delete a report – this option will display all reports available in memory and ask which one you would like to delete. 3. Display a report – this option will display all reports available in memory and ask you which one you would like to generate a report. 4. Exit – Program ends. For option 1, you do not know how many reports are, meaning that you will create dynamically the reports. For long distance calls the formula will be (minutes call x $1.50). For local phone calls the formula will be (minutes call x $0.25) -------------------------------------------------------------------------------------------------------------------- ---------------------------- //Main.cpp *#define between(x,y,z) ((x>=y && x<=z)? true:false) #include #include #include #include \"Data.h\" #include \"Report.h\" #include \"Menu.h\" using namespace std; //uses class Report to create reports //uses class Menu to display a menu to choose int main() { int idx = 0; int count = idx; Menu menu(\"Reports\"); Data temp; string fileName; Report* phoneCompany; Report* newReport(Report*, int&); Report* deleteReport(Report*, int&, int); int displayReport(Report*, int); bool fileNameExists(string); menu.addMenuItem(\"New Report\"); menu.addMenuItem(\"Delete a Report\"); menu.addMenuItem(\"Display a Report\"); ofstream openFile; phoneCompany = NULL; phoneCompany = new Report[count]; do { cout << menu; cin >> menu; switch (menu.getChoice()) { case \'1\': cout << \"\ \\tEnter report name (TE??????): \"; cin >> fileName; openFile.open(fileName + \".tel\"); if (openFile.good()) { cout << \"\ \\tReport succesfully created.\ \"; phoneCompany[count].setFileName(fileName); count++; } else { cout << \"\ \\terror: Could not create report.\ \"; } break; case \'2\': if (count != 0) { do { system(\"cls\"); cout << \"\ \ \\tDelete a Report:\ \ \"; idx = displayReport(phoneCompany, count); if (between(idx, 0, count - 1)) { phoneCompany = deleteReport(phoneCompany, count, idx); idx = 0; } else cout << \"\ \\terror: Report could not be deleted.\ \"; } while (idx != count); } else { cout << \"\ \ \\tNo reports to delete.\ \ \"; system(\"pause\"); } break; case \'3\': if (count != 0) { do { system(\"cls\"); cout << \"Display a Report:\ \ \"; idx = displayReport(phoneCompany, count); system(\"cls\"); cout << \"\ \\t\" << phoneCompany[idx].getFileName(); cout << \"\ \ \\tWould you like to edit the report?\"; cout << \.

To write a program that implements the following C++ concepts 1. Dat.pdf

SANDEEPARIHANT

I am stuck on parts E and F Exercise 1: NumberListTester.java Class NumberList implements a simple list of Integers, using an ArrayList. NumberListTester generates 10 random, positive, 2-digit ints, and adds them to the list. It then calls method printList which prints the items on the list. Run the program until you understand what it does. a. Write the body of the method printReversed, which prints the list items in reverse order. Add a statement in main to call printReversed after the call to printList. Check ______ b. Write the body of the method printEveryOther, which prints every other item on the list, beginning with the first one. In main, replace the statement that calls printReversed with one that calls printEveryOther. Check ______ c. Write the body of the method printEvens, which prints all the even-numbered ints on the list. In main, replace the statement that calls printEveryOther with one that calls printEvens. Check ______ All this printing is getting a bit tedious. Let\'s try some more fun operations. d. 0. Add a new ArrayList-of-integer instance variable called bigList to the NumberList class Add a statement to the NumberList constructor that creates an empty ArrayList object pointed to by bigList Delete the call to printEvens from main. Write the body of the method splitList, which copies all ints that are greater than or equal to 50 from aList to bigList. Add a method to the NumberList class to print bigList. Add a sequence of method calls in main to verify that the splitList method is working correctly. I.e., after calling splitList, call again the method that prints the original list and then call the method you wrote in step 4 to print the bigList. Check _____ E. Add a method insert to the NumberList class that takes two parameters of type int. The first parameter is the index at which to insert a new number into the list, and the second is the number to be inserted. E.g., if the first param is 4 and the second is 37, then 37 will be inserted at index 4 in aList (i.e., as the new 5th list element). The number inserted does not replace the number currently at that position, but is inserted just before it. Hint: The ArrayList class has a method that does exactly this. Call that method from your insert method. Now add statements to main to allow the user to specify the number to insert and the position at which to insert it. Then, after inserting the new number, print the updated list. Check _____ F. Finally, add code to your insert method that will assure that an IndexOutOfBoundsException cannot be thrown. I.e., your insert method should just print an appropriate error message if the first parameter --- the index at which to insert the new Integer --- is illegal. Hint: What are the legal indices for an ArrayList? What is the smallest? What is the largest? What about the special case of inserting a new value at the end of the list? Try it! Check _____ MY CODE SO FAR: import java.util.ArrayList ; import java.util.Random ; /.

I am stuck on parts E and FExercise 1 NumberListTester.java.pdf

RAJATCHUGH12

I am Joe L. I am a Programming Assignment Expert at programminghomeworkhelp.com. I hold a Ph.D. in Programming from, University of Chicago, USA. I have been helping students with their homework for the past 10 years. I solve assignments related to Programming. Visit programminghomeworkhelp.com or email support@programminghomeworkhelp.com.You can also call on +1 678 648 4277 for any assistance with Programming Assignments.

Programming Assignment Help

Programming Homework Help

Automate the boring stuff with python

DEEPAKSINGHBIST1

lab08/build.bat @echo off cls set DRIVE_LETTER=%1: set PATH=%DRIVE_LETTER%\MinGW\bin;%DRIVE_LETTER%\MinGW\msys\1.0\bin;%DRIVE_LETTER%\MinGW\gtkmm3\bin;%DRIVE_LETTER%\MinGW\gtk\bin;c:\Windows;c:\Windows\system32 set PROJECT_PATH=. make DRIVE_LETTER="%DRIVE_LETTER%" PROJECT_DIR="%PROJECT_PATH%" lab08/CSC2110/CD.h #if !defined CD_H #define CD_H #include "Song.h" #include "Text.h" using CSC2110::String; #include "ListArray.h" using CSC2110::ListArray; namespace CSC2110 { class CD { private: String* artist; String* title; int year; int rating; int num_tracks; ListArray<Song>* songs; public: CD(String* artist, String* title, int year, int rating, int num_tracks); virtual ~CD(); String* getKey(); void addSong(String* title, String* length); void displayCD(); static ListArray<CD>* readCDs(const char* file_name); static int compare_items(CD* one, CD* two); static int compare_keys(String* sk, CD* cd); static char getRadixChar(CD* cd, int index); //1-based }; } #endif lab08/CSC2110/Double.h #if !defined (DOUBLE_H) #define DOUBLE_H namespace CSC2110 { class Double { private: double value; public: Double(double val); ~Double(); double getValue(); }; } #endif lab08/CSC2110/HighPerformanceCounter.h #if !defined (HIGHPERFORMANCECOUNTER_H) #define HIGHPERFORMANCECOUNTER_H namespace CSC2110 { class HighPerformanceCounter { private: double micro_spt; //micro_seconds per tick HighPerformanceCounter(); static HighPerformanceCounter* hpc; static int getTicksPerSecond(); public: virtual ~HighPerformanceCounter(); static HighPerformanceCounter* getHighPerformanceCounter(); int getCurrentTimeInTicks(); double getTimeDifferenceInMicroSeconds(int start_time, int end_time); }; } #endif lab08/CSC2110/Integer.h #if !defined (INTEGER_H) #define INTEGER_H namespace CSC2110 { class Integer { private: int value; public: Integer(int val); virtual ~Integer(); int getValue(); }; } #endif lab08/CSC2110/Keyboard.h #if !defined KEYBOARD_H #define KEYBOARD_H #include "Text.h" using CSC2110::String; #include <string> using namespace std; namespace CSC2110 { class Keyboard { private: Keyboard(); public: virtual ~Keyboard(); static Keyboard* getKeyboard(); //pre: the string (character literal) that will prompt the user for input //post: the input read from the keyboard interpreted as an int is returned int readInt(string prompt); int getValidatedInt(string prompt, int min, int max); //pre: the string that will prompt the user for input //post: the input read from the keyboard interpreted as a double is returned double readDouble(string prompt); double getValidatedDouble(string prom ...

lab08build.bat@echo offclsset DRIVE_LETTER=1s.docx

DIPESH30

File Type: cpp Add the following to your linked list of strings program: 1. allow the user to search for an item (indicate the result of the search) 2. allow the user to insert an item (print the linked list after insertion) 3. allow the user to delete an item (print the linked list after deletion) Here\'s the program I need to have remodified for this assignment as shown below. #include #include #include using namespace std; int main() { struct nodeType { string info; nodeType *link; }; nodeType *first, *newNode, *last; string x; //string input variable cout << \"Enter a string of some kind. Enter \'Done\' when finished.\" << endl; getline(cin, x); first = NULL; last = NULL; while (x != \"Done\") { newNode = new nodeType; newNode->info = x; newNode->link = NULL; if (first == NULL) { first = newNode; last = newNode; } else { last->link = newNode; last = newNode; } cout << newNode->info << \" \"; cout << \"Enter a string of some kind. Enter \'Done\' when finished.\" << endl; getline(cin, x); } return 0; } Solution In the main function, you need to enter the following: main() { int ch, nodes, ele, posi; sin_llist sl; start = NULL; while(1) { cout<<\"1.Search for an item\"<>ch; switch(ch) { case 1: cout<<\"Searching an item:\"<>val; struct node *z; z = start; while (z != NULL) { posi++; if (z->info == val) { flag = true; cout<<\"Element \"<next; } if (!flag) cout<<\"Element \"<>y; struct node *tem, *k; temp = create_node(y); if (start == NULL) { start = tem; start->next = NULL; } else { k = start; start = tem; start->next = k; } cout<<\"Element Inserted at beginning\"<>posi; struct node *z, *ptr; z = start; if (posi == 1) { start = z->next; } else { while (z != NULL) { z = z->next; count++; } if (posi > 0 && posi <= count) { z = start; for (i = 1;i < pos;i++) { ptr = z; z = z->next; } ptr->next = z->next; } else { cout<<\"Position out of range\"<.

File Type cppAdd the following to your linked list of strings pro.pdf

footworld1

source code which create file and write into it

melakusisay507

Use the graph of the function f below to find the following. All local minimum values of f All values at which f has a local minimum If there is more than one answer, separate them with commas. All local minimum values of f All values at which f has a local minimum: Solution Dear student Thank you for using Chegg As per the given curve it is clear that the local minimum values of f are -3 & 0 Values of x when curve attain minimum values are x = -2,3.

Using Array Approach, Linked List approach, and Delete Byte Approach.pdf

fms12345

8799.pdfOr else the work is fine only. Lot to learn buddy.... Improve your ba...

Yashpatel821746

Or else the work is fine only. Lot to learn buddy.... Improve your basics in ...

Yashpatel821746

PYTHONOr else the work is fine only. Lot to learn buddy.... Improve your basi...

Yashpatel821746

Complete the provided partial C++ Linked List program. Main.cpp is given and Link list header file is also given. The given testfile listmain.cpp is given for demonstration of unsorted list functionality. The functions header file is also given. Complete the functions of the header file linked_list.h below. ========================================================= // listmain.cpp #include \"Linked_List.h\" int main(int argc, char **argv) { float f; Linked_List *theList; cout << \"Simple List Demonstration\ \"; cout << \"(List implemented as an Array - Do not try this at home)\ \ \"; cout << \"Create a list and add a few tasks to the list\"; theList = new Linked_List(); // Instantiate a list object theList->Insert(5, 3.1f); // Note: The argument to the funtion should be a float theList->Insert(1, 5.6f); // A constant real number like 3.1 is interpreted as theList->Insert(3, 8.3f); // a double unless it is explicitly defined as a float theList->Insert(2, 7.4f); // by adding an \'f\' to the end of the number. theList->Insert(4, 2.5f); // Show what is in the list theList->PrintList(); // Test the list length function cout << \"\ List now contains \" << theList->ListLength() << \"items.\ \ \"; // Test delete function cout << \"Testing delete of last item in list.\ \"; theList->Delete(4); theList->PrintList(); // Test delete function cout << \"Testing delete of first item in list.\ \"; theList->Delete(5); theList->PrintList(); // Test delete function cout << \"Testing delete of a middle item in list.\ \"; theList->Delete(3); theList->PrintList(); // Test delete function with a known failure argument cout << \"Testing failure in delete function.\ \"; if(theList->Delete(4)) cout << \"Oops! Should not have been able to delete.\ \"; else cout << \"Unable to locate item to delete.\ \"; // Test search (known failure) cout << \"Testing Search function. Search for key 3\ \"; if(theList->Search(3, &f)) cout << \"Search result: theData = %f\ \", f; else cout << \"Search result: Unable to locate item in list\ \"; // Test search (known success) cout << \"Testing Search function. Search for key 2\ \"; if(theList->Search(2, &f)) cout << \"Search result: theData = \" << f << \"\ \"; else cout << \"Search result: Unable to locate item in list\ \"; cout << \"\ \ End list demonstration...\"; return 0; } ===================================================================== =================== // linked_list.h functions #include using namespace std; // Define a structure to use as the list item struct ListItem { int key; float theData; ListItem *next; }; class Linked_List { private: ListItem *head; // Pointer to head of the list public: Linked_List(); // Class constructor ~Linked_List(); // Class destuctor void ClearList(); // Remove all items from the list bool Insert(int key, float f);// Add an item to the list bool Delete(int key); // Delete an item from the list bool Search(int key, float *retVal); // Search for an item in the list int ListLength(); // Return numb.

Complete the provided partial C++ Linked List program. Main.cpp is g.pdf

rajkumarm401

(C++ exercise) 4. Write a recursive version of the binary search alg.docx

ajoy21

coding in C; Create a function called reverseList that takes the head of a linked list, reverses the order of all the nodes. For example, if the list contained 1, 2, 3, 4 in its nodes, the list will now contain 4, 3, 2, 1. please add a main test. Solution Please find the required program below: #include<stdio.h> #include<stdlib.h> struct node { int data; struct node* next; }; void push(struct node** head, int new_element) { struct node* new_node = (struct node*) malloc(sizeof(struct node)); new_node->data = new_element; new_node->next = (*head); (*head) = new_node; } void printList(struct node *head) { struct node *temp = head; while(temp != NULL) { printf(\"%d \", temp->data); temp = temp->next; } } void reverseList(struct node** head) { struct node* prev = NULL; struct node* current = *head; struct node* next; while (current != NULL) { next = current->next; current->next = prev; prev = current; current = next; } *head = prev; } int main() { struct node* head = NULL; push(&head, 12); push(&head, 14); push(&head, 5); push(&head, 8); printf(\"\ Linked list Before Reversing :\ \"); printList(head); reverseList(&head); printf(\"\ Linked list After Reversing :\ \"); printList(head); } -------------------------------------------------------------------------------- OUTPUT: Linked list Before Reversing : 8Â Â 5Â Â 14Â Â 12 Linked list After Reversing : 12Â Â 14Â Â 5Â Â 8 .

coding in C- Create a function called reverseList that takes the head.docx

tienlivick

//This is the main file #include "item.h" #include "itemList.h" int main() { //create a list of items ItemList groceryList; //create temp variables Item anItem; int count = 0, newNum = 0; char newName[MAXCHAR], findName[MAXCHAR]; //read from user and add to list cin >> count; cin.ignore(100, 'n'); for(int i = 0; i < count; i++) { cin >> newName; cin >> newNum; cin.ignore(100, 'n'); anItem.setItemName(newName); anItem.setNumItems(newNum); groceryList.InsertAtFront(anItem); } groceryList.showList(); cin >> findName; if(!groceryList.findItem(findName)) { cout << "Item not found!"; } return 0; } item.h //Item header file // #pragma once #include <iostream> #include <cstring> using namespace std; //constant for char arrays const int MAXCHAR = 101; //class definition class Item { private: char *itemName; int numberOfItems; public: //Constructors Item(); Item(char *, int); //copy constructor Item(const Item &anItem); //destructor ~Item(); //mutators void setItemName(char *); void setNumItems(int); //accessors void getItemName(char *); int getNumItems(); //print item void printItem(); //assignment op overloading Item& operator= (const Item& anItem); }; item.cpp //This is the implementation file for item.h (the Item class) #include "item.h" //default constructor Item::Item() { //allocate memory for itemName itemName = new char[MAXCHAR]; strcpy(this->itemName, "no name"); numberOfItems = 0; } //constructor with parameters Item::Item(char tempItemName[], int tempNumItems) { //allocate memory for itemName itemName = new char[strlen(tempItemName) + 1]; strcpy(itemName, tempItemName); numberOfItems = tempNumItems; } //Copy Constructor Item::Item(const Item &anItem) { //allocate memory for itemName itemName = new char[strlen(anItem.itemName) + 1]; strcpy(itemName, anItem.itemName); numberOfItems = anItem.numberOfItems; } //destructor Item::~Item() { //deallocate the memory for itemName if(itemName) { delete [] itemName; itemName = NULL; } } //mutator functions void Item::setItemName(char *newItemName) { if(itemName) { delete [] itemName; } itemName = new char[strlen(newItemName) + 1]; strcpy(itemName, newItemName); } //for numberofitems void Item::setNumItems(int newNum) { numberOfItems = newNum; } //accessor functions void Item::getItemName(char *returnItemName) { strcpy(returnItemName, itemName); } int Item::getNumItems() { return numberOfItems; } //print the item void Item::printItem() { cout << numberOfItems << ' ' << itemName << endl; } //assignment operator overload Item& Item::operator= (const Item& anItem) { //if it is a self copy, don't do anything if (this == &anItem) return *this; //make current object *this a copy of the passed in item else { this->setItemName(anItem.itemName); this->numberOfItems = anItem.numberOfItems; return *this; } } itemList.h //This is the itemList header file. //Class for a list of items #pragma once #include "item.h" //define class for a list of items class ItemList { private: //struct for each Node struct Node { Item d.

This is the main file include itemh include itemList.pdf

info334223

Similar to 3. Implement the UnsortedList class to store a list of numbers that .pdf (20)

2.(Sorted list array implementation)This sorted list ADT discussed .pdf

Describe a data structure that supports both removeMin() and rem.pdf

You must implement the following functions- Name the functions exactly.docx

Lab_3- Objective- Experiment with Lists- Stacks- and Queues- Simulate.docx

Please help solve this in C++ So the program is working fin.pdf

To write a program that implements the following C++ concepts 1. Dat.pdf

I am stuck on parts E and FExercise 1 NumberListTester.java.pdf

Programming Assignment Help

Automate the boring stuff with python

lab08build.bat@echo offclsset DRIVE_LETTER=1s.docx

File Type cppAdd the following to your linked list of strings pro.pdf

source code which create file and write into it

Using Array Approach, Linked List approach, and Delete Byte Approach.pdf

8799.pdfOr else the work is fine only. Lot to learn buddy.... Improve your ba...

Or else the work is fine only. Lot to learn buddy.... Improve your basics in ...

PYTHONOr else the work is fine only. Lot to learn buddy.... Improve your basi...

Complete the provided partial C++ Linked List program. Main.cpp is g.pdf

(C++ exercise) 4. Write a recursive version of the binary search alg.docx

coding in C- Create a function called reverseList that takes the head.docx

This is the main file include itemh include itemList.pdf

More from kisgstin23

John Smith wrote fraudulent checks and made false statements when applying for credit. He is most likely guilty of a white collar crime. True False Solution The answer is given below True White collar crime in general terms means fraudulent activities with regards to finance and money laundering. In the above case John Smith is involved with financial fradulent crime by writing false statement when applying for credit..

John Smith wrote fraudulent checks and made false statements when ap.pdf

3. Implement the UnsortedList class to store a list of numbers that .pdf

Recommended

Recommended

More Related Content

Similar to 3. Implement the UnsortedList class to store a list of numbers that .pdf

Similar to 3. Implement the UnsortedList class to store a list of numbers that .pdf (20)

More from kisgstin23

More from kisgstin23 (20)

Recently uploaded

Recently uploaded (20)

3. Implement the UnsortedList class to store a list of numbers that .pdf