|
所在平台: Coursera |
课程主页: https://www.coursera.org/learn/cpsc-8400-design-and-analysis-of-algorithms
课程评论：没有评论
课程名称：算法设计与分析 课程概述：算法研究是计算学科基础的重要组成部分。近年来，算法计算机科学的研究迅速发展，对科学和工业的几乎所有领域产生了深远影响。本课程为研究生级别，旨在广泛而深入地介绍现代算法研究。课程的主要目标是：提升学生在算法应用方面的能力。 课程大纲： 1. **模块1：初步概念与基础** - 描述：学习算法性能分析、计算模型、基本数据结构、算法设计技术和常见排序算法。 - 工作量：1周 2. **模块2：编程作业#1** - 描述：要求学习者将模块1中获得的知识应用于一个包含3个部分的编程作业。 - 工作量：1周 3. **模块3：随机化** - 描述：介绍期望运行时间和平均案例性能的分析方法，随机快速排序和快速选择的应用，随机算法与数据结构的实例，以及“高概率”界限。 - 工作量：1周 4. **模块4：递归** - 描述：讲解分析递归算法的技术（“分而治之”）、递归思维及在算法设计中的递归实例。 - 工作量：1周 5. **模块5：编程作业#2** - 描述：鼓励学习者将之前模块（特别是模块4）中获得的知识应用于第二个编程作业。 - 工作量：1周 6. **模块6：基本数据结构** - 描述：涵盖优先队列、用于表示集合、映射和序列的二叉搜索树，以及随机和平摊树平衡机制和扫描线方法。 - 工作量：1周 通过本课程，学习者将掌握算法分析的核心理念，从而为计算机科学的进一步研究奠定坚实的基础。
Name:Module 1: Preliminary Concepts and Fundamentals
Description:This module covers how to analyze performance of algorithms, models of computation, basic data structures, algorithm design techniques, and common sorting algorithms. [Workload: 1 Week]
Name:Module 2: Programming Assignment #1
Description:This module asks learners to apply the knowledge gained in Module 1 to a Programming Assignment with 3 parts. [Workload: 1 Week]
Name:Module 3: Randomization
Description:This module covers methods for analyzing expected running time and average-case performance, randomized quicksort and quickselect, examples of randomized algorithms and data structures, and "high probability" bounds. [Workload: 1 Week]
Name:Module 4: Recursion
Description:This module covers techniques for analyzing recursive algorithms ("divide and conquer"), recursive thinking, and examples of recursion in algorithm design. [Workload: 1 Week]
Name:Module 5: Programming Assignment #2
Description:This module asks learners to apply the knowledge gained in previous modules, particularly Module 4, to a Programming Assignment. [Workload: 1 Week]
Name:Module 6: Fundamental Data Structures
Description:This module covers priority queues, binary search trees for representing sets, maps, and sequences, randomized and amortized tree balancing mechanisms, and sweep line methods. [Workload: 1 Week]
The study of algorithms is a significant part of the foundation for the discipline of computing. Over the past several decades, research in algorithmic computer science has advanced at a rapid pace its contributions have had a profound impact on almost every area of science and industry. In this graduate-level course, we aim to provide a modern introduction to the study of algorithms that is both broad and deep. The primary goals of the course are: (1) to become proficient in the application of
