Basic Info

Instructor: Dr. Weitian Tong     Assistant Professor at Department of Computer Science
Office: CIT 2305
Email: wtong@georgiasouthern.edu
Lecture time: N/A; Online Course, Entirely at a distance
Office hours: By appointment

Course Schedule (timely updated!)

Date	Topics	Useful Resources
Module 1:	Class 1: Attendance Verification Check the Syllabus on Folio Quickly explore the resources in the right column → Introduction: Video: Data Types vs. Abstract Data Types Video: Data Structure Definition & Advantages Video: Types of Data Structures Module 2: Java background (refresh your memory) Classes and Objects Interfaces Strings, Arrays Overloading, Overriding Video: Object Oriented Programming Video: Comparable Generics Video: Generic Programming Class 3: Analysis of Algorithms Video: Basics of Asymptotic Analysis: Part 1; Part 2; Part 3; Part 4; Part 5; Class 4: Analysis of Algorithms Video: Guidelines for Asymptotic Analysis: Part 1; Part 2; Video: Asymptotic Analysis Examples: Example 1; Example 2; Example 3; Class 5: Recursion Divide and Conquer Coding Quiz 1: Recursion	Visualizing data structures and algorithms: Visualgo Data Structure Visualizations Data Structures and Algorithms Visualizations Search for coding examples and hands-on practice: GeeksforGeeks LeetCode How to Code Without Plagiarizing Free online textbook: An Introduction to the Analysis of Algorithms Algorithms, 4th Edition Tutorialspoint YouTube Channels: Neso Academy: Data Structure Data Structures by Dr. Rob Edwards HackerRank: Data Structure and Algorithms Latex: Download Latex Learn LaTeX in 30 minutes Youtube: LaTex Tutorial for Beginners Full Course Asymptotic Analysis: More resources Asymptotic Analysis Asymptotic Notations Big-O-cheatsheet Video: Introduction to Asymptotic Analysis Fibonacci: a recursion example Fibonacci Coursera Video: Fibonacci I Coursera Video: Fibonacci II Coursera Video: Fibonacci II
H1 (Asymptotic Analysis and Recursion)
Module 2:	Class 1: Linear DS Array ArrayList Array vs ArrayList in Java      Video Class 2: Linear DS: Singly Linked List      Video Doubly Linked List      Video Coding Quiz 2: LinkedList Class 3: Linear DS: Stack      Video Queue      Video Coding Quiz 3: Stack Class 4: Maps and Hash Tables Hashing Separate Chaining; Open Addressing; Double Hashing Class 5: Trees General Tree Definitions and Terminology Binary Tree Tree Traversals (Inorder, Preorder and Postorder) Binary Tree Properties	Visualizations: ArrayList LinkedList Array-based stack, List-based stack Array-based queue, List-based queue Hash Table Hash Table: Linear Probing vs Quadratic Probing vs Double Probing vs Separate Chaining Tree: Binary Tree questions Tree traversal questions
H2 (Linear Data Structures and Hash Tables)
Module 3:	Class 1: PriorityQueue Heap Coding Quiz 4: Heap It is a bonus quiz! Class 2: Search Trees Binary Search Tree: Search and Insertion; Delete Class 3: Coding Quiz 5: Search Tree Class 4: AVL tree: Insertion , Delete Coding Quiz 6: AVL Tree Class 5: Red-Black Tree Coding Quiz 7 Red-Black Tree It is a bonus quiz!	Visualizations: Heap Heap on Visualgo Binary search tree and AVL tree on Visualgo Binary search tree AVL Tree Splay Tree Red-Black Tree
H3 (Trees)
Module 4:	Class 1: Comparison Sorts Sorting Terminology Selection Sort, Bubble Sort, Insertion Sort Coding Quiz 8: Insertion Sort Class 2: Comparison Sorts Merge Sort HeapSort Coding Quiz 9: Merge Sort Class 3: Comparison Sorts QuickSort Lower bound for comparison sorts Coding Quiz 10: Quick Sort Class 4: Linear Sorts Sorting without comparison of elements Bucket Sort Counting Sort Radix Sort Coding Quiz 11: Counting Sort Class 5: Graph and graph representations Graph Introduction Graph and its representations	Visualization: Sorting algorithms on Visualgo Comparison Sorting Algorithms Bucket Sort Counting Sort Radix Sort Graph representations on Visualgo
H4 (Sorting)
Module 5:	Class 1: Graph Algorithms Depth First Search Video: Depth First Search (Algorithm, Examples, and Code) Coding Quiz 12: DFS Class 2: Graph Algorithms Breadth First Search Coding Quiz 13: BFS Class 3: Graph Algorithms Shortest Path: Dijkstra's algorithm Minimum Spanning Tree Prim's algorithm, Kruskal's algorithm Coding Quiz 14: Dijkstra's algorithm	Visualization: DFS and BFS on Visualgo Minimum Spanning Tree on Visualgo Shortest on Visualgo Depth First Search Breadth First Search Dijkstra's algorithm Prim's algorithm Kruskal's algorithm
H5 (Graphs)