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
231. The minimum number of edges in a connected cyclic graph on n vertices is
- n - 1
- n
- n + 1
- none of these
232. The post fix expression for the infix expression A + B * (C + D)/F + D * E is
- AB + CD + *F/D + E*
- ABCD + *F/+DE*+
- A * B + CD/F*DE ++
- A + *BCD/F * DE++
233. In a circularly linked list organization; insertion of a record involves the modification of
- no pointer
- 1 pointer
- 2 pointers
- 3 pointers
234. Stack is useful for implementing
- radix sort
- breadth first search
- recursion
- depth first search
235. Which of the following is useful in implementing quick sort ?
- stack
- set
- list
- queue
236. Queue can be used to implement
- radix sort
- quick sort
- recursion
- depth first search
237. The process of accessing data stored in a tape is similar to manipulating data on a
- stack
- queue
- list
- heap
238. The maximum degree of any vertex in a simple graph with n vertices is
- n
- n - 1
- n + 1
- 2n - 1
239. the number of edges in a regular graph of degree d and n vertices is
- maximum of n, d
- n + d
- nd
- nd/2