关于此课程： This two-part course introduces the basic mathematical and programming principles that underlie much of Computer Science. Understanding these principles is crucial to the process of creating efficient and well-structured solutions for computational problems. To get hands-on experience working with these concepts, we will use the Python programming language. The main focus of the class will be weekly mini-projects that build upon the mathematical and programming principles that are taught in the class. To keep the class fun and engaging, many of the projects will involve working with strategy-based games. In part 2 of this course, the programming portion of the class will focus on concepts such as recursion, assertions, and invariants. The mathematical portion of the class will focus on searching, sorting, and recursive data structures. Upon completing this course, you will have a solid foundation in the principles of computation and programming. This will prepare you for the next course in the specialization, which will begin to introduce a structured approach to developing and analyzing algorithms. Developing such algorithmic thinking skills will be critical to writing large scale software and solving real world computational problems.
教学方： Scott Rixner, Professor
Computer Science教学方： Joe Warren, Professor
Computer Science教学方： Luay Nakhleh, Associate Professor
Computer Science; Biochemistry and Cell Biology
| 基本信息 | 课程 4（共 7 门，Fundamentals of Computing Specialization ） |
| 承诺学习时间 | 4 weeks of study, 7-10 hours/week |
| 语言 | English, 字幕： Romanian |
| 如何通过 | 通过所有计分作业以完成课程。 |
| 用户评分 |
- 视频: The Importance of Searching
- 视频: Generators
- 视频: Stacks and Queues
- 视频: Inheritance
- 视频: Grid Class
- 视频: Grid search
- 视频: Mini-project Video
- Reading: Mini-project Description
- LTI Item: Assignment Submission History
- Reading: Math Notes on Growth Rates of Functions
- Reading: Math Notes on Grid Representations
- Reading: Math Notes on Breadth-First Search
- Reading: Practice Activity - Sorting strings
- Reading: Practice Activity - Working with Distance Fields
- 视频: CodeSkulptor (optional video from our previous class)
- 视频: Saving in CodeSkulptor (optional video from our previous class)
- 视频: Beyond CodeSkulptor (optional video from our previous class)
- 视频: Recursion
- 视频: Binary Search
- 视频: Visualizing Recursion
- 视频: Recurrences
- 视频: Reading Files
- 视频: Mini-project Video
- Reading: Mini-project Description
- Reading: Math Notes on Recurrence Relations
- Reading: Practice Activity - Recursion
- Reading: Practice Activity - Binary representations for numbers
- Reading: Practice Activity - Visualizing recurrences
- 视频: Lambda
- 视频: Trees
- 视频: Illustration of Trees
- 视频: Minimax
- 视频: Mini-project Video
- Reading: Mini-project Description
- Reading: TTTBoard Class
- Reading: Math Notes on Trees
- Reading: Math Notes on Minimax
- Reading: Practice Activity - Nim (Tree search)
- Reading: Practice Activity - Drawing trees
- 视频: Assertions
- 视频: Invariants
- 视频: Modeling
- 视频: Software Development
- Reading: The Basics of the Fifteen Puzzle
- 视频: Mini-project Video
- Reading: Mini-project Description
- Reading: Math Notes on Invariants
- Reading: Practice Activity - Solitaire Tantrix
- 视频: What is Algorithmic Thinking?
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.
| 购买课程 | |
|---|---|
| 访问课程材料 | 可用 |
| 访问评分的材料 | 可用 |
| 收到最终成绩 | 可用 |
| 获得可共享的课程证书 | 可用 |
projects are tough at least for me it was but once you finish all the project, that rewarding feeling is just awesome
wonderfully fun assignments!:)
Last one is killer... hardest one I faced on Coursera!:)
little bit hard to solve the assignment.
Even though it took much more time to solve the assignments and practice activity, this class was awesome.
Am
Great course.