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
81. If the hashing function is the remainder on division, then clustering is more likely to occur if the storage space is divided into 40 sectors rather than 41. This conclusion is
- more likely to be false
- more likely to be true
- is alwyas false
- none of these
82. The algorithm design technique used in the quick sort algorithm is
- dynamic programming
- Backtracking
- Divide and conquer
- Greedy method
83. Linked lists are not suitable for
- insertion sort
- Binary search
- radix sort
- Polynomial manipulation
84. A 3-ary tree in which every internal node has exactly 3 children. the number of leaf nodes in such a tree with 6 internal nodes will be
- 10
- 11
- 12
- 13
85. In Pascal, each of the elements in the array var A :array [-6..6] of boolean can have
- one value
- one of the two values
- 12 values
- 13 values
86. In C programming language, if the first and the second operands of operator + are of types int and float, respectively, the result will be of type
- int
- float
- char
- long int
87. The minimum number of interchange needed to convert the array 89, 19, 14, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70, into a heap with maximum element at the root is
- 0
- 1
- 2
- 3
89. What is the maximum number of dimensions and array in C may have ?
- two
- eight
- sixteen
- theoratically no limit. the only practical limits are memory size and compilers.
90. C programming language provides operations which deal directly with objects such as
- strings and sets
- lists and arrays
- characters, integers, and floating point numbers
- all of these