Algorithms final exam mock

Algorithms final exam mock

University

35 Qs

quiz-placeholder

Similar activities

App Dev Reviewer - Midterm

App Dev Reviewer - Midterm

University

32 Qs

Materi Google Form (KuisOnline)

Materi Google Form (KuisOnline)

10th Grade - University

30 Qs

Informatique - Acronymes

Informatique - Acronymes

University

35 Qs

Software Life Cycle Models

Software Life Cycle Models

University

30 Qs

hihi

hihi

University

39 Qs

Basics of Microsoft Word and PowerPoint

Basics of Microsoft Word and PowerPoint

University

30 Qs

Сессия Алгоритм 225-256 сурактар

Сессия Алгоритм 225-256 сурактар

University

32 Qs

Level 3 Final Exam Review 1

Level 3 Final Exam Review 1

University

31 Qs

Algorithms final exam mock

Algorithms final exam mock

Assessment

Quiz

Information Technology (IT)

University

Hard

Created by

Jack Samawi

FREE Resource

35 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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)

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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)

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

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

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?