COMP 2547 - Overview

Course Title

The title for COMP-2547 is "Programming for Beginners II".

Course Description

This course provides an introduction to the programming and analysis of both linear and non-linear data structures and their associated algorithms. Topics include the formal notion of algorithms; basics of time and space complexity; linear data structures (such as stacks, queues, linked lists); nonlinear data structures (such as trees, binary trees); recursion; sorting techniques (such as heap sort, quick sort, merge sort); searching techniques (such as binary search, binary search trees, hashing); algorithm design paradigms (such as divide-and-conquer, greedy algorithms); and applications. (Prerequisite: COMP-1000 and 2087, Prerequisite or Co-requisite: COMP-2087. Antirequisite: COMP2540) (May not be used to fulfill the major requirements of any major or joint major in Computer Science, except for the Bachelor of Information Technology (BIT) program. This course can not be taken as a substitute for COMP-2540)(3 lecture hours a week).

Typical Course Offering

COMP-2547 is typically offered in the Fall semester.

Is a Textbook Required?

There is currently no information about the Textbook requirement.

Prerequisites

COMP-1000 and COMP-2087 are the prerequisites for this class.