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
11. Which of the following statements is false ?
- Every tree is a bipartite graph
- A tree contains a cycle
- A tree with a n nodes contains n-1 edges
- A tree is a connected graph
12. Which of the following sorting method is stable ?
- Straight insertion sort
- Binary insertion sort
- Shell sort
- Heap sort
13. A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as
- binary search tree
- AVL tree
- Completely balanced tree
- Heap
14. A complete binary tree with the property that the value at each node is at least as large as the values at its children is known as
- binary search tree
- AVL tree
- Completely balanced tree
- Heap
15. In which of the following sorting algorithm the number of comparisons needed is the minimum if the items are initially in reverse order and is the maximum if the items are in order ?
- Straight insertion sort
- binary insertion sort
- Heap
- Bubble sort
16. Which of the following best describes sorting ?
- Accessing and processing each record exactly ocne
- Finding the location of the record with a given key
- Arranging the data (record) in some given order
- Adding a new reccord to the data structure
17. A search procedure which associates an address with a key value and provides a mechanism for dealing with two or more values assigned to the same address is called
- linear search
- binary search
- hash coded search
- radix search
18. When key values are reals a similar data representation might be produced by using a hashing function with
- mod
- div
- trunc
- log N
19. A characteristic of the data that binary search uses but the linear search ignores, is the
- order of the list
- length of the list
- maximum value in the list
- mean of data valuesd
20. A sort which compares adjacent elements in a list and switches where necessary is a
- insertion sort
- heap sort
- quick sort
- bubble sort