Brain Booster

1 / 30

1. Antonym of "INNOVATIVE":

A) Conventional

B) Original

C) Creative

D) Unique

2 / 30

2. Which of the following operations has a constant time complexity in a hash table?

A) All of the above

B) Insertion

C) Deletion

D) Search

3 / 30

3. Which data structure is used to represent hierarchical data?

A) Array

B) Stack

C) Tree

D) Queue

4 / 30

4. If 'PAPER' is coded as 'QBPFS', what is the code for 'BOOK'?

A) CPPJ

B) CPPH

C) CQQH

D) CQQJ

5 / 30

5. Which of the following is an example of a non-linear data structure?

A) Array

B) Linked List

C) Queue

D) Tree

6 / 30

6. What is the result of the following bitwise operation?
int x = 12; // 00001100 in binary
int y = 7; // 00000111 in binary
int z = x & y;

A) 4

B) 7

C) 12

D) 0

7 / 30

7. What is the time complexity of inserting an element into a heap?

A) O(n)

B) O(1)

C) O(log n)

D) O(n log n)

8 / 30

8. If the cost price of 20 articles is equal to the selling price of 15 articles, what is the profit percentage?

A) 20%

B) 50%

C) 25%

D) 33.33%

9 / 30

9. Name the highest mountain outside of Asia.

A) Mount Elbrus

B) Aconcagua

C) Mount Kilimanjaro

D) Denali

10 / 30

10. What is the primary advantage of a doubly linked list over a singly linked list?

A) Simplicity of implementation

B) Lower memory usage

C) Faster access to elements

D) Bidirectional traversal

11 / 30

11. Which city is known as the "City of Seven Hills"?

A) Rome

B) Athens

C) Istanbul

D) Lisbon

12 / 30

12. What is the time complexity of merging two sorted arrays?

A) O(n^2)

B) O(n log n)

C) O(n)

D) O(1)

13 / 30

13. In a certain code, "FESTIVAL" is written as "GFTUJWBM". How is "TRADITION" written in that code?

A) USBFJUPJO

B) USBEJUPJO

C) USBFKUPJO

D) USBEJPUPJ

14 / 30

14. What is 30% of 450?

A) 135

B) 140

C) 130

D) 120

15 / 30

15. If a number is increased by 25%, it becomes 150. What is the original number?

A) 110

B) 140

C) 130

D) 120

16 / 30

16. Choose the word that is most opposite in meaning to "PERSISTENT":

A) Tenacious

B) Resolute

C) Hesitant

D) Determined

17 / 30

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

A) 2

B) 4

C) 3

D) 1

18 / 30

18. What is the time complexity of adding an element to the end of a dynamic array?

A) O(n log n)

B) O(log n)

C) O(1)

D) O(n)

19 / 30

19. What is the average time complexity of accessing an element in a balanced binary search tree?

A) O(n)

B) O(n log n)

C) O(log n)

D) O(1)

20 / 30

20. In a circular linked list, the last node points to which node?

A) NULL

B) The first node

C) The second node

D) Itself

21 / 30

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

A) 1

B) 4

C) 2

D) 3

22 / 30

22. 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) 5 seconds

B) 6 seconds

C) 4 seconds

D) 8 seconds

23 / 30

23. Choose the correct synonym for "ANONYMOUS":

A) Unnamed

B) Identified

C) Famous

D) Known

24 / 30

24. Which of the following algorithms is used for finding the shortest path in a graph with non-negative weights?

A) Bellman-Ford Algorithm

B) Kruskal's Algorithm

C) Dijkstra's Algorithm

D) Floyd-Warshall Algorithm

25 / 30

25. Which data structure is best suited for implementing a LRU (Least Recently Used) cache?

A) Binary Search Tree

B) Queue

C) Stack

D) Linked List and Hash Map

26 / 30

26. Which data structure is used to implement recursion?

A) Linked List

B) Array

C) Queue

D) Stack

27 / 30

27. In a priority queue, which element is removed first?

A) The element with the lowest priority

B) The element inserted last

C) The element inserted first

D) The element with the highest priority

28 / 30

28. If the perimeter of a square is 32 cm, what is the area of the square?

A) 16 cm²

B) 256 cm²

C) 128 cm²

D) 64 cm²

29 / 30

29. What is the capital of the European Union?

A) Berlin

B) Rome

C) Brussels

D) Paris

30 / 30

30. What is the main characteristic of a binary search tree (BST)?

A) Each node has at most two children.

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

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

D) Nodes are arranged in a balanced manner.

Your score is