前言（4）：建议的授课要点

最新推荐文章于 2026-01-06 09:10:26 发布

原创最新推荐文章于 2026-01-06 09:10:26 发布 · 714 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#algorithm #hierarchy #inheritance #sorting #features #graph

C#数据结构与算法专栏收录该内容

7 篇文章

订阅专栏

本课程大纲为一学期36课时的C#程序设计课程，涵盖编程基础、算法分析、数据结构等内容。学生将学习C#语言特性、面向对象编程、数据抽象等，并深入研究栈、队列、散列表、树、排序算法及图算法。

Suggested Course Outline

This text may be used in either a one semester or a two semester course. The course which I teach at Waterloo is a one-semester course that comprises 36 lecture hours on the following topics:

Review of the fundamentals of programming in C# and an overview of object-oriented programming with C#. (Appendix ). [4 lecture hours].
Models of the computer, algorithm analysis, and asymptotic notation (Chapters and ). [4 lecture hours].
Foundational data structures, abstraction, and abstract data types (Chapters and ). [4 lecture hours].
Stacks, queues, ordered lists, and sorted lists (Chapters and ). [3 lecture hours].
Hashing, hash tables, and scatter tables (Chapter ). [3 lecture hours].
Trees and search trees (Chapters and ). [6 lecture hours].
Heaps and priority queues (Chapter ). [3 lecture hours].
Algorithm design techniques (Chapter ). [3 lecture hours].
Sorting algorithms and sorters (Chapter ). [3 lecture hours].
Graphs and graph algorithms (Chapter ). [3 lecture hours].

Depending on the background of students, a course instructor may find it necessary to review features of the C# language. For example, an understanding of inner classes is required for the implementation of enumerations. Similarly, students need to understand the workings of classes, interfaces, and inheritance in order to understand the unifying class hierarchy discussed in Chapter .