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
51. A given connected graph G is a Euler graph if and only if all vertices of G arre of
- same degree
- even degree
- odd degree
- different degree
52. A circuit in connected graph which includes every vertex of the graph is known as
- Euler
- Unicursal
- Hamiltonian
- Clique
53. The length of a Hamiltonian path (if exist) in a connected graph of n vertices is
- n - 1
- n
- n + 1
- n / 1
54. A simple graph in which there exists an edge between every pair of vertices is called a (an)
- incomplete graph
- complete graph
- Euler graph
- planar graph
55. If B is a circuit matrix of a graph with k components, e edges and n vertices, the rank of B is
- n - k
- e - n - k
- e - n + k
- e + n - k
56. Consider a graph G having cutset matrix C(G) and incidence matrix A(G). The Rank of B is
- same as the rank of A(G)
- more than the rank of A(G)
- less than the rank of A(G)
- independent of the rank of A(G)
57. Let X be the adjacency matrix of a graph G with no self loops. the entries along the principle diagonal of X are
- all zeros
- all ones
- both zeros and ones
- different
58. Which of the following tool is used to specify lexical analyzers for variety of languages
- Lex
- Yaac
- EQN
- TeX
59. In compilers, the syntax analysis is done by
- exical analyzer
- scanner
- parser
- code generator
60. Which of the following parsing methods handle left-recursive grammars ?
- Top-down parsing
- button-up parsing
- both top-down and bottom-up
- none of these