Mettl Coding Fundamentals and Logic 2

Question 1

What is the time complexity of binary search on a sorted array of n elements?

Accepted Answer

O(log n)

Answer

Binary search halves the search space each iteration, yielding O(log n) time complexity.

Question 2

Which data structure uses LIFO (Last In, First Out) ordering?

Accepted Answer

Stack

Answer

A stack follows LIFO ordering, where the last element pushed is the first to be popped.

Question 3

What does the following pseudocode return for input n=5?

function f(n):
  if n <= 1: return n
  return f(n-1) + f(n-2)

Accepted Answer

8

Answer

This is the Fibonacci sequence; f(5) = f(4)+f(3) = 3+5 = 8.

Question 4

Which sorting algorithm has an average-case time complexity of O(n log n)?

Accepted Answer

Merge Sort

Answer

Merge Sort consistently achieves O(n log n) average and worst-case time complexity.

Question 5

In a singly linked list, what is the time complexity of accessing the kth element?

Accepted Answer

O(k)

Answer

You must traverse from the head node, taking O(k) steps to reach the kth element.

Mettl Practice Test