Home Princeton University, Princeton Courses Computer Science Algorithms, Theory and Machines Computer Science: Algorithms, Theory, and Machines Learn about the fundamentals of computation through this online certification course by Coursera.
Intermediate
Online
2 Weeks
Interested in this College? Get updates on Eligibility, Admission, Placements Fees Structure
Brochure Compare Quick Facts Medium Of Instructions Mode Of Learning Mode Of Delivery English Self Study Video and Text Based
Course Overview The Computer Science: Algorithms, Theory, and Machines Certification Course is a 100% online course that explores the nuances and concepts of computation. The intermediate-level course will deal with classic algorithms, classic theoretical models, and modern applications of computation. The course can be easily accessed on the Coursera online learning platform.
The Computer Science: Algorithms, Theory, and Machines Training will be provided by the Computer Science faculty of Princeton University. The Computer Science: Algorithms, Theory, and Machines Certification Course by Coursera and Princeton University will be available for free and there will be no certificates awarded to candidates.
The Highlights Free course Flexible deadlines 100% online Video lectures Practice exercises Academic readings Graded assignments Peer feedback English medium Financial aid Subtitles in English, Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, Spanish. Programme Offerings free course Flexible Deadlines 100% Online English medium English Subtitles financial aid video lectures Practice Exercises Academic Readings Graded Assignments Multiple-Choice Exercises In-Video Quizzes peer feedback. Courses and Certificate Fees Certificate Availability no
What you will learn Computer skills Programming skills Knowledge of Algorithms
After completing the Computer Science: Algorithms, Theory, and Machines Certification Classes, you will learn about the following topics:
Classic algorithms Fundamental stack and queue abstractions Linked structures Binary search trees, Formal languages and abstract machines, Turing Machines Design of computer processor von Neumann machines Who it is for Admission Details Follow the given steps to enroll in the Computer Science: Algorithms, Theory, and Machines Online Course:
Step 1: Click on the URL given below -
https://www.coursera.org/learn/cs-algorithms-theory-machines
Step 2: Click on the “Enroll for Free” option and choose the desired option.
Step 3: Fill in the required details and complete the process.
The Syllabus Videos A typical client Binary search Insertion sort Mergesort Longest repeated substring Readings Getting Started Supplements for Lecture 11 Optional Enrichment on Sorting and Searching Assignment Videos APIs Clients Strawman implementations Linked lists Implementations Readings Supplements for Lecture 12 Optional Enrichment on Stacks and Queues Assignment Videos APIs and clients A design challenge Binary search trees Implementation Analysis Readings Supplements for Lecture 13 Optional Enrichment on Symbol Tables Assignment Videos Overview Regular Expressions DFAs Applications Limitations Readings Supplements for Lecture 14 Optional Enrichment on Theory of Computing Assignment Videos Context A simple model of computation Universality Computability Implications Readings Supplements for Lecture 15 Optional Enrichment on Turing Machines Assignment Videos Reasonable questions P and NP Poly-time reductions NP-completeness Living with intractability Readings Supplements for Lecture 16 Optional Enrichment on Intractability Assignment Videos Overview Data Types Instructions Operating the machine Machine language programming Readings Supplements for Lecture 17 Optional Enrichment on A Computing Machine Assignment Videos Perspective A note of caution Practical implications Simulation Readings Supplements for Lecture 18 Optional Enrichment on von Neumann Machines Assignment Videos Building blocks Boolean algebra Digital circuits Adder circuit Arithmetic/logic unit Readings Supplements for Lecture 19 Optional Enrichment on Combinational Circuits Assignment Videos Overview Bits, registers, and memory Program counter Components and connections Readings Supplements for Lecture 20 Optional Enrichment on the CPU Assignment Princeton University, Princeton Frequently Asked Questions (FAQ's) 1: How much time does it require to finish the course?
The course requires a total of 2 weeks for completion.
2: Can I get placement help for the course?
No, the Computer Science: Algorithms, Theory, and Machines Online Course does not provide placement help.
3: Will I get a certificate for the course?
No, the candidates of the course will not receive a certificate for the course.
4: What is the mode of assessments for the course?
The mode of assessment for the course includes multiple-choice exercises and in-video quizzes.
5: Can I get access to all course materials for free?
Yes, the Computer Science: Algorithms, Theory, and Machines Course is a free course wherein you will get access to all course materials free of cost.
Articles Latest Articles Other Important Articles