À propos de ce cours : 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.
Enseigné par : Scott Rixner, Professor
Computer Science
Enseigné par : Joe Warren, Professor
Computer Science
Enseigné par : Luay Nakhleh, Associate Professor
Computer Science; Biochemistry and Cell Biology
| Informations de base | Cours 4 de 7 dans Fundamentals of Computing Specialization |
| Engagement | 4 weeks of study, 7-10 hours/week |
| Langue | English |
| Comment réussir | Réussissez tous les devoirs notés pour terminer le cours. |
| Notes des utilisateurs |
- Vidéo: Introduction
- Vidéo: The Importance of Searching
- Vidéo: Generators
- Vidéo: Stacks and Queues
- Vidéo: Inheritance
- Vidéo: Grid Class
- Vidéo: Grid search
- Vidéo: 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
- Vidéo: CodeSkulptor (optional video from our previous class)
- Vidéo: Saving in CodeSkulptor (optional video from our previous class)
- Vidéo: Beyond CodeSkulptor (optional video from our previous class)
- Vidéo: The Importance of Recursion
- Vidéo: Recursion
- Vidéo: Binary Search
- Vidéo: Visualizing Recursion
- Vidéo: Recurrences
- Vidéo: Reading Files
- Vidéo: 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
- Vidéo: The Importance of Trees
- Vidéo: Lambda
- Vidéo: Trees
- Vidéo: Illustration of Trees
- Vidéo: Minimax
- Vidéo: 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
- Vidéo: The Importance of Modeling
- Vidéo: Assertions
- Vidéo: Invariants
- Vidéo: Modeling
- Vidéo: Software Development
- Reading: The Basics of the Fifteen Puzzle
- Vidéo: Mini-project Video
- Reading: Mini-project Description
- Reading: Math Notes on Invariants
- Reading: Practice Activity - Solitaire Tantrix
- Vidéo: 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.
| Acheter le cours | |
|---|---|
| Accéder au contenu du cours | Disponible |
| Accéder au contenu noté | Disponible |
| Recevoir une Note Finale | Disponible |
| Obtenir un Certificat de Cours partageable | Disponible |
I came to PoC Part 2 via Rice's IIPP courses and PoC Part 1. The PoC series is a step up in difficulty from IIPP. The homework assignments usually took me several hours to complete and the mini-projects all took around 10 hours (maybe more) to complete. If you have lots of programming experience, I expect the mini-project would take you less time, at least once you've conceptualized how to solve the problem/project. And it is this thinking - rather than programming - that is the main thing the instructors want students to take away from this course. In other words, this is not an intermediate Python course. But it is a great class. You'll get an introduction to searches, data structures, recursion, trees, and how to test your software. And like IIPP, the mini-projects are based a fun games.
Very enlightening. Excellent assistance from staff.
Excellent course. I tried several similar courses on Edx and Coursera platforms and found this as the most efficient. The lectures are clearly stated and always accompanied by reading material, which makes it easy to repeat the material.
Practical tasks are very interesting and help to develop practical skills.
It is a wonderful opportunity to learn Python and fundamentals of computing. I highly recommend this course to everyone interested in this subject.
Another entertaining and great course in the series with really well-designed and engaging projects.
I am getting sad I'm running out of courses to take from Rixner, Warren, et al. They are superb.
CodeSkuptor and OwlTest are really easy to use and handy tools (although I've had some issues with OwlTest not working all of the time).