Links to miscellaneous resources that will be helpful will appear here during the course of the semester.
Test 2 study materials:
In addition to the items below, be sure to study all the previous worksheets and their keys.
Test 1 study materials:
In addition to the items below, be sure to study all the previous worksheets and their keys. Additional items such as quiz questions and answerers will be added to this area soon.
Written homeworks and solutions:
Worksheets and solutions:
- Single Shortest Path Guide. This guide by Cole contains notes about SSP and questions you can use the book to answer. The guide is to help you study.
- Depth First Graph Search Guide. This guide works through a depth first graph search.
- Cole's Basic Graph Notes. This guide contains notes on graphs, breadth first graph search, depth first graph search, topological sort, and strongly connected components. It also references a great website that shows BFS and DFS in action.
- Dynamic Programming example - Traveling. This is an example of dynamic programming that takes you through a recursive solution to the DP solution. The basic problem is that you have a fixed number of gallons of gas and depending on your speed you use up different amounts of gas. Your task is to figure out how to use different speeds to go the farthest distance that you can.
- Gale-Shapley proofs
- Cole's Python tutorial/guide. This is a tutorial guide that Cole developed to show basics of the Python language that you'll use in CS320. This link takes you to a static version of the guide - you can try out the things it shows you in an interactive Python console.
- PyCharm, Git, and GitHub
- For info on how to run PyCharm on the department computers, please see Cole's video.
- Basic Git information
Git, PyCharm download sites: