← Back to Data Structures & Algorithms

Data Structures & Algorithms final exam

Fifteen questions on all of Data Structures & Algorithms. Answer all 15 to see your score. Questions are drawn from a bank of 45, so every attempt is different.

0 of 15 answered

Question 1 of 15

Appending to a dynamic array that doubles when full costs, amortised:

Question 2 of 15

Deleting a node from a doubly linked list given a pointer to it costs:

Question 3 of 15

Which structure gives O(1) indexing and the best cache behaviour?

Question 4 of 15

An LRU cache achieves O(1) operations by combining a hash map with a:

Question 5 of 15

Undo features in editors are most naturally modelled with a:

Question 6 of 15

A printer serving jobs in arrival order uses a:

Question 7 of 15

A ring buffer advances its indexes using:

Question 8 of 15

A priority queue always removes:

Question 9 of 15

A complete binary tree stored in an array has the root at index:

Question 10 of 15

In-order traversal of a BST visits keys:

Question 11 of 15

The worst-case height of a plain BST with n keys is:

Question 12 of 15

AVL and red-black trees guarantee search in:

Question 13 of 15

A left rotation followed by a right rotation fixes which AVL case?

Question 14 of 15

Extracting the minimum from a binary min-heap costs:

Question 15 of 15

Most relational database indexes are built on:

Back to all units