This course covers graph theory, data structures, algorithms, and analysis. Key concepts include recursion, greedy algorithms, memoization and dynamic programming. Students will build an original project whose underlying structure requires the use of graph structures and algorithms to solve real-world problems such as airplane routing, social networking, and board games.

Graphs can be used to model and solve a wide variety of problems, including systems of roads, airline flights from city to city, how the Internet is connected, or even the sequence of classes you must take to complete your degree here at Make School! Understanding graphs allows you to build models of these problems and use those models to find optimal or best case solutions.

• CS 1.3

Students by the end of the course will be able to ...

• Describe common graph algorithms.
• Model and solve real world problems using graph algorithms.
• Implement graph algorithms in code.
• Develop algorithmic thinking skills to expand on common graph algorithms and improve problem solving approaches.

NOTE: Due to the shorter summer sessions, for some class sessions you will see multiple topics covered. This is to ensure that we cover the same material that we normally would in non-summer terms.

Course Dates: Monday, July 8 – Wednesday, August 14, 2019 (6 weeks)

Class Times: Monday and Wednesday at 1:30–3:20pm

• Challenge Descriptions

• Graph Properties and Algorithms Tutorial

• Graph Properties and Algorithms Project

To pass this course you must meet the following requirements ( submit to course progress tracker

• Complete all required challenges.
• Pass the Graph Properties and Algorithms Tutorial according to the associated Tutorial Rubric
• Pass the - Graph Properties and Algorithms Project according to the associated Project Rubric
• Pass the 4 quizzes given during the term (1 retake allowed).
• Actively participate in class and abide by the attendance policy
• Make up all classwork from all absences

The following resources were used in developing this course and are a great place to start for learning more. These resources are used through the Attribution / Share Alike license.

• Geeks for Geeks
• Wikipedia Graph Theory
• Runestone Academy Data Structures and Algorithms

Much of the code you will be implementing in this class is for standard algorithms and thus is readily available from many sources. By using these resources, we can focus on deepening our understanding of the algorithms themselves and on the process of solving real world problems with these algorithms. This means it may be likely that class members will have relatively similar algorithmic implementations, however, in keeping with the Academic Honesty Policy, you are expected to always give credit to code sources (online or classmates), write each line of code yourself with full understanding, add appropriate comments, and fully test your code.

• Program Learning Outcomes
• Grading System
• Diversity and Inclusion Statement
• Academic Honesty
• Attendance Policy
• Course Credit Policy
• Disability Services (Academic Accommodations)
• Student Handbook