Data Structures and Algorithms IILaajuus (4 cr)

Objective

Learning outcomes: The student will know how to analyse asymptotic time complexity of algorithms, including recursive algorithms and can measure and extrapolate running real time of programs understand basic concepts of graphs, graph properties and graphs as abstract data types understand elementary graph algorithms and is able to design, implement, and analyse simple graph algorithms know elementary algorithm strategies and be able to apply those know how to use mass storage efficiently and be able to analyse running time of algorithms using mass storage

Content

Algorithms and running time analysis. Experimental time complexity analysis. Graphs, graph algorithms, and applying graph algorithms. Using mass storage efficiently

Qualifications

Data Structures and Algorithms I

Materials

T