Write a function, to be included in a sorted linked list class, called printPosition, that will receive a parameter and print its position within the list ( position 1 if first, position 2 if second...). If the item is not in the list, specify it in a printing. Consider efficiency.

Write a function, to be included in a sorted linked list class, called printPosition, that will receive a parameter and print its position within the list ( position 1 if first, position 2 if second...). If the item is not in the list, specify it in a printing. Consider efficiency.

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

Array lists and linked lists are both examples of list implementations. Give an example of a case in which an array list might be preferable over a linked list. Justify your actions in each scenario.
Implements clone which duplicates a list. Pay attention, because if there are sublists, they must be duplicated as well. Understand the implementation of the following function, which recursively displays the ids of each node in a list def show_ids(M, level=0): k = M.first_node while k is not None: print(" "*2*level, id(k)) if (str(k.value.__class__.__name__) == str(M.__class__.__name__)): show_ids(k.value, level+1) k = k.next W=L2(Node(10, Node(L2(Node(14, Node(15, Node(L2(Node(16, Node(17))))))), Node(20, Node(30)))) )show_ids(W) Develop your solution as follows: - First copy the nodes of the current list (self) - Create a new list with the copied nodes - Loop through the nodes of the new list checking the value field - If this field is also a list (use isinstance as in the show_ids function) then it calls clone on that list and substitutes the value. Complete the code: def L4(*args,**kwargs): class L4_class(L):…
Create a generic function print(ls, n) that prints to standard output the first n elements of list ls. The elements are printed on separate lines. If ls has less than n elements, then the entire list is printed. I attached a picture of what I have so far. I'm having a hard time figuring out how I would make it print a certain number of elements that I specify.
In AList class, we have the get function to return an item at a particular position in list indexed by i. For example, let L=[1,2,3]. A call to L.get (1) will return 2. Write in the answer an enhanced get function to accept negative indices. Specifically, the last item has index -1, the second last item has index -2, and the i-th last item has index -i. For example, let L=[1,2,31. A call to L.get (-1) will return 3. A call to L.get (-2) will return 2. A call to L.get (-3) will return 1. Below is a skeleton of the AList class: template class AList { private: /** The underlying array. */ ItemType *items; /** Stores the current size of the list. */ int count; /** Max number of items allowed. */ int maxCnt; public: // Other functions omitted... ItemType get (int i) { // Copy this function in the answer and write code below this line. } ;
Write a program in c++ and make sure it works, that reads a list of students (first names only) from a file. It is possible for the names to be in unsorted order in the file but they have to be placed in sorted order within the linked list.The program should use a doubly linked list.Each node in the doubly linked list should have the student’s name, a pointer to the next student, and a pointer to the previous student. Here is a sample visual. The head points to the beginning of the list. The tail points to the end of the list. When inserting consider all the following conditions:if(!head){ //no other nodes}else if (strcmp(data, head->name)<0){ //smaller than head}else if (strcmp(data, tail->name)>0){ //larger than tail}else{ //somewhere in the middle} When deleting a student consider all the following conditions:student may be at the head, the tail or in the middleBelow, you will find a sample of what the file looks like. Notice the names are in…
What is the benefit of having a link-based implementation of the List that also tracks a reference to the last Node in the chain? Select one: a. It requires more pointes to be adjusted when performing the basic List operations b. It makes adding a new entry to a specified position an O(1) operation c. It makes the remove operation an O(1) operation d. It makes adding a new entry to the back of the List an O(1) operation
Given the linked list data structure, implement a sub-class TSortedList that makes sure that elements are inserted and maintained in an ascending order in the list. So, given the input sequence {1,7,3,11,5}, when printing the list after inserting the last element it should print like 1, 3, 5, 7, 11. Note that with inheritance, you have to only care about the insertion situation as deletion should still be handled by the parent class.
Execute a program that will split a circularly linked list P with n nodes intotwo circularly linked lists P1, P2 with the first n/2 and the last n – n/2 nodes ofthe list P in them.
Write a function, to be included in an unsorted linked list class, called getLargest, that will return the largest item in the list.
A double linked list may be implemented in a workspace array by utilising only one index next. That is, we do not need to retain a distinct field back in the workspace array nodes to detect the backward linkages. The goal is to add a member workspace[current] into workspace[current] rather than the index of the next element on the list. The difference is the index of the next item less the index of the entry preceding current. We must additionally keep two pointers to subsequent nodes in the list, the current index and the prior index of the node right before current in the linked list.To find the next entry of the list, we calculate workspace[current].difference + previous; Similarly, to find the entry preceding previous, we calculate current − workspace[previous].difference;
Q.2. Implement a single linked list. Elements of this linked list should be of integer type, user would provide values as input for elements of this linked list. Which does not allow insertion of duplicate value to the list.