Lecture 10: Data Structures and Algorithms

Interactive: Linear Search Visualization

Interactive: Stack Operations

Interactive: Queue Operations (Linked List)

Interactive: Bubble Sort Visualization

Mini‑Quiz Q1

Q1. What is the time complexity of linear search in the worst case?

O(1)
O(n)
O(log n)

Mini‑Quiz Q2

Q2. In a stack, which element is removed first?

Last element added (LIFO)
First element added (FIFO)
Middle element

Summary

Data structures organize data using arrays, pointers, and structs from previous modules.
Algorithms like search and sort use control flow and loops.
Stacks (LIFO) and queues (FIFO) are fundamental data structures.
Understanding time complexity helps evaluate algorithm efficiency.