IT/Comps ADA IMP Topics

Brainheaters IMPs of ADA- Sem5

1. Principle of Optimality

2. NP-Complete and NP-Hard problems. Define P, NP, NP-complete and NP-hard problems

3. Naive string matching algorithm

4. An algorithm. Differ from flowchart

5. Dynamic programming and divide-and conquer method

5. Greedy and dynamic programming

6. State space tree diagram for 4 Queen problems

7. Asymptotic notation. Solve Numerical also

8. Graph, complete graph and connected graph

9. BFS and DFS

10. Travelling salesman problem

11. Numerical on Rabin-Karp matcher

12. Advantages of dynamic programming method over divide-&- conquer method

13.Asymptotic Notations

14.Knapsack Problem

The topics sent above are the IMPORTANT topics and not the IMPORTANT questions.

For questions, you will have to check the question bank in the StudyRoom.

To get your smart plan activated:

Also, you will get study materials for FREE for your Semester 6,7&8 if you get your smart plan today.

GTU Brainheaters