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

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:

Q101

For secondary key processing which of the following file organisations is preferred ?

A Indexed sequential file organisation
B Two-way linked list
C Inverted file organisation
D Sequential file organisation

Answer: Option D

Q102

In a circularly linked list organization, insertion of a record involves the modification of

A no pointer
B 1 pointer
C 2 pointers
D 3 pointers

Answer: Option C

Q103

Stack is useful for implementing

A radix
B breadth first search
C recursion
D none of these

Answer: Option C

Q104

A machine needs a minimum of 100 sec to sort 1000 names by quick sort. the minimum time needed to sort 100 names will be approximately

A 50.2 sec
B 6.7 sec
C 72.7sec
D 11.2 sec

Answer: Option B

Q105

A machine took 200 sec to sort 200 names, using bubble sort. In 800 sec, it can approximately sort

A 400 names
B 800 names
C 750 names
D 800 names

Answer: Option A

Q106

Which of the following is useful in traversing a given graph by breadth first search ?

A stack
B set
C list
D queue

Answer: Option D

Q107

Which of the following is useful in implementing quick sort

A stack
B set
C list
D queue

Answer: Option A

Q108

Which of the following relates of machine language ?

A difficult to learn
B machine-dependent
C instructions and data are represented by binary digits
D all of these

Answer: Option D

Q109

Queue can be used to implement

A radix sort
B quick sort
C recursion
D depth first search

Answer: Option A

Q110

Which of the following allows users to specify what the computer is supposed to do rather than how the computer is supposed to do it ?

A nonprocedural language
B FORTRAN
C BASIC
D COBOL

Answer: Option A

📚 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