Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
P.R.M.I.T &R., Badnera Department of Information Technology Lecture Plan Sem:5th Section: B Subject: Digital Integrated Circuit Name of Subject Teacher: A. S. Mahalle Lecture No. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. Topics Covered Data structures basics Mathematical /algorithmic notations & functions Complexity of algorithms Subalgorithms. String processing, Storing strings, character data type String operations, Word Processing First pattern matching algorithm & example Second pattern matching algorithm & example Linear arrays and their representation in memory Traversing linear arrays Inserting & Deleting operations Bubble sort Linear search Binary search algorithms Multidimensional arrays Multidimensional arrays Pointer arrays Record structures and their memory representation Matrices and sprase matrices Linked lists and their representation in memory Traversing a linked list Searching a linked list Memory allocation & garbage collection Insertion deletion operations on linked lists Insertion deletion operations on linked lists Header linked lists Algorithm on header linked list Two- way linked lists. Two way linked list Algorithm on two way linked list Stacks and their array representation.,. Arithmetic expressions: Polish notation. Quick sort Recursion Tower of Hanoi problem. Implementation of recursive procedures by stacks Queues Deques. Priority queues. Trees, Binary trees & and their representation in memory Traversing binary trees Traversal algorithms using stacks Header nodes : threads Binary search trees searching, inserting and deleting in binary trees Heap and heapsort Path length & Hoffman's algorithm General trees, M-way search Trees. Graph theory Unit 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 6 49. 50. 51. 52. 53. 54. Sequential representations of graphs Warshalls’ algorithm, Linked representation Operations & traversing the graphs Posets & Topological sorting Selection Sort ,Insertion Sort Merging & Merge-sort 6 6 6 6 6 6 P.R.M.I.T &R., Badnera Department of Information Technology Lecture Plan Subject: Data Structures Name of Subject Teacher: A. S. Mahalle Lecture No. 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. Topics Covered Data structures basics Mathematical /algorithmic notations & functions Complexity of algorithms Subalgorithms. String processing, Storing strings, character data type String operations, Word Processing First pattern matching algorithm & example Second pattern matching algorithm & example Linear arrays and their representation in memory Traversing linear arrays Inserting & Deleting operations Bubble sort Linear search Binary search algorithms Multidimensional arrays Multidimensional arrays Pointer arrays Record structures and their memory representation Matrices and sprase matrices Linked lists and their representation in memory Traversing a linked list Searching a linked list Memory allocation & garbage collection Insertion deletion operations on linked lists Insertion deletion operations on linked lists Header linked lists Algorithm on header linked list . Two way linked list Algorithm on two way linked list Stacks and their array representation.,. Arithmetic expressions: Polish notation. Quick sort Recursion Tower of Hanoi problem. Implementation of recursive procedures by stacks Queues Deques. Priority queues. Trees, Binary trees & and their representation in memory Traversing binary trees Traversal algorithms using stacks Header nodes : threads Binary search trees searching, inserting and deleting in binary trees Heap and heapsort Path length & Hoffman's algorithm General trees, M-way search Trees. Graph theory Sem:4th Section: A Date 2/1/17 3/1/17 4/1/17 5/1/17 6/1/17 9/1/17 10/1/17 11/1/17 12/1/17 13/1/17 16/1/17 17/1/17 18/1/17 19/1/17 23/1/17 24/1/17 25/1/17 27/1/17 30/1/17 31/1/17 1/2/17 2/2/17 3/2/17 6/2/17 7/2/17 8/2/17 9/2/17 10/2/17 16/2/17 17/2/17 20/2/17 21/2/17 22/2/17 23/2/17 24/2/17 27/2/17 28/2/17 1/3/17 2/3/17 3/3/17 6/3/17 7/3/17 8/3/17 9/3/17 10/3/17 13/3/17 14/3/17 15/3/17 Unit 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 6 49. 50. 51. 52. 53. 54. Sequential representations of graphs Warshalls’ algorithm, Linked representation Operations & traversing the graphs Posets & Topological sorting Selection Sort ,Insertion Sort Merging & Merge-sort Subject Teacher 16/3/17 17/3/17 20/3/17 21/3/17 22/3/17 28/3/17 6 6 6 6 6 6 Head of Department P.R.M.I.T &R., Badnera Department of Information Technology Session Plan Sem:4th Section: A Subject: Data Structures Name of Subject Teacher: A. S. Mahalle Lecture No. 1. Unit No. Data structures basics 2. 3. 4. 5. 1 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. Topics Covered 2 18. 19. 20. Mathematical /algorithmic notations & functions Complexity of algorithms Subalgorithms. String processing, Storing strings, character data type String operations, Word Processing First pattern matching algorithm & example Second pattern matching algorithm & example Linear arrays and their representation in memory Traversing linear arrays Inserting & Deleting operations Bubble sort Linear search Binary search algorithms Multidimensional arrays Multidimensional arrays Pointer arrays Record structures and their memory representation Matrices and sprase matrices Linear arrays and their representation in memory 3 28. 29. Linked lists and their representation in memory Traversing a linked list Searching a linked list Memory allocation & garbage collection Insertion deletion operations on linked lists Insertion deletion operations on linked lists Header linked lists Algorithm on header linked list Two- way linked lists. Two way linked list Algorithm on Two Way Linked List 30. 31. 32. 33. 4 Stacks and their array representation.,. Arithmetic expressions: Polish notation. Quick sort Recursion 21. 22. 23. 24. 25. 26. 27. Description Introduction to Data Structures and Basic concepts of it. Floor. Ceiling, Mod functions in data structures. 34. 35. Tower of Hanoi problem. Implementation of recursive procedures by stacks Queues Deques. Priority queues. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 5 Trees, Binary trees & and their representation in memory Traversing binary trees Traversal algorithms using stacks Header nodes : threads Binary search trees searching, inserting and deleting in binary trees Heap and heapsort Path length & Hoffman's algorithm General trees, M-way search Trees. 6 Graph theory Sequential representations of graphs Warshalls’ algorithm, Linked representation Operations & traversing the graphs Posets & Topological sorting Selection Sort ,Insertion Sort Merging & Merge-sort 48. 49. 50. 51. 52. 53. 54. Subject Teacher Head of Department