Topic Wise Lesson Plane

🔹 Data

Raw facts or values (numbers, text, symbols) that can be processed.
Example: 10, "Alice", A

🔹 Data Structure

A way of organizing and storing data so it can be accessed and modified efficiently.
Examples: Array, Stack, Queue, Tree

🔹 Abstract Data Type (ADT)

A logical description of a data structure that defines:

• What operations can be done

• Not how they are implemented
  Example: Stack ADT (push, pop) regardless of array or linked list implementation

🔹 Array

A collection of elements of the same type stored in contiguous memory locations.
Accessed using an index.

🔹 Linked List

A collection of nodes where each node contains:

• Data

• A reference (link) to the next node

🔹 Stack

A linear data structure that follows LIFO
Last In, First Out
Operations: push, pop, peek

🔹 Queue

A linear data structure that follows FIFO
First In, First Out
Operations: enqueue, dequeue

🔹 Tree

A non-linear data structure with a hierarchical relationship.
Terms: root, parent, child, leaf, subtree

🔹 Graph

A non-linear data structure made of:

• Vertices (nodes)

• Edges (connections)

🔹 Node

A basic unit of a data structure that stores:

• Data

• Link(s) to other nodes

🔹 Pointer / Reference

A variable that stores the address of another variable or node.

🔹 Traversal

The process of visiting each element in a data structure.
Examples:

• Array traversal

• Tree traversal (Inorder, Preorder, Postorder)

🔹 Searching

Finding an element in a data structure.
Examples: Linear Search, Binary Search

🔹 Sorting

Arranging data in a specific order (ascending or descending).
Examples: Bubble Sort, Merge Sort, Quick Sort