Searching & Sorting Essentials

Binary search, merge sort, and complexity fundamentals. Ideal for students and interview prep.

Questions

Attempts

Passed

Failed

Likes

Views

QUESTION NO 01

A hash table ideally provides average lookup time of?

Answer: O(1)

With a good hash function and load factor, average lookup is O(1).

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 02

Which sorting algorithm has average time complexity O(n log n)?

Answer: Merge sort

Merge sort divides and merges in O(n log n) average and worst case.

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 03

In a binary tree, each node has at most how many children?

Answer: 2

By definition a binary tree node has 0, 1, or 2 children.

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 04

Dijkstra's algorithm finds?

Answer: Shortest paths from a source in a weighted graph

Dijkstra computes shortest paths from one source (non-negative weights).

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 05

Space complexity of an in-place algorithm is typically?

Answer: O(1) extra space

In-place algorithms use constant (or very small) extra memory beyond the input.

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 06

A stack can be used to evaluate?

Answer: Postfix expressions

Operand stacks are classic for evaluating postfix (RPN) expressions.

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 07

BFS on a graph typically uses a?

Answer: Queue

Breadth-first search explores level by level using a queue.

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 08

Worst-case time for searching in an unsorted array is?

Answer: O(n)

Linear search may scan all n elements in the worst case.

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 09

A min-heap always keeps the smallest element at the?

Answer: Root

In a min-heap the minimum key is at the root.

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 10

Recursion uses which memory structure implicitly?

Answer: Call stack

Each recursive call pushes a frame onto the call stack.

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

Published By

Shahzad Mahota

@shahzad-mahota

WAS THIS QUIZ HELPFUL?

Please help us improve by giving us your feedback.

YOUR SCORE CARD

00

Attempts

00

Correct

00

Incorrect

01 02 03 04 05 06 07 08 09 10

WAS THIS QUIZ HELPFUL?

YOUR SCORE CARD

00

Attempts

00

Correct

00

Incorrect

01 02 03 04 05 06 07 08 09 10

Quiz complete See your shareable result poster

View result

Quiz Categories

Explore

Content

Create

Discover

Account

More

Searching & Sorting Essentials

A hash table ideally provides average lookup time of?

Which sorting algorithm has average time complexity O(n log n)?

In a binary tree, each node has at most how many children?

Dijkstra's algorithm finds?

Space complexity of an in-place algorithm is typically?

A stack can be used to evaluate?

BFS on a graph typically uses a?

Worst-case time for searching in an unsorted array is?

A min-heap always keeps the smallest element at the?

Recursion uses which memory structure implicitly?

Published By

Shahzad Mahota

00

00

00

00

00

00

Searching & Sorting Essentials

A hash table ideally provides average lookup time of?

Explanation

Which sorting algorithm has average time complexity O(n log n)?

Explanation

In a binary tree, each node has at most how many children?

Explanation

Dijkstra's algorithm finds?

Explanation

Space complexity of an in-place algorithm is typically?

Explanation

A stack can be used to evaluate?

Explanation

BFS on a graph typically uses a?

Explanation

Worst-case time for searching in an unsorted array is?

Explanation

A min-heap always keeps the smallest element at the?

Explanation

Recursion uses which memory structure implicitly?

Explanation

Published By

Shahzad Mahota

00

00

00

00

00

00

Related Quizzes

Arrays, Stacks & Queues Basics