True or False For each statement below, indicate whether you think it is True or False. provide a description of your answer for partial credit in case you are incorrect. 2) Given a queue implemented as an array with a maximum capacity of 5 elements and O(1) insert and remove, and the following functions are performed: Insert(7), Insert(6), Insert(5), Insert(4), Remove(), Remove(), Insert(3), Insert(2), Insert(1), Remove() a. The removeIndex value will be index 4 b. The array will be [2][1][ ][4][3] c. The insertIndex value will be index 2

True or False For each statement below, indicate whether you think it is True or False. provide a description of your answer for partial credit in case you are incorrect. 2) Given a queue implemented as an array with a maximum capacity of 5 elements and O(1) insert and remove, and the following functions are performed: Insert(7), Insert(6), Insert(5), Insert(4), Remove(), Remove(), Insert(3), Insert(2), Insert(1), Remove() a. The removeIndex value will be index 4 b. The array will be [2][1][ ][4][3] c. The insertIndex value will be index 2

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 18SA

See similar textbooks

Similar questions

True or False For each statement below, indicate whether you think it is True or False. provide a description of your answer for partial credit in case you are incorrect. 1) Given a stack implemented as an array, and the following functions performed: Push(A), Push (B), Push(C), Pop(), Push(D), Push(E), Pop(), Push(F) a. The array will be [A][B][D][F] and the “top” of the stack will be at index 3 where [F] is b. The next element that will be removed when Pop is called will be A c. If we Push(G), [G] will be inserted at index 0
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…
Implement the function below void swap(int pos1, int pos2) {} For LinkedList, to maintain integrity of data in the structure, you are not to swap directly the element, nor remove a node. Instead, you are to only change the nodes' next pointers. Inital code to be completed: class LinkedList : public List { node* head; node* tail; int index; node* create_node(int num) { node* n = (node*) malloc(sizeof(node)); n->element = num; n->next = NULL; return n; } public: LinkedList() { index = 0; head = NULL; tail = NULL; } int add(int num) { addTail(num); return index; } int get(int pos) { node* currnode = head; int count =0; while (currnode != NULL){ count++; if (count == pos){ return currnode -> element; }else{ currnode = currnode -> next; } }…
Assume you are using a array-based queue and have just instantiated a queue of capacity 10. You enqueue 5 elements, dequeue 5 elements, and then enqueue 1 more element. Which index of the internal array elements holds the value of that last element you enqueued? A. 0. B. 1 C. 4. D. 5. E. 6
True or False For each statement below, indicate whether you think it is True or False. provide a description of your answer for partial credit in case you are incorrect. 3) Given a priority queue implemented as a standard linked list with only a head pointer, insert performing at O(n) and remove at O(1), and the following functions performed (higher numbers represent higher priorities): Insert(“Rick”, 75), Insert(“Carol”, 80), Insert(“Daryl”, 65), Remove(), Insert(“Negan”, 60), Insert(“Maggie”, 25), Remove(), Insert(“Michonne”, 55) a. If Insert(“Eugene”, 40) is called, it will be added as the last node in the linked list b. The linked list from head to the end at this point is Rick, Negan, Michonne, and then Maggie c. Carol was the first element removed from the priority queue
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 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): def clone(self): def clone_node(node): return <... YOUR CODE HERE ...> r = <... YOUR CODE HERE...> return r return L4_class(*args,**kwargs)
If the following is a circular array based queue of size 99 43 54 76 93 77 18 If rear is at index 1 and front is at index 6, what is the size of the queue?
Q#03: Consider a queue that is a Queue-Type object and the size of the array implementation of aqueue is 200. In addition, consider that the value of Queue-Front is 199 and the value of Queue-Rear is 125. a. After adding an element to queue, what will be the values of Queue-Front and Queue-Rear?b. After removing an element from queue, what will be the values of Queue-Front and Queue-Rear?
Create a class to implement a queue using a circular array The class should contain functions to Insert a new value, Delete a value. Change a value equal to X to a value equal to Y. Count all value equal to X in the queue. 2. For each function above perform an asymptotic analysis and state the worst case performance of the algorithm
there are similar questions please come up with an original answer because the questions are slighty different, thank you. FREE = 2 B FIRST = 5 D SHOW CHANGES IN DATA AND NEXT MEMBERS OF THE ARRAY AND THE VALUES OF FIRST AND FREE AFTER H IS INSERTED INTO THE LINKED LIST SO THE RESULTING LIST IS IN ALPHABETICAL ORDER.
Implement a city database using ordered lists. Each database record contains the name of the city (a string of arbitrary length) and the coordinates of the city expressed as integer x and y coordinates. Your database should allow records to be inserted, deleted by name, and searched by name. Another operation that should be supported is to print all records within a given distance of a specified point/coordinate. The order of cities should be alphabetically by city name. Implement the database using: an array- based list implementation. By using JAVA.
Please implement this function: void swap(int pos1, int pos2) {}. There's an answer from the previous teacher but he added '' node** hRef " in the function (see below) please correct without the href. For LinkedList, to maintain integrity of data in the structure, you are not to swap directly the element, nor remove a node. Instead, you are to only change the nodes' next pointers. PLEASE CORRECT THIS ONE void swap(node** hRef, int pos1, int pos2) { if (pos1 == pos2) return; node *prevNode1 = NULL; node* currNode1 = *hRef; while (currNode1 && currNode1->index != pos1) { prevNode1 = currNode1; currNode1 = currNode1->next; } node *prevNode2 = NULL; node *currNode2 = *hRef; while (currNode2 && currNode2->index != pos2) { prevNode2 = currNode2; currNode2 = currNode2->next; } if (currNode1 == NULL || currNode2 == NULL) return; if (prevNode1 != NULL) prevNode1->next =…