Data Structure Using C – Syllabus

Data Structure Using C – Syllabus

• Introduction to Data Structures:

  • Lesson 1. Definition and classification.
    01 Hrs.
  • Lesson 2. Abstract Data Types (ADT).
    01 Hrs.
  • Lesson 3. Static and dynamic memory allocation.
    01 Hrs.

• Arrays and Linked Lists:

  • Lesson 1. Arrays: definition, representation, operations.
    02 Hrs.
  • Lesson 2. Single, Double inked lists: creation, traversal, insertion, deletion.
    06 Hrs.
  • Lesson 3. Circular linked lists.
    02 Hrs.

• Stacks and Queues:

  • Lesson 1. Stack: definition, operations, applications (infix to postfix conversion, postfix expression evaluation).
    04 Hrs.
  • Lesson 2. Queue: definition, operations, types (simple queue, circular queue, priority queue).
    04 Hrs.

• Searching and Sorting:

  • Lesson 1. Searching: linear search, binary search.
    02 Hrs.
  • Lesson 2. Sorting: bubble sort, insertion sort, selection sort, quick sort, merge sort.
    06 Hrs.

• Trees:

  • Lesson 1. Tree terminology.
    02 Hrs.
  • Lesson 2. Binary trees, binary search trees (BST): creation, traversal (in-order, pre-order, post-order).
    06 Hrs.
  • Lesson 3. AVL trees, B-trees & B+ Tree.
    04 Hrs.

• Graphs:

  • Lesson 1. Graph terminology, representation (adjacency matrix, adjacency list).
    02 Hrs.
  • Lesson 2. Traversal techniques: BFS (Breadth First Search), DFS (Depth First Search).
    02 Hrs.
  • Lesson 3. Applications of graphs.
    02 Hrs.

• Hashing and File Structures:

  • Lesson 1. Hashing concepts, hash functions.
    02 Hrs.
  • Lesson 2. Collision resolution techniques: chaining, open addressing.
    02 Hrs.
  • Lesson 3. Basics of file structures.
    02 Hrs.