CAS CS 111 Lecture Notes - Lecture 1: Imperative Programming, Problem Set

• School: Boston University
• Department: Computer Science
• Course: CAS CS 111
• Professor: David Sullivan

Document Summary

Syllabus and lecture 1: 4 weeks: fundamental programming, 2 weeks: digital logic/circuits, 2 weeks: imperative programming, 2 weeks: object-oriented programming, 2 weeks: cs theory. Preparing for lecture: short readings and videos, online reading quiz - completed by 9am on the day of lecture. Asap: complete lab 0 on course website: register clicker, setup a cs account. Weekly problem sets: part 1: 9pm thursday, part 2: 9pm sunday, individual and pair-optional problem sets. Algorithms: a step-by-step description of how to accomplish a task, algorithms must be: Effective: you can actually carry it out. It"s really important to specify every step of the process. You don"t always know if it"s going to work unless you try it. Programming: class taught using python, python version 3 - not python 2. D: news north, east, west, south, picobot knows its surroundings, and it also knows its state. It is trying to go in a certain direction.