CSE101: Course Information


Instructor: Ragesh Jaiswal
Office: 4122, CSE
Email: rajaiswal@ucsd.edu
Office hours: Wed, 11-1.

Teaching Assistants:
- Fang Qiao [Email: faqiao@ucsd.edu][Office hours: Wed 4-5, CSE B275]
- Anand Desai [Email: ajd007@eng.ucsd.edu][Office hours: Tue 1-3, CSE B275]
- Apoorve Dave [Email: a1dave@eng.ucsd.edu][Office hours: Mon 10-12, CSE B250A]
- Yizhen Wang [Email: yiw248@eng.ucsd.edu][Office hours: Mon 4-6, CSE B250A]

Lectures:
  • Section B00: Tu, Th, 3:30 - 4:50pm, PCYNH 109
  • Section C00: Tu, Th, 5:00 - 6:20pm, WLH 2205

  • Discussion:
  • Section B01: Fri, 10:00-10:50am, CENTR 105
  • Section C01: Wed, 2:00 - 2:50pm, CENTR 212

  • Evaluation :
  • Homework: 15%
  • Quizzes: 15%
  • 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

    Examinations:
  • Midterm 1:
  • Midterm 2:
  • Final Exam:
  • Homework and Quizzes:
  • Homework will be posted every Wednesday by 6pm and will be due the following Wednesday at 5pm.
  • There will be a quiz every Thursday on the material of the homework submitted on Wednesday.
  • You will have to upload the PDF of your homework on Gradescope. When uploading, you may be asked to indicate which page(s) correspond to which problems.