CS320 Projects

Programming Assignment Two

Breadth First and Depth First Search

The objective of PA2 is to write a Python program that traverses graphs in BFS and DFS manner. BFS will determine the shortest path distance (number of edges) from the root for each node reachable from the root. DFS will find cycles in the graph of nodes reachable from the root

Programming Assignment Three

Making Change

The objective of PA3 is to create a program that counts the number of ways a certain integer amount of money can be paid using a certain coin set.