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

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:

Q41

Which of the following abstract data types can be used to represent a many to many relation ?

A tree,, only
B plex, only
C graph, only
D both (b) and (c)

Answer: Option D

Q42

Trie indexing is

A efficient in dealing with strings of variable length
B the number of disk accesses can't exceed the length of the particular string that is searched.
C that it can handle insertions and deletions,
D all of these

Answer: Option D

Q43

The average search time of hashing with linear probing will be less if the load factor

A is far less than one
B equals one
C is far greater than one
D none of these

Answer: Option A

Q44

Which of the following remarks about Trie index is false ?

A It is an m-ary tree.
B It is a search tree should terminate in leaf nodes
C Unsucessful scarches should terminate in leaf nodes
D Unsucessful scarches may terminate at any level of the tree structure.

Answer: Option B

Q45

Number of vertices of odd degree in a graph is

A allways even
B always odd
C either even or odd
D always zero

Answer: Option A

Q46

A graph in which all nodes are of equal degree is known as

A multigraph
B non regular graph
C regular graph
D complete graph

Answer: Option C

Q47

A vertex of degree one is called as

A pendant
B isolated vertex
C null vertex
D coloured vertex

Answer: Option A

Q48

Two isomorphic graphs must have

A the same number of verticles
B the same number of edges
C an equal number of vertices
D all of these

Answer: Option D

Q49

The terminal vertices of a path are of degree

A one
B two
C zero
D more than four

Answer: Option A

Q50

If there exists at least one path between every pair of vertices in a graph, he graph is known as

A complete graph
B disconnected graph
C connected graph
D Euler graph

Answer: Option C

📚 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