For each of the following, choose the most suitable data structure: an unsorted array. linked list, doubly linked list, circular linked list, stack, queue. To get full credit, explain the reason 3) briefly. a) Customer servicing on first come first served basis. b) A list must be maintained so that any element can be accessed randomly. c) A text-editing program requires remembering the operations it performed in opposite order. d) The size of a file is unknown. The entries need to be entered as they come in. Entries must be deleted when they are no longer needed. It is important that the structure has flexible memory management. e) A list must be maintained so that elements can be added to the beginning or end in O(1).

For each of the following, choose the most suitable data structure: an unsorted array. linked list, doubly linked list, circular linked list, stack, queue. To get full credit, explain the reason 3) briefly. a) Customer servicing on first come first served basis. b) A list must be maintained so that any element can be accessed randomly. c) A text-editing program requires remembering the operations it performed in opposite order. d) The size of a file is unknown. The entries need to be entered as they come in. Entries must be deleted when they are no longer needed. It is important that the structure has flexible memory management. e) A list must be maintained so that elements can be added to the beginning or end in O(1).

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

1. a function that takes in a list (L), and creates a copy of L. note: The function should return a pointer to the first element in the new L. [iteration and recursion]. 2. a function that takes in 2 sorted linked lists, and merges them into a single sorted list. note: This must be done in-place, and it must run in O(n+m).
Question #7. SORTED LIST NOT UNSORTED C++ The specifications for the Sorted List ADT state that the item to be deleted is in the list. Rewrite the specification for DeleteItem so that the list is unchanged if the item to be deleted is not in the list. Implement DeleteItem as specified in (a) using an array-based. Implement DeleteItem as specified in (a) using a linked implementation. Rewrite the specification for DeleteItem so that all copies of the item to be deleted are removed if they exist. Implement DeleteItem as specified in (d) using an array-based. Implement DeleteItem as specified in (d) using a linked implementation.
Given pointers to the head nodes of linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share a common node, return that node's value. Note: After the merge point, both lists will share the same node pointers. Example In the diagram below, the two lists converge at Node x: [List #1] a--->b--->c \ x--->y--->z--->NULL / [List #2] p--->q Function Description Complete the findMergeNode function in the editor below. findMergeNode has the following parameters: SinglyLinkedListNode pointer head1: a reference to the head of the first list SinglyLinkedListNode pointer head2: a reference to the head of the second list Returns int: the value of the node where the lists merge Input Format Do not read any input from…
For each of the following scenarios choose the “best” data structure from the following list or acombination of data structures: an UNSORTED ARRAY, LINK LIST, DLL, circular LINKLIST, STACK, QUEUE, DOUBLE ENDED QUEUE, HEAP, BST. In each case, justify youranswer briefly.i. When the data dynamically growsii. A list must be maintained so that any element can be accessed randomlyiii. A program needs to remember operations it performed in opposite orderiv. If the developer wants to add or remove both endsv. Whenever the developer wants quick access to the largest (or smallest) item.
@6 The Reference-based Linked Lists: Select all of the following statements that are true. options: As a singly linked list's node references both its predecessor and its successor, it is easily possible to traverse such a list in both directions. According to the terminology introduced in class, the head reference variable in a singly linked list object references the list's first node. According to the terminology introduced in class, in a doubly linked list, each node references both the head and tail node. In a double-ended singly linked list, the tail reference variable provides access to the entire list. In a circular linked list, the last node references the first node.
Both array lists and linked lists are examples of how a list may be implemented. Discuss a scenario when a linked list might be preferable than a list stored in an array. Explain your reasoning in each situation.
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.
TRUE or FALSE? Answer the following question and state the reason why: The delete operation only involves the removing of the node from the list without breaking the links created by the next node. You need an array to represent each node in a linked list. STL lists are also efficient at adding elements at their back because they have a built-in pointer to the last element in the list. A circular linked list has 2 node pointers. cout<<list.back()<<endl; = The back member function returns a reference to the last element in the list. In a Dynamic Stack, the pointer top stays at the head after a push operation. During a Pop operation in Static Stack, the elements are being moved one step up. In a dynamic implementation of stack, the pointer top has an initial value of null. In a dynamic stack, the node that was popped is deleted. In a dynamic stack, the pointer top stays at the head after push operation. STL function top returns a reference to element at the top of the…
There are many differences between array and linked list, one of these differences: a. In a linked list insertion and deletion takes more time b. Array supports random access while linked List supports sequential access c. in linked list, elements are stored in contiguous memory location while in array are stored anywhere in the memory d. None of the above
Short answer: Answer the following in your own words: 1) Your friend says they implemented a stack as a linked list with reference pointers to both a head and the tail node (i.e. they implemented a stack as a double endedlinked list). They said this significantly improved the performance for all functions (push, pop, search, and update). Are they correct? Why or why not?
5. Assume you are using the text's array-based queue and have just instantiated a queue of capacity 10. You enqueue 5 elements and then dequeue 2 elements. Which indices of the internal array elements hold the remaining elements? Group of answer choices 0 to 2 1 to 3 2 to 4 0 to 4 7 to 9 6. Suppose you start with an empty queue and perform the following operations: enqueue 1, enqueue 2, dequeue, enqueue 3, enqueue 4, dequeue, enqueue 5. What are the resultant contents of the queue, from front to back? Group of answer choices 1, 2, 3, 4, 5 1, 3, 5 1, 2, 3 3, 4, 5 7. The text's approach to creating an array-based queue implementation is: Group of answer choices the same as its approach to the array-based stack. the fixed-front approach. the floating-front approach. 8. The following sequence of operations essentially leaves a queue unchanged. Group of answer choices enqueue followed by dequeue dequeue followed by enqueue two enqueues followed by…
8. The following sequence of operations essentially leaves a queue unchanged. Group of answer choices enqueue followed by dequeue dequeue followed by enqueue two enqueues followed by two dequeues two isEmptys followed by two isFulls 9. Recall that within the ArrayBoundedQueue the front variable and the rear variable hold the indices of the elements array where the current front and rear elements, respectively, of the queue are stored. Which of the following code sequences could be used to correctly enqueue element into the queue, assuming that enqueue is called on a non-full queue and that the code also correctly increments numElements? Group of answer choices rear++; elements[rear] = element; front++; elements[front] = element; rear = (rear + 1) % elements.length; elements[rear] = element; front = (front + 1) % elements.length; elements[front] = element; 10. Assume you are using the text's array-based queue and have just instantiated a queue of capacity 10. You…