COURSE DESCRIPTION
This course introduces the broader discipline of computer science to people having basic familiarity with Java programming. Our intent is to demystify computation and to build awareness about the substantial intellectual underpinnings and rich history of the field of computer science.
First, we introduce classic algorithms along with scientific techniques for evaluating performance, in the context of modern applications. Next, we introduce classic theoretical models that allow us to address fundamental questions about computation, such as computability, universality, and intractability. We conclude with machine architecture (including machine-language programming and its relationship to coding in Java) and logic design (including a full CPU design built from the ground up).
The course emphasizes the relationships between applications programming, the theory of computation, real computers, and the field's history and evolution, including the nature of the contributions of Boole, Shannon, Turing, von Neumann, and others.
Length: 10 Weeks
Effort: 2-5 hours per week
Price: FREE
Provider: Princeton University via Coursera
Subject: Computer Science
Level: Intermediate
Languages: English
Instructors: Robert Sedgewick, William O. Baker, Kevin Wayne
[parsehtml]<a class="button" style="height: 100%; padding:14px 14px 14px 14px !important; color: white; font-size: 18px; font-weight: bold; margin-bottom: 10px;" href="https://www.coursera.org/learn/cs-algorithms-theory-machines"target="_blank">> Go To Course</a>[/parsehtml]
This course introduces the broader discipline of computer science to people having basic familiarity with Java programming. Our intent is to demystify computation and to build awareness about the substantial intellectual underpinnings and rich history of the field of computer science.
First, we introduce classic algorithms along with scientific techniques for evaluating performance, in the context of modern applications. Next, we introduce classic theoretical models that allow us to address fundamental questions about computation, such as computability, universality, and intractability. We conclude with machine architecture (including machine-language programming and its relationship to coding in Java) and logic design (including a full CPU design built from the ground up).
The course emphasizes the relationships between applications programming, the theory of computation, real computers, and the field's history and evolution, including the nature of the contributions of Boole, Shannon, Turing, von Neumann, and others.
Length: 10 Weeks
Effort: 2-5 hours per week
Price: FREE
Provider: Princeton University via Coursera
Subject: Computer Science
Level: Intermediate
Languages: English
Instructors: Robert Sedgewick, William O. Baker, Kevin Wayne
[parsehtml]<a class="button" style="height: 100%; padding:14px 14px 14px 14px !important; color: white; font-size: 18px; font-weight: bold; margin-bottom: 10px;" href="https://www.coursera.org/learn/cs-algorithms-theory-machines"target="_blank">> Go To Course</a>[/parsehtml]