CS 130B (Spring 2016)
Data Structures and Algorithms

Computer Science Department
University of California, Santa Barbara

  • Instructor

  • Dr. Teofilo F. Gonzalez
    Office: 2119 Harold T. Frank Hall
    Phone: 893-3849
    Office hours: W: 2:00 pm - 3:00 pm and F: 1:00 pm - 2:00 pm.
    E-mail: teo+alg@cs.ucsb.edu

  • Teaching Assistants

  • Minh X. Hoang
    Office: GSL in Trailer 698 (next to HFH on the way to the Library)
    Phone: 895-3380
    Office Hours: Monday 1pm - 2pm and Thursday 5pm - 6pm.
    E-mail: mhoang@cs.ucsb.edu

  • Raymond Wong
    Office: GSL in Trailer 698 (next to HFH on the way to the Library)
    Phone: 895-3380
    Office Hours: Tuesday Noon - 2pm.
    E-mail: rwong@cs.ucsb.edu

  • Course Schedule

  • Course Rules

  • Course Goals

    • Study and learn techniques to solve problems efficiently. These techniques include: greedy methods, divide and conquer, dynamic programming, backtracking, and branch and bound. Apply the techniques to design efficient algorithms for problems from several fields of study. The performance of the resulting algorithms will be investigated theoretically and empirically (when necessary).

  • News

  • Discussion sessions begin on Friday April 1st, 2016. It is very important that you attend all the Discussion Sessions. It is very important that you attend all the Discussion Sessions.

  • Topics covered so far:

  • Tentative list of topics to be covered (not in final order):

  • Introduction (O, Omega, and Theta notation )
  • Greedy Methods
  • Definitions
  • Container Loading
  • The Printer Scheduling Problem
  • Bin Packing
  • Single Source Shortest Paths
  • Min Cost Spanning Trees (Kruskal, Prim and Sollin)
  • Huffman Codes
  • Divide and Conquer
  • Finding the Counterfeit Coin
  • Merge sort
  • Quick sort
  • Multiplying long integers
  • Basic Theorem For Solving Recurrence Relations
  • Proof of Theorem
  • Applications of Basic Theorem
  • Fast Matrix Multiplication
  • Triangular Matrix Multiplication
  • Selecting the kth Smallest Element
  • Closest Pair in 2D
  • Convex Hull
  • Dynamic Programming
  • Family Vacation
  • All Pairs Shortest Paths
  • Matrix Prod Chains
  • Parallel Matrix Prod Chains
  • Triangulating a Convex Polygon
  • Image Compression (if time permits)
  • NP-complete Problems
  • Other
  • Backtracking
  • Branch and Bound
  • Local Search (if time permits)
  • Games (Tic-Tac-Toe), Chess and Alpha-Beta Pruning (if time permits)
  • Maximum Matching in Bipartite Graphs (if time permits)
  • Bipartite Graph Covers (if time permits)
  • Applications of DFS and BFS (if time permits)

  • Under Construction DO NOT CLICK HERE

    • Total number of visitors to this page, since 1/1/2011, is .