Revised (December 11, 2013)

CS 240: Data Structures and Data Management


General description

This course introduces widely used and effective methods of data organization, focusing on data structures, their algorithms, and the performance of these algorithms. Specific topics include priority queues, sorting, dictionaries, and data structures for text processing.

Students will learn to

Logistics

Audience

Normally available

Related courses

For official details, see the UW calendar.

Software/hardware used

Typical reference(s)

Required preparation

At the start of the course, students should be able to

Analytical:

Computational and algorithmic:

Learning objectives

At the end of the course, students should be able to

In addition to the above language-independent skills, students should be able to apply (code, debug, and test) any of the above structures and algorithms in C++, using appropriate design methodologies and language features. Students should be prepared to transfer these abilities to other languages (once learned).

Typical syllabus

Introduction and review (3) hours

Stacks, queues, and priority queues (3) hours

Sorting and analysis of randomized algorithms (5) hours

Search trees (5) hours

Hashing (5) hours

Range search and multidimensional dictionaries (5) hours

Algorithms and data structures for text processing (8) hours

 


Campaign Waterloo

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-webmaster@cs.uwaterloo.ca | David R. Cheriton School of Computer Science | Faculty of Mathematics


Valid HTML 4.01!Valid CSS! Last modified: Friday, 06-Jun-2014 15:17:46 EDT


Menu:ShowHide