NOTICE: is experiencing limited functionality. We are working to resolve the issue.

More details

Algorithm Analysis and Data Structure (CSTP 1305)

Students learn the fundamentals of algorithm design and analysis through hands-on practice with various popular algorithms and data structures used in software development. Students learn how to analyze the time and space complexity of an algorithm and learn how to test and choose the right solution for a non-trivial programming problem. The emphasis is on developing practical skills as well as the conceptual mastery of efficient algorithm selection. Important data structures covered in this course include: Arrays and Vectors, Trees and Graphs. Popular algorithms and design strategies covered include: Recursion vs Iteration, Divide and Conquer, Greedy Techniques and basic sorting algorithms.
CSTP 1205 Programming in C++

course outline

* Note: The CRNs listed below could be restricted to specific program areas.

CRN Fee Campus - Room Day(s) Time Date Instructor
TBATo Be Assigned TBATo Be Assigned
TBATo Be Assigned

Nezami, Reza

To register for this course, check the information for your program: