CSE101: Course Information


Instructor: Ragesh Jaiswal
Office: 4122, CSE
Email: rajaiswal@ucsd.edu
Office hours: Mon, 10-11am.

Teaching Assistants:
- Qiao Fang [Email: faqiao@ucsd.edu][Office hours: Wed, 9-10, Thu 1-2, CSE B260A]
- Scott Fernandez [Email: sfernandez07@gmail.com][Office hours: Thu, 11:30-1:30, APM 6436]
- Sanjeev Shenoy [Email: sshenoy@ucsd.edu][Office hours: Wed, 12-1, B275, CSE]

Tutors:
- Zackary Lee [Email: zjlee@ucsd.edu][Office hours: Wed, 1-3, B260, CSE]

Lectures:
Location: CENTR 115
Time: Mon, Wed, Fri, 8-9.

Discussion:
Mon 3-4, WLH 2111
Mon 4-5, WLH 2111
Mon 5-6, WLH 2111

Evaluation :
  • Homework: 10%
  • Quizzes: 20%
  • Midterm: 30% (two midterms each 15%)
  • Final: 40%

    Syllabus:
    - Basic Graph Algorithms
    - Divide and Conquer
    - Greedy Algorithms
    - Dynamic Programming
    - Network Flows
    - Computational Intractability

    Textbook:
    - Algorithm Design by Jon Kleinberg and Eva Tardos

    Examination:
    - Midterm 1: October 23 in class
    - Midterm 2: November 20 in class
    - Final: Dec 7, 8-11am, TBA

    Homework and Quizzes: There will usually be homework due every Friday and there will be a quiz on the same material. You are allowed to discuss the homework with your peers. However, you should write the solutions individually.