Schedule
Three hours of lecture per week, plus a two-hour lab and a one-hour tutorial. Normally available in Fall only.
Outline
Introduction and review (6 hours)
Review of hardware and software, problem solving and programming, including declarations, selection and looping constructs, I/O.
Subprograms (6 hours)
Functions. Scoping. Parameter passing, by value and by reference. Top-down design. Programming with stubs.
Structured Data (7.5 hours)
Arrays. Structures. Arrays of structures. Multidimensional arrays. Appropriate choice of data structures. String processing and tokenization.
Recursion (3 hours)
Introduction to recursive procedures and functions.
Analysis (1.5 hours)
Introduction to O-notation, space and time efficiency, and complexity.
Sorting Algorithms (4.5 hours)
Algorithm design and efficiency, through discussion of of elementary sorting algorithms (insertion sort, selection sort) and advanced sorting algorithms (mergesort, quicksort, heapsort).
Pointers and Dynamic Structures (6 hours)
Introduction to pointers, memory allocation and deallocation, singly and doubly-linked lists.
History of Computer Science (1.5 hours)
Babbage, Hilbert, Godel, Church, Turing. Early development of electronic computers and programming languages. History of concepts covered in this course.
David R. Cheriton School of Computer Science
University of Waterloo
Waterloo, Ontario, Canada N2L 3G1
Tel: 519-888-4567 x33293
Fax: 519-885-1208
Contact | Feedback: cs-uops@cs.uwaterloo.ca | David R. Cheriton School of Computer Science | Faculty of Mathematics
Last modified: Wednesday, 15-Feb-2012 10:19:52 EST
