Top

  1. Stack Implementation in C using a Linked List
    2. Design and implementation of a stack in C
  2. Binary Search Tree
    3. Introduction to the binary search tree and its operations
  3. Stack and Queue Abstract Data Types (ADT)
    4. Review of stacks and queues and an analysis of their implementations.
  4. Priority Queues using Heaps
    5. Introduction to the heap abstract data type and its use in implementing priority queues
  5. Mathematical Induction (Proof by Induction)
    6. Introduction to a method of proving mathematical statements (induction)
  6. Binary Trees
    7. Introduction to binary trees
  7. Insertion Sort Algorithm and Time Complexity
    8. Analysis of a sorting algorithm (insertion sort)
  8. Binary Tree Traversal
    9. Implementation of binary tree traversal algorithms (preorder, postorder, inorder) recursively and non-recursively in Java
  9. Recurrences
    10. Study of recurrences and their use in determining the time complexity of recursive algorithms
  10. Permutations of a String
    11. Write a method that prints out all the permutations of the characters in a string.