Data Structures and Algorithms
Description
Introducing insights in and experience with datastructures and algorithms, which are generally usable for the development of softwaresystems. Knowing the generally usable datastructures, e.g.: lists, trees and graphs. Having insight in diverse representations of datastructures, having insight in the advantages and disadvantages of different representations and being able to implement a number of these representations. Having insight in the important algorithms for the manipulation of datastrustures and being able to implement a number of these algorithms. Being able to assess the qualities of generally usable algorithms, including complexity. Being able to assimilate a basic level scientific publication on the subject and communicate on it. Being able to analyse a simple problem statement and to design and implement a solution for it.
Preview the 5 closest equivalencies already indexed in our system
X0A45A has possible credit equivalents including COMP251 at McGill University.