Algorithms and Data Structures (CSTP 2140)
Students learn the fundamentals of algorithm analysis and design through hands-on practice in this course. They study various algorithms and data structures frequently used in software development. Students learn to analyze the time and space complexities of algorithms and choose algorithms for non-trivial programming problems.
Data structures covered in this course include: arrays and vectors, lists, queues, stacks, and trees and graphs. Algorithms covered include: recursion, divide and conquer, greedy techniques and sorting algorithms.
Data structures covered in this course include: arrays and vectors, lists, queues, stacks, and trees and graphs. Algorithms covered include: recursion, divide and conquer, greedy techniques and sorting algorithms.
Course code: CSTP 2140
Credits: 3.0
Tuition: $0
Length: 60.0 hours
Course outline:
view
https://www.vcc.ca/vccphp/courseoutline?subject=CSTP&number=2140
Prerequisites
CSTP 1204 or equivalent, taken prior to or concurrently.
No schedule is currently available. Please check again later.
0
Additional Information
- The fundamentals of algorithm analysis
- Vectors and Arrays
- Lists
- Iteration vs Recursion
- Common Sorting algorithms
- Time and space complexity analysis
- Divide and conquer and greedy algorithms
- Stacks and queues
- Graphs
- Binary trees and balanced binary trees
- Tree traversal algorithms
This course is offered as part of a VCC program only.
Ask a question
* The amount shown is the approximate cost of tuition (for courses with tuition) or fees (for courses that do not have tuition).
Tuition and Fees are approximate and subject to change. Students are required to pay any applicable fee increases. Fees listed are for domestic students. For international programs, visit VCC International.
† This information is intended as a guideline only. Program and course details are subject to change with the approval of VCC's Board of Governors.