0% 0 Year1st Year2nd Year3rd Year4th YearStateAndhra PradeshArunachal PradeshAssamBiharChhattisgarhGoaGujaratHaryanaHimachal PradeshJharkhandKarnatakaKeralaMadhya PradeshMaharashtraManipurMeghalayaMizoramNagalandOdishaPunjabRajasthanSikkimTamil NaduTelanganaTripuraUttar PradeshUttarakhandWest Bengal 1 / 30 1. What is the worst-case time complexity of insertion sort? A) O(log n) B) O(n^2) C) O(n) D) O(n log n) 2 / 30 2. Which country recently exited the European Union, a process known as Brexit? A) United Kingdom B) Italy C) Germany D) France 3 / 30 3. In a certain code, "FESTIVAL" is written as "GFTUJWBM". How is "TRADITION" written in that code? A) USBFKUPJO B) USBEJPUPJ C) USBEJUPJO D) USBFJUPJO 4 / 30 4. Fill in the blank: "The company’s _____ approach led to innovative solutions for their clients." A) Traditional B) Conventional C) Unconventional D) Routine 5 / 30 5. What is the smallest number that when divided by 6, 9, and 15 leaves a remainder of 5 in each case? A) 155 B) 95 C) 125 D) 175 6 / 30 6. Complete the sentence: "The ______ nature of his speech made it difficult for the audience to follow." A) Concise B) Lucid C) Clear D) Confusing 7 / 30 7. What is the space complexity of using an adjacency matrix to represent a graph with 'n' vertices? A) O(n^2) B) O(n^3) C) O(n log n) D) O(n) 8 / 30 8. 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) ₹ 250 B) ₹ 400 C) ₹ 200 D) ₹ 300 9 / 30 9. What is the size of int on a 64-bit system? A) Depends on the compiler B) 4 bytes C) 2 bytes D) 8 bytes 10 / 30 10. Which data structure is most suitable for implementing a graph with weighted edges? A) Adjacency List B) Linked List C) Adjacency Matrix D) Hash Table 11 / 30 11. Which function is used to dynamically allocate memory in C? A) realloc() B) malloc() C) calloc() D) All of the above 12 / 30 12. If you rearrange the letters of the word "TREAT", you will get a meaningful word. What is it? A) RATE B) ART C) TEAR D) EAR 13 / 30 13. Which of the following algorithms is used to find the minimum spanning tree of a graph? A) Dijkstra's Algorithm B) Floyd-Warshall Algorithm C) Kruskal's Algorithm D) Bellman-Ford Algorithm 14 / 30 14. A person walks 6 km towards the east, then 8 km towards the north. How far is he from the starting point? A) 14 km B) 10 km C) 16 km D) 12 km 15 / 30 15. Which data structure is most suitable for implementing a depth-first search (DFS)? A) Queue B) Linked List C) Array D) Stack 16 / 30 16. Which of the following is not a characteristic of a heap? A) Every node follows the heap property B) Used to implement priority queues C) Complete binary tree D) Nodes are always balanced 17 / 30 17. 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) 4 seconds B) 5 seconds C) 6 seconds D) 8 seconds 18 / 30 18. In a binary tree, what is the maximum number of nodes at level 'l'? A) 2^(l+1) - 1 B) 2^l C) 2^(l-1) D) 2^l - 1 19 / 30 19. Which type of binary tree has every level fully filled except possibly the last? A) Full Binary Tree B) Balanced Binary Tree C) Perfect Binary Tree D) Complete Binary Tree 20 / 30 20. What is the time complexity of deleting an element from a balanced binary search tree? A) O(n log n) B) O(n) C) O(1) D) O(log n) 21 / 30 21. Which data structure is ideal for implementing a priority queue? A) Stack B) Linked List C) Queue D) Binary Heap 22 / 30 22. Which algorithm is used for sorting an array by repeatedly swapping adjacent elements if they are in the wrong order? A) Quick Sort B) Bubble Sort C) Selection Sort D) Merge Sort 23 / 30 23. Which traversal method uses a queue to visit nodes in level order? A) Level Order B) Preorder C) Postorder D) Inorder 24 / 30 24. In a binary tree, what is the maximum number of nodes at height 'h'? A) 2^(h+1) B) 2^h C) 2^(h+1) - 1 D) 2^h - 1 25 / 30 25. Name the current President of Brazil. A) Jair Bolsonaro B) Michel Temer C) Lula da Silva D) Dilma Rousseff 26 / 30 26. What is the worst-case time complexity of a linear search in an unsorted array? A) O(log n) B) O(n log n) C) O(n) D) O(1) 27 / 30 27. Choose the correct synonym for "VITAL": A) Superfluous B) Unnecessary C) Optional D) Essential 28 / 30 28. If 5 men can complete a work in 15 days, how long will it take for 10 men to complete the same work? A) 8 days B) 10 days C) 7.5 days D) 7 days 29 / 30 29. Which of the following is not a type of tree traversal? A) Inorder B) Preorder C) Postorder D) Stackorder 30 / 30 30. What is the capital of the European Union? A) Rome B) Brussels C) Berlin D) Paris Your score is LinkedIn Facebook Twitter VKontakte 0%
