CS 3353 – Spring 2022

Important Docs

• Syllabus
• Join #22s-cs-3353 channel on Fontenot’s Classes Slack.  (Link to join the Slack org is on Canvas).
• Take Home Exam 2
• Exam 3 will be in class on May 3 (follows a Friday Schedule).

Slide Decks

• Intro Material
• Algorithms – ch 01
• Analysis – 01
• Analysis and Recurrence Relations
  • Watch the following videos to understand more about these topics:
    • Recurrence Relations 3 – Binary Search
    • Recurrence Relations 7 – Merge Sort Split in Thirds
    • Recurrence Relations 9 – Similar Problems & the Master Theorem
    • Recurrence Relations 10 – Rules of Thumb
• Sorting
• Introduction to Graphs
• Topological Sorting
• Shortest Path – Dijkstra’s Algorithm
• Minimum Spanning Trees
• Introduction to Dynamic Programming

Projects

• PA 01 – Art is fun!
  • Handout
  • Github Classroom Assignment Link
  • See Extra Helpful Info section below for info on Actions, Feature-branch workflow, and cmake.
• PA 02 – Sorting
  • Handout
  • Github Classroom Assignment Link
• PA 03 – Community Detection
  • Handout
  • How to Write a Medium Article
  • SMU CS Medium Pub
  • Github Classroom Assignment Link
• PA 04 – Algorithms LeetCode Practice
  • Handout

Homework Assignments

• HW 01 – Due Feb 11, 2022 @ 6am uploaded to Canvas
• HW 02
• HW 03
• HW 04

Extra Helpful Info

• GitHub Actions
  • Introduction to Github Actions
  • Finding and customizing Github Actions
  • Essential Features of Github Actions
  • Github Actions Workflow Syntax Reference
• Git Feature Branch Workflow
  • Atlassian Tutorial on the Feature Branch Workflow
    • Important quote: “It also means the main branch will never contain broken code”.
• CMake
  • The Official CMake Tutorial
  • Introduction to Modern CMake for Beginners
  • CMake Stuff I wish I Knew Earlier