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

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:

Q91

C programming language by itself provides

A input facility
B output facility
C both input and output facilities
D no input and output facilities

Answer: Option D

Q92

Which of the following are not provided in C ?

A tests and loops
B grouping and subprograms
C synchronization, coroutines, and parallel operations
D all of these

Answer: Option C

Q93

A connected graph is the one which

A cannot be partitioned without removing an edge
B contains at least three loops
C does not contain a cycle
D is not simple

Answer: Option A

Q94

In which kind of storage structure for strings, one can easily insert, delete, concatenate, and rearrange substrings?

A fixed length storage structure
B variable length storage with fixed maximum
C linked list storage
D array type storage

Answer: Option C

Q95

Which of the following is not a characteristic of COBOL ?

A It is very standardized language
B It is very efficient in terms of coding and execution
C It has limited facilities for mathematical notation
D It is very readable language

Answer: Option B

Q96

Which of the following is an example of a problem oriented language ?

A BASIC
B PL/1
C FORTRAN
D None of these

Answer: Option D

Q97

In the evaluation of a computer language, all of the following characteristics should be considered except

A application-oriented features
B efficiency
C software development aids
D hardware maintenance costs

Answer: Option D

Q98

A factor in the selection of a source language is

A programmer skill
B language availability
C program compatibility with other software
D all of these

Answer: Option D

Q99

A computer-generated output that let programmers following the execution of their programs line by line is a:

A core dump
B tracing routine
C detailing listing
D source listing

Answer: Option B

Q100

The number of binary trees with 3 nodes which when traversed in post-order gives the sequence A, B, C is

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