









































Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Information about the CS 200 - Programming I course offered in Fall 2017 at the University of Wisconsin-Madison. It covers topics related to computer science and programming, including algorithms, computer graphics, language theory, systems, and human-computer interaction. The course aims to teach fundamental CS topics to students with no prior programming experience and covers problem abstraction, edit-compile-run cycle, data types, control structures, basic testing and debugging, and good programming practices. The document also includes information about the course instructors, consultants, and learning outcomes.
Typology: Lecture notes
1 / 49
This page cannot be seen from the preview
Don't miss anything!










































Marc Renault
Department of Computer Sciences University of Wisconsin – Madison
Fall 2017 TopHat Sec 3 (PM) Join Code: 719946 TopHat Sec 4 (AM) Join Code: 891624
Broad discipline that explores any and all areas of computation. Includes: theory of computation, algorithms, computer graphics, language theory, systems, and human-computer interaction.
Broad discipline that explores any and all areas of computation. Includes: theory of computation, algorithms, computer graphics, language theory, systems, and human-computer interaction.
Providing a set of instructions to a computer to automate a specific task or solve a given problem.
Broad discipline that explores any and all areas of computation. Includes: theory of computation, algorithms, computer graphics, language theory, systems, and human-computer interaction.
Providing a set of instructions to a computer to automate a specific task or solve a given problem. An application of computer science. Implementing algorithms.
a. Freshman b. Sophomore c. Junior d. Senior e. Graduate Student f. Other
a. Windows b. Mac c. Linux d. Other e. None
Fall 2017 Team https://cs200-www.cs.wisc.edu/wp/contact/
Jim Williams jimw @cs.wisc.edu Lectures 001 and 002 Office: 6384 CS Hours: T 10am - noon, W 9am - 11am, or by appt.
Marc Renault mrenault @cs.wisc.edu Lectures 003 and 004 Office: 6382 CS Hours: T 1pm - 3pm, Th 10am - noon, or by appt.
Fall 2017 Team https://cs200-www.cs.wisc.edu/wp/contact/
Fall 2017 Team https://cs200-www.cs.wisc.edu/wp/contact/
https://cs200-www.cs.wisc.edu/wp/syllabus/
Design and implement a standalone program that can interact with the user via prompts and or menus, access and edit data stored in an array or list structure, and use and further process the data found in those structures.
https://cs200-www.cs.wisc.edu/wp/syllabus/
Design and implement a standalone program that can interact with the user via prompts and or menus, access and edit data stored in an array or list structure, and use and further process the data found in those structures. Able to trace code to determine output or results.
https://cs200-www.cs.wisc.edu/wp/syllabus/
Able to interpret a variety of diagram types used to express programming concepts and results: truth tables, memory model diagrams, control flow charts, class diagrams, object diagrams, and use-case diagrams.
https://cs200-www.cs.wisc.edu/wp/syllabus/
Able to interpret a variety of diagram types used to express programming concepts and results: truth tables, memory model diagrams, control flow charts, class diagrams, object diagrams, and use-case diagrams. List, describe, use the basic I/O operations for reading and writing text files to and from the computer’s hard drive.