Fun facts:

1. grew up in San Clemente (~1hr south of Claremont, on the beach)
2. 7 years in the navy
   1. nuclear submarine officer, personally converted >10g of uranium into pure energy
   2. worked at National Security Agency (NSA)
   3. left Navy as a conscientious objector
3. phd/postdoc at UC Riverside
4. taught in DPRK (i.e. North Korea)
5. my wife is pregnant and due to have a baby April 18th

Data structures is the most important course in computer science, and many of the "classic" CS interview questions come from this course. Mastering this material is the first step towards getting a high paying CS job. See:

1. https://www.levels.fyi
2. tech employers illegally collude to reduce salaries

Who should take this course?

1. This is a second semester course in computer science designed for students who have previously taken either CS40 (CMC), CS5 (Mudd), or CS51 (Pomona).

2. You cannot take this course if:

   1. you have already taken a data structures course (e.g. Pomona: CS62; HMC: CS60, CS70), or
   2. you are a CS major through Mudd or Pomona.

3. This course is required for CMC's data science major and the computer science sequence. It is optional for the data science sequence.

Learning Objectives:

Primary objectives:

1. Learn basic devops and how open source software is developed
2. Be able to answer the following three questions about an algorithm:
   1. Is it correct?
   2. How much resources does it consume? (time, memory, money, etc.)
   3. Can we do better?

Secondary objectives:

1. Learn basic shell programming
2. More experience with python programming
3. Solve the questions asked in programming interviews and contests
4. Introduction to the mathematics of programming (overlap with discrete math)
5. Introduction to the hacker culture

Differences between this course and HMC's CSCI060HM/CSCI070HM:

1. This course does not cover low-level memory management (C/C++ programming languages)
2. This course is more practical

This course is NOT an algorithms course. Algorithms courses form the "other half" of classic CS interview questions, and you should consider taking CS148 - Graph Algorithms after this course.

Textbook:

All of our textbooks are both free as in beer and free as in speech:

1. Problem Solving with Algorithms and Data Structures using Python by Brad Miller and David Ranum

2. Official Python Documentation

Grades:

Your grade will be composed of:

1. Weekly labs (worth 2**1 points)
2. Weekly quizzes (worth 2**2 or 2**3 points)
3. Weekly projects (worth 2**4 or 2**5 points)
4. No midterm/final exam.
   1. Non-seniors will complete a final project due during finals week.
5. Occassional extra credit assignments

Historically, the average student needs to spend about 10 hours per week (including class time) to get an A. About 25% of students will either: spend 15-20 hours per week and get an A, or spend 10 hours per week and get a B/C.

Late Work Policy:

You lose 2**i points on every assignment, where i is the number of days late. It is usually better to submit a correct assignment late than an incorrect one on time.

Grade Schedule:

Your final grade will be computed according to the following table, with one caveat.

Caveats::

There are 2 "caveat tasks" in this course. These tasks should be easy, and everyone will get full credit on the task just for completing the task. If you don't complete one of the tasks, however, your grade (from the table above) will be docked 10%. (For example, an A- grade would become a B- grade.) You have the entire semester (until I submit grades) to complete these tasks.

You can find the details about the caveat tasks at:

1. caveat_tasks/typespeed.md
2. caveat_tasks/culture.md

Technology Policy:

1. You must complete all programming assignments on the lambda server.

2. You must use either vim or emacs to complete all programming assignments. In particular, you may not use the GitHub text editor, VSCode, IDLE, or PyCharm for any reason.

3. You must not share your lambda-server credentials with anyone else.

Violations of any of these policies will be treated as academic integrity violations.

Collaboration Policy

You are encouraged to discuss all labs and homeworks with other students, subject to the following constraints:

1. you must be the person typing in all code for your assignments, and
2. you must not copy another student's code.

You may use any online resources you like as references.

WARNING:

All material in this class is cumulative. If you work "too closely" with another student on an assignment, you won't understand how to complete subsequent assignments, and you will quickly fall behind. You should view collaboration as a way to improve your understanding, not as a way to do less work.

You are ultimately responsible for ensuring you learn the material!

I've tried to design the course to be as accessible as possible for people with disabilities. (We'll talk a bit about how to design accessible software in class too!) If you need any further accommodations, please ask.

I want you to succeed and I'll make every effort to ensure that you can.