cs141

Home Links cs141 cs166 cs180 About Me

As an undergraduate student at UCR I used to facilitate an Academic Excellence workshop for cs141. In doing the workshop I created a few web pages and worksheets that someone taking the course might find useful. Hopefully at some point I will get the oppertunity to TA the class. Until then, anyone is free to use any of the material that you find here. Hopefully someone will find it usefull.

The following are a list of topics pertinent to cs141. As time permits I will post pseudo-tutorials and examples.

Background: Time Complexity: String Searching: Programming Strategies:
  • Greedy Algorithms:
    • Knapsack
    • Huffman Code
  • Divide and Conquer:
    • Min and Max
  • Dynamic Programming:
Graph Algorithms:
  • Breadth First Search(BFS)
  • Depth First Search(DFS)
  • Topological Sort
  • Strongly Connected Components
  • Minimum Spanning Tree
  • Kruskal's Algorithm
  • Prim's Algorithm
  • Single Source Shortest Path(SSSP)
  • Dijkstra's Algorithm
  • Bellman-Ford Algorithm
  • All Pairs Shortest Path(APSP)

You might also find some good resources at the web sites of Prof. Jiang, Prof. Lonardi, and Prof. Faloutsos. They have all taught the course in the past.

Last modified: Fri Sep 26 17:18:12 PDT 2003