FIFTH SEMESTER ‘A’ and ‘B’ Sections Important questions
ADA subject
PART A
2 marks each
1. Define algorithm
2. Define pseudo code.
3. Define flowchart
4. Define basic operation.
5. On what basis the efficiency of algorithm depends. ( time
efficiency and space efficiency)
6. Define worst case.
7. Define best case.
8. Define average case.
9. Define Asymptotic notation.
10. List Asymptotic notations. ( Big O , Big theta and Big
omega).
11. Define recursive algorithm.
12. Define non-recursive algorithm.
13. Define Brute force method and give an example.
14. Define Exhaustive search and give an example.
15. Define Selection sort.
16. Define Bubble sort.
17. Define Sequential search.
18. Define graph ( collection of edges and vertices).
19. Define Travelling salesman problem.
20. Define Depth First Search ( DFS).
21. Define Breadth First Search( BFS).
22. Define Insertion sort.
23. Define Topological sorting.
24. Define Divide and Conquer method and give an example (
Binary search).
25. Define Binary search.
26. List Binary tree traversals.
( Pre-order , post-order and in-order)
27. Define Pre-order traversal.
28. Define post-order.
29. Define In-order
30. Define Binary tree.
31. Define greedy algorithms and give an example.
32. Define Spanning tree and Minimum spanning tree.
33. Define Kruskals algorithm. ( Selecting the egde with
minimum weight , next selectin the edge with minimum weight
and continuing the process and finally getting the mimimum
spanning tree in such a way that there is no cycle.
34. Define prim’s algorithm.
35. Define Decision tree.
36. Define P problem.
37. Define NP problem.
38. Define NP- Complete proble.
39. Define Numerical algorithms.
40. List Numerical algorithms.
Note : Write two sentences for above questions.
PART – B
5 marks each.
1. Write an algorithm to to find GDC of two numbers using
euclid’s algorithm.
2. Explain notion of algorithm with and example.
3. Write a note on graph with an example.
4. Explain adjacency matrix with an example.
5. Write a note on tree with an example.
6. Explain orders of growth with table.
7. Explain base efficiency classes.
8. Explain Brute force method with and example.
9. Explain exhaustive search with an example.
10 . Explain working of Selection sort with an example.
10. Explain working of Bubble sort with an example.
11. Write the algorithm for sequential( Linear search ) search
and explain it’s working with an example.
12. Explain Travelling sales-man problem with an example.
13. Explain Knapsack problem with an example.
14. Explain topological sorting with an example.
15. Write the algorithm of merge sort and explain.
16. Write a note on Binary search.
17. Write a note on Binary tree traversals and list properties
of Binary tree.
18. Write a note on Greedy algorithms.
PART – C
10 marks.
1. Explain fundamentals of Algorithmic problem solving with
neat flow chart.
2. Explain in detail Analysis framework in detail.
3. Explain in detail worst case , best case and average case in
detail.
4. Explain Asymptotic notations in detail ( Big O , big theta
and Big omega)
5. Explain in detail Mathematical Analysis of non- recursive
algorithms.
6. Explain in detail Mathematical Analysis of Recursive
algorithms.
7. Explain Knapsack problem with an example.
8. Explain DFS and BFS in detail with an example.
9. Explain Decrease and Conquer.
10. Explain Divide and conquer method with an example
11. Explain working of Quick sort with an example.
12. Explain Prim’s algorithm in detail with an example.
13. Explain Dijkstr’s algorithm in detail.
For part – C write sufficient information.