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

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:

Q131

What is the name of the computer programming language which is credited with 'no threshold and no ceiling' ?

A LOGO
B BASIC
C PASCAL
D ADA

Answer: Option A

Q132

The Computer language LOGO is based on another powerful list processing language for Robotics and Artificial Intelligence. Can you tell the name of that language ?

A GSP
B LISP
C PASCAL
D PROLOG

Answer: Option D

Q133

Which of the following is one of the widely used algol based simulation language ?

A FORTRAN
B GASPIV
C SIMSCRIPT
D GPSS

Answer: Option C

Q134

Which decision procedure has at least doubly-exponential time complexity ?

A LInear programming
B Travelling Salesmen Problem
C Presburger Arithmetic
D Hamiltonian Circuit Problem

Answer: Option C

Q135

Which sort will operate in quadratic time relative to the number of elements in the array (on the average) ?

A quick sort
B merge sort
C heap sort
D bubble sort

Answer: Option D

Q136

What is the weight of the minimal spanning tree for the graph in problem 234 ?

A 17
B 18
C 20
D 21

Answer: Option D

Q137

After constructing a "sorted" binary insertion tree, to produce a sorted array to numbers (for printing purposes), what must be done ?

A pre-order traversal
B inorder traversal
C post-order traversal
D top down traversal

Answer: Option B

Q138

Which of the following sorting algorithms yield approximately the same worst-case and average-case running time behaviour in O (n log n) ?

A Bubble sort and Selection sort
B Heap sort and Merge sort
C Quicksort and Radix sort
D Tree sort and Median-of-3 Quick sort

Answer: Option B

Q139

Super-Jarvis said "I can write a super merge sort which splits an array into 4 components (unlike regular merge sort which splits in two) and then recursively sort the 4 subarrays and thend merges them. Though similar to merge sort, it is faster and called SJ4." What is true ?

A SJ4 cannot possibly work, a four-way split and then later merge is 0 reposdterous
B SJ4 Works and SJ4 operates in O(Merge-Sort)
C SJ4 Works and SJ4 is greater than (slower than) O(Merge-Sort)
D SJ4 worksd and SJ4 is less than (faster than) O(Merge-sort)

Answer: Option B

Q140

A complete binary tree of level 5 has how many nodes ?

A 15
B 25
C 63
D 33

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