Short Notes on Data Structures and Algorithms Using C
Unit I: Linear Data Structures - Static
- Introduction to Algorithms: Characteristics (Precise, Finite, Input, Output, Effective), Types (Sorting, Search, Graph,
Dynamic Programming), Applications (Software Development, Data Analysis, AI), Analysis (Time and Space
Complexity).
- Arrays: Single Dimension, Two-Dimension, Multi-Dimension, Memory Representation, Address Calculation.
- Searching and Sorting:
* Linear Search: O(N) complexity, simple but inefficient for large datasets.
* Binary Search: O(log N) complexity, efficient but requires sorted array.
* Sorting Algorithms: Selection Sort, Bubble Sort, Insertion Sort, Merge Sort, each with distinct time complexities.
- Hashing: Hash Table, Hash Functions, Collision Resolution Techniques.
Unit II: Dynamic Memory Allocation
- Linked Lists:
* Types: Singly Linked List, Doubly Linked List, Circular Linked List.
* Operations: Creation, Insertion, Deletion, Searching, Sorting, Reversing, Merging.
Unit III: Abstract Data Types
- Stacks:
* Implementation: Static and Dynamic.
* Operations: Push, Pop, Peek.
* Applications: Expression Evaluation, Conversion between Notations.
- Queues:
* Implementation: Static and Dynamic.
* Types: Linear Queue, Circular Queue, Doubly Ended Queue, Priority Queue.
Unit IV: Non-Linear Data Structures
- Graphs:
* Notations & Terminologies: Nodes, Edges, Paths.
* Representation: Adjacency Matrix, Incidence Matrix, Linked Representation.
- Trees:
* Types: Binary Trees, AVL Trees, Heap Trees, B Trees.
* Traversals: In-order, Pre-order, Post-order.
* Binary Search Tree: Basic Operations, Advantages.
