Syllabus
|
Course Code: BCA-305 Course Name: DATA STRUCTURES – I |
||
| MODULE NO / UNIT | COURSE SYLLABUS CONTENTS OF MODULE | NOTES |
|---|---|---|
| 1 | Data Structure Definition, Data Type vs. Data Structure, Classification of Data Structures, Data Structure Operations,
Applications of Data Structures; Algorithm Specifications: Performance Analysis and Measurement (Time and Space Analysis of Algorithms- Average, Best and Worst Case Analysis), Asymptotic Notations and their use in Algorithm Handling. |
|
| 2 | Arrays: Introduction, Linear Arrays, Representation of Linear Array In Memory, Two Dimensional and
Multidimensional Arrays, Sparse Matrix and its Representation, Operations on Array: Algorithm for Traversal,
Selection, Insertion, Deletion and its implementation. String Handling: Storage of Strings, Operations on Strings viz., Length, Concatenation, Substring, Insertion, Deletion, Replacement, Pattern Matching |
|
| 3 | Linked List: Introduction, Array vs. linked list, Representation of linked lists in Memory, Traversing a Linked List,
Insertion, Deletion, Searching into a Linked list, Type of Linked List. Stack: Array Representation of Stack, Linked List Representation of Stack, Algorithms for Push and Pop, Application of Stack: Polish Notation, Postfix Evaluation Algorithms, Infix to Postfix Conversion, Infix to Prefix Conversion, Recursion |
|
| 4 | Introduction to Queues: Simple Queue, Double Queue, Circular Queue, Priority Queue, Representation of Queues as
Linked List and Array, Applications of Queue. Algorithm on Insertion and Deletion in Simple Queue and Circular
Queue. Searching and Sorting Techniques, Sorting Techniques: Bubble sort, Merge sort, Selection sort, Quick sort, Insertion Sort. Searching Techniques: Sequential Searching, Binary Searching. |
|
