How to Talk to Machines
COMP 114
Summer 2016 not offered
|
In this course, students will learn how to program in a number of different styles. We start with programming state-transition machines, the kind of programming one might use to instruct a robot how to interact with the world around it. We will move on to programming von Neumann machines, which form the core of most computing systems today, and so along the way we will learn what is "in the box." We will end with an introduction to high-level 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. Along the way, we will pay special attention to the commonalities of the various styles, ultimately learning that much of what a high-level language provides is a way to more easily express computational algorithms that are ultimately implemented on a state transition machine. After passing this course, students will have a working knowledge of basic programming, and COMP 114 satisfies 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: (BIOL)(CIS)(IDEA-MN)(IDEA)(INFO-MN)(MATH) |
Major Readings:
Alvarado, et al, CS FOR ALL, Chs. 1-4.
|
Examinations and Assignments:
Regular short programming assignments; two longer "wrap-up" projects. |
| Drop/Add Enrollment Requests | | | | | |
| Total Submitted Requests: 0 | 1st Ranked: 0 | 2nd Ranked: 0 | 3rd Ranked: 0 | 4th Ranked: 0 | Unranked: 0 |
|
|