**Instructions:**1. Do not change the name of the class.2. Write comments for each line to explain your code.3. Follow the guidelines discussed in class for submitting programming assignments when submitted via Blackboard.4. Use the attached file in Blackboard to work on this lab.**Task:**Extend the class (linkedListType and/or unorderedLinkedList) by adding the following operation:We discussed the function `deleteSmallest()` which finds and deletes the first occurrence of the smallest element in a list. In this lab, we will implement the following function (see (A)) and write a test program to perform several tasks (see (B)).**(A)** Find the smallest element in the list. Then, delete all occurrences of this element. Add these functions as abstract functions in the class `linkedListType` and provide their definitions in the class `unorderedLinkedList`.*(Hint: Add the abstract type `virtual Type detectSmallestElement() = 0;` in the class `linkedListType`.)***(B)** Write a test program to perform the following tasks:- **(A)** Create a linked list object (object type is integer).- **(B)** Prompt the user to enter inputs, providing an appropriate ending statement (use -999 to end user input).- **(C)** Print the list.- **(D)** Request the user to enter the number to be deleted, print the list after deleting all occurrences of the number, and print the current length of the list.- **(E)** Find the smallest element and delete it from the list (only the first occurrence if more than one exists). Then, list after deleting the smallest element and print the current length of the list.- **(F)** Find the smallest element in the list, then delete all occurrences of this element. List after deleting all occurrences and print the current length of the list.

Solution: C++ implementation: arrayListType.h #ifndef H_arrayListType#define…

Answered: Instruction: 1) Do not change the name…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Two stacks of the same kind are the same if they contain the same number of elements and have the same items at the same places. Overload the relational operator == for the class stackType, which returns true if two stacks of the same type are identical; otherwise, it returns false. Also, write the function template definition to overload this operator. Create a programme to test the overloaded operators and functions of the stackType class.
A for construct is used to build a loop that processes a list of elements in programming. To do this, it continues to operate forever as long as there are objects to process. Is this assertion truthful or false? Explain your response.
Write a class for the city database using unordered lists. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as integer x and y coordinates. Your database should allow records to be inserted, deleted by name, and searched by name or coordinate. Implement the database using an array-based list. Develop a simple test (as the main function) Run your program and present the results of the test.
Need help with this Java review If you can also send a screenshot will be helpful to understan Objective: The purpose of this lab exercise is to create a Singly Linked List data structure . Please note that the underlying implementation should follow with the descriptions listed below. Instructions : Create the following Linked List Data Structure in your single package and use "for loops" for your repetitive tasks. Task Check List ONLY "for" loops should be used within the data structure class. Names of identifiers MUST match the names listed in the description below. Deductions otherwise. Description The internal structure of this Linked List is a singly linked Node data structure and should have at a minimum the following specifications: data fields: The data fields to declare are private and you will keep track of the size of the list with the variable size and the start of the list with the reference variable data. first is a reference variable for the first Node in…
Do not add import statements
1. Design your own linked list class to hold a series of integers using C++. The class should have member functions for appending, inserting, and deleting nodes. Don't forget to add a destructor that destroys the list. Demonstrate the class with a driver program. 2. Modify the linked list class you created to add a print member function. The function should display all the values in the linked list. Test the class by starting with an empty list, adding some elements, and then printing the resulting list out.
Fill in the blanks in each of the following statements (CHOOSE ONLY TEN): 5 AP 1. An --- is created to store information of the method such as the parameters and (0- local variables specific to a given call of the method, and information about which command in the body of the method is currently executing. 21. One application of stack is 32. The type of linked list which is contain more memory space is 3. The --------- operation return the top item of stack. 54. The method used to removes beginning and ending spaces of string 6 5. stack is said underflow when 6. String objects are stored in a special memory area known as 7. Two dimensional array that have a different length is called ----------- A 8. One way to create string object is -------- 10 9. is known as expression. 110. Example of none linear data structures is 12 11. A is a method that contains a statement that makes a call to itself. 13 12. One application of queue is
Please answer the question in the screenshot. The language used is Java.
Please answer the question in the screenshot. The language used here is in Java.
Please Explain your work and this should be in "C Language" and this is a data structure subject Thank you!
Implement the following function using C++ remove_redundant() This method will clear out the duplicate numbers in your linked list. It is also imperative that you will use an instance of this Linked List class to hold the numbers that you have already checked and use the methods in this instance. In the example 10 -> 10 -> 20 -> 30 -> 10, calling remove_redundant() will remove the other 2 10's that occurred later, hereby making the list 10 -> 20 -> 30. Limitation: You cannot have a nested loop here nor use methods that employ loops as the performance of our linked list will suffer.
In C Programming: Write a function printCourseRow() which receives a course pointer and prints all its fields as a single row. Use proper formatting so that when we print 2 or more courses as rows, the same members align below each other. Test the function, but don’t include the testing code in your homework.Upload a screenshot of a sample output.

SEE MORE QUESTIONS

Recommended textbooks for you

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

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

SEE MORE TEXTBOOKS