Online Quiz Attempt – Play & Test Your Knowledge

Question 1

1 / 10

Which data structure is best suited for implementing recursion?

रिकर्सन को लागू करने के लिए कौन सा डेटा स्ट्रक्चर सबसे उपयुक्त है?

A

Stack

B

Queue

C

Heap

D

Graph

Question 2

2 / 10

What is the average time complexity of Quick Sort?

Quick Sort की औसत समय जटिलता क्या है?

A

O(n log n)

B

O(n^2)

C

O(log n)

D

O(n)

Question 3

3 / 10

Which traversal technique uses a queue?

कौन सी traversal तकनीक queue का उपयोग करती है?

A

Breadth First Search

B

Depth First Search

C

Inorder Traversal

D

Postorder Traversal

Question 4

4 / 10

Which data structure is used to implement priority queues?

Priority queue को लागू करने के लिए कौन सा डेटा स्ट्रक्चर उपयोग होता है?

A

Heap

B

Stack

C

Array

D

Linked List

Question 5

5 / 10

What is the worst-case time complexity of binary search?

Binary search की worst-case समय जटिलता क्या है?

A

O(log n)

B

O(n)

C

O(n log n)

D

O(1)

Question 6

6 / 10

Which algorithm is used to find the shortest path in a graph?

ग्राफ में सबसे छोटा पथ खोजने के लिए कौन सा एल्गोरिदम उपयोग किया जाता है?

A

Dijkstra’s Algorithm

B

Prim’s Algorithm

C

Kruskal’s Algorithm

D

DFS

Question 7

7 / 10

Which data structure supports efficient insertion and deletion at both ends?

कौन सा डेटा स्ट्रक्चर दोनों सिरों से कुशल insertion और deletion को सपोर्ट करता है?

A

Deque

B

Stack

C

Priority Queue

D

Tree

Question 8

8 / 10

Which technique divides a problem into smaller subproblems?

कौन सी तकनीक समस्या को छोटे उपसमस्याओं में विभाजित करती है?

A

Divide and Conquer

B

Greedy Method

C

Backtracking

D

Brute Force

Question 9

9 / 10

Which sorting algorithm is stable by nature?

कौन सा sorting algorithm स्वभाव से stable होता है?

A

Merge Sort

B

Quick Sort

C

Heap Sort

D

Selection Sort

Question 10

10 / 10

What does Big-O notation describe?

Big-O नोटेशन क्या दर्शाता है?

A

Algorithm efficiency

B

Programming syntax

C

Memory location

D

Code readability

Data Structures & Algorithms – Advanced

Which data structure is best suited for implementing recursion?

What is the average time complexity of Quick Sort?

Which traversal technique uses a queue?

Which data structure is used to implement priority queues?

What is the worst-case time complexity of binary search?

Which algorithm is used to find the shortest path in a graph?

Which data structure supports efficient insertion and deletion at both ends?

Which technique divides a problem into smaller subproblems?

Which sorting algorithm is stable by nature?

What does Big-O notation describe?

Total Questions