uopeople-cs-3303-data-structures-review-quiz-unit-9

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 2/49 Question 2 Correct Mark 1.00 out of 1.00 Question 3 Correct Mark 1.00 out of 1.00 Correctly identify the following heap structure by selecting the best answer: Select one: a. partially ordered heap b. max-heap structure  c. priority heap d. min-heap structure The correct answer is: max-heap structure A sorting algorithm that assigns records to bins and then relies on some other sorting technique to sort the records within each bin called: Select one: a. Radix Sort b. Quicksort c. Hash sort d. Bucket sort  The correct answer is: Bucket sort

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 5/49 Question 9 Correct Mark 1.00 out of 1.00 Question 10 Correct Mark 1.00 out of 1.00 Question 11 Correct Mark 1.00 out of 1.00 A traversal that visits each node after visiting its children is called: Select one: a. Preorder Traversal b. Postorder Traversal  c. Inorder Traversal d. Outoforder Traversal The correct answer is: Postorder Traversal A linked list implementation relies upon static memory allocation where static refers to the requirement to pre-allocate all of the memory that will be used for the list. Select one: True False  The correct answer is 'False'. A traversal of a general tree that traverses the roots subtrees from left to right, then visits the root is called a preorder traversal. Select one: True False  The correct answer is 'False'.

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 8/49 Question 16 Correct Mark 1.00 out of 1.00 Question 17 Correct Mark 1.00 out of 1.00 The best asymptotic analysis for the selection sort is represented by (select the best option): Option 1. O( n log n ) Option 2. Ω( n ) Option 3. O( n ) Option 4. Θ( n ) Select one: a. Option 1 b. Option 2 c. Option 3 d. Option 4  2 2 2 The correct answer is: Option 4 For the following code fragment, select the option that represents the most appropriate asymptotic analysis: for (int i = 1; i <= n; i *= 2) { for (int j = 0; j < n; j++) { count++; } } Option 1. O( 1 ) Option 2. O( 2 ) Option 3. O( n log n ) Option 4. O( n ) Select one: a. Option 1 b. Option 2 c. Option 3  d. Option 4 n 2 Explanation: Here the outer loop is done log n times and the inner loop is done n times, so T(n) = n log n . (Note that the default base for logarithms in Computer Science is 2.) The correct answer is: Option 3

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 11/49 Question 21 Correct Mark 1.00 out of 1.00 Question 22 Incorrect Mark 0.00 out of 1.00 Question 23 Correct Mark 1.00 out of 1.00 A tree whose internal nodes all have exactly K children is called a K-ary tree. Select one: True  False The correct answer is 'True'. A sort that features a limit of n-1 of record swaps is called: Select one: a. Insertion sort b. Bubble sort  c. Inversion sort d. Selection sort The correct answer is: Selection sort True/False: The stack data structure is implemented as a LIFO structure (last in first out) Select one: True  False The correct answer is 'True'.

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 14/49 Question 29 Correct Mark 1.00 out of 1.00 Question 30 Incorrect Mark 0.00 out of 1.00 An important advantage of the sequential tree implementation is that (select the best answer): Select one: a. It is an extremely shallow tree b. The data structure can be transmitted between computers c. It saves space because no pointers are stored  d. It uses dynamic nodes The correct answer is: It saves space because no pointers are stored For the following code fragment, select the choice which represents the most appropriate asymptotic analysis: static int function ( n ) { sum = 0; for (i=1; i<=n; i++) sum += n; return sum; } Choice 1. Ω( n ) Choice 2. Θ ( n ) Choice 3. O( log n ) Choice 4. O( n ) (NOTE: code fragment is not intended to be functioning code) Select one: a. Choice 1 b. Choice 2  c. Choice 3 d. Choice 4 2 2 The correct answer is: Choice 4

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 17/49 Question 35 Correct Mark 1.00 out of 1.00 For the following code fragment, select the option that represents the most appropriate asymptotic analysis: public static int binarySearch(int[] a, int key) { int left = 0; int right = a.length-1; while (left <= right) { int mid = left + (right-left)/2; if (key < a[mid]) right = mid-1; else if (key > a[mid]) left = mid+1; else return mid; } //not found return -1; } Option 1. Ω( 1 ), O( log n ) Option 2. Ω( n ), O( 2 ) Option 3. Θ( n log n ) Option 4. Θ( log n ) Select one: a. Option 1  b. Option 2 c. Option 3 d. Option 4 n The correct answer is: Option 1

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 20/49 Question 41 Correct Mark 1.00 out of 1.00 Question 42 Correct Mark 1.00 out of 1.00 Push and Pop are notations associated with which data structure: Select one: a. Queue b. Stack  c. List d. Array The correct answer is: Stack A sequential tree can be represented using a bit vector? Select one: True  False The correct answer is 'True'.

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 21/49 Question 43 Incorrect Mark 0.00 out of 1.00 Question 44 Correct Mark 1.00 out of 1.00 The lower bound for the growth of the Algorithms running time is represented by (please the best answer): 1. Big Oh (O) 2. Big Omega (Ω) 3. Big Theta (Θ) 4. Exponential growth Select one: a. Choice 1  b. Choice 2 c. Choice 3 d. Choice 4 The correct answer is: Choice 2 Data is stored within the disk drive on the: (select the best answer) Select one: a. Spindle b. Platter  c. Cylinder d. Sector The correct answer is: Platter

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 22/49 Question 45 Correct Mark 1.00 out of 1.00 Question 46 Incorrect Mark 0.00 out of 1.00 The weighted union rule joins a tree with fewer nodes to a tree with more nodes by making the smaller tree’s root point to the root of the larger tree. Select one: True  False The correct answer is 'True'. For the following code fragment, select the choice which represents the most appropriate asymptotic analysis: function ( n ) { sum2 = 0; for (k=1; k<=n; k*=2) for (j=1; j<=k; j++) sum2++; } Choice 1. O( 2 ) Choice 2. Θ ( n ) Choice 3. Θ( n log n ) Choice 4. Ω( n ) (NOTE: code fragment is not intended to be functioning code) Select one: a. Choice 1 b. Choice 2 c. Choice 3  d. Choice 4 n 2 The correct answer is: Choice 2

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 23/49 Question 47 Correct Mark 1.00 out of 1.00 Question 48 Correct Mark 1.00 out of 1.00 Question 49 Correct Mark 1.00 out of 1.00 A finite set of one or more nodes such that there is one designated node call the root is a: (select the best answer) Select one: a. Parent root b. a B+ tree data structure c. Index d. Tree  The correct answer is: Tree The process of storing blocks of data in main memory after reading from disk is referred to as: Select one: a. Buffering  b. Hashing c. Pooling d. Indexing The correct answer is: Buffering A method that is designed to create extremely shallow trees is called: Select one: a. Dynamic node implementation b. Union/Find c. The list of children method d. Path compression  The correct answer is: Path compression

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 24/49 Question 50 Correct Mark 1.00 out of 1.00 Question 51 Correct Mark 1.00 out of 1.00 A full binary tree has a restricted shape which starts at the root and fills the tree by levels from left to right. Select one: True False  The correct answer is 'False'. For the following code fragment, select the choice which represents the most appropriate asymptotic analysis: static int function ( n ) { sum = 0; for (i=1; i<=n; i++) sum += n; return sum; } Choice 1. Ω( n ) Choice 2. Ω( log n ) Choice 3. Θ( n log n ) Choice 4. O ( n ) (NOTE: code fragment is not intended to be functioning code) Select one: a. Choice 1 b. Choice 2 c. Choice 3 d. Choice 4  2 2 The correct answer is: Choice 4

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 25/49 Question 52 Correct Mark 1.00 out of 1.00 Question 53 Incorrect Mark 0.00 out of 1.00 For the following code fragment, select the choice which represents the most appropriate asymptotic analysis: static int function ( n ) { for (k=0; k<n; k++) A[k] = k; return A[k]; } Choice 1. O ( n ) Choice 2. O( 2 ) Choice 3. Ω( n ) Choice 4. Θ ( n ) (NOTE: code fragment is not intended to be functioning code) Select one: a. Choice 1 b. Choice 2 c. Choice 3 d. Choice 4  2 n 2 The correct answer is: Choice 4 A binary tree traversal that lists every node in the tree exactly once is called: Select one: a. a Traversal  b. A visitor design pattern c. An enumeration d. Natural ordering sequence The correct answer is: An enumeration

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 26/49 Question 54 Incorrect Mark 0.00 out of 1.00 Question 55 Correct Mark 1.00 out of 1.00 Question 56 Correct Mark 1.00 out of 1.00 A significant benefit to using an index to hold and sort keys to a file is: Select one: a. Smaller keys require less I/O b. The entire sort can always be completed in memory c. The head of the disk drive does not need to move d. There is no seek time added to the latency of I/O operations  The correct answer is: Smaller keys require less I/O True/False: Big Theta (Θ) indicates that the Upper and Lower bounds of an algorithm are the same. Select one: True  False The correct answer is 'True'. Setting the dirty bit causes what action to be performed on a block: (select the best answer) Select one: a. It is deleted because it is no longer consistent b. It flushes or writes the block out to the disk  c. Refreshes the data by re-reading the block d. It cleans the cache by flushing all data from the cache The correct answer is: It flushes or writes the block out to the disk

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 27/49 Question 57 Correct Mark 1.00 out of 1.00 Question 58 Correct Mark 1.00 out of 1.00 Question 59 Correct Mark 1.00 out of 1.00 Enqueue and Dequeue are notations associated with which data structure: Select one: a. Queue  b. Stack c. List d. Array The correct answer is: Queue Which of the following is NOT one of the buffer pool heuristics defined in the text : (select the best answer) Select one: a. FIFO b. LIFO  c. LRU d. LFU The correct answer is: LIFO The process for visiting all of the nodes of a binary tree in some order is called a traversal. Select one: True  False The correct answer is 'True'.

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 28/49 Question 60 Correct Mark 1.00 out of 1.00 Question 61 Correct Mark 1.00 out of 1.00 The benefit of a quicksort is that it provides excellent performance in both the average and worst case: Select one: True False  The correct answer is 'False'. In a stack which option would access the 3 element from the top of the stack S Op±on 1. S.push(-1); Op±on 2. S.dequeue(-3); Op±on 3. S.pop(); S.pop(); S.pop(); Op±on 4. S.pop(n-3); Select one: a. Option 1 b. Option 2 c. Option 3  d. Option 4 rd The correct answer is: Option 3

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 29/49 Question 62 Correct Mark 1.00 out of 1.00 Question 63 Correct Mark 1.00 out of 1.00 Select the answer that best defines Huffman Coding: Select one: a. A set of coding rules that is typically used for compression b. A fixed length coding scheme for character representation c. A tree structure that trades off space and time requirements to provide a more efficient priority queue d. An approach of assigning codes to characters such that the frequency length of the code depends upon the relative frequency of the corresponding character in use  The correct answer is: An approach of assigning codes to characters such that the frequency length of the code depends upon the relative frequency of the corresponding character in use For the following code fragment, select the option which represents the most appropriate asymptotic analysis: /** @return Position of largest value in "A“ */ static int largest(int[] A) { int currlarge = 0; // Position of largest for (int i=1; i<A.length; i++) if (A[currlarge] < A[i]) currlarge = i; // Remember pos return currlarge; // Return largest pos } Choice 1. Θ ( n ) Choice 2. O( 2 ) Choice 3. Θ( n log n ) Choice 4. Ω( n ) (NOTE: code fragment is not intended to be functioning code) Select one: a. Choice 1  b. Choice 2 c. Choice 3 d. Choice 4 n 2 The correct answer is: Choice 1

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 30/49 Question 64 Correct Mark 1.00 out of 1.00 Question 65 Correct Mark 1.00 out of 1.00 True/False: Big Theta (Θ) indicates that the Upper and Lower bounds of an algorithm are the same. Select one: True  False The correct answer is 'True'. The processing time or cost of a sort is defined by the number of comparisons and exchanges that must be made during processing. What is the average cost of the heapsort?: Option 1. O( n log n ) Option 2. Ω( n ) Option 3. O( n ) Option 4. Θ( n ) Select one: a. Option 1  b. Option 2 c. Option 3 d. Option 4 2 2 2 The correct answer is: Option 1

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 31/49 Question 66 Incorrect Mark 0.00 out of 1.00 Question 67 Incorrect Mark 0.00 out of 1.00 A traversal that visits each node before visiting its children is called: Select one: a. Preorder traversal b. Postorder traversal  c. Inorder Traversal d. Outoforder Traversal The correct answer is: Preorder traversal A tree data structure whose shape obeys the following definition, o A node contains one or two keys o Every internal node has either 2 children if it contains 1 key or 3 children if it contains two keys o All leaves are at the same level in the tree Is called a/an: Select one: a. B*-Tree  b. BST c. B+-Tree d. 2-3 tree The correct answer is: 2-3 tree

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 32/49 Question 68 Correct Mark 1.00 out of 1.00 Question 69 Correct Mark 1.00 out of 1.00 If A={1, 2, 3, 4} and B={4, 5, 6}, find A ∪ B . Select one: a. {1,2,3,4,4,5,6} b. {4} c. {x | x is all positive integers} d. {1,2,3,4,5,6}  The correct answer is: {1,2,3,4,5,6} For the following code fragment, select the choice which represents the most appropriate asymptotic analysis: function ( n ) { sum1 = 0; for (i=1; i<=n; i++) for (j=1; j<=n; j++) sum1++; } Choice 1. Θ ( n ) Choice 2. O( 2 ) Choice 3. Θ( n log n ) Choice 4. Ω( log n ) (NOTE: code fragment is not intended to be functioning code) Select one: a. Choice 1  b. Choice 2 c. Choice 3 d. Choice 4 2 n 2 The correct answer is: Choice 1

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 33/49 Question 70 Correct Mark 1.00 out of 1.00 Question 71 Correct Mark 1.00 out of 1.00 Question 72 Correct Mark 1.00 out of 1.00 According to textbook by Shaffer, a heap data structure has two properties which are: Select one: a. every node stores a value less than or equal to that of its children and it is a complete binary tree b. it is a min-heap and is partially ordered c. it is a complete binary tree and the values stored in it are partially ordered  d. it is a priority queue and is in Θ( n ) The correct answer is: it is a complete binary tree and the values stored in it are partially ordered A collection of one or more trees is called: Select one: a. Trees b. Multiple Spanning Trees c. a Forest  d. Traversals The correct answer is: a Forest Recursion is when an algorithm uses a series of loop structures to repeat an operation until the answer has been computed. Select one: True False  The correct answer is 'False'.

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 34/49 Question 73 Correct Mark 1.00 out of 1.00 Question 74 Correct Mark 1.00 out of 1.00 The full binary tree theorem states “the number of leaves in an empty full binary tree is one more than the number of internal nodes” Select one: True False  The correct answer is 'False'. For the following code fragment, select the option that represents the most appropriate asymptotic analysis: // Recursive Fibonacci generator static long fibr(int n) { if ((n == 1) || (n == 2)) return 1; // Base case return fibr(n-1) + fibr(n-2); // Recursive call } Option 1. O( n ) Option 2. O( 2 ) Option 3. O( n log n ) Option 4. O( n ) Select one: a. Option 1 b. Option 2  c. Option 3 d. Option 4 n 2 The correct answer is: Option 2

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 35/49 Question 75 Correct Mark 1.00 out of 1.00 Question 76 Correct Mark 1.00 out of 1.00 Question 77 Correct Mark 1.00 out of 1.00 A coding scheme that replaces repeated occurrences of strings with a pointer to the location in the file of the first occurrence of the string is called Ziv-Lempel coding. Select one: True  False The correct answer is 'True'. Which of the following is not a mathematical proof technique? Select one: a. Proof by mathematical induction b. Proof by contradiction c. Direct proof d. Proof by consensus  The correct answer is: Proof by consensus Internal Fragmentation refers to: (select the best answer) Select one: a. Space that is left empty because records do not fit evenly into a sector b. Space allocated to a file that is not physically adjacent on the disk drive c. Space that is left empty because records do not fit evenly into a sector or Space allocated to a file that is not physically adjacent  d. None of the options The correct answer is: Space that is left empty because records do not fit evenly into a sector or Space allocated to a file that is not physically adjacent

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 36/49 Question 78 Correct Mark 1.00 out of 1.00 Question 79 Incorrect Mark 0.00 out of 1.00 Which of the following is NOT one of the design patterns outlined in our text. Select one: a. Flyweight b. Visitor c. Composite d. Synergy  The correct answer is: Synergy For the following code fragment, select the choice which represents the most appropriate asymptotic analysis: function ( n ) { sum2 = 0; for (i=1; i<=n; i++) for (j=1; j<=i; j++) sum2++; } } Choice 1. Ω ( 1 ) Choice 2. O( 2 ) Choice 3. Θ( n ) Choice 4. Ω( n ) (NOTE: code fragment is not intended to be functioning code) Select one: a. Choice 1 b. Choice 2  c. Choice 3 d. Choice 4 n 2 2 The correct answer is: Choice 3

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 37/49 Question 80 Correct Mark 1.00 out of 1.00 Question 81 Correct Mark 1.00 out of 1.00 Question 82 Correct Mark 1.00 out of 1.00 True/False: There is always one most efficient algorithm to solve a particular problem. Select one: True False  The correct answer is 'False'. In a queue, placing new items in the queue is referred to as a push and taking an item out of the queue is called a pop. Select one: True False  The correct answer is 'False'. A sort algorithm that uses two nested loops with the inner loop moving through the array from bottom to top is called the: Select one: a. Insertion sort b. Bubble sort  c. Inversion sort d. Selection sort The correct answer is: Bubble sort

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 38/49 Question 83 Correct Mark 1.00 out of 1.00 Question 84 Correct Mark 1.00 out of 1.00 The upper bound for the growth of the Algorithms running time is represented by (please select the best answer): 1. Big Oh (O) 2. Big Omega (Ω) 3. Big Theta (Θ) 4. Exponential growth Select one: a. Choice 1  b. Choice 2 c. Choice 3 d. Choice 4 The correct answer is: Choice 1 The list of children approach uses both pointers and an array structure to represent the tree. Select one: True  False The correct answer is 'True'.

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 39/49 Question 85 Correct Mark 1.00 out of 1.00 Question 86 Correct Mark 1.00 out of 1.00 Question 87 Correct Mark 1.00 out of 1.00 Which of the following is not one of the general approaches to search algorithms: Select one: a. Buffer cache access methods  b. Sequential and list methods c. Direct access by key value (hashing) d. Tree indexing methods The correct answer is: Buffer cache access methods The freelist … Select one: a. Provides access to memory within the operating system that has not yet been allocated b. Provides access to memory objects which have no Big O ( n ) time. c. Facilitates and encourages the use of the new operator. d. Holds the list nodes that are no longer in use.  The correct answer is: Holds the list nodes that are no longer in use. An exchange sort is one where: (select the best answer) Select one: a. Records in an unsorted list are moved to a sorted list b. Adjacent records in the list and compared and exchanged  c. An inversion is executed d. The sorting algorithm is said to be stable The correct answer is: Adjacent records in the list and compared and exchanged

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 40/49 Question 88 Correct Mark 1.00 out of 1.00 Question 89 Correct Mark 1.00 out of 1.00 Question 90 Correct Mark 1.00 out of 1.00 A technique that allows a programmer to use more main memory than exists in the computer is called: (select the best answer) Select one: a. Buffer cache b. Random access memory c. Secondary storage d. Virtual memory  The correct answer is: Virtual memory The upper bound for the growth of the Algorithms running time is represented by: Select one: a. Big Oh (O)  b. Big Omega (Ω) c. Big Theta (Θ) d. Exponential growth The correct answer is: Big Oh (O) Which of the following is not a characteristic of an algorithm? Select one: a. It must be correct b. It must be composed of concrete steps c. It can have no ambiguity d. It must be composed of an infinite number of steps.  The correct answer is: It must be composed of an infinite number of steps.

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 41/49 Question 91 Correct Mark 1.00 out of 1.00 Question 92 Correct Mark 1.00 out of 1.00 What is the role of the pivot in a quicksort algorithm? Select one: a. It identifies the maxkey value b. It specifies the point where the array will be subdivided into partitions and each partition then sorted  c. It defines the sequence for merging in the sort d. It indicates the index of the current record being compared The correct answer is: It specifies the point where the array will be subdivided into partitions and each partition then sorted Secondary storage is characterized by the following: Select one: a. It is persistent  b. It is faster than primary storage c. It is volatile d. It is more expensive than primary storage The correct answer is: It is persistent

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 42/49 Question 93 Correct Mark 1.00 out of 1.00 For the following code fragment, select the choice which represents the most appropriate asymptotic analysis: /** @return The position of an element in sorted array A with value k. If k is not in A,return A.length. */ static int binary(int[] A, int k) { int l = -1; // Set l and r int r = A.length; // beyond array bounds while (l+1 != r) { // Stop when l, r meet int i = (l+r)/2; // Check middle if (k < A[i]) r = i; // In left half if (k == A[i]) return i; // Found it if (k > A[i]) l = i; // In right half } return A.length; // Search value not in A } Choice 1. Θ ( n ) Choice 2. O( 2 ) Choice 3. O( log n ) Choice 4. Ω( n ) (NOTE: code fragment is not intended to be functioning code) Select one: a. Choice 1 b. Choice 2 c. Choice 3  d. Choice 4 n 2 The correct answer is: Choice 3

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 43/49 Question 94 Correct Mark 1.00 out of 1.00 Question 95 Correct Mark 1.00 out of 1.00 For the following code fragment, select the choice which represents the most appropriate asymptotic analysis: function ( n ) { sum1 = 0; for (k=1; k<=n; k*=2) for (j=1; j<=n; j++) sum1++; } Choice 1. Θ ( n ) Choice 2. O( 2 ) Choice 3. Θ( n log n ) Choice 4. Ω( n ) (NOTE: code fragment is not intended to be functioning code) Select one: a. Choice 1 b. Choice 2 c. Choice 3  d. Choice 4 n 2 The correct answer is: Choice 3 The process of determining if two objects are in the same set and then merging those sets is called: Select one: a. a Union Operation b. Union / Find  c. a Weighted Union d. a Merge Operation The correct answer is: Union / Find

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 44/49 Question 96 Incorrect Mark 0.00 out of 1.00 Question 97 Correct Mark 1.00 out of 1.00 For the following code fragment, select the option which represents the most appropriate asymptotic analysis: static int function ( n ) { sum = 0; for (i=1; i<=n; i++) sum += n; return sum; } Option 1. Ω( n ) Option 2. Θ ( n ) Option 3. O( log n ) Option 4. O( 2 ) (NOTE: code fragment is not intended to be functioning code) Select one: a. Choice 1 b. Choice 2 c. Choice 3 d. Choice 4  2 n The correct answer is: Choice 2 A traversal that visits the left subtree, then the node, and then the right subtree is called: Select one: a. Preorder Traversal b. Postorder Traversal c. Inorder Traversal  d. Outoforder Traversal The correct answer is: Inorder Traversal

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 45/49 Question 98 Incorrect Mark 0.00 out of 1.00 Question 99 Correct Mark 1.00 out of 1.00 When big-Oh and W coincide, we indicate this by using (select the best answer): 1. Big Oh (O) 2. Big Omega (Ω) 3. Big Theta (Θ) 4. Exponential growth Select one: a. Choice 1 b. Choice 2  c. Choice 3 d. Choice 4 The correct answer is: Choice 3 A preorder traversal visits every node starting at the leaf nodes and working up the tree. Select one: True False  The correct answer is 'False'.

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 46/49 Question 100 Correct Mark 1.00 out of 1.00 Question 101 Correct Mark 1.00 out of 1.00 Question 102 Correct Mark 1.00 out of 1.00 A linear index is an index file organized as a sequence of key/pointer pairs where the keys are in a sorter order. Select one: True  False The correct answer is 'True'. The most time consuming of the following operations on an array based list implementation is: Select one: a. Inserting a new element at position n-1 in the list where n is the number of elements in the list. b. Inserting a new element into the head of the list.  c. Removing an element at position n-1 within the list d. Removing an element from the tail of the list. The correct answer is: Inserting a new element into the head of the list. The quicksort is typically slower than the heapsort by a constant factor. Select one: True False  The correct answer is 'False'.

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 47/49 Question 103 Incorrect Mark 0.00 out of 1.00 Question 104 Correct Mark 1.00 out of 1.00 Each record of a database normally has a unique identifier called the: Select one: a. Secondary Key b. Primary index  c. Primary key d. Index key The correct answer is: Primary key Which of the following is NOT true for Linked Lists structures (please select the best choice): Choice 1. Insertion and deletion are Q ( 1 ). Choice 2. Direct access of an item in the list structure is Q ( n ). Choice 3. Space grows with number of elements. Choice 4. There is no overhead associated with elements in the list structure Select one: a. Choice 1 b. Choice 2 c. Choice 3 d. Choice 4  The correct answer is: Choice 4

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 48/49 Question 105 Correct Mark 1.00 out of 1.00 Question 106 Correct Mark 1.00 out of 1.00 For the following code fragment, select the choice which represents the most appropriate asymptotic analysis: static int function ( n ) { sum = 0; for (j=1; j<=n; j++) for (i=1; i<=j; i++) sum++; return sum; } Choice 1. Θ ( n ) Choice 2. O( 2 ) Choice 3. Θ( n ) Choice 4. Ω( n ) (NOTE: code fragment is not intended to be functioning code) Select one: a. Choice 1 b. Choice 2 c. Choice 3  d. Choice 4 n 2 2 The correct answer is: Choice 3 A list is said to be empty when all of its elements have a zero (0) value Select one: True False  The correct answer is 'False'. ◄ Learning Guide Unit 9 Jump to...

1/4/23, 6:28 AM Review Quiz: Attempt review https://my.uopeople.edu/mod/quiz/review.php?attempt=9499118&cmid=328928 49/49