Algorithms final exam mock

What is the time complexity of looking for an element in any given tree?

• O(n)

• O(log n)

• O(1)

• O(n log n)

Given the topological sort implementation below, what is its time complexity? (n for Vertices, m for Edges)

• O(m + n)

• O(nm)

• O(m log n)

• O(n log m)

A Binary Search Tree is more appropriate than Binary Search over a sorted array when...

• We need to perform not only searches but access any random element efficiently

• The contents of the data structure are very dynamic and elements are added and removed frequently

• The contents of the data structure are very static and do not change once inserted

• We need to save space in memory

What is the purpose of Red-Black Trees?

• To help making insertions on the Binary Search Tree faster

• To help making removals from the Binary Search Tree faster

• To give the tree a beautiful colored shape

• To keep the Binary Search Tree balanced

Which of the following sentences about graphs is correct?

• Breadth-First Search is suited to compose the topological orderings of a graph

• Breadth-First Search can help us calculate the shortest path between two nodes in an unweighted graph

• Depth-First Search is suited to calculate the shortest path in a Direct Acyclic Graph

• Dijkstra's algorithm can help us calculate the shortest path between two nodes in an unweighted graph

This is a placeholder for Question 6.

• Option A for Question 6

• Option B for Question 6

• Option C for Question 6

• Option D for Question 6

This is a placeholder for Question 7.

• Option A for Question 7

• Option B for Question 7

• Option C for Question 7

• Option D for Question 7

This is a placeholder for Question 8.

• Option A for Question 8

• Option B for Question 8

• Option C for Question 8

• Option D for Question 8

This is a placeholder for Question 9.

• Option A for Question 9

• Option B for Question 9

• Option C for Question 9

• Option D for Question 9

This is a placeholder for Question 10.

• Option A for Question 10

• Option B for Question 10

• Option C for Question 10

• Option D for Question 10