0% 0 Year1st Year2nd Year3rd Year4th YearStateAndhra PradeshArunachal PradeshAssamBiharChhattisgarhGoaGujaratHaryanaHimachal PradeshJharkhandKarnatakaKeralaMadhya PradeshMaharashtraManipurMeghalayaMizoramNagalandOdishaPunjabRajasthanSikkimTamil NaduTelanganaTripuraUttar PradeshUttarakhandWest Bengal 1 / 30 1. If in a certain language, "MATH" is coded as "NBUJ", what will be the code for "READ"? A) SFBE B) SFBH C) SFBF D) SFBG 2 / 30 2. Which data structure uses a FIFO (First In, First Out) approach? A) Linked List B) Queue C) Stack D) Array 3 / 30 3. 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) 12 B) 7 C) 0 D) 4 4 / 30 4. Which data structure is typically used to implement function call management in programming languages? A) Linked List B) Stack C) Queue D) Array 5 / 30 5. If the code for "CAR" is "DPS", what is the code for "CAT"? A) DQT B) DCT C) DCT D) DBU 6 / 30 6. Fill in the blank: "Her _____ efforts to improve the system were acknowledged by the management." A) Careless B) Negligent C) Diligent D) Unfocused 7 / 30 7. 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) 12 km/h B) 10 km/h C) 8 km/h D) 7 km/h 8 / 30 8. Find the value of 12×4×5\frac{1}{2} \times 4 \times 521×4×5: A) 10 B) 5 C) 15 D) 20 9 / 30 9. In a binary search tree, how is the left child of a node related to its parent? A) It has a value greater than the parent B) It can be any value C) It can have a value equal to the parent D) It has a value less than the parent 10 / 30 10. What is the time complexity of finding the maximum element in a binary heap? A) O(1) B) O(n) C) O(n log n) D) O(log n) 11 / 30 11. In which data structure are elements accessed by a unique index? A) Array B) Stack C) Linked List D) Queue 12 / 30 12. Which data structure is most suitable for implementing a depth-first search (DFS)? A) Queue B) Array C) Linked List D) Stack 13 / 30 13. Who is the current Secretary-General of the United Nations? A) António Guterres B) Kofi Annan C) Ban Ki-moon D) Boutros Boutros-Ghali 14 / 30 14. Which of the following is not a valid operation for a stack? A) Pop B) Peek C) Dequeue D) Push 15 / 30 15. Which African country became independent from Sudan in 2011? A) South Sudan B) Ethiopia C) Somalia D) Eritrea 16 / 30 16. What is the least common multiple (LCM) of 15 and 20? A) 40 B) 60 C) 30 D) 80 17 / 30 17. Which type of queue is implemented using two stacks? A) Priority Queue B) Circular Queue C) Double-ended Queue D) Stack-based Queue 18 / 30 18. Which of the following operations will be affected by endianness? A) Array access B) Type casting C) Pointer arithmetic D) Bitwise operations 19 / 30 19. What is the space complexity of a recursive algorithm? A) O(1) B) O(n^2) C) O(n) D) O(log n) 20 / 30 20. Which of the following operations is not supported by a singly linked list? A) Deletion B) Access by index C) Traversal D) Insertion 21 / 30 21. Which of the following is an antonym for "ADVANCE"? A) Develop B) Progress C) Move forward D) Retreat 22 / 30 22. In a doubly linked list, how would you delete a node if you have only a pointer to that node? A) Change the pointers of adjacent nodes B) Traverse from the head C) Create a new list without the node D) Use a stack 23 / 30 23. In a binary tree, what is the maximum number of nodes at height 'h'? A) 2^(h+1) B) 2^(h+1) - 1 C) 2^h - 1 D) 2^h 24 / 30 24. What is the capital of the European Union? A) Brussels B) Rome C) Berlin D) Paris 25 / 30 25. What is the time complexity of accessing an element in a linked list? A) O(n) B) O(1) C) O(log n) D) O(n log n) 26 / 30 26. What is the HCF of 24 and 36? A) 8 B) 24 C) 12 D) 6 27 / 30 27. What is the primary advantage of a linked list over an array? A) Random access B) Fixed size C) Constant time insertion and deletion D) Efficient memory allocation 28 / 30 28. Find the word that is most opposite in meaning to "CONCEAL": A) Cover B) Protect C) Hide D) Reveal 29 / 30 29. A shopkeeper gives a discount of 10% on the marked price and still gains 20%. If the marked price of an article is ₹ 500, what is its cost price? A) ₹ 450 B) ₹ 375 C) ₹ 350 D) ₹ 400 30 / 30 30. What is the time complexity of adding an element to the end of a dynamic array? A) O(1) B) O(n) C) O(n log n) D) O(log n) Your score is LinkedIn Facebook Twitter VKontakte 0%
