🏷️ LIMITED TIME OFFER: GET 20% OFF GRADE+ YEARLY SUBSCRIPTION →

Verified Documents at Boston University

Introduction to Computer Science 1
Boston University
Verified Notes

Browse the full collection of course materials, past exams, study guides and class notes for CAS CS 111 - Introduction to Computer Science 1 at Boston University verified by our …

PROFESSORS

All Professors

David Sullivan

Verified Documents for David Sullivan

Class Notes

Taken by our most diligent verified note takers in class covering the entire semester.

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

The process of developing algorithms to solve problems. The process of developing computer programs to express those algorithms. Other topics from comp

CAS CS 111 Lecture Notes - Lecture 2: Mit Media Lab

Makes it easy to create animations, games, etc. Sprites perform actions and interact with each other on the stage. At the start, there is a single cat

CAS CS 111 Lecture Notes - Lecture 3: Concatenation, String Literal, Control Order

The following prompt indicates that the shell is waiting for you to type something: % modulus: gives the remainder of a division. The operators follow

CAS CS 111 Lecture Notes - Lecture 4: Docstring

A list is a sequence of arbitrary values (the list"s elements). A list can include values of different types: List ops == strings ops (more or less) Fo

CAS CS 111 Lecture Notes - Lecture 5: Boolean Expression

Flow of control = order in which statements are executed. By default, a program"s statements are executed sequentially, from top to bottom: conditional

CAS CS 111 Lecture Notes - Lecture 6: Global Variable, Local Variable

The scoop of a variable is the portion of your program in which the variable can be used. When we assign a value to a variable inside a function, we cr

CAS CS 111 Lecture 8: CAS CS 111 B1 September 21 Lecture 8 Notes

CAS CS 111 Lecture 8: 21-09-18 Handwritten Prelecture and Lecture Notes

CAS CS 111 Lecture 9: 24-09-18 Handwritten Prelecture and Lecture Notes

CAS CS 111 Lecture 9: CAS CS 111 B1 September 25 Lecture 9 Notes

CAS CS 111 Lecture 10: 09/26/18 Prelecture and Lecture Handwritten Notes

CAS CS 111 Lecture Notes - Lecture 10: Higher-Order Function

Range (low, high): allows us to work with the range of integers from low to high-1. If you omit low, the range will start at 0. You can think of range

CAS CS 111 Lecture 11: 09/28/18 Lecture Handwritten Notes

CAS CS 111 Lecture Notes - Lecture 11: Empty String

CAS CS 111 Lecture Notes - Lecture 12: Playstation 3, List Comprehension

Max(values): returns the largest value in a list of values. Min(values): returns the smallest value in a list of values: list of lists. Recall that ele

CAS CS 111 Lecture 12: 10/01/18 Prelecture and Lecture Handwritten Notes

CAS CS 111 Lecture 13: 10/03/18 Prelecture and Lecture Handwritten Notes

CAS CS 111 Lecture Notes - Lecture 13: Palindrome, Empty String, Abracadabra

Cas cs 111 - week 4, lecture 13 - algorithm design. *as professor sullivan counts lectures from 0, this is considered lecture 12 in class. A helper fun

CAS CS 111 Lecture Notes - Lecture 13: Microsoft Powerpoint, Palindrome, Subsequence

CAS CS 111 Lecture Notes - Lecture 13: Subsequence, Playstation 3, Gang Of Youths

When designing a function, it often helps to write a separate helper function for a portion of the overall task. Returns the number of characters in s1

CAS CS 111 Lecture Notes - Lecture 14: Binary Number

CAS CS 111 Lecture 14: 10/05/18 Prelecture and Lecture Handwritten Notes

CAS CS 111 Lecture 14: CAS CS 111 (Lecture 14 Notes)

Cas cs 111 - week 4, lecture 14 - binary numbers. *as professor sullivan counts lectures from 0, this is considered lecture 13 in class. A binary n mbe

CAS CS 111 Lecture Notes - Lecture 14: Binary Number

Each digit in a binary number of one bit. Based on two voltages: low = 0, high = 1. A given set of bits can have more than one meaning. In base 10 (dec

CAS CS 111 Lecture 15: CAS CS 111 B1 October 10 Lecture 15 Notes

All types of data are represented in binary. In ps 4, you will write a python function for this. In ps 4, you will write an add_bitwise () function tha

CAS CS 111 Lecture 15: 10/10/18 Prelecture and Lecture Handwritten Notes

CAS CS 111 Lecture Notes - Lecture 15: Or Gate, And Gate

CAS CS 111 Lecture Notes - Lecture 16: Canonical Normal Form, And Gate

CAS CS 111 Lecture 17: 10/15/18 Prelecture and Lecture Handwritten Notes

CAS CS 111 Lecture Notes - Lecture 19: Extensible Resource Identifier

CAS CS 111 Lecture Notes - Lecture 20: The Need

CAS CS 111 Lecture Notes - Lecture 21: Urt

CAS CS 111 Lecture 22: 10/2/618 Prelecture and Lecture Handwritten Notes

CAS CS 111 Lecture 23: 10/29/18 Prelecture and Lecture Handwritten Notes

CAS CS 111 Lecture Notes - Lecture 24: To-3

CAS CS 111 Lecture 25: 11/02/18 Prelecture and Lecture Hndwritten Notes

CAS CS 111 Lecture 26: 11/05/18 Prelecture and Lecture Handwritten Notes

CAS CS 111 Lecture 27: 11/07/18 Prelecture and Lecture Handwritten Notes

CAS CS 111 Lecture Notes - Lecture 28: Init, Adit, Methamphetamine

CAS CS 111 Lecture 29: 11/12/18 Prelecture and Lecture Handwritten

CAS CS 111 Lecture 30: 11/14/18 Lecture Handwritten Notes

CAS CS 111 Lecture Notes - Lecture 31: Cittern, Init

CAS CS 111 Lecture 32: 11/19/18 Lecture Handwritten Notes

CAS CS 111 Lecture Notes - Lecture 33: Init

CAS CS 111 Lecture 35: 12/03/18 Lecture Notes

CAS CS 111 Lecture 36: CAS CS 111 Lecture : 11/30/18 Lecture Notes

CAS CS 111 Lecture Notes - Lecture 37: Eleman Languages

CAS CS 111 Lecture 38: 12/07/18 Lecture Notes