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
161. A (n) ______ occurs when the value in the current record's control field does not match the value in the control variable.
- control break
- error
- unable to find
- return's zero
162. The of the following types of programs would require the program data to be sorted in order for the programs to work correctly?
- programs that display department names in alphabetical order
- programs that display sales amounts in numercial order
- programs that display subtotals in reports
- all of these
163. The bubble sort would compare the code [x] element to the ____ element.
- code [x+1]
- code [x+2]
- code [x+2x]
- all of these
164. The value for which you are searching is called the
- binary value
- key
- search argument
- serial value
165. Which of the following is false
- A serial search begins with the first array element
- A serial search continues searching, element by element, either until a match is found or until the end of the array is encountered
- A serial search is useful when the amount of data that must be search is small
- for a serial search to work, the data in the array must, be arranged in either alphabetical or numerical order
166. _______, which are calculated by adding together the various subtotals in the report, typically appear at the end of the report ?
- grand total
- final totals
- summary totals
- all of these
167. A ______ search begins the search with the element that is located in the middle of the array.
- serial
- random
- parallel
- binary
168. Which is true about linked list ?
- A list is a dynamic data structure
- A list is a static data structure having variable storage
- A stack can't be implemented by a linear linked list.
- Both (a) and (b)
169. The address field of a linked list
- contain address off the next node
- contain address of the next pointer
- may contain NULL character
- both (a) and (c)
170. A circular list can be used to represent
- a stack
- a queue
- B-tree
- both (a) and (b)