Online Coding Lessons Data Structures and Algorithms 2

Question 1

What is a linked list?

Accepted Answer

A data structure where each node points to the next node

Answer

A linked list is a data structure where each element (node) contains data and a pointer/reference to the next node in the sequence.

Question 2

What is the main advantage of binary search over linear search?

Accepted Answer

It is faster, with O(log n) complexity on sorted arrays

Answer

Binary search has O(log n) time complexity on sorted arrays, making it much faster than linear search's O(n) for large datasets.

Question 3

What is a tree data structure?

Accepted Answer

A hierarchical structure with a root node and child nodes

Answer

A tree is a non-linear hierarchical data structure with a root node at the top and child nodes branching below it.

Question 4

What does 'O(1)' mean in Big O notation?

Accepted Answer

The algorithm has constant time complexity regardless of input size

Answer

O(1) means constant time complexity — the algorithm takes the same amount of time regardless of how large the input is.

Question 5

Which data structure is best suited for implementing a 'back' button in a browser?

Accepted Answer

Stack

Answer

A stack is ideal for a browser's back button because visited pages are added to the top, and clicking 'back' pops the most recent page off the stack (LIFO).

Online Coding Lessons Practice Test

Online Coding Lessons Practice Test

Online Coding Lessons Data Structures and Algorithms 2