0% 0 Year1st Year2nd Year3rd Year4th YearStateAndhra PradeshArunachal PradeshAssamBiharChhattisgarhGoaGujaratHaryanaHimachal PradeshJharkhandKarnatakaKeralaMadhya PradeshMaharashtraManipurMeghalayaMizoramNagalandOdishaPunjabRajasthanSikkimTamil NaduTelanganaTripuraUttar PradeshUttarakhandWest Bengal 1 / 30 1. The sum of two numbers is 50 and their difference is 14. What are the two numbers? A) 22 and 28 B) 18 and 32 C) 15 and 35 D) 20 and 30 2 / 30 2. What is the worst-case time complexity of finding an element in a balanced binary search tree? A) O(n) B) O(log n) C) O(n log n) D) O(1) 3 / 30 3. What is the missing letter in the sequence: A, C, F, J, O, ? A) U B) S C) T D) R 4 / 30 4. 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) ₹ 350 B) ₹ 400 C) ₹ 375 D) ₹ 450 5 / 30 5. Which of the following algorithms is used for finding the shortest path in a graph with non-negative weights? A) Kruskal's Algorithm B) Bellman-Ford Algorithm C) Floyd-Warshall Algorithm D) Dijkstra's Algorithm 6 / 30 6. Which algorithm is used to find the shortest path between all pairs of nodes in a graph? A) Dijkstra's Algorithm B) Bellman-Ford Algorithm C) Prim's Algorithm D) Floyd-Warshall Algorithm 7 / 30 7. Which traversal method visits nodes in the following order: left subtree, root, right subtree? A) Preorder B) Postorder C) Inorder D) Level Order 8 / 30 8. Which of the following is not a characteristic of a stack? A) Elements are inserted at the end and removed from the beginning B) Only allows access to the last element C) Operates like a stack of plates D) Last In, First Out (LIFO) principle 9 / 30 9. A person sold an article for ₹ 600 at a loss of 20%. What was the cost price of the article? A) ₹ 850 B) ₹ 750 C) ₹ 700 D) ₹ 800 10 / 30 10. What is the worst-case time complexity of quicksort? A) O(n log n) B) O(log n) C) O(n^2) D) O(n) 11 / 30 11. In a binary tree, what is the maximum number of nodes at height 'h'? A) 2^h B) 2^h - 1 C) 2^(h+1) - 1 D) 2^(h+1) 12 / 30 12. In a doubly linked list, how many pointers does each node have? A) 4 B) 3 C) 2 D) 1 13 / 30 13. Who is the current Secretary-General of the United Nations? A) Boutros Boutros-Ghali B) Kofi Annan C) Ban Ki-moon D) António Guterres 14 / 30 14. Which of the following is a dynamic data structure? A) Linked List B) ueue C) Array D) Matrix 15 / 30 15. Which river is the longest in the world? A) Mississippi B) Amazon C) Nile D) Yangtze 16 / 30 16. Which of the following is not a storage class in C? A) volatile B) auto C) register D) extern 17 / 30 17. What will be the result of the following C expression? int x = 5; x = x++ + ++x; A) 10 B) 12 C) 11 D) Undefined behavior 18 / 30 18. Choose the word most similar in meaning to "ABUNDANT": A) Limited B) Scarce C) Rare D) Sufficient 19 / 30 19. What is the main advantage of a binary search tree over a simple binary tree? A) Easier traversal B) Efficient searching, insertion, and deletion C) Fixed size D) More balanced structure 20 / 30 20. If 5 men can complete a work in 15 days, how long will it take for 10 men to complete the same work? A) 10 days B) 7 days C) 7.5 days D) 8 days 21 / 30 21. What is the primary use of a priority queue? A) To manage function calls B) To store unique elements C) To sort elements D) To handle tasks based on priority 22 / 30 22. What is the time complexity of accessing an element in a hash table with chaining? A) O(n) average case B) O(1) average case C) O(n log n) average case D) O(log n) average case 23 / 30 23. Complete the sentence: "The ______ nature of his speech made it difficult for the audience to follow." A) Clear B) Concise C) Confusing D) Lucid 24 / 30 24. Which city is known as the "City of Seven Hills"? A) Rome B) Athens C) Lisbon D) Istanbul 25 / 30 25. What will be the compound interest on ₹ 1,000 at 10% per annum for 2 years? A) ₹ 210 B) ₹ 100 C) ₹ 220 D) ₹ 200 26 / 30 26. What is the next letter in the sequence: D, G, J, M, ? A) R B) O C) P D) Q 27 / 30 27. Which of the following is an example of a non-linear data structure? A) Tree B) Array C) Queue D) Linked List 28 / 30 28. In a binary search tree, how is the left child of a node related to its parent? A) It can have a value equal to the parent B) It can be any value C) It has a value greater than the parent D) It has a value less than the parent 29 / 30 29. In a doubly linked list, how would you delete a node if you have only a pointer to that node? A) Use a stack B) Change the pointers of adjacent nodes C) Create a new list without the node D) Traverse from the head 30 / 30 30. If A = 1, B = 2, C = 3, what is the value of the word "CAB"? A) 7 B) 9 C) 6 D) 8 Your score is LinkedIn Facebook Twitter VKontakte 0%
