Free Online Lectures and Courses for Computer Science
83 Courses
-
Computer Science II: Programming Abstractions
-
About the Introduction to Computer Science Series at Stanford
-
Similarity between C++ & Java: - syntax - variable types - operators - control structures
-
C++ Libraries - Standard Libraries
-
C++ Console I/O
-
Client Use of Templates
-
More Containers
-
Seeing Functions as Data: Specific Plot Functions
-
Common Mistakes Stumbled Upon: 'I'terator
-
Thinking Recursively
-
Refresh: Permute Code
-
Backtracking Pseudocode
-
Pointer Movie
-
Coding with Linked List
-
Selection Sort
-
Partitioning for Quicksort
-
Sort Template with Callback
-
Abstract Data Types
-
Rules of Template Implementation
-
Live Coding: Recap of the Vector-based Implementation for Stack
-
Buffer: Vector vs Stack
-
Map as Vector
-
Pathfinder Demo
-
Compare Map Implementations
-
Lexicon Case Study
-
Final Showdown
-
About the C++ Language, Quick History of C++, C++ Philosophy
-
-
Computer Science III: Programming Paradigms
-
Introduction to Programming Paradigms Course
-
Data Types - Interpretations
-
Converting Between Types of Different Sizes and Bit Representations Using Pointers
-
Creating a Generic Swap Function for Data Types of Arbitrary Size
-
Generic Lsearch - Prototype
-
Integer Stack Implementation - Constructor and Destructor
-
Problems with Ownership of Memory
-
Heap Management - How Information about Allocations are Stored in the Heap
-
How a Code Snippet is Translated into Assembly Instructions
-
More Detail about Activation Records - Layout of Memory During a Function Call
-
Moving from C Code Generation to C++ Code Generation: Basic Swap Example
-
Preprocessing Commands
-
Review of Compilation Process of a Simple Program
-
Sequential Programming vs. Concurrent Programming
-
Transitioning from Sequential Programming to Concurrent Programming in the Ticket Sale Example
-
Semaphores
-
Review of the Dining Philosopher Problem
-
Ice Cream Store Problem
-
Introduction to the Functional Paradigm (Scheme)
-
Car-Cdr Recursion Problem
-
Introduction to the Kawa Development Environment: Evaluation of Expressions
-
Writing a Recursive Power Set Function in Scheme
-
Scheme Memory Model
-
Overarching Features of Python
-
Python Object Model
-
XML Processing and Python
-
Introduction to Haskell
-
-
Computer System Engineering
-
Naming
-
Fault Isolation with Clients and Servers
-
Virtualization and Virtual Memory
-
Virtual Processors: Threads and Coordination
-
Performance
-
Introduction to Networks
-
Layering and Link Layer
-
Network Layer, Routing
-
End-to-end Layer
-
Distributed Naming
-
Reliability
-
Atomicity Concepts
-
Recoverability
-
Isolation
-
Transactions and Consistency
-
Multi-site Atomicity
-
Security Introduction
-
Authentication
-
Authorization and Confidentiality
-
Advanced Authentication
-
Complex, Trusted Systems
-
-
Cryptography and Cryptanalysis
-
CS1: Higher Computing - Richard Buckland UNSW
-
Higher Computing - Richard Buckland UNSW 2008
-
Inside a Computer - Richard Buckland UNSW
-
Machine Code - Richard Buckland UNSW
-
Simple C Program - Richard Buckland UNSW
-
Clarity (C programming #2) - Richard Buckland UNSW
-
Solving Problems - Richard Buckland UNSW 2008
-
Side Effects - Richard Buckland UNSW 2008
-
Writing a Simple C Program - Richard Buckland
-
COMP1917 Higher Computing - Richard Buckland UNSW
-
COMP1917 Higher Computing - Richard Buckland UNSW: Part 1
-
COMP1917 Higher Computing - Richard Buckland UNSW: Part 2
-
A Simple Recursive Function - Richard Buckland UNSW
-
Functions - Richard Buckland UNSW
-
What To Do When Things Go Wrong? Richard Buckland UNSW
-
The Mechanics of Function Calls - Richard Buckland UNSW
-
The Mechanics of Function Calls (part 2) - Richard Buckland UNSW
-
The Amazing Alan Turing - Richard Buckland (extension lecture) UNSW 2008
-
The Turing Test - Richard Buckland UNSW
-
UNSW COMP1917 Higher Computing 2008 S1W4L3
-
Frames (revision) - Richard Buckland (UNSW)
-
Arrays (part 1) - Tim Lambert UNSW
-
Arrays (part 2) - Tim Lambert UNSW
-
Pass By Reference: Arrays#3 - Tim Lambert UNSW
-
Game Design - Malcolm Ryan UNSW
-
Everything U Need 2 Know About Pointers -Richard Buckland
-
The Most Important Thing - Richard Buckland UNSW
-
Stack Frames - Richard Buckland UNSW
-
eXtreme Programming - Richard Buckland
-
A Miracle - Richard Buckland UNSW
-
Programming in the Large - Richard Buckland UNSW
-
Stress - Richard Buckland UNSW
-
Random Numbers - Richard Buckland UNSW (2008)
-
The Trouble with Concrete Types - Richard Buckland UNSW
-
Abstract Data Types in C - Richard Buckland UNSW
-
The Major Project - Richard Buckland UNSW
-
Task2 rewritten as an ADT - Richard Buckland UNSW
-
Steganography (hidden messages) - Richard Buckland UNSW
-
Don't give up - Richard Buckland UNSW
-
The Australian National Anthem - Richard Buckland UNSW
-
Linked Lists - Richard Buckland UNSW
-
Experimenting with CMOS - Richard Buckland UNSW
-
Complexity & Trees - Richard Buckland UNSW
-
Programming Errors - Richard Buckland UNSW
-
Taste of Graphics - Tim Lambert, Yose Widjaja UNSW
-
Sample Tree Code: Loop Detection - Richard Buckland UNSW 2008
-
Ethics - Richard Buckland UNSW
-
Hamming Error Correcting Code - Richard Buckland UNSW
-
Professionalism - Richard Buckland UNSW
-
What Makes a Good Programmer? - Richard Buckland UNSW
-
The Entire Semester in 46 Minutes and 2 Seconds - Richard Buckland
-
Learning and Teaching Computing - Richard Buckland UNSW
-
The Strange Case of the Erotic Kiss - Richard Buckland UNSW
-
Coding Samples C: Extracting Digits Using % /, Recursion
-
Coding Samples B: Scope, Pass By Copy
-
Coding Samples A: xcode, .hfiles
-
Gamification and The Joy of Learning - Richard Buckland
-
-
CS2: Data Structures and Algorithms - Richard Buckland
-
Introduction to Data Structures and Algorithms - Richard Buckland
-
Data Structures and Algorithms 2 - Richard Buckland
-
Data Structures and Algorithms 3 - Richard Buckland
-
Data Structures and Algorithms 4 - Richard Buckland
-
Data Structures and Algorithms 5 - Richard Buckland
-
Data Structures and Algorithms 6 - Richard Buckland
-
Data Structures and Algorithms 7 - Richard Buckland
-
Data Structures and Algorithms 8 - Richard Buckland
-
Data Structures and Algorithms 9 - Richard Buckland
-
Bucket Sort, Counting Sort - Richard Buckland
-
Exponential Growth - Richard Buckland
-
Data Structures and Algorithms 11 - Richard Buckland
-
Data Structures and Algorithms 12 - Richard Buckland
-
Data Structures and Algorithms 13A- Richard Buckland
-
Data Structures and Algorithms 13B- Richard Buckland
-
Data Structures and Algorithms 14 - Richard Buckland
-
Data Structures and Algorithms 15 - Richard Buckland
-
Data Structures and Algorithms 16 - Richard Buckland
-
Data Structures and Algorithms 17 - Richard Buckland
-
Data Structures and Algorithms 18 - Richard Buckland
-
Data Structures and Algorithms 19 - Richard Buckland
-
Data Structures and Algorithms 20 - RIchard Buckland
-
Search Design - Richard Buckland Computing2
-
Inside and Outside - Richard Buckland - Computing2
-
Hash Tables - Richard Buckland Computing2
-
Task 2 - Richard Buckland
-
Hashing - Richard Buckland
-
LOOPS!! - Richard Buckland
-
Introduction to Graphs - Richard Buckland
-
Design and Discovery - Richard Buckland 2009
-
About the Project: Fury of Dracula - Richard Buckland
-
Simple Graph Problems - Richard Buckland
-
Linked List ADT in C 1/2 - Richard Buckland
-
Linked List ADT in C 2/2 - Richard Buckland
-
What is Life? The Amazing R.H. Conway - Richard Buckland
-
Admin Only - Richard Buckland
-
Graph Algorithms and Skepticism - Richard Buckland
-
Controlling Errors - Richard Buckland
-
Numerical Algorithms I - Richard Buckland
-
The Loneliest Number - Richard Buckland
-
Numerical Algorithms II - Richard Buckland
-
Not a lecture: Just Chitchat About the Project and Misc Before Extension Lecture 36
-
Puzzles and Protocols (with Movie) - Richard Buckland
-
Balanced Trees - Richard Buckland
-
Things Go Wrong, Heaps - Richard Buckland
-
A Priori VS a Posteriori: Interview with Glen Kelley
-
-
CS3: Design in Computing - Richard Buckland UNSW
-
Design in Computing 1 - Richard Buckland UNSW COMP2911
-
Design in Computing 2 - Richard Buckland UNSW COMP2911
-
CS3 Greetings from the Future - Richard Buckland UNSW COMP2911
-
Design in Computing 2B - Richard Buckland UNSW COMP2911
-
Design in Computing 3 - Richard Buckland UNSW COMP2911
-
Design in Computing 4 - Richard Buckland (draft) UNSW COMP2911
-
Design in Computing 5 - Richard Buckland (draft) UNSW COMP2911
-
Design in Computing 6 - Richard Buckland (draft) UNSW COMP2911
-
Design in Computing 7 - Richard Buckland (draft) UNSW COMP2911
-
Design in Computing 8 - Richard Buckland (draft) UNSW COMP2911
-
-
Data Communication Networks
-
Data Structures
-
Course Overview
-
Using Objects
-
Defining Classes
-
Types and Conditionals
-
Iteration and Arrays I
-
Iteration and Arrays II
-
Linked Lists I
-
Linked Lists II
-
Stack Frames
-
Testing
-
Inheritances
-
Abstract Classes
-
Java Packages
-
Exceptions
-
More Java
-
Game Trees
-
Encapsulation
-
Encapsulated Lists
-
Asymptotic Analysis
-
Amortized Analysis
-
Algorithm Analysis
-
Hash Tables
-
Stacks and Queues
-
Trees and Traversals
-
Priority Queues
-
Binary Search Trees
-
Balanced Search Trees
-
Graphs
-
Weighted Graphs
-
Sorting I
-
Sorting II
-
Disjoint Sets
-
Sorting III
-
Sorting V
-
Splay Trees
-
Randomized Analysis
-
Expression Parsing
-
Garbage Collection
-
Augmenting Data Structures
-
-
Data Structures