CS13002 Programming and Data Structures | Spring semester |
Animations
Index
- Simple instructions
- Conditional branching
- 2-way conditional branching
- Nested conditional branching
- 3-way conditional branching
- Multi-way branching
- Multi-way branching with break
- Example of while loop
- Example of do loop
- Example of for loop
- Passing parameters to functions
- Passing arrays to functions
- Recursive computation of factorial
- Recursive computation of Fibonacci numbers
- 1-D arrays
- 2-D arrays
- Working with structures
- Linear search
- Binary search
- Bubble sort
- Insertion sort
- Selection sort
- Merge sort
- Quick sort (with additional storage)
- Quick sort (in-place)
- 1-D dynamic memory
- 2-D dynamic memory
- Implementation of ordered lists (static memory)
- Implementation of ordered lists (dynamic memory)
- Application of stacks (Postfix evaluation)
- Implementation of stacks (static memory)
- Implementation of stacks (dynamic memory)
- Application of queues (Round-robin scheduling)
- Implementation of queues (static memory)
- Implementation of queues (dynamic memory)