Analysis of Algorithms and Computational Complexity Questions and Answers
Understanding the Analysis of Algorithms and Computational Complexity questions with answers is crucial for students preparing for GATE, TCS, Infosys, and Wipro placement exams. This topic focuses on evaluating the efficiency of algorithms based on time and space complexity, which forms the foundation of advanced computer programming and system design. By solving programming questions and answers related to algorithm analysis, you can strengthen your logical thinking, optimize code performance, and make informed design decisions. In this section, we cover detailed MCQs and explanations to help you master Big O notation, asymptotic analysis, and algorithmic trade-offs. Perfect for both academic and placement preparation, this guide ensures clarity with well-explained examples.
Questions on algorithmic analysis for computer science aspirants can be complemented by data structure algorithms and software engineering MCQ
Analysis of Algorithms and Computational Complexity
201. the smallest number of key that will force a b-tree of order 3 to have a height 3 is
- 12
- 10
- 7
- none of these
202. A complete full binary tree with 10 leaves
- cannot have more than 19 nodes
- has exactly 19 nodes
- has exactly 17 nodes
- cannot have more than 17 nodes
204. Number of swappings needed to sort the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order, using bubble sort is
- 11
- 12
- 13
- 14
205. A hash table with 10 buckets with one slot per bucket is depicted. the symbols, S1 to S7 are initially emeged using a hashing function with linear probing. Maximum number of comparisons needed in searching an item that is not present is
- 6
- 5
- 4
- 3
206. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Wuch a tree with 10 leaves
- cannot have more than 19 nodes
- has exactly 19 nodes
- has exactly 17 nodes
- cannot have more than 17 nodes
207. Average successful search time taken by binary search on a sorted array of 10 items is
- 2.6
- 2.7
- 2.8
- 2.9
209. Sorting is useful for
- report generation
- making searching easier and efficient
- responding to queries easily
- all of these
210. A sorting technique that guarantees that records with the same primary key occurs in the same order in the sorted list as in the original unsorted list is said to be
- stable
- consistant
- external
- linear