8. In the linked list implementation of linear queue, there are two pointers front and back. Which of these pointers will change during an insertion operation on a NON-EMPTY queue? A. Only the back pointer. B. Only the front pointer. C. Both front and back pointer. D. None of the mentioned above.

Using C++ The specifications for the Sorted List ADT state that the item to be deleted is in the list. a. Rewrite the specification for DeleteItem so that the list is unchanged if the item to be deleted is not in the list. b. Implement DeleteItem as specified in (a) using an array-based. c. Implement DeleteItem as specified in (a) using a linked implementation. d. Rewrite the specification for DeleteItem so that all copies of the item to be deleted are removed if they exist. e. Implement DeleteItem as specified in (d) using an array-based. f. Implement DeleteItem as specified in (d) using a linked implementation.

Compare an Array, Single Linked List and Circular Linked List. Which is better to use in general and why? Which one is better for implementing a Queue or Stack?

Objectives: The code for the different stack and queue operations in both implementations (array and linked list) are discussed in the lectures: and are written in the lectures power point. So the main object of this assignment is to give the student more practice to increase their understanding of the different implementation of these operations. - The students also are asked to write by themselves the main methods in the different exercises below; The Lab procedures: The following files must be distributed to the students in the Lab - arrayImpOfStack.java // it represents an array implementation of the stack. - pointerImOfStack.java // it represents a Linked List implementation of the stack. - pointerImOfQueue.java // it represents a pointer implementation of the queue. Then the students by themselves are required to write the code for the following questions Ex1) Given the file arrayImpOfStack.java then write a main method to read a sequence of numbers           and using the stack…

Suppose you were storing a collection of n words into a container, and wanted to be able to retrieve (find) any word in O(n) time (or faster). Which of the following STL containers would work? SELECT ALL THAT APPLY list priority_queue queue vector set stack

Write a function, to be included in an unsorted linked list class, called getLargest, that will return the largest item in the list.

Write a C code that will search an int type target from a dynamic linked list. The linked list contains int type values inside each of the nodes. The “search” function will use following input-output arguments,Input: Pointer to the head of the list that you are searching Target value that you are searchingOutput: Pointer to the node that contains the target if found or, NULL if not found.