Computer Science (CSC) Courses>Introduction to Computer Architecture

CSC226 - Algorithms and Data Structures II

Description

Advanced techniques for design, analysis, and implementation of algorithms and data structures with an introduction to algorithm engineering. Algorithmic design paradigms: greedy, divide-and-conquer, dynamic programming, backtracking, branch and bound. Advanced Analysis techniques, such as amortization. Advanced data structures: hashing, disjoint sets. Advanced graph algorithms: network flow, connectivity, minimum spanning trees, shortest paths. Mathematical tools: graphs and digraphs, graph properties, planar graphs, networks; discrete probability, counting techniques, recurrences.

Units

1.5

Hours: lecture-lab-tutorial

3-1-0

Formerly

CSC 326

Note(s)

  • Credit will be granted for only one of CSC 226, CSC 326.

Prerequisites

  • Complete all of:
    • CSC225 - Algorithms and Data Structures I (1.5)

Course offered by

Department of Computer Science

Course schedules

Summer timetable available: February 15. Fall and Spring timetables available: May 15.

Use the buttons below to search the timetable. If the search results show 0 classes and the message ‘Please search again’, then the class is not scheduled for the selected term.