CS13002 Programming and Data Structures

Spring semester

Animations

Index
  1. Simple instructions
  2. Conditional branching
  3. 2-way conditional branching
  4. Nested conditional branching
  5. 3-way conditional branching
  6. Multi-way branching
  7. Multi-way branching with break
  8. Example of while loop
  9. Example of do loop
  10. Example of for loop
  11. Passing parameters to functions
  12. Passing arrays to functions
  13. Recursive computation of factorial
  14. Recursive computation of Fibonacci numbers
  15. 1-D arrays
  16. 2-D arrays
  17. Working with structures
  18. Linear search
  19. Binary search
  20. Bubble sort
  21. Insertion sort
  22. Selection sort
  23. Merge sort
  24. Quick sort (with additional storage)
  25. Quick sort (in-place)
  26. 1-D dynamic memory
  27. 2-D dynamic memory
  28. Implementation of ordered lists (static memory)
  29. Implementation of ordered lists (dynamic memory)
  30. Application of stacks (Postfix evaluation)
  31. Implementation of stacks (static memory)
  32. Implementation of stacks (dynamic memory)
  33. Application of queues (Round-robin scheduling)
  34. Implementation of queues (static memory)
  35. Implementation of queues (dynamic memory)

Download flash player plug-in


Course home