CS331 - Datastructures and Algorithms

Version 1

Course webpage for CS331

Course Overview

The class takes place: Monday + Wednesday, 9:40 am - 10:55 am, online

Lectures are recorded. Recordings are available on: youtube

This course teaches you basic data structures, algorithm design, and runtime analysis. We will use python as our language of choice. Office hours for the instructor and tas will be held on https://discord.gg/dkCrHbDU7y .

Instructor

Boris Glavic

TAs

Ismael Lopez

Aman Luqman

Christopher Sherman

Theo W. Guidroz

Naunidh Singh

Syllabus

Grading Policies

Weighting of Deliverables

  • Programming assignments: 30%
  • Project: 10%
  • Exams (2 midterms + final): 60%

Grading Scheme

Your final course grade is determined based on your total score which is calculated as the weighted sum of the points for each of the deliverables. The weights are as shown above. For each deliverable you will receive between 0 and 100 points. For some deliverables, I am giving additional bonus points. These are not considered for the grade cutoffs. For instance, the first programming assignment is weighted 10%. For sake of the example assume that you get 110 points in this assignment (full points + bonus points), then this assignment would contribute \(0.1 * 110 = 11\) points to your final score.

  • A: >= 90
  • B: >= 80
  • C: >= 70
  • D: >= 60
  • E: < 60

Late Policy

Each student has 7 late days for assignments. Usage of late days will not result in penalties. Once you have exhausted your late days, you will not receive points for late submissions.

Reading Material

The following text books will be helpful for following the course and studying the presented material. All four textbooks have their merits, but any one should be sufficient as reading material.

  • Brad Miller and David Ranum, Problem Solving with Algorithms and Data Structures using Python, , Franklin Beedle Publishers, 2003
  • Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms, 3rd, The MIT Press,

Last updated on Saturday, January 2, 2021
Published on Saturday, January 2, 2021
 Edit on GitHub