2) Consider an ordered linked list with n entries in ascending order. Each entry has 2 components: a key component of type int and the usual next link component. a) Write a function to insert a new entry with key x into its proper place. Note that a key may be added as the new first or last entry in the list, and so there are n+1 locations where x could be inserted. b) Assume that each of the n+1 possibilities is equally likely. Determine the average number of times ints are compared in the above insertion algorithm. Your answer should be a precise function of n. An asymptotic answer (such as one that uses big-oh, big-theta, etc.) is not ассeptable.

2) Consider an ordered linked list with n entries in ascending order. Each entry has 2 components: a key component of type int and the usual next link component. a) Write a function to insert a new entry with key x into its proper place. Note that a key may be added as the new first or last entry in the list, and so there are n+1 locations where x could be inserted. b) Assume that each of the n+1 possibilities is equally likely. Determine the average number of times ints are compared in the above insertion algorithm. Your answer should be a precise function of n. An asymptotic answer (such as one that uses big-oh, big-theta, etc.) is not ассeptable.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 17SA

See similar textbooks

Similar questions

Suppose there are two singly linked lists both of which intersect at some point and become a single linked list. The head or start pointers of both the lists are known, but the intersecting node is unknown. Also, the number of nodes in each of the list before they intersect are unknown and both the list may have it different. List1 may have n nodes before it reaches intersection point and List2 might have m nodes before it reaches intersection point where m and n may be m = n, m > n or m < n. Give an algorithm for finding the merging point. Hints: A brute force approach would be to compare every pointer in one list with every pointer in another list. But in this case the complexity would be O(mn)
Write a function that changes the places of the first and second nodes of a linked list. I.e. the First node will become the second node, and the second node will become the first node. THE FUNCTION WILL NOT EXCHANGE DATA, IT WILL CHANGE LINKS.
2.Consider a polynomial that can be represented as a node which will be of fixed size having 3 fields which represent the coefficient and exponent of a term plus a pointer to the next term or to 0 if it’s the last term in the polynomial. Then A = 11x4 -2x is represented by fig below A 11 4 -2 1 0 Represent the following polynomials in linked list form P = G – 3L +2F
Consider the following scenario: a software creates and manipulates a linked list, like follows:The software would normally maintain track of two special nodes, which are as follows: Explanation of how to utilise the null reference in the node of the linked list in two frequent situations?
Exercise 2 Given the following function to update a node in a standard linked list:public boolean update(Node head, int oldValue, int newValue){if (head == null)return false;while (head != null)if (head.data == oldValue){head.data = newValue;return true;}elsehead = head.next;return false;}There may be an error with the code. Answer the following:1) Design your own linked list of 4 nodes with different values2) If the code has an error, describe the issue and provide an example of calling theupdate function with values of your choice and show what the linked list looks likea. Also, show the code changes you would make to fix the error3) If the code does not have an error, provide an example of calling the update functionwith values of your choice and show what the linked list looks likeFor example, if your linked list was 1 -> 2 -> 3 -> 4, and you think there is an error withthis code, you could say something like “the problem with the code is xxx and after callingupdate(3, 5),…
Consider the following linked list: Give the correct sequence to steps to the list be like below: I Move pointer to position to insert i.e. node K II Point the new node to next of node K III Point the node K to the new node. IV Create new node S Select one: A.IV, I, II, III B.IV, I, III, II C.IV, III, II, I D.I, II, III, IV
Write a rudimentary link program to check whether all variables have been initialized and whether local variables have the same names as global variables. Create a linked list of global variables, and for each function, create a linked list of local variables. In both lists, store information on the first initialization of each variable and check if any initialization has been made before a variable is used for the first time. Also, compare both lists to detect possible matches and issue a warning if a match is found. The list of local variables is removed after the processing of one function is finished and created anew when a new function is encounter. Consider the possibility of maintaining alphabetical order on both lists. Use a java program only.
In C++, Consider a singly linked list where each node contains two fields – integer dataand node type pointer next. The head pointer of the list, a position, and a valueof data is given. You have to insert a node with the given value at the givenposition. You have to consider any position including first or last. You have toImplement an insert operation as per the above specification.
You are to work to develop a linked-list processing function IsolateTargetSoloAsTail that is to process a linked list as follows. ● If target cannot be found on the given list, a new node containing target is created and added to the end (made the new tail node) of the list. ► This includes the case where the given list is empty, in which case the new tail node added is also new head node. (This is so because the only node in a 1-node list is both the head and tail node of the list.) ● If target appears only once on the given list, the target-matching node is moved to the end (made the new tail node) of the list. ► In case the target-matching node is already the tail node (of the given list), then nothing needs to be done. ● If target appears multiple times on the given list, the first target-matching node is moved to the end (made the new tail node) of the list, and all other target-matching nodes are to be deleted from the list. ►…
1. Implement a function insertBook(Book newBook) to add a book at the end of thelinked list.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object as the parameter to the functiond. Store the Book object into the Node objecte. “Link” the object with the rest of the linked list2. Implement a function insertBefore(Book newBook, int bookID) to add a book infront of another book given its bookID.a. Ask the librarian to input all the necessary book information.b. Use the information to create a Book objectc. Pass through the Book object and bookID as the parameter to the functiond. Search for the matching Book objecte. Store the Book object into the Node objectf. “Link” the object with the rest of the linked list3. Implement a function searchBook(int bookID) to search for a book by its bookIDcode and return the book object.a. Ask the librarian to input the bookID.b. If the book doesn’t exist display an…
1-Write a C program to show operations on a singly linked where each node consists of integers. (a) Insert (At beginning, At end) (b) Delet (At beginning, At end) (c) Search (d)reverse (e) Print middle element 2 Write a C program using dynamic variable & pointers to construct a singly linked list consisting of the following information in each node. Student id (integer), student name (character string) & semester (integer). 3 Write a C program using dynamic variables & pointers to construct an ordered (ascending) singly linked list based on the rank of the student, where each node consists of the following information student id( integer) student name(character), rank(integer).
Consider a singly linked list where each node contains two fields – integerdata and node type pointer next. The head of the list and a value of the data isgiven. You have to find the node that contains the given data and delete thatnode. Data may occur at any position of the list including first or last. In caseof unavailability of the given data, you have to print a message. You have toImplement a delete operation of a singly linked list.