data structure
32) Sort the following list into descending order. 20.24, 20.12, 20.245, 20.025
*a. 20.245, 20.24, 20.12, 20.025
57) Given the queue myData 12, 24, 48 (front is 12), where will the new item 72 be enqueued?
*a. After 48
9) Which of the following statements is correct? every data structure...
*a. Every data structure has a specific algorithm to implement a certain operation.
65) Given the list (11, 22, 25), which is the correct way to add 32 to the list in ascending order?
*a. InsertAfter(list, 25, 32)
83) Given the singly-linked list (18, 20, 27, 28, 30), which is the first node searched by ListSearch(list, 27)?
*a. Node 18
62) _____ returns but does not remove the item at the front of the deque.
*a. PeekFront(deque)
109) If a queue is implemented as a linked list, an enqueue inserts a new item _____.
*a. after the last item
23) An algorithm's _____ is the scenario where the algorithm does the minimum possible number of operations.
*a. best case
105) If a stack is implemented as a linked list, then a pop will remove the _____.
*a. head node
48) Given the list (27, 40, 15, 25, 10, 19, 30), what are the new partitioned lists if the pivot is 25?
*b. (10, 15, 19, 25) and (27, 30, 40)
44) Given the number list (2, 12, 8, 19, 5, 30), identify the merged list in merge sort after the completion of the second level.
*b. (2, 8, 12) and (5, 19, 30)
38) Sort the following list of video extensions using selection sort: mpg, mp4, mov, mkv, m4v. What is the order of the elements after the second swap?
*b. (m4v, mkv, mov, mp4, mpg)
26) An algorithm is written to return the first name beginning with "L" in a list of employee names. Which of the following is the algorithm's worst case scenario?
*b. No names in the list begin with "L."
66) Given the list (24, 36, 48), which is the correct way to add 12 at the start of the list?
*b. Prepend(list, 12)
20) Which of the following statements is correct? the list ADT..
*b. The list ADT supports the printing of the list contents but the queue ADT does not.
78) Given the singly-linked list (88, 99), which node will be removed by the ListRemoveAfter(list, node 88) command?
*b. The tail node
100) When removing curNode from a doubly-linked list with at least 2 elements, the list's tail may be assigned with _____.
*b. curNode's predecessor
19) ADTs allow programmers to _____.
*b. focus on higher-level operations as a program's needs
61) Identify the operation to add an item to the deque at the back.
*b. push-back
10) Appending an element in an array involves increasing the array's _____.
*b. size
31) During sorting the algorithm swaps _____.
*b. two elements at a time
59) Given the queue myData 12, 24, 36 (front is 12), what is the result of the following operations? Enqueue(myData, 48) Enqueue(myData, 60) Dequeue(myData) print(Peek(myData)) print(IsEmpty(myData))
*c. 24 false
42) Given the list (7, 23, 12, 8, 5, 6), what is the order of the elements after the third insertion sort swap?
*c. 7, 8, 12, 23, 5, 6
39) A list of 10 elements is to be sorted using insertion sort algorithm. How many times will the outer loop be executed?
*c. 9
96) Identify the statement that is true of linked list traversal. a douubly linked list's..
*c. A doubly linked list's reverse traversal starts with the list's tail node.
21) Which of the following is correct for a list ADT? an element can be..
*c. An element can be found and removed from the end of the list.
34) Which of the following is not an example of sorting a list?
*c. Arranging student records neatly on a desk
49) Which is the worst case runtime for a quicksort algorithm?
*c. O(N^2)
25) What is the space complexity of the algorithm? ArithmeticSeries(list, listSize) { i = 0 arithmeticSum = 0 while (i < listSize) { arithmeticSum = arithmeticSum + list[i] i = i + 1 } return arithmeticSum }
*c. S(N) = N + k
107) Given an empty stack menuItems, what will be the result of the following operations? StackPush(menuItems , item Pizza) StackPush(menuItems , item Chips) StackPush(menuItems , item Nachos) StackPush(menuItems , item Tea) print(StackPop(menuItems))
*c. Tea
93) Given the doubly-linked list students (Tom, Sam, Hal, Pam), what is the student list's head node after the operation ListInsertAfter(students, node Tom, node Tim)?
*c. Tom
74) In the ListInsertAfter function for singly-linked lists, the curNode parameter points to _____ node.
*c. any existing
102) Given the doubly-linked list animalList (Cat, Dog), which nodes will be the head and tail nodes after the following operations? ListInsertAfter(animalList, node Cat, node Bird) ListInsertAfter(animalList, node Dog, node Fish) ListRemove(animalList, node Cat) ListRemove(animalList, node Fish)
*c. head = node Bird, Tail = node Dog
22) Complexity analysis helps in avoiding algorithms with _____.
*c. high memory usage
35) In selection sort, the smallest element is selected and swapped with the _____ unsorted element.
*c. leftmost
87) Given a doubly-linked list (2, 3, 4, 5, 6, 7), node 2's pointer(s) point(s) to _____.
*c. node 3 and null
40) Given the list (xlsx, xls, xlr, txt, ods), what is the order of the elements after completing insertion sort's second outer loop iteration?
*c. xlr, xls, xlsx, txt, ods
80) Given the singly-linked list (10, 20, 30, 40, 50, 60), what commands remove 10, 20, and 60, such that the final list is (30, 40, 50)?
*d. ListRemoveAfter(list, null) ListRemoveAfter(list, null) ListRemoveAfter(list, node 50)
60) Given the queue myData 12, 24, 36 (front is 12), what is the result of the following operations? Dequeue(myData) Dequeue(myData) Dequeue(myData) print(GetLength(myData))
*d. 0
58) Given the queue myData 12, 24, 48 (front is 12), what will be the queue contents after the following operations? Enqueue(myData, 72) Dequeue(myData)
*d. 24, 48, 72
45) How many additional recursive partitioning levels are required for a list of 64 elements compared to a list of 8 elements?
*d. 3
71) Identify the correct way to insert 52 at the end of the following list: 12, 24, 36, 48.
*d. ListAppend(list, node 52)
79) Identify the correct way to remove 18 from the singly-linked list (18, 20, 22, 24).
*d. ListRemoveAfter(list, null)
24) An algorithm that uses a constant number k of integer variables to find a number list's minimum value has space complexity S(N) = _____ and auxiliary space complexity S(N) = _____.
*d. N, k
82) Given the singly-linked list (80, 81, 82, 83), what is returned from ListSearch(list, 84)?
*d. Null
92) Given the doubly-linked list students (Tom, Sam), what will be the second node in the list after the following operations? ListInsertAfter(students, list⇢tail, node Hal) ListInsertAfter(students, list⇢head, node Pam)
*d. Pam
95) Which of the following is an example of a linked list traversal operation?
*d. Printing the list
86) Identify the error in the following algorithm to search for a node in the singly-linked list of students. ListSearch(students, key) { curNode = students⇢head while (curNode is null) { if (curNode⇢data == key) { return curNode } curNode = curNode⇢next } return null }
*d. The while condition should bewhile (curNode is not null).
85) ListSearch visits _____ when searching for 83 in the singly-linked list (80, 81, 82, 83).
*d. all the nodes
94) Which XXX would replace the missing statement in the following algorithm? ListInsertAfter(students, curNode, newNode) { if (students⇢head == null) { students⇢head = newNode students⇢tail = newNode } XXX { students⇢tail⇢next = newNode newNode⇢prev = students⇢tail students⇢tail = newNode } else { sucNode = curNode⇢next newNode⇢next = sucNode newNode⇢prev = curNode curNode⇢next = newNode sucNode⇢prev = newNode } }
*d. else if (curNode == students⇢tail)
55) Given a stack myData: 34, 78 (top is 34), what is the output after the following operations? Peek(myData) Push(myData, 2) Push(myData, 15) Pop(myData) Pop(myData) print(IsEmpty(myData))
*d. false
81) Which XXX completes the algorithm to remove a node from the singly-linked list? ListRemoveAfter(list, curNode) { if (curNode is null && list⇢head is not null) { sucNode = list⇢head⇢next list⇢head = sucNode if (sucNode is null) { XXX } } else if (curNode⇢next is not null) { sucNode = curNode⇢next⇢next curNode⇢next = sucNode if (sucNode is null) { list⇢tail = curNode } } }
*d. list⇢tail = null
27) Suppose that binary search is called with input list (3, 7, 13, 18, 24, 29, 31, 33, 41) and target item x = 14. low = 1 and high = 9 on the first call to binary search. What are the values for low and high on the third call to binary search?
*d. low = 4 and high = 5
91) Replace XXX in the following function header for a doubly-linked list: ListInsertAfter(listName, currentNode, XXX)
*d. newNode
84) Given the singly-linked list (10, 20, 30, 40, 50, 60), ListSearch(list, 30) points the current node pointer to _____ after checking node 20.
*d. node 30
106) If a stack is implemented as a linked list, then an empty stack will have _____.
*d. null head and tail pointers
104) If a stack is implemented as a linked list, then a push will be a(n) _____ operation.
*d. prepend
56) In a queue, a dequeue operation always removes _____ element.
*d. the front
43) Insertion sort requires at most _____ swaps to sort a list of 20 elements.
190
46) What is the merge sort algorithm's runtime?
O(N*logN)
28) What is the recurrence relation that describes the asymptotic complexity of binary search, as a function of n, the number of items in the input list?
T(n) = T(n/2) + theta(1)
72) If myList is initially empty, what sequence of operations creates the list (75, 76, 68)?
a. ListAppend(myList, node 75) ListAppend(myList, node 76) ListAppend(myList, node 68)
76) Given the singly-linked list (11, 33, 44, 66), identify the commands for inserting 22 and 55, such that the final list is (11, 22, 33, 44, 55, 66).
a. ListInsertAfter(list, node 11, node 22) ListInsertAfter(list, node 44, node 55)
36) The array (67, 23, 32, 80, 53, 60) is to be sorted using selection sort. What is the order of the elements after the third swap?
a. 23, 32, 53, 80, 67, 60
29) Suppose that binary search is called with input list (3, 7, 13, 18, 24, 29, 31, 33, 41) and target item x = 19. What is the sequence of items in the list that x is compared to? Include the comparison made in the base case in testingwhether .
a. 24, 13, 18, 24
13) Which is an abstract data type (ADT)?
a. A list
16) Which abstract data type (ADT) is best suited to store the names of all currently available smartphone models?
a. A set
6) In a computational problem for finding the highest salary of an employee in a company, what is the input?
a. The list of employees' salaries
67) Given the list (75, 76, 68), identify the commands for the following operations. Insert item 80 at the end of the list Remove item 68 Insert item 82 at the end of the list Get the total number of items in the list
b. Append(list, 80) Remove(list, 68) Append(list, 82) GetLength(list)
12) What values are stored in the list numList? numberList() { for (i = 0; i < 10; i++) { if (i % 2 == 0) { numList[i] = i } } }
b. [0, 2, 4, 6, 8]
14) A stack abstract data type (ADT) is implemented using a(n) _____ data structure.
b. linked list
37) Which XXX should replace the missing statement in the selection sort algorithm given below? SelectionSort(list, listSize) { for (ctr1 = 0; ctr1 < listSize - 1; ++ctr1) { mimIndex = ctr1 for (ctr2 = ctr1 + 1; ctr2 < listSize; ++ctr2) { if (list[ctr2] < list[mimIndex]) { mimIndex = ctr2 } } temp = list[ctr1] XXX list[mimIndex] = temp } }
b. list[ctr1] = list[mimIndex]
2) In a linked list, each node stores a _____ the next node.
b. pointer to
41) Which XXXcompletes the following insertion sort algorithm to sort in descending order? for (i = 1; i < numbersSize; ++i) { j = i X XX { temp = numbers[j] numbers[j] = numbers[j - 1] numbers[j - 1] = temp --j } }
b. while(j > 0 && numbers[j] > numbers[j-1])
68) Given the list (40, 42, 45, 46, 47), identify the commands for the following operations. Remove 45 Confirm that 45 is removed
c. Remove(list, 45) Search(list, 45)
4) Identify the correct sequence for inserting an item in a linked list.
c. 1. Create a list node for a new item. 2. Assign a pointer of the new item to point to the next item. 3. Update the pointer of the previous node to point to the new node.
70) Which is the correct code to prepend an item to a list?
c. ListPrepend(list, newNode) { if (list⇢head == null) { list⇢head = newNode list⇢tail = newNode } else { newNode⇢next = list⇢head list⇢head = newNode } }
77) Which XXX completes the following algorithm for inserting a new node into a singly-linked list? ListInsertAfter(list, curNode, newNode) { if (list⇢head == null) { list⇢head = newNode list⇢tail = newNode } else if (curNode == list⇢tail) { list⇢tail⇢next = newNode list⇢tail = newNode } else { XXX } }
c. newNode⇢next = curNode⇢next curNode⇢next = newNode
54) Given a stack myData: 34, 56, 78, 12, 66 (top is 34) what is the output after the following operations? Push(myData 43) Pop(myData) Pop(myData) print(Peek(myData)) Pop(myData) print(Peek(myData))
c. 56 78
17) Which abstract data type (ADT) is suited to check whether a given string is a palindrome?
c. A deque
7) A manufacturing plant has many ways to assemble a product. Which algorithm will be useful to find the quickest way?
c. Dijkstra's shortest path
51) Identify the error in the following code snippet of the quicksort partition function. while (completed) { while (myList[low] < pivot) { ++low } while (pivot < myList[high]) { --high } if (low >= high) completed = true else { temp = myList[low] myList[low] = myList[high] myList[high] = temp ++low --high } }
c. The statementwhile (completed)should bewhile (!completed)
18) The process of providing only the essentials and hiding the details is known as _____.
c. abstraction
64) Given the deque 10, 12, 14, 16 (front is 10), what is the outcome of the following operations? print(IsEmpty(deque)) print(PeekFront(deque)) print(PeekBack(deque)) print(GetLength(deque))
c. false, 10, 16, 4
1) Which data type is best suited to store the names and grades of students?
c. record
69) Identify the commands for the following list operations. Check that there are no items in a listInsert 10, 50, 30, 40, and 20 at the end of the listArrange the items in ascending order
d. IsEmpty(list) Append(list, 10) Append(list, 50) Append(list, 30) Append(list, 40) Append(list, 20) Sort(list)
63) Given the deque 10, 12, 14, 16 (front is 10), what will the deque look like after the following operations? push-front 2, push-back 13, push-front 8, pop-front, pop-back, push-back 18
d. 2, 10, 12, 14, 16, 18
15) Which abstract data type (ADT) is most suitable to store a list of perishable products such that the product with the nearest expiry date is removed first?
d. A priority queue
3) Which of the following is best represented by a graph?
d. A telephone network
8) Which is not a characteristic of an NP-complete problem?
d. All NP-complete problems can be solved efficiently.
99) Identify the correct algorithm for reverse traversal in the doubly-linked list studentList.
d. ListTraverseReverse(students) { curNode = students⇢tail while (curNode is not null) { Print curNode's data curNode = curNode⇢prev } }
5) Which algorithm is best suited for a plagiarism check?
d. Longest common substring
97) Identify the error in the following algorithm for traversing a linked list. ListTraverse(list) { curNode = list⇢head while (curNode is not null) { Print curNode's data curNode = list⇢head⇢next } }
d. The statement curNode = list⇢head⇢next should be curNode = curNode⇢next.
108) If a stack is implemented as a linked list, which XXX would replace the missing statement? StackPop(stack) { XXX ListRemoveAfter(stack, null) return headData }
d. headData = stack⇢head⇢data
11) Which XXX will complete the algorithm to separate numberList into two lists (even and odd) using an array? MathematicalFunction(numberList) { Create evenNumberList array Create oddNumberList array for (i = 0; i < numberList⇢length; ++i) { XXX { ArrayAppend(evenNumberList,numberList[i]) } else { ArrayAppend(oddNumberList,numberList[i]) } SortAscending(evenNumberList) SortAscending(oddNumberList) } for (i = 0; i < evenNumberList⇢length; ++i) { Display evenNumberList[i] } for (i = 0; i < oddNumberList⇢length; ++i) { Display oddNumberList[i] } }
d. if (numberList[i] % 2 == 0)
Which XXX would replace the missing statements in the following code to prepend a node in a doubly-linked list? ListPrepend(students, newNode) { if (list⇢head == null) { list⇢head = newNode list⇢tail = newNode } else { XXX list⇢head = newNode } }
d. newNode⇢next = list⇢headlist⇢head⇢prev = newNode
53) Given a stack myData: Tom, Sam (top is Tom), what is the output after the following operations? Push(myData, Hal) Pop(myData) Pop(myData) Pop(myData) print(Pop(myData))
d. null
73) In a singly-linked list with 1 element, the tail pointer ____ and the next pointer of the head node ____.
d. points to the head node, is null
75) In the ListInsertAfter function for singly-linked lists, the curNode parameter is ignored when _____.
d. the list's head pointer is null
50) Which XXX will replace the missing conditional statement in the following code for quicksort? Quicksort(numbers, lowIndex, highIndex) { XXX { return } lowEndIndex = Partition(numbers, lowIndex, highIndex) Quicksort(numbers, lowIndex, lowEndIndex) Quicksort(numbers, lowEndIndex + 1, highIndex)}
if(lowIndex >= highIndex)
