Brain Booster

1 / 30

1. Choose the correct synonym for "ANONYMOUS":

A) Famous

B) Known

C) Identified

D) Unnamed

2 / 30

2. In a binary tree, what is the maximum number of nodes at height 'h'?

A) 2^h

B) 2^(h+1) - 1

C) 2^h - 1

D) 2^(h+1)

3 / 30

3. What is the time complexity of accessing an element in a hash table with chaining?

A) O(log n) average case

B) O(1) average case

C) O(n) average case

D) O(n log n) average case

4 / 30

4. Which function is used to dynamically allocate memory in C?

A) realloc()

B) All of the above

C) calloc()

D) malloc()

5 / 30

5. Who is the youngest Nobel Prize laureate in history?

A) Kailash Satyarthi

B) Nadia Murad

C) Malala Yousafzai

D) Greta Thunberg

6 / 30

6. If 5 cats can catch 5 mice in 5 minutes, how many cats are needed to catch 100 mice in 100 minutes?

A) 10

B) 25

C) 5

D) 20

7 / 30

7. Two trains are moving in opposite directions at speeds of 60 km/h and 90 km/h. If the length of each train is 150 meters, how much time will they take to cross each other?

A) 8 seconds

B) 4 seconds

C) 6 seconds

D) 5 seconds

8 / 30

8. Fill in the blank: "The company’s _____ approach led to innovative solutions for their clients."

A) Routine

B) Unconventional

C) Conventional

D) Traditional

9 / 30

9. Find the correct word to complete the sentence: "The movie was _____ with brilliant performances and an engaging storyline."

A) Dull

B) Exceptional

C) Mediocre

D) Average

10 / 30

10. What is the main advantage of a binary search tree over a simple binary tree?

A) More balanced structure

B) Fixed size

C) Efficient searching, insertion, and deletion

D) Easier traversal

11 / 30

11. Name the highest mountain outside of Asia.

A) Mount Kilimanjaro

B) Aconcagua

C) Denali

D) Mount Elbrus

12 / 30

12. What is the worst-case time complexity of finding an element in a balanced binary search tree?

A) O(1)

B) O(log n)

C) O(n)

D) O(n log n)

13 / 30

13. What is the maximum number of children a node can have in a binary tree?

A) 3

B) 1

C) 2

D) 4

14 / 30

14. Which data structure is best for implementing recursion?

A) Queue

B) Linked List

C) Array

D) Stack

15 / 30

15. What is 40% of 350?

A) 120

B) 130

C) 150

D) 140

16 / 30

16. Which traversal method uses a queue to visit nodes in level order?

A) Level Order

B) Postorder

C) Preorder

D) Inorder

17 / 30

17. If you arrange the letters of the word "BEAUTIFUL" into a new word, which of the following words will be different?

A) LITE

B) FABLE

C) FAULT

D) TABLE

18 / 30

18. If a boat travels downstream at 15 km/h and upstream at 5 km/h, what is the speed of the boat in still water?

A) 10 km/h

B) 8 km/h

C) 12 km/h

D) 7 km/h

19 / 30

19. What is the time complexity of deleting an element from a balanced binary search tree?

A) O(1)

B) O(n)

C) O(n log n)

D) O(log n)

20 / 30

20. Which of the following is not a characteristic of a heap?

A) Complete binary tree

B) Every node follows the heap property

C) Used to implement priority queues

D) Nodes are always balanced

21 / 30

21. What is the worst-case time complexity of heap sort?

A) O(n log n)

B) O(log n)

C) O(n)

D) O(n^2)

22 / 30

22. Which river is the longest in the world?

A) Mississippi

B) Yangtze

C) Amazon

D) Nile

23 / 30

23. What is the space complexity of using an adjacency matrix to represent a graph with 'n' vertices?

A) O(n log n)

B) O(n^2)

C) O(n)

D) O(n^3)

24 / 30

24. What is the output of the following code?
#include
int main() {
int arr[] = {1, 2, 3, 4};
printf("%d", arr[3]);
return 0;
}

A) 4

B) 3

C) 2

D) 1

25 / 30

25. Which traversal method visits nodes in the following order: left subtree, root, right subtree?

A) Inorder

B) Preorder

C) Postorder

D) Level Order

26 / 30

26. What is the time complexity of searching for an element in an unsorted linked list?

A) O(n log n)

B) O(n)

C) O(1)

D) O(log n)

27 / 30

27. Which of the following is a characteristic of a binary search tree (BST)?

A) The left child is greater than the parent node.

B) The right child is smaller than the parent node.

C) The tree is always balanced.

D) Each node has at most two children.

28 / 30

28. A man sells an article at 20% loss. If he had sold it for ₹ 60 more, he would have made a 10% profit. What is the cost price of the article?

A) ₹ 300

B) ₹ 200

C) ₹ 250

D) ₹ 400

29 / 30

29. In which data structure are elements accessed by a unique index?

A) Linked List

B) Array

C) Stack

D) Queue

30 / 30

30. The population of a town increases by 10% every year. If the present population is 20,000, what will be the population after 2 years?

A) 24,200

B) 24,000

C) 22,000

D) 22,200

Your score is