Sanghvi Institute of Management & Science, Indore

SCHOOL OF ENGINEERING
LECTURE PLAN 1/2
Department: Computer Science Department Subject: CS/IT-404
CS/IT-404(Analysis & Design of Algorithm)
Faculty: Vidhya Samad
Scheme: Lectures: 3, Tutorial: 1, Practical:2 , MS:20, TW: 30 Theory:100 Practical:50

LECTURE PLAN: Session Jan-June2009

Lect. Expected Particulars of Lecture Date of

No. Date completion
Unit- I

1.
0

2.
0

3.
0

4.
0

5.
0

6.
0

7.
0

8.

Unit- II

9. Singly linked list

1

10. Implementation linked list using arrays

1

11. Implementation of linked list using dynamic memory allocation,

1 circular link list
12. Josphus problem
1

13. Polynomial manipulation using linked list

1

14. Representation of sparse matrices

 Sanghvi Institute of Management & Science, Indore
SCHOOL OF ENGINEERING
LECTURE PLAN 2/2
Department: Computer Science Department Subject: CS/IT-404
CS/IT-404(Analysis & Design of Algorithm)
Faculty: Vidhya Samad
Scheme: Lectures: 3, Tutorial: 1, Practical:2 , MS:20, TW: 30 Theory:100 Practical:50

15. Stacks - their concepts and implementation, multiple stacks

1

16. Conversion of infix to postfix notation using stack

1

17. Recursion, how recursion- works

2

18. Queues their concepts and implementation, deque

2

19. Primary queues, simulation

2

Unit-III

20. Trees, Binary tree - their representation and operations

2

21. Tree traversals

2

22. Threaded binary trees

2

23. Conversion of general trees to binary trees

2

24. Binary expression tree, applications of trees

2

25. Sequential searching

2

26. Binary search

2

27. Floating point arithmetic

2

28. Digital search, trees, hashing and collision - resolution techniques.

2

Unit-IV
29. Bubble sort
 Sanghvi Institute of Management & Science, Indore
SCHOOL OF ENGINEERING
LECTURE PLAN 3/2
Department: Computer Science Department Subject: CS/IT-404
CS/IT-404(Analysis & Design of Algorithm)
Faculty: Vidhya Samad
Scheme: Lectures: 3, Tutorial: 1, Practical:2 , MS:20, TW: 30 Theory:100 Practical:50

30. Selection sort

3

31. Inserted sort

3

32. Quicksort
3

33. Merge sort

3

34. Complexity of the algorithm

3

Unit- V

35. Graphs, terminology

4

36. Representation of graphs, reachability

4

37. Minimum path problem

4

38. Critical events, Graph traversals

4

39 Spanning trees
40 Application of graph

41 Revision –unit-1
42 Revision –unit-2
43 Revision –unit-3
44 Revision –unit-4
45 Revision –unit-5

TOTAL LECTURES: 45
 Sanghvi Institute of Management & Science, Indore
SCHOOL OF ENGINEERING
LECTURE PLAN 4/2
Department: Computer Science Department Subject: CS/IT-404
CS/IT-404(Analysis & Design of Algorithm)
Faculty: Vidhya Samad
Scheme: Lectures: 3, Tutorial: 1, Practical:2 , MS:20, TW: 30 Theory:100 Practical:50

[D] REFERENCE BOOKS

 Data structures using C: By Tannenballam

 Data structures: By Trembley Sorenson: TMH Delhi.

SUGGESTED BOOKS

 Data structures using C: By Rajiv Jindal

 Data structures & Program design :Kruse-Pearson,
 Discrete Structure & Algorithm Nitin Upadhyay. Shivani Publications. Gwalior