| home page - news - syllabus - topics - schedule - assignments - tutorials - tests - java - references - Mike Jacobson |
| syllabus - learning goals - CS background - math background - how to succeed - what to avoid - assessment |
| About CPSC 331 |
A large proportion of computing time is spent solving a very small number of fundamental problems. Computer Science 331 introduces data structures and algorithms that are needed to solve these fundamental problems. The material introduced in this course therefore serves as the foundation upon which many other computer science fields are built.
In particular, Computer Science 331 introduces algorithms that can be used to solve several fundamental problems (including searching and sorting) as well as data structures that are commonly used to manage information when solving problems of small-to-moderate size. This course also introduces or reviews terminology, notation and techniques that are commonly used in computer science to establish that algorithms are correct, to systematically test implementations of algorithms, and to determine the resources that these algorithms use.
|
This page last modified:
http://www.cpsc.ucalgary.ca/~jacobs/cpsc331/W07/syllabus.html |