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
91. C programming language by itself provides
- input facility
- output facility
- both input and output facilities
- no input and output facilities
92. Which of the following are not provided in C ?
- tests and loops
- grouping and subprograms
- synchronization, coroutines, and parallel operations
- all of these
93. A connected graph is the one which
- cannot be partitioned without removing an edge
- contains at least three loops
- does not contain a cycle
- is not simple
94. In which kind of storage structure for strings, one can easily insert, delete, concatenate, and rearrange substrings?
- fixed length storage structure
- variable length storage with fixed maximum
- linked list storage
- array type storage
95. Which of the following is not a characteristic of COBOL ?
- It is very standardized language
- It is very efficient in terms of coding and execution
- It has limited facilities for mathematical notation
- It is very readable language
96. Which of the following is an example of a problem oriented language ?
- BASIC
- PL/1
- FORTRAN
- None of these
97. In the evaluation of a computer language, all of the following characteristics should be considered except
- application-oriented features
- efficiency
- software development aids
- hardware maintenance costs
98. A factor in the selection of a source language is
- programmer skill
- language availability
- program compatibility with other software
- all of these
99. A computer-generated output that let programmers following the execution of their programs line by line is a:
- core dump
- tracing routine
- detailing listing
- source listing
100. The number of binary trees with 3 nodes which when traversed in post-order gives the sequence A, B, C is
- 3
- 9
- 7
- 5