Education
| Graduate Course Details | |
|---|---|
| Number | NGP 881 |
| Title | Inquiry Based Learning & Teaching |
| Credits | 3.0 |
| Prerequisites | CSC260 and MAT214A |
Description
|||CSC 415
Advanced concepts from data structures and general algorithms are discussed from both theoretical and applied viewpoints. Topics covered include multi lists, graph theory, searching and sorting algorithms, and general n-way tree structures. Techniques for analysis of algorithms for average and best/worst cases are presented. Laboratory work may involve programming in a high level language. Three lecture hours per week.