ADA ASSIGNMENT QUESTIONS
2MARKS
1. Define Order Of Growth.
2. Write the difference between Algorithm and Pseudocode.
3. Write any 3 Characteristics of Algorithm.
4. Write an algorithm to Compute GCD of two numbers.
5. Write in Increasing Order given functions
2n, n log n, n3, n2, log n, n
6. What is Best-Case Efficiency?
7. Define Recursive Algorithm.
8. Let f(n)=100n+ 6. Express f(n) Using Big-oh Notation.
9. What are the various functions that affect the execution time?
10. Mention the advantages of Selection Sort.
11. Define Time and Space Complexity of an algorithm.
[Link] is the use of Asymptotic Notations?
[Link] Brute force approach.
[Link] any two advantages of Brute force method.
15. Define Brute force method.
[Link] is Decrease and Conquer Method?
17. Define Travelling Salesman Problem (TSP)
18. Write Advantages and Disadvantages of Bubble Sort.
19. What is Greedy Algorithm
20. Write General Strategy of Divide and Conquer.
21. Define Binary Tree and Complete Binary Tree.
22. What is NP-Class?
23. Define Greedy Method.
24. What is P -Class?
25. What is Decision Trees.?
26. What is Single Source Shortest Path Problem?
6 Marks:
1. Explain the fundamentals of algorithmic problem solving.
2. Define Algorithm Explain its characteristics.
3. Explain Time and Space Complexity of an algorithm with an example.
4. Explain general plan for analyzing non-recursive algorithm.
5. Explain asymptotic notations with examples.
6. Explain Big-O, Big-Omegha and Big-Theta Notations.
7. Explain Travelling Salesman Problem with an example.
8. Explain Knapsack problem with an example.
9. Solve the following graph using TSP.
3
A B
9
6 4
C 8 D
10. Write Advantages and Disadvantages of Divide and Conquer technique.
11. Write a C Program to find minimum and maximum value in an array using
divide and conquer.
12. Explain Binary Search Algorithm.
13. Explain Merge Sort algorithm with an example and Space and Time
Complexity.
14. Topological Sort the following Graph.
A D
F B C E
G H
15. Write a C Program to implement Prim’s algorithm to generate Minimum
Spanning Tree.
16. Find MST using Kruskal’s Algorithm.
16 14
2 3
1
18
8 4 8 28
4
0 22 8
16 14 12 20
7
6 5
2 4
17. Explain: P-Problems, NP-Problems and NP-Complete Problem.
8 Marks:
1. Define an Algorithm. What are the Criteria that an algorithm must satisfy?
2. Explain Worst-Case, Best-Case and Average –Case efficiency with an
example.
3. Define Tree. Traverse the Following tree in
i. In-Order ii. Pre-Order iii. Post-Order
B C
D E F
G H I
[Link] the differences between BFS and DFS.
5. Explain Asymptotic Notations in detail.
6. Discuss the general plan to analyze the efficiency of recursive algorithm.
7. Obtain the shortest distance and shortest path from node 5 to node 1 in the
following graph.
8. Write the algorithm for the following.
i. Pre-Order Tree Traversals
ii. Post-Order Tree Traversals
iii. In-Order Tree Traversals
9. Find the Shortest path from node 1 to all other nodes using Dijkstra’s
Algorithm.
