🌐 Public

Computer Science Fundamentals

By Steven Otto

Introduction

Computers pervade our daily live, but do you know how they work under the hood? This playlist teaches the fundamentals of the art of computing. Be aware that computing science is about the theory and applied mathematics and less so about learning how to program.

Steven Otto — Tech-savvy UX/UI Designer from Leiden, The Netherlands.

Added by Steven Otto: “Single variable calculus

3 Single variable calculus

About the CourseCalculus is one of the grandest achievements of human thought, explaining everything from planetary orbits to the optimal size of a city to the periodicity of a heartbeat. This brisk course covers the core ideas of single-variable Calculus with emphases on conceptual understanding and applications. The course is ideal for students beginning in the engineering, physical, and social

4 Introduction to Computer Science and Programming

Course FeaturesCourse DescriptionThis subject is aimed at students with little or no programming experience. It aims to provide students with an understanding of the role computation can play in solving problems. It also aims to help students, regardless of their major, to feel justifiably confident of their ability to write small programs that allow them to accomplish useful goals. The

Added by Steven Otto: “Learn how to think recursively with Scheme.

5 The Little Schemer

The book is a new edition of The Little LISPer, Third Edition. We have substantially revised the existing material and added a chapter and a half. The book and its sequel, The Seasoned Schemer, appeared with MIT Press in December 1995. The chapter includes the discussion of the Y operator from "Why Y Works".

Added by Steven Otto: “The essence of software engineering

6 Structure and Interpretation of Computer Programs

1 Building Abstractions with Procedures 1.1 The Elements of Programming 1.1.1 Expressions 1.1.2 Naming and the Environment 1.1.3 Evaluating Combinations 1.1.4 Compound Procedures 1.1.5 The Substitution Model for Procedure Application 1.1.6 Conditional Expressions and Predicates 1.1.7 Example: Square Roots by Newton's Method 1.1.8 Procedures as Black-Box Abstractions 1.2 Procedures and

Added by Steven Otto: “This interactive tutorial teaches you Assembly 6502. It's the lowest level of abstraction in computers. Assembly language translates directly to the bytes that are executed by your computer’s processor.

7 Easy 6502 by skilldrick

8 Mathematics for Computer Science

This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds: Fundamental Concepts of Mathematics: Definitions, Proofs, Sets, Functions, Relations Discrete Structures: Modular Arithmetic, Graphs, State Machines, Counting Discrete Probability Theory A version of this course from a previous term was also taught as part of the Singapore-MIT Alliance (SMA) programme ...

10 Artificial Intelligence

Course FeaturesCourse HighlightsThis course includes interactive demonstrations which are intended to stimulate interest and to help students gain intuition about how artificial intelligence methods work under a variety of circumstances. Course DescriptionThis course introduces students to the basic knowledge representation, problem solving, and learning methods of artificial intelligence. Upon completion of 6.034, students should be able to develop intelligent systems

11 6.004: Computation Structures - Lecture 2

Recorded on 2/9/12 In 6.004: Computation Structures, students should feel comfortable using computers. A rudimentary knowledge of programming language concepts and electrical fundamentals (8.02) is assumed. Each student must have an Athena account to access the software used to complete the lab assignments.

13 Elements of Software Construction

Course FeaturesCourse DescriptionThis course introduces fundamental principles and techniques of software development. Students learn how to write software that is safe from bugs, easy to understand, and ready for change. Topics include specifications and invariants; testing, test-case generation, and coverage; state machines; abstract data types and representation independence; design patterns for object-oriented programming; concurrent programming, including message passing and shared

Andrey Zherebtsov

Freshman

  • 0 Playlists
  • 0 Followers

Vika Skorik

Freshman

  • 0 Playlists
  • 0 Followers

prasanna srinivas

Freshman

  • 0 Playlists
  • 0 Followers

Hiep Vu

Freshman

  • 0 Playlists
  • 0 Followers

silver380

Freshman

  • 0 Playlists
  • 0 Followers

Todos

Freshman

  • 0 Playlists
  • 0 Followers

Tim Robertson

Freshman

  • 0 Playlists
  • 0 Followers

Johannes Winger-Lang

Freshman

  • 0 Playlists
  • 0 Followers

wqm9425

Freshman

  • 0 Playlists
  • 0 Followers

Artem Tutov

Freshman

  • 0 Playlists
  • 0 Followers

shoroukhossam

Freshman

  • 0 Playlists
  • 0 Followers

Maria Brovarska

Freshman

  • 0 Playlists
  • 0 Followers

sirish aditya

amateur knowledge geek

  • 0 Playlists
  • 0 Followers

Arek Mycek

Freshman

  • 0 Playlists
  • 0 Followers

HoudiniLogic359

Freshman

  • 0 Playlists
  • 0 Followers

anasiguer

Freshman

  • 0 Playlists
  • 0 Followers

DarrDon

Freshman

  • 0 Playlists
  • 0 Followers

schoenflies

Freshman

  • 2 Playlists
  • 0 Followers

Jessica Wilson

Freshman

  • 0 Playlists
  • 0 Followers

chety clooney

Freshman

  • 1 Playlists
  • 0 Followers
Load more

Delete your comment

Are you sure you want to delete your comment?