CS-130b: Data Structures and Algorithms

Instructor: Dr. Subhash Suri (suri@cs.ucsb.edu)

Class: Tu-Th 9:30-10:45 (GIRV 2127)

Discussion: Wed, 9:00--9:50 (Phelps 1425)

Office Hours: Mon-Tu 11-12 (Engr I, 2111)

Teaching Assistant
- Ceren Budak (Email: cbudak@cs.ucsb.edu)
  Office hours: Wed 10-12 (PHELPS 1413)
- Nagender Reddy Paduru (Email: npaduru@cs.ucsb.edu)
  Office hours: Thur 1-3 PM (CSIL)
The Course Schedule appears here

Turnin Instructions
For Project 1 you do turnin prog1@cs130b *.c *.h makefile

For Project 2 you do turnin prog2@cs130b *.c *.h makefile

Discussion Section Notes

Lecture Slides
- Introduction (lecture 1) (txt)
- Activity Scheduling (txt)
- Huffman Coding (txt)
- Dijkstra, Prim, and Kruskal (pdf)
- Divide and Conquer (pdf)
- Dynamic Programming (pdf)
- NP-Completeness (Lecture 1) (Lecture 2) (Lecture 3)
- Approximation Algorithms (pdf)
- Bin Packing (txt)
- Lower Bounds (pdf) or (Landscape pdf) or (postscript)
Homework Assignments

1. Homework #1 (in pdf). Due IN CLASS on April 8, 2008.
2. Homework #2 (in pdf). Due IN CLASS on April 15, 2008.
3. Homework #3 (in pdf). Due IN CLASS on May 6, 2008.
4. Homework #4 (in pdf). Due IN CLASS on May 20, 2008.
4. Homework #5 (in pdf). Due IN CLASS on June 3, 2008.
Programming Assignments

1. Programming Assignment #1 Lab 1. DEADLINE 4/29/08 (midnight).

Gnuplot help tutorial by Chris Gnuplot Help
The following perl scripts are provided as a reference, and also to help you check the correctness of your code. Scripts for various functions: frequency, huffman, encode, decode.

2. Programming Assignment #2 (in pdf). Due 5/30/08 (Fri) at 11:59 PM.

See a sample output here
Exams

1. Midterm #1, May 8, in class.
2. Midterm #2, June 5, in class.