Dashboard / My courses / g CS 3303-01 - AY2022-T5 / 14 July - 20 July / G Graded Quiz Unit 5
Started on Friday, 15 July 2022, 12:11 AM State Finished Completed on Friday, 15 July 2022, 12:28 AM Time taken 16 mins 49 secs Marks 25.00/25.00 Grade 100.00 out of 100.00
Question 1 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: O a. Parent root O b.a B+ tree data structure O c. Index O d. Tree
The correct answer is: Tree
Question 2 Correct Mark 1.00 out of 1.00
True/False: Big Theta (O) indicates that the Upper and Lower bounds of an algorithm are the same.
Select one: O True v
O False
The correct answer is 'True'.
Question 3 Correct Mark 1.00 out of 1.00
Which of the following is not a characteristic of an algorithm?
Select one: O a. It must be correct O b. It must be composed of concrete steps O c. It can have no ambiguity O 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
Question 4 Correct Mark 1.00 out of 1.00
Enqueue and Dequeue are notations associated with which data structure:
Select one: O a. Queue O b. Stack O c. List O d. Array
The correct answer is: Queue
Question 5 Correct Mark 1.00 out of 1.00
For the following code fragment, select the most appropriate asymptotic analysis: II Towers of Hanoi static void solveHanoi(int disks, char fromPole, char toPole, char withPole) { if (disks >= 1){ solveHanoi(disks-1, fromPole, withPole, toPole); moveDisk(fromPole, toPole); solveHanoi(disks-1, withPole, toPole, fromPole);
static void moveDisk(char fromPole, char toPole) { moves++;
Option 1. O(n) Option 2. 0(2)
Option 3.
O(n log n) Option 4. O(n2)
Select one: O a. Option 1 O b. Option 2 O c. Option 3 O d. Option 4
The correct answer is: Option 2
Question 6 Correct Mark 1.00 out of 1.00
The process of determining if two objects are in the same set and then merging those sets is called:
Select one: O a. a Union Operation O b. Union /Find O c. a Weighted Union O d. a Merge Operation
The correct answer is: Union