ENROLL Course Search

Saved Courses (0)

Your search for courses for 22/WI and in OLIN 310 found 4 courses.

Revise Your Search New Search

CS 111.01 Introduction to Computer Science 6 credits

Open: Size: 34, Registered: 32, Waitlist: 0

Olin 310

Synonym: 60490

Anya E Vostinar

This course will introduce you to computer programming and the design of algorithms. By writing programs to solve problems in areas such as image processing, text processing, and simple games, you will learn about recursive and iterative algorithms, complexity analysis, graphics, data representation, software engineering, and object-oriented design. No previous programming experience is necessary. Students who have received credit for Computer Science 201 or above are not eligible to enroll in Computer Science 111.

CS 208.00 Introduction to Computer Systems 6 credits

Closed: Size: 34, Registered: 34, Waitlist: 0

Olin 310

Synonym: 60498

Jeffrey R Ondich

Are you curious what's really going on when a computer runs your code? In this course we will demystify the machine and the tools that we use to program it. Our broad survey of how computer systems execute programs, store information, and communicate will focus on the hardware/software interface, including data representation, instruction set architecture, the C programming language, memory management, and the operating system process model.

Prerequisite: Computer Science 201 or instructor permission

CS 251.00 Programming Languages: Design and Implementation 6 credits

Closed: Size: 34, Registered: 31, Waitlist: 0

Olin 310

Synonym: 61983

James O Ryan

What makes a programming language like "Python" or like "Java"? This course will look past superficial properties (like indentation) and into the soul of programming languages. We will explore a variety of topics in programming language construction and design: syntax and semantics, mechanisms for parameter passing, typing, scoping, and control structures. Students will expand their programming experience to include other programming paradigms, including functional languages like Scheme and ML.

Prerequisite: Computer Science 201 or instructor permission

CS 254.00 Computability and Complexity 6 credits

Closed: Size: 34, Registered: 34, Waitlist: 0

Olin 310

Synonym: 60500

James O Ryan

An introduction to the theory of computation. What problems can and cannot be solved efficiently by computers? What problems cannot be solved by computers, period? Topics include formal models of computation, including finite-state automata, pushdown automata, and Turing machines; formal languages, including regular expressions and context-free grammars; computability and uncomputability; and computational complexity, particularly NP-completeness.

Prerequisite: Computer Science 201 and Computer Science 202 (Mathematics 236 will be accepted in lieu of Computer Science 202)

Search for Courses

This data updates hourly. For up-to-the-minute enrollment information, use the Search for Classes option in The Hub

Instructional Mode
Class Period
Courses or labs meeting at non-standard times may not appear when searching by class period.
You must take 6 credits of each of these.
You must take 6 credits of each of these,
except Quantitative Reasoning, which requires 3 courses.
Special Interests