Data Structures and Algorithms - Study24x7
Social learning Network

Warning: include(./views/auth.php): failed to open stream: Permission denied in /var/www/html/live/loginRightSlider.php on line 18

Warning: include(): Failed opening './views/auth.php' for inclusion (include_path='.:/usr/share/php') in /var/www/html/live/loginRightSlider.php on line 18
datastructuresalgorithms Cover image
datastructuresalgorithms
Data Structures and Algorithms

  • Warning: Use of undefined constant Followers - assumed 'Followers' (this will throw an Error in a future version of PHP) in /var/www/html/live/makepage.php on line 1760
    Followers
  • Latest Feeds
  • Articles
  • Question
  • Course
  • About
  • Review
Interests
Java Technologies Python Technologies Computer Programming Software Developer
See more

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 29 Dec 2025 04:41 PM study24x7 study24x7

What is the maximum number of children for any node in a binary tree?

A

1

B

2

C

3

D

Depends on height

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 29 Dec 2025 04:40 PM study24x7 study24x7

Which of the following sorting algorithms is comparison-based?

A

Counting Sort

B

Radix Sort

C

Bucket Sort

D

Heap Sort

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 29 Dec 2025 04:37 PM study24x7 study24x7

Which tree structure keeps keys in sorted order and allows multiple keys per node?

A

AVL Tree

B

Binary Search Tree

C

B-Tree

D

Heap

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 26 Dec 2025 01:18 PM study24x7 study24x7

BFS uses which data structure?

A

Stack

B

Queue

C

Hash table

D

Heap

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 26 Dec 2025 01:17 PM study24x7 study24x7

Time complexity of inserting a node at the beginning of a linked list:

A

O(n)

B

O(log n)

C

O(1)

D

O(n log n)

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 26 Dec 2025 01:15 PM study24x7 study24x7

Binary search works only on:

A

Unsorted arrays

B

Sorted arrays

C

Linked lists

D

Trees

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 24 Dec 2025 03:56 PM study24x7 study24x7

Which algorithm uses backtracking?

A

Merge sort

B

Quick sort

C

Tower of Hanoi

D

N-Queens problem

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 24 Dec 2025 03:56 PM study24x7 study24x7

The number of edges in a complete graph with n nodes is:

A

n

B

C

n(n−1)/2

D

2n

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 24 Dec 2025 03:55 PM study24x7 study24x7

In graph algorithms, Dijkstra’s algorithm fails when:

A

Graph is directed

B

Graph has cycles

C

Negative edge weights

D

Graph is disconnected

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 23 Dec 2025 01:25 PM study24x7 study24x7

Best data structure for implementing priority scheduling:

A

Stack

B

Queue

C

Heap

D

Linked list

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 23 Dec 2025 01:25 PM study24x7 study24x7

A queue where insertion is allowed at both ends but deletion only at one end is called:

A

Input-restricted deque

B

Output-restricted deque

C

Circular queue

D

Priority queue

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 23 Dec 2025 01:24 PM study24x7 study24x7

Which of the following is not an application of stack?

A

Checking balanced parentheses

B

Function call management

C

Level order traversal

D

Reversing a string

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 08 Dec 2025 05:52 PM study24x7 study24x7

Which traversal gives nodes in sorted order for a BST?

A

Preorder

B

Postorder

C

Inorder

D

Level order

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 08 Dec 2025 05:49 PM study24x7 study24x7

What is the time complexity of searching an element in an AVL tree?

A

O(n)

B

O(log n)

C

O(1)

D

O(n log n)

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 08 Dec 2025 05:41 PM study24x7 study24x7

Which data structure is used to convert infix to postfix expression?

A

Queue

B

Stack

C

Tree

D

Heap

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 05 Dec 2025 04:38 PM study24x7 study24x7

In a complete binary tree, the height is:

A

log n

B

n

C

n log n

D

constant

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 05 Dec 2025 04:38 PM study24x7 study24x7

Hash collisions can be handled by:

A

Resizing memory

B

Chaining

C

Segmentation

D

Paging

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 05 Dec 2025 04:31 PM study24x7 study24x7

Which of the following is not a stable sorting algorithm?

A

Bubble Sort

B

Merge Sort

C

Selection Sort

D

Insertion Sort

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 04 Dec 2025 01:07 PM study24x7 study24x7

What is the worst-case time complexity of Quick Sort?

A

O(n log n)

B

O(n²)

C

O(log n)

D

O(n)

study24x7
Write a comment

Warning: count(): Parameter must be an array or an object that implements Countable in /var/www/html/live/makepost.php on line 52
6 followers study24x7 04 Dec 2025 01:05 PM study24x7 study24x7

Which data structure is best suited for implementing recursion?

A

Queue

B

Stack

C

Heap

D

Tree

study24x7
Write a comment
Ratings
0.0
out of 5
0 Ratings
5 study24x7
 
0.0
4 study24x7
 
0.0
3 study24x7
 
0.0
2 study24x7
 
0.0
1 study24x7
 
0.0
Related Pages