Introduction to Computer Science

  1. Intro to Algorithms
  2. Addition Algorithm
    3. An introduction to algorithms using a simple example (addition)
  3. Binary Number Representation
    4. Introduction to binary numbers and the binary system
  4. Decimal to Binary Conversion
    5. Technique to convert a decimal number to its binary representation
  5. Memory Addressing and Arrays
  6. Array Expansion Time Complexity
    7. Analysis of the operation that expands an array to accommodate more elements
  7. Insertion Sort Algorithm and Time Complexity
    8. Analysis of a sorting algorithm (insertion sort)
  8. The List Abstract Data Type (ADT)
    9. Analysis of the different implementation of the list ADT and the time complexities associated with its operations.
  9. Stack and Queue Abstract Data Types (ADT)
    10. Review of stacks and queues and an analysis of their implementations.
  10. Mathematical Induction (Proof by Induction)
    11. Introduction to a method of proving mathematical statements (induction)
  11. Recursion
    12. The concept of recursion in computer science
  12. Recursive Decimal to Binary Conversion
    13. Analysis of a recursive decimal to binary conversion algorithm
  13. Recursive Fibonacci & Tower of Hanoi
  14. Recursive Power Algorithm
    15. Study of a recursive algorithm to compute the power of a number
  15. Binary Search
    16. Study of Binary Search, its algorithm and recursive/iterative implementations
  16. Mergesort
  17. Big O and Big Omega
  18. Recurrences
    19. Study of recurrences and their use in determining the time complexity of recursive algorithms
  19. The Tree Abstract Data Type (ADT)
    20. Introduction to the tree abstract data type
  20. Binary Trees
    21. Introduction to binary trees
  21. Binary Search Tree
    22. Introduction to the binary search tree and its operations
  22. Priority Queues using Heaps
    23. Introduction to the heap abstract data type and its use in implementing priority queues
  23. Heaps and Heapsort
  24. Maps and Hashes
  25. Graphs and Graph Traversal