ADITYA COLLEGE OF ENGINEERING

DEPARTMENT OF CSE – IOT

LESSION PLAN

PROGRAM: BTECH in CSE-AIML CLASS: III

COURSE NAME: DAA FACULTY NAME: R.RAJASEKHAR
COURSE CODE: ACADEMIC YEAR & SEM: 2023-24 & II- Semester
L.No Topic/ Sub Topic Reference Teaching
method
1. UNIT-1:Introduction: algorithm definitions T1(3-4) C&T

2. Algorithm specifications T1(5-7) C&T

3. Performance analysis T1(8-9) C&T

4. Performance measurement T1(10-12) S/P

5. Asymptotic notations T1(15) S/P

6. Randomized algorithms T1(16-20) S/P

7. UNIT 2:Divide and conquer T1(33-45) S/P

8. General method T1(46-50) S/P

9. Defective chessboard T1(51-64) S/P

10. Binary search T166-79) S/P

11. Finding the maximum and minimum T1(90-106) S/P

12. Merge sort T2(107-113) S/P

13. Quick sort T1(114-118) C&T

14. The greedy method: general method T1(119-124) C&T

15. Knapsack problem T1(125-128) C&T

16. Minimum cost spanning trees T1(129) C&T

17. Optimal merge patterns T1(135) C&T

18. Single source shortest paths T2(136-137) C&T

19. UNIT 3: Dynamic programming T1(138-155) C&T

20. T1(156-160) S/P

21. Dynamic programming: general method T1(161-163) S/P

22. Multistage graphs T1(164-173) S/P

23. All pairs shortest paths T1(174) C&T

24. Optimal binary search trees T1(190-204) C&T

25. 0/1 knapsack T1(205) C&T

26. The travelling sales person problem T1(206-212) C&T

27. UNIT IV: Back tracking T1(213-217) C&T

28. The general method T1(218) C&T

29. The 8 queens problem T1(231-232) C&T

30. Sum of subsets T1(233) C&T

31. Graph colouring T1(244) C&T

32. Hamiltonian cycles T21(255) C&T

33. Knapsack problem T1(256) C&T

34. The 8 queens problem T1() S&P

35. 0/1 knapsack T1(258) C&T

36.
The travelling sales person problem T1(352) C&T

37.
UNIT 5:NP hard T1(356-364) C&T

38. NP Completeness T1(387-390) C&T

39. Basic concepts T1(504) C&T

40. Non deterministic algorithms T1(430) C&T

41. NP HARD T1(431-433) C&T

42. NP COMPLETNESS T1(434) C&T

Teaching Methods: C&T:-Chalk & Talk; S/P:-Slides/PPT; Videos; SEM: Seminar; DEMO;
CHART; ET/GL: Expert Talk/Guest Lecture; QUIZ; GD:-Group discussion; RTCS: Real time
case studies; OL:-Online lecture/Google class room.

TEXT BOOKS:

1. Ellis horwitz,satraj sahani ,sanghuthevaran rajasekaran.”fundamentals of computer algorithms

“,2nd edition,university press.
2. Introduction to algorithms .Thomas H .coremen,PHI learning.
3.Harsh Bhasin “algorithms design and analysis”oxford university press.

Faculty Signature