Analysis of Algorithms and Computational Complexity Questions with Answers | Page 22

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

Showing 10 of 239 questions

Per page:

Q211

A text is made up of the characters a, b, c, d, e each occurring with the probability 0.12, 0.4, 0.15, 0.08, and .25 respectively. The optional coding technique will have the average length of

A 4.78
B 3.78
C 2.78
D 1.78

Answer: Option A

Q212

The order of an algorithm that finds whether a given boolean function of 'n' variables, produces a 1 is

A constant
B linear
C logarithmic
D exponential

Answer: Option D

Q213

The best sorting methods if number of swappings done, is the only measure of efficiency is

A Bubble sort
B Selection sort
C Insertion sort
D Quick sort

Answer: Option B

Q214

The maximum number of comparisons needed to sort 7 items using radix sort is (assume each item is a 4 digit decimal number)

A 280
B 40
C 47
D 38

Answer: Option A

Q215

As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be

A bubble sort
B insertion sort
C selection sort
D heap sort

Answer: Option B

Q216

Which of the following algorithms exhibits the unnatural behaviour that, minimum number of comparisons are needed if the list to be sorted is in the reverse order and maximum number of comparisons are needed if they are already in order?

A Heap sort
B Radix sort
C Binary insertion sort
D None of these

Answer: Option C

Q217

The sorting method which sorts a given set of items that is already in order or in reverse order with equal speed is

A Heap sort
B Quick sort
C Insertion sort
D Selection sort

Answer: Option B

Q218

Algorithm which solves the all-pair shortest path problem is

A Dijkstra's algorithm
B Floyd's algorithm
C Prim's algorithm
D Warshall's algorithm

Answer: Option B

Q219

Stack A has the entries a, b, c (with a on top). Stack B is empty. an entry propped out of stack A can be printed immediately or pushed to stack B. An entry popped out of the stack B can only be printed. IN this arrangement, which of the following permutations of a, b, c are not possible?

A b a c
B b c a
C c a b
D a b c

Answer: Option C

Q220

In the previous problem, if the stack A has 4 entries, then the number of possible permutations will be

A 24
B 12
C 21
D 14

Answer: Option D

📚 More from Computer Science & Engineering(CSE)

← All Topics 🎯 Practice ⏱️ Take Test 🔍 Search

Back to Computer Science & Engineering(CSE)

Analysis of Algorithms and Computational Complexity Questions and Answers

📚 More from Computer Science & Engineering(CSE)

Computer Science & Engineering(CSE)

Other Subjects

Analysis of Algorithms and Computational Complexity Questions and Answers

📚 More from Computer Science & Engineering(CSE)

Computer Science & Engineering(CSE)

Other Subjects

Report a Problem