Consider the implementation of the Ordered Linked list class, implement the following functions as part of the class definition: ▪ index(item) returns the position of item in the list. It needs the item and returns the index. Assume the item is in the list. 
 ▪ pop() removes and returns the last item in the list. It needs nothing and returns an item. Assume the list has at least one item. 
 ▪ pop_pos(pos) removes and returns the item at position pos. It needs the position and returns the item. Assume the item is in the list. 
 ▪ a function that counts the number of times an item occurs in the linked list ▪ a function that would delete the replicate items in the linked list (i.e. leave one occurrence only of each item in the linked list) Your main function should do the following: ▪ Generate 15 random integer numbers in the range from 1 to 5. ▪ Insert each number (Item in a node) in the appropriate position in a linked list, so you will have a sorted linked list in ascending order. ▪ Display the generated linked list items. ▪ Call the index(item), pop() and pop_pos(pos) functions to test them. ▪ Display the linked list items ▪ Display the number of occurrences of each item. ▪ Delete the replicate items in the linked list (i.e. leave one occurrence only of each item in the linked list) ▪ Display the final linked list items that should be unique and sorted. Make sure your code is readable and well-documented. It must begin with a title block includes problem definition. Each function must also begin with a title block that describes the task of the function, input parameters and return value.

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
icon
Related questions
icon
Concept explainers
Question

Consider the implementation of the Ordered Linked list class, implement the following functions as part of the class definition:

▪ index(item) returns the position of item in the list. It needs the item and returns the index. Assume the item is in the list. 


▪ pop() removes and returns the last item in the list. It needs nothing and returns an item. Assume the list has at least one item. 


▪ pop_pos(pos) removes and returns the item at position pos. It needs the position and returns the item. Assume the item is in the list. 


▪ a function that counts the number of times an item occurs in the linked list

▪ a function that would delete the replicate items in the linked list (i.e. leave one occurrence only of each item in the linked list)

Your main function should do the following:

▪ Generate 15 random integer numbers in the range from 1 to 5.
▪ Insert each number (Item in a node) in the appropriate position in a

linked list, so you will have a sorted linked list in ascending order.
▪ Display the generated linked list items.
▪ Call the index(item), pop() and pop_pos(pos) functions to test them.
▪ Display the linked list items
▪ Display the number of occurrences of each item.
▪ Delete the replicate items in the linked list (i.e. leave one occurrence only

of each item in the linked list)
▪ Display the final linked list items that should be unique and sorted.

Make sure your code is readable and well-documented. It must begin with a title block includes problem definition. Each function must also begin with a title block that describes the task of the function, input parameters and return value.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 8 images

Blurred answer
Knowledge Booster
Types of Linked List
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education