Computer SystemsIndividualComputer SystemsDesigning and Configuring Computer | Alexander | Kate Hudson
Author: Apple on 28-03-2016, 13:27

Coursera  Stanford University, Automata
Coursera: Stanford University - Automata
WEBRip | English | MP4 + PDF Slides | 960 x 540 | AVC ~25.3 kbps | 15 fps
AAC | 128 Kbps | 44.1 KHz | 2 channels | Subs: English (.srt) | 11:38:38 | 798.6 MB

Genre: eLearning Video / Development, Programming
The course will have a number of homeworks that are designed using the Gradiance technology. The objective of these homeworks is to enable everyone to get 100% and learn the underlying material. While questions look like multiple choice,
you should think of them as more conventional "solve this problem and submit the solution" questions. That is, you are given a problem to solve, which you should work completely. Then, you are given a random choice of responses that are designed to figure out whether you got the right solution or not. If you do have the right solution, you should be able to answer the question easily, regardless of the choices presented.
If you get it wrong, you will be given a hint and allowed to try again. Your score on a homework is the maximum of any try. We group about 5 questions together, so you can't repeatedly guess each question independently, without actually doing the work.

In the first week's videos, you will begin with an introduction to the whole course. I want to try to convince you of the value of learning the four big concepts that you can take away from this course: finite automata, context-free grammars, undecidable problems, and intractable problems (NP-completeness). The second video is an informal introduction to finite automata. Both these two first videos are "light," and I expect you to have little trouble. The third video introduces deterministic finite automata, and at this point we start to get more formal. In the fourth video, the important concept of nondeterminism is introduced. We learn the remarkable fact that despite the almost "magic" capability of nondeterminism, it does not add power to the finite automaton (although it does make description of many applications of automata a lot easier).

Courses list:
Week 1: Finite Automata
Week 2: Regular Expression and Properties of Regular Languages
Week 3: Context-Free Grammars and Pushdown Automata
Week 4: Pushdown Automata and Properties of Context-Free Languages
Week 5: Turing Machine
Week 6: Intractable Problems and NP-completeness
Problem Session

Buy Premium From My Links To Get Resumable Support,Max Speed & Support Me

Dear visitor, you are browsing our website as Guest.
We strongly recommend you to register and login to view hidden contents.

Would you like to leave your comment? Please Login to your account to leave comments. Don't have an account? You can create a free account now.

Register | Forgot Password
Link 1
Designed by
Go Daddy Web Hosting! A completely unique experience - only  $1.99 / mo from Go Daddy! - 468x60