Online Examination – Data Structures and Algorithms

Question 1

Which data structure follows the LIFO (Last In, First Out) principle?

Question 2

What is the time complexity of binary search in a sorted array?

Question 3

Which data structure is best for implementing recursion?

Question 4

Which of the following is a non-linear data structure?

Question 5

In a singly linked list, each node contains:

Question 6

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

Question 7

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

Question 8

Which data structure is used for Breadth First Search (BFS)?

Question 9

Which traversal of a binary tree gives sorted output in a Binary Search Tree (BST)?

Question 10

What is the time complexity of accessing an element in an array by index?

1
2
3
4
5
6
7
8
9
10