Scribd
Upload
52 views2 pages

Data Structure M Caii

This document outlines the lecture plan for a course on data and file structures using C. It covers topics such as arrays, linked lists, stacks, queues, trees, sorting, searching, hashing, and file organization. The evaluation scheme includes assignments, a mid-semester exam, class participation and attendance.

Uploaded by

Kapil Chandak
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
52 views2 pages

Data Structure M Caii

This document outlines the lecture plan for a course on data and file structures using C. It covers topics such as arrays, linked lists, stacks, queues, trees, sorting, searching, hashing, and file organization. The evaluation scheme includes assignments, a mid-semester exam, class participation and attendance.

Uploaded by

Kapil Chandak
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

LECTURE PLAN Data & File Structure using C (MCA 2.

2)
1. Basic Terminology, Elementary Data Organization, Data Structure Operations. 2. Array Definition, Representation and Analysis, Single and Multidimensional Arrays, Address calculation. 3. Application of arrays, Character String in C, Character string operation. 4. Singly Linked List 5. 6. 7. 8. 9. 10. Two-way Header List. Traversing & Searching of Linked List [Overflow, underflow] Insertion and deletion to or from linked list. Algorithms of Insertion in doubly linked list Deletion in doubly linked list, Garbage collection and compaction. Ordered List, Sparse Matrices and Vectors

11. Stacks Array Representation and Linked Representation of stack. 12. Operations associated with stacks, and application of
stack: Conversion of Infix to PREFIX and POSTFIX Expressions. 13. Evaluation of postfix expression using stack.

14. Recursion Concept & working in C, Principles Simulating recursion


15. 16. 17. 18. 19. Backtracking, recursive algorithms, tail recursion. Queues Representation and Implementation of Array & Linked. Operations on queue [Create, Add, Delete, Full & Empty] Circular queue de-queue & Priority Queue. Algorithm Complexity and Time-Space trade off.

20. Introduction to Trees and its concept, Binary Trees, Its Representation. 21. Complete Binary Tree, Extended Binary Trees.
22. Array Representation of Binary Trees. 23. Linked Representation of Binary Trees. 24. Traversing Binary Tree.

25. Threaded Binary Trees, Traversing Threaded Binary trees.


26. and 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. Huffman Algorithm, Searching [Sequential, Binary, comparison analysis]. Hashing Hash Table & Functions. Collision Resolution Strategies Hash Table Implementation. Sorting Insertion Sort Bubble Sort. Quick Sort. Two way Merge sort Heap sort. Practical consideration on sorting Binary Search Tree (BST), Insertion in BST Deletion in BST

38. Complexity of Search Algorithm, Path Length. 39. AVL Trees, B-Trees.
40. Graphs Concept, Graphs & Multi-Graphs, 41. Directed Graphs 42. Sequential representations of Graphs

43. Adjacency Matrices, Traversal on Trees


44. Connected Component and Spanning Trees, Minimum Cost Spanning Trees. 45. File Structures Physical storage Media File Organization, Organization of records into Blocks. 46. Sequential Files, indexing and Hashing, Primary indices, Secondary indices. 47. B+ Tree index Files, B Tree index Files 48. Indexing and Hashing Comparisons.

EVALUATION SCHEME
MCA 202 Evaluation Criteria Tutorial Assignment Mid Semester Exam Nos. 5 6 2 Weight age 5 5 30 Subject - Data & File Structure using C Nature Written/Oral/Presentations Written referring books Written Conducted by Exam cell

Class Participation Attendance

5 5

Based on regular class assessment Based on Class Attendance

You might also like