关于此课程： Experienced Computer Scientists analyze and solve computational problems at a level of abstraction that is beyond that of any particular programming language. This two-part class is designed to train students in the mathematical concepts and process of "Algorithmic Thinking", allowing them to build simpler, more efficient solutions to computational problems. In part 2 of this course, we will study advanced algorithmic techniques such as divide-and-conquer and dynamic programming. As the central part of the course, students will implement several algorithms in Python that incorporate these techniques and then use these algorithms to analyze two large real-world data sets. The main focus of these tasks is to understand interaction between the algorithms and the structure of the data sets being analyzed by these algorithms. Once students have completed this class, they will have both the mathematical and programming skills to analyze, design, and program solutions to a wide range of computational problems. While this class will use Python as its vehicle of choice to practice Algorithmic Thinking, the concepts that you will learn in this class transcend any particular programming language.
教学方： Luay Nakhleh, Associate Professor
Computer Science; Biochemistry and Cell Biology
教学方： Scott Rixner, Professor
Computer Science
教学方： Joe Warren, Professor
Computer Science
| 基本信息 | 课程 6（共 7 门，Fundamentals of Computing Specialization ） |
| 级别 | Intermediate |
| 承诺学习时间 | 4 weeks of study, 7-10 hours/week |
| 语言 | English, 字幕： Spanish |
| 如何通过 | 通过所有计分作业以完成课程。 |
| 用户评分 |
- 视频: The sorting problem
- 视频: A simple quadratic algorithm
- 视频: Illustrating MergeSort
- 视频: The recurrence for MergeSort
- 视频: The Master Theorem and MergeSort efficiency
- 视频: Linear vs. binary search
- 视频: Efficiency of binary search
- 视频: Class structure (from part 1)
- Reading: Class notes
- Reading: Coding notes
- 视频: Coding styles and standards - PoC
- 视频: Testing and machine grading - PoC
- 视频: Plotting data - PoC
- 视频: Peer assessment - "We want a shrubbery!" - IIPP
- Reading: Project #3 Description
- Reading: Tests and Tips for Implementing the Clustering Methods
- LTI Item: Project Submission History
- Reading: Application #3 Description
- Reading: Application #3 Solution
- 视频: A dynamic programming algorithm
- 视频: Illustrating the DP algorithm
- 视频: Running time of the DP algorithm
- 视频: DP vs. recursive implementation
- 视频: Global pairwise sequence alignment
- 视频: Local pairwise sequence alignment
- Reading: Project #4 Description
- Reading: Application #4 Description
- Reading: Application #4 Solution
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
| 购买课程 | |
|---|---|
| 访问课程材料 | 可用 |
| 访问评分的材料 | 可用 |
| 收到最终成绩 | 可用 |
| 获得可共享的课程证书 | 可用 |
Excellent class in the series. Even if computational biology is not your thing, the assignments are really interesting, fun and informative.
Great class...Luay's lectures and problem sets were a great continuation to what Joe and Scott started. I suppose I will get started on Course 7 shortly.
Great course to learning computer science!
Great course!
Definitely learned a lot from the process of doing projects