|
Ben Sanders
UC Riverside
|
 UCR CS CS 141 Pfr. Stefano Lonardi Neil Conos Tony Taing
Albrecht Cruz Jimmy Xu Petey Supatuasakul Esther Rupel
Hello, welcome to CS 141. My name is Ben Sanders, and I will be accompanying you towards your completion of the Computer Science series of core classes. Feel free to click on the links above to learn more about the workshops other facilitators have to offer.
The CS 141 Academic Excellence Workshop (AEW) will be meeting in EBUII 103 from 1 to 2pm on Tuesdays and Thursdays this quarter.
For anyone interested, here is the latest of my fire project updates.
7 June 2007 This workshop involved a discussion of the final project and the topics that will be on the final.
5 June 2007 Today we talked about Kruskal's and Prim's algorithms. We also talked about the general MST algorithm.
31 May 2007 This workshop involved a discussion of puzzles for which algorithms needed to be designed.
29 May 2007 Today we talked about Prim's algorithm and semi-connectedness.
24 May 2007 This workshop involved a discussion of Dijkstra's algorithm, trees, and weighted graphs.
22 May 2007 Today we talked about a review for the quiz.
17 May 2007 This workshop involved a discussion of Dijkstra's algorithm and a few AI topics. We also talked about weighted digraphs.
15 May 2007 Today we talked about DFS, BFS, and A* Search..! Specifically, we talked about the difference between implementing those algorithms iteratively and recursively.
11 May 2007 Dynamic programming was again the main focus of the workshops.
8 May 2007 Today's workshop focused mainly on dynamic programming.
3 May 2007 Today we talked about dynamic programming, greedy algorithms, and divide and conquer algorithms.
1 May 2007 Workshop involved going over problems that were similar to the problems in the sample quiz. Good luck tomorrow!
26 April 2007 Today involved dynamic caching and greedy algorithms. Specifically, we studied string matching, Djikstra's algorithm, and Huffman encoding.
24 April 2007 Today involved dynamic caching and greedy algorithms.
19 April 2007 This workshop involved both the problems from the previous homework assignment and an exercise about matrix multiplication. This focused on divide and conquer and the running-time analysis of recursive algorithms.
17 April 2007 Today we tried to memorize the master theorem. After that, we briefly talked about proofs by induction.
12 April 2007 We talked about both proofs by induction and evaluation of recursive time complexities in workshop today.
10 April 2007 Today in workshop we covered proofs by induction. Specifically, we proved various algebraic and geometry-based (graph theory) statements.
|