Arrays, Stacks & Queues Basics

Practice core linear structures: arrays, stacks, and queues. Ideal for students and interview prep.

Questions

Attempts

Passed

Failed

Likes

Views

QUESTION NO 01

Which data structure uses FIFO (First In, First Out)?

Answer: Queue

A queue removes elements in the order they were added — FIFO.

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 02

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

Answer: Stack

A stack pops the most recently pushed item — LIFO.

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 03

Average time complexity of binary search on a sorted array is?

Answer: O(log n)

Binary search halves the search space each step, giving O(log n).

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 04

A linked list stores elements as?

Answer: Nodes with data and pointers

Each node holds data and a reference/pointer to the next node.

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 05

Which traversal visits left subtree, root, then right subtree?

Answer: Inorder

Inorder is left → root → right.

Shahzad Mahota @shahzad-mahota

302 Quizzes

2930 Questions

00 Likes

QUESTION NO 06

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 07

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 08

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 09

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 10

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

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

Arrays, Stacks & Queues Basics

Which data structure uses FIFO (First In, First Out)?

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

Average time complexity of binary search on a sorted array is?

A linked list stores elements as?

Which traversal visits left subtree, root, then right subtree?

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?

Published By

Shahzad Mahota

00

00

00

00

00

00

Arrays, Stacks & Queues Basics

Which data structure uses FIFO (First In, First Out)?

Explanation

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

Explanation

Average time complexity of binary search on a sorted array is?

Explanation

A linked list stores elements as?

Explanation

Which traversal visits left subtree, root, then right subtree?

Explanation

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

Published By

Shahzad Mahota

00

00

00

00

00

00

Related Quizzes

Searching & Sorting Essentials