Description
Thorough coverage of fundamental abstract collections: stacks, queues, lists, priority queues, dictionaries, sets, graphs. Data structures: review of arrays and linked lists; trees, heaps, hash tables. Specification, design, implementation of collections, complexity analysis of operations. Sorting algorithms.
Prerequisites
- Prerequisite(s): SYSC 1006 or SYSC 2006 .
Conditions and arrangements
- Precludes additional credit for Precludes additional credit for COMP 2402 .
- Prerequisite(s): SYSC 1006 or SYSC 2006 .
- Lectures three hours a week, laboratory two hours a week, problem analysis one hour alternate weeks.
Reference text in its original language
Thorough coverage of fundamental abstract collections: stacks, queues, lists, priority queues, dictionaries, sets, graphs. Data structures: review of arrays and linked lists; trees, heaps, hash tables. Specification, design, implementation of collections, complexity analysis of operations. Sorting algorithms.
- Prerequisite(s): SYSC 1006 or SYSC 2006 .
- Precludes additional credit for Precludes additional credit for COMP 2402 .
- Lectures three hours a week, laboratory two hours a week, problem analysis one hour alternate weeks.
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/undergrad/courses/SYSC/