Supplementary Quiz

Which of the following is a hierarchical data structure?

• • Tree

• • Array

• • Stack

• • Queue

What is the space complexity of an algorithm concerned with?

• • Execution speed

• • Memory usage

• • Number of loops

• • Code length

Which notation is used to express time and space complexity?

• • π (Pi) Notation

• • Σ (Sigma) Notation

• • Δ (Delta) Notation

• • Big-O Notation

Big-O notation is used to describe:

• • Programming syntax rules

• • The rate of algorithm growth

• • The number of lines of code

• • Variable memory addresses

Arrays allow direct/random access to elements via indices.

• True

• False

A linked list needs contiguous memory allocation.

• True

• False

If an algorithm uses recursion heavily, it usually consumes more:

• • Time only

• • Space only

• • Both time and space

• Neither time nor space

In plain words, O(log n) means:

• • Checks every element one by one

• • Work grows slowly as input grows

• • Runs in constant time always

• • Doubles speed with more data

Which of the following is a disadvantage of arrays?

• • Contiguous memory allocation

• • Direct access to elements

• • Fixed size that cannot be changed easily

• • Stores multiple elements of the same type

What is the time complexity for accessing an element in an array by index?

• • O(1)

• • O(n)

• • O(log n)

• • O(n²)