Dashboard / My courses / CS 3304-01 - AY2023-T December- 7 December / Graded Quiz Unit4
Started on Wednesday, 7 December 2025, 2:59 PM
State Finished
Completed on Wednesday, 7 December 2025, 3:18 PM
Time taken 18 mins 57 secs
Marks 16.00/16.00
Grade 100.00 out of 100.00
Question 1
Correct
Mark 1.00 out of 1.00
Which method of traversal does not use stack to hold nodes that are waiting to be processed?
Select one:
a. Depth First
b. Breadth first
¢ Back-tracking
Bounding
o
Question 2
Correct
Mark 1.00 out of 1.00
Suppose you have a directed graph representing all the flights that an airline flies and the flying times for each connection. What
algorithm might be used to find the best sequence of connections from one city to another to minimize the overall time of the flight?
Select one:
a. Breadth first search.
b. Depth first search.
¢ Acycle-finding algorithm.
A shortest-path algorithm. ¥
o
, Question 3
Correct
Mark 1.00 out of 1.00
What is the big-o complexity of the green line?
Big O Notaton
Operations
Elements
Select one:
a o
b. O(log )
¢ Ofnlogn)v
d. oen
ion
Correct
Mark 1.00 out of 1.00
What will be the Big-Oh complexity to search a balanced binary tree?
Select one:
a O
b. Oflog n)¥
¢ oM
d. 0@
Started on Wednesday, 7 December 2025, 2:59 PM
State Finished
Completed on Wednesday, 7 December 2025, 3:18 PM
Time taken 18 mins 57 secs
Marks 16.00/16.00
Grade 100.00 out of 100.00
Question 1
Correct
Mark 1.00 out of 1.00
Which method of traversal does not use stack to hold nodes that are waiting to be processed?
Select one:
a. Depth First
b. Breadth first
¢ Back-tracking
Bounding
o
Question 2
Correct
Mark 1.00 out of 1.00
Suppose you have a directed graph representing all the flights that an airline flies and the flying times for each connection. What
algorithm might be used to find the best sequence of connections from one city to another to minimize the overall time of the flight?
Select one:
a. Breadth first search.
b. Depth first search.
¢ Acycle-finding algorithm.
A shortest-path algorithm. ¥
o
, Question 3
Correct
Mark 1.00 out of 1.00
What is the big-o complexity of the green line?
Big O Notaton
Operations
Elements
Select one:
a o
b. O(log )
¢ Ofnlogn)v
d. oen
ion
Correct
Mark 1.00 out of 1.00
What will be the Big-Oh complexity to search a balanced binary tree?
Select one:
a O
b. Oflog n)¥
¢ oM
d. 0@
