Get updates on Eligibility, Admission, Placements Fees Structure
Quick Facts
| Medium Of Instructions | Mode Of Learning | Mode Of Delivery |
|---|---|---|
| English | Self Study, Virtual Classroom | Video and Text Based |
Course Overview
The Algorithms and Data Structures certification is a 10 weeks online programme. This programme requires the attention of students for only 5-10 hours every week. It is a successful launch of Carnegie Mellon University's School of Computer Science Executive Education, and Emeritus. The curriculum offered in all 10 modules keeps a focus on a particular type of data structure or algorithm, that includes computational application of theories.
Algorithms and Data Structures training will allow participants to present themselves by solving real-world problems for correctness and efficiency. The entire course is expressed in very simple English that anyone who has a very basic understanding of basic mathematics and coding can easily decipher. The end certificate will provide an experience that is invaluable and help broaden the knowledge base of all the participating candidates thus helping in their career advancement.
The Highlights
- 10 weeks course
- 5-10 hours of classes
- Online course
- Renowned Faculty
- Certificate of completion
- Flexible payment options
Programme Offerings
- 10 Weeks
- Online Course
- completion certificate
- Try-it activities
- Luve Faculty Sessions
- Live office hours
- Knowledge checks
- Programming Assignments
- Discussion Board Activities
Courses and Certificate Fees
| Certificate Availability | Certificate Providing Authority |
|---|---|
| yes | CMU School of Computer Science, Pittsburgh |
The Algorithms and Data Structures certification fee is US$2,500. The fee can be paid using flexible options of installments and using a special corporate discount of 20% for group enrolments.
The Algorithms and Data Structures Fee Structure
Description | Amount in USD |
Programme Fee | US$2,500 |
Eligibility Criteria
Educational Qualification
Participants must be familiar with calculus and probability and must be possessing a working knowledge of one programming language. Also Python, and Jupyter Notebook are not mandatory but can be preferable.
Certification qualifying details
After the participants complete their activities by 60% they shall be receiving Algorithms and Data Structures certification by Carnegie Mellon University's School of Computer Science Executive Education.
What you will learn
After the Algorithms and Data Structures certification syllabus completion, the candidates will be able to:
- All the concepts of algorithms and data structures can be examined by the candidates.
- The candidates will be able to apply standardized building blocks of algorithms.
- The candidates will learn to verify the efficiency of algorithms.
- These participants will practice algorithms by using Python.
- It will be possible for the candidates to explore real-world applications related to data structures.
Who it is for
The people who should be attending this Algorithms and Data Structures online course are:
- People who are already established as software engineers but want an understanding that is advanced in the field of data structures, and algorithms.
- People who are technology graduates, and have just begun their careers and want to test their skills at the jobs marketplace.
Admission Details
Here is Algorithms and Data Structures admission process:
Step 1: Get started by visiting the main official website: https://execonline.cs.cmu.edu/algorithms-data-structures
Step 2: Then after scrolling down move a step further by clicking the ‘Apply Now’ button.
Step 3: After the button is clicked, the candidates will have to re-login on the Emeritus.
Step 4: Then details of the form for application must be filled in as the next step.
Step 5: The admission confirmation is based on how fast the application form and fee are submitted.
Application Details
The requisite fields to be filled up by the candidates in the application form are the city, state, street address, work-related details like current company, job titles, designation, and others.
The Syllabus
- Illustrating the key components of an algorithm and the notations used for time complexity
- Performing recurrence analysis and analyzing the time complexity of merge-sort and quick-select algorithms
- Explaining the concept of concrete models as well as tight upper and lower bounds
- Applying the information-theoretic and adversary techniques to prove upper and lower bounds of computational problems
- Explaining what a greedy algorithm is and how to design such algorithms
- Proving the optimality of greedy algorithms
- Developing and implementing dynamic programming
- Comparing the bottom-up and the top-down approaches to dynamic programming
- Examining the properties of hashing and applying it to the dynamic dictionary problems
- Using hashing to solve problems on data streams
- Finding the maximum flow and minimum cut of a given network
- Designing and implementing network flow algorithms to solve problems
- Exploring LP solutions for the min-cut max-flow and the operations research problems
- Applying LP algorithms, such as the Simplex algorithm
- Proving a problem is NP-complete
- Developing approximation algorithms to solve NP-complete problems
- Using the multiplicative weights framework to solve problems
- Proving the correctness of multiplicative weight algorithms
- Examining the fundamentals of the GD framework and convexity
- Implementing GD algorithms to solve convex optimization problems
Instructors
CMU School of Computer Science, Pittsburgh Frequently Asked Questions (FAQ's)
The knowledge of Python is not at all essential but having knowledge may be preferred.
There are 10 modules that are taught in 10 weeks.
Without registration on Emeritus, no students can access the application form.
The programme fee can be deposited through 3 installments.
The online duration is 10 weeks.