COMP 114
Fall 2019
 Section:
01
02

How do we tell robots and computers how to do what they do? Getting a handle on this question is the goal of this course. Since telling a device how to do something depends a lot on what that device can do, along the way we will learn a bit about what is "in the box." We will start with the kind of programming one might use to instruct a robot how to interact with the world around it. That will lead us to the Turing machine, a beautiful mathematical model of a computer. We will adapt that model to something that is closer to how most computer systems today are designed. We will end with an introduction to highlevel programming, learning the fundamentals of programming in a language such as Python or Java.
The goal of the course is to understand not just programming, but how computers are designed, and how those designs are reflected in the way we program them. After passing this course, students will have a basic knowledge of programming and how a computer works. COMP 114 can be used to satisfy the COMP 211 prerequisite and also the mathematics major "elementary knowledge of algorithms and computer programming" requirement. 
Credit: 1 
Gen Ed Area Dept:
NSM MATH 
Course Format: Lecture  Grading Mode: Student Option 
Level: UGRD 
Prerequisites: None 

Fulfills a Major Requirement for: (CIM)(MATH) 

Past Enrollment Probability: 75%  89% 
SECTION 01 
Instructor(s): Zimmeck,Sebastian Times: ...W.F. 01:20PM02:40PM; Location: TBA 
Total Enrollment Limit: 25   SR major: 0  JR major: 0   
Seats Available: 11  GRAD: X  SR nonmajor: 5  JR nonmajor: 5  SO: 5  FR: 10 
SECTION 02 
Instructor(s): Zimmeck,Sebastian Times: ...W.F. 02:50PM04:10PM; Location: TBA 
Total Enrollment Limit: 25   SR major: 0  JR major: 0   
Seats Available: 10  GRAD: X  SR nonmajor: 5  JR nonmajor: 5  SO: 5  FR: 10 
