
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
C++ Program
This assignment consists of 2 parts.
1. Append Process:
- Create a Linked List that will store integers.
- Using the provided getData() method (See below), append 20 numbers to the Linked List.
- After loaded, display the data. Start with the Head of the list.
- Prompt for user to proceed.
2. Insert Process:
- Delete the contents of the Linked List in part 1.
- Using the provided getData() method, insert 20 numbers into the list and place them in the list in numerical order (1..X). Do not allow duplicates to be in the list. Hint: Do not allow a duplicate to count as a member of the 20.
- After loaded, display the data per line in order, starting with the Head of the list.
- Display the content with a leading increasing number 1- 20. i.e.
- 11
- 13
- 14
- 20
- The result should be a naturally sorted.
- Display the content with a leading increasing number 1- 20. i.e.
Do not use the STL list container for this exercise. Use the features described in section - Linked List Operations. Using a Class to manage the linked list as shown in section is required.
// Requires #include <iostream>
int getData() {
return (rand() % 100);
}
Deliverable is a working CPP program (including header file) and pseudo-code for task 2b.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps with 1 images

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- C++ Program This assignment consists of 2 parts. 1. Append Process: Create a Linked List that will store integers. Using the provided getData() method (See below), append 20 numbers to the Linked List. After loaded, display the data. Start with the Head of the list. Prompt for user to proceed. 2. Insert Process: Delete the contents of the Linked List in part 1. Using the provided getData() method, insert 20 numbers into the list and place them in the list in numerical order (1..X). Do not allow duplicates to be in the list. Hint: Do not allow a duplicate to count as a member of the 20. After loaded, display the data per line in order, starting with the Head of the list. Display the content with a leading increasing number 1- 20. i.e. 11 13 14 20 The result should be a naturally sorted. Do not use the STL list container for this exercise. Use the features described in section - Linked List Operations. Using a Class to manage the linked list as shown in section is…arrow_forwardpython language Write the lines of code that will print out all of the data in a Linked List.arrow_forwardPython Suppose a list empList consists of sublists with [id,fullName] empList = [ ] Ask the user to enter their ID and name Put that information into empList Ask the user to enter a name Print the ID of the person with that name OR “Name not found” if that name isn’t in empList. Ask the user to enter a IDRemove that entry from empList OR print “No delete – name not found” if the ID isn’t there. Ask the user to enter an ID.If empList has an entry with that ID, ask the user for a newFullName and replace the existing entry in empList Print the entries in List, one per line so that the output looks like this:ID Name123 Joe Brown235 Molly Smith Please use format to do this printingarrow_forward
- C++ program This assignment consists of 2 parts. 1. Append Process: Create a Linked List that will store integers. Using the provided getData() method (See below), append 20 numbers to the Linked List. After loaded, display the data. Start with the Head of the list. Prompt for user to proceed. 2. Insert Process: Delete the contents of the Linked List in part 1. Using the provided getData() method, insert 20 numbers into the list and place them in the list in numerical order (1..X). Do not allow duplicates to be in the list. Hint: Do not allow a duplicate to count as a member of the 20. After loaded, display the data per line in order, starting with the Head of the list. Display the content with a leading increasing number 1- 20. i.e. 11 13 14 20 The result should be a naturally sorted. Do not use the STL list container for this exercise. Use the features described in section - Linked List Operations. Using a Class to manage the linked list as shown in section is…arrow_forwardDraw how an item can be added to the front of a doubly linked list. (show the steps in multiple pictures)arrow_forwardData Structures/Algorithms in Javaarrow_forward
- For each of the following Python list methods indicate whether the method mutates the list. Write "yes" if the method mutates the list or "no" if the method does not mutate the list. append sort reverse index insert count remove poparrow_forward{7,14,26,43,46,50,81} trace the binary search code and fill out the table for 3 different cases: Search for the value that is in the table. Search for the value that is greater than any value in the list. Search for the value that is smaller than any value in the list. low high Low<high mid callarrow_forward1. Create/Make grades.py to do the following: a) Create an empty list named grades. b) Add the following grades one at a time to grades. 92, 51, 83, 37, 72 Output Example: c) Compute the total of these grades using the index to reference each number in grades. [92, 51, 83, 37, 72] Average: 67.00 d) Compute the average of these grades using the len method. Median: 83 e) Print the average with a precision of two decimal places. [92, 83, 72] Average: 82.33 f) Compute the location of the median grade using the len method. g) Print the median grade using index syntax. h) Remove all failing grades (lower than 60) one at time from the list. i) Print the updated list of grades. i) Print the updated average. Average = the sum of all elements divided by the number of elements Median = the middle element in a list of elementsarrow_forward
- In the function below, return the last element (the one at the last index) of the list provided as the parameter called list1. Assume that the argument is a list.arrow_forwardComplete the method “readdata”. In this method you are to read in at least 10 sets of student data into a linked list. The data to read in is: student id number, name, major (CIS or Math) and student GPA. You will enter data of your choice. You will need a loop to continue entering data until the user wishes to stop. Complete the method “printdata”. In this method, you are to print all of the data that was entered into the linked list in the method readdata. Complete the method “printstats”. In this method, you are to search the linked list and print the following: List of student’s id and names who are CIS majors List of student’s id and names who are Math majors List of student’s names along with their gpa who are honor students (gpa 3.5 or greater) All information for the CIS student with the highest gpa (you may assume that different gpa values have been entered for all students) CODE (student_list.java) You MUST use this code: package student_list;import…arrow_forwardTrue or False For each statement below, indicate whether you think it is True or False. If you like, you can provide a description of your answer for partial credit in case you are incorrect. Use the standard linked list below to answer True/False statements 9-12: 8 7 null 4 10 The “head” pointer of this list is pointing to Node 4 If we called “insert(5)”, the new node’s “next” pointer will point to Node 8 If we called “delete(10)”, Node 7’s “next” pointer will point to Node 8 If we called “search(20)”, the “head” pointer will be at Node 4 after the search function endsarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON

Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education