• Lecture 2: C++ Basics, I/O, Arrays, Files

    CPSC-350_Lecture02_GuidedNotes.pdf

  • Lecture 3: Introduction to Classes in C++

    CPSC-350_Lecture03_GuidedNotes.pdf

  • Lecture 4: Algorithm Analysis 1

    CPSC-350_Lecture04_GuidedNotes.pdf

  • Lecture 5: Algorithm Analysis 2 & Binary Search vs. Linear Search

    CPSC-350_Lecture05_GuidedNotes.pdf

  • Lecture 6: Stacks

    CPSC-350_Lecture06_GuidedNotes.pdf

  • Lecture 7: Templated Classes

    CPSC-350_Lecture07_GuidedNotes.pdf

  • Lecture 8: Queues

    CPSC-350_Lecture08_GuidedNotes.pdf

  • Lecture 9: Linked Lists

    Lecture9_Participation_LinkedList_Algorithms.pdf

    Answers:

    • addFront(T data)
    • addBack(T data)
    • add(int pos, T data)
    • removeFront()
    • removeBack()
    • remove(int pos)
  • Lecture 11: Priority Queues

    CPSC-350_Lecture11_GuidedNotes.pdf

  • Lecture 14: Trees

    CPSC-350_Lecture14_GuidedNotes.pdf

  • Lecture 19: Self-Balancing Trees

    CPSC-350_Lecture19_GuidedNotes.pdf

  • Lecture 20: Heaps

    CPSC-350_Lecture20_GuidedNotes.pdf

  • Lecture 21: Hashing

    CPSC-350_Lecture21_GuidedNotes.pdf

  • Lecture 25: Graphs, BFS & DFS