Scribd
Upload
18 views1 page

Ada Module 1 Question Bank

The document is a question bank for an ADA module, covering various topics related to algorithms, including definitions, complexities, and analysis of different algorithms. It includes questions on time and space complexity, asymptotic efficiency classes, recursive algorithms, and fundamental data structures. Additionally, it requests the design and analysis of specific algorithms such as Fibonacci, matrix multiplication, and Euclid's algorithm for finding the GCD.

Uploaded by

Vansh negi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
18 views1 page

Ada Module 1 Question Bank

The document is a question bank for an ADA module, covering various topics related to algorithms, including definitions, complexities, and analysis of different algorithms. It includes questions on time and space complexity, asymptotic efficiency classes, recursive algorithms, and fundamental data structures. Additionally, it requests the design and analysis of specific algorithms such as Fibonacci, matrix multiplication, and Euclid's algorithm for finding the GCD.

Uploaded by

Vansh negi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

ADA MODULE 1 QUESTION BANK

Q1. Give the definition of an Algorithm and also give the characteristics of Algorithm.

Q2. Define space complexity and time complexity of an algorithm and also compute the time
complexity of Fibonacci number’s algorithm.

Q3. What are the various Asymptotic efficiency classes? Explain big-o , big-theta and big-Omega
notation with an examples.
Q4. Give Mathematic Analysis of non-recursive Matrix Multiplication algorithm.
Q5. Give general plan for analyzing time efficiency of recursive algorithms. Also Analyse the Tower of
Hanoi recursive algorithm.
Q6. Mention the problem types considered for design and analysis. Explain any two.
Q7. Write an algorithm to find the uniqueness of elements in an array and give the mathematical
analysis of non-recursive algorithm with steps ?
Q8. Explain the following problem types:_
(a) Sorting (b) Sequencing (c) Combinatorial problems

Q9. Discuss fundamental data structures.


Q10. Explain with a steps how count variable is introduced in the program to find the number of
steps required by a program to solve the problem.
Q11.Explain the notion of the algorithm. Design and Analyse the algorithm of gcd of two numbers
using Euclid’s algorithm.

REFER ALL THE ALGORITHMS


DISCUSSED IN CLASS.

You might also like