UNIVERSITY AT BUFFALO - STATE UNIVERSITY OF NEW YORK
The Department of Computer Science & Engineering
CSE 111:
GREAT IDEAS IN
COMPUTER SCIENCE
Directory of Documents
CSE 111
:
Syllabus for CSE 111
(the syllabus was originally handed out Aug 30,
but will be continually updated;
changes will be announced in lecture
and/or to the Listserv)
Join/Quit the Email List
Email archive
How to Study
How to Read (algorithm)
Last Update: 19 September 2013
Note:
or
material is highlighted
CIT Services for Students
...
...is a list of links to services provided by
Computing and Information Technology
,
including such topics as:
Getting Started
Email & News
Internet Access
Computing Labs (e.g., where they are; how to print)
Hardware & Software (including TechTools and Unix)
Training, Support, & Documentation
HOMEWORK ASSIGNMENTS
General Course Information
What Is Computing?
Great Idea I: Binary Representation
Great Idea II: Turing Machines
Great Idea III: The Boehm-Jacopini Theorem and Structured Programming
(and
Karel the Robot
)
The Halting Problem
Artificial Intelligence
Course Summary
Copyright © 2004 by
William J. Rapaport
(
rapaport@cse.buffalo.edu
)
file: 111F04/directory-2004-11-23.html