Algorithmic Thinking (Part 2)
Keep adding new skills with 10,000+ programs for $239 (usually $399). Save now.
Algorithmic Thinking (Part 2)
This course is part of Fundamentals of Computing Specialization
26,673 already enrolled
Included with
Learn more
Ask Coursera
220 reviews
220 reviews
Skills you'll gain
Tools you'll learn
Details to know
See how employees at top companies are mastering in-demand skills
Build your subject-matter expertise
- Learn new concepts from industry experts
- Gain a foundational understanding of a subject or tool
- Develop job-relevant skills with hands-on projects
- Earn a shareable career certificate
There are 4 modules in this course
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.
Sorting, searching, big-O notation, the Master Theorem
What's included
13 videos2 readings1 assignment
13 videosβ’Total 147 minutes
- What is Algorithmic Thinking? β’9 minutes
- The sorting problem β’12 minutes
- A simple quadratic algorithm β’10 minutes
- Illustrating MergeSort β’13 minutes
- The recurrence for MergeSort β’10 minutes
- The Master Theorem and MergeSort efficiency β’12 minutes
- Linear vs. binary search β’12 minutes
- Efficiency of binary search β’11 minutes
- Class structure (from part 1)β’10 minutes
- Coding styles and standards - PoCβ’12 minutes
- Testing and machine grading - PoCβ’11 minutes
- Plotting data - PoCβ’14 minutes
- Peer assessment - "We want a shrubbery!" - IIPPβ’11 minutes
2 readingsβ’Total 20 minutes
- Class notesβ’10 minutes
- Coding notesβ’10 minutes
1 assignmentβ’Total 30 minutes
- Homework #3β’30 minutes
Closest pairs of points, clustering of points, comparison of clustering algorithms
What's included
4 readings1 peer review2 app items
4 readingsβ’Total 40 minutes
- Project #3 Descriptionβ’10 minutes
- Tests and Tips for Implementing the Clustering Methodsβ’10 minutes
- Application #3 Descriptionβ’10 minutes
- Application #3 Solutionβ’10 minutes
1 peer reviewβ’Total 120 minutes
- Comparison of Clustering Algorithmsβ’120 minutes
2 app itemsβ’Total 120 minutes
- Project Submission Historyβ’60 minutes
- Assignment: Closest Pairs and Clustering Algorithmsβ’60 minutes
Dynamic programming, running time of DP algorithms, local and global sequence alignment
What's included
7 videos1 assignment
7 videosβ’Total 87 minutes
- The RNA secondary structure problem β’16 minutes
- A dynamic programming algorithm β’14 minutes
- Illustrating the DP algorithm β’12 minutes
- Running time of the DP algorithm β’8 minutes
- DP vs. recursive implementation β’14 minutes
- Global pairwise sequence alignment β’15 minutes
- Local pairwise sequence alignment β’8 minutes
1 assignmentβ’Total 30 minutes
- Homework 4β’30 minutes
Computation of sequence alignments, applications to genomics and text comparison
What's included
1 video3 readings1 peer review1 app item
1 videoβ’Total 8 minutes
- Class wrap-up β’8 minutes
3 readingsβ’Total 30 minutes
- Project #4 Descriptionβ’10 minutes
- Application #4 Descriptionβ’10 minutes
- Application #4 Solutionβ’10 minutes
1 peer reviewβ’Total 60 minutes
- Applications to Genomics and Beyondβ’60 minutes
1 app itemβ’Total 60 minutes
- Assignment: Computing Alignments of Sequencesβ’60 minutes
Earn a career certificate
Add this credential to your LinkedIn profile, resume, or CV. Share it on social media and in your performance review.
Instructors
Offered by
Explore more from Software Development
- Status: Free TrialR
Rice University
Course
- Status: PreviewN
Northeastern University
Course
- Status: Free Trial
- Status: Free Trial
Why people choose Coursera for their career
Learner reviews
- 5 stars
80.45%
- 4 stars
10.90%
- 3 stars
4.54%
- 2 stars
2.27%
- 1 star
1.81%
Showing 3 of 220
Reviewed on Mar 24, 2018
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.
Reviewed on Apr 28, 2018
Excellent class in the series. Even if computational biology is not your thing, the assignments are really interesting, fun and informative.
Reviewed on Sep 22, 2016
You cannot get easy answers for homework and it pushes you to think hard.
Frequently asked questions
To access the course materials, assignments and to earn a Certificate, you will need to purchase the Certificate experience when you enroll in a course. You can try a Free Trial instead, or apply for Financial Aid. The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile.
Yes. In select learning programs, you can apply for financial aid or a scholarship if you canβt afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, youβll find a link to apply on the description page.
More questions
Financial aid available,
ΒΉ Some assignments in this course are AI-graded. For these assignments, your data will be used in accordance with Coursera's Privacy Notice.
