20-Lecture Course: Introduction to Computer Science 1

June 24, 2010 · 0 comments

GD Star Rating
a WordPress rating system

Lecture #1 of 20

Course Description: This IT course offers an introduction to computer science and computer programming. Students will learn to become familiar with thinking in terms of algorithms and solving problems efficiently. Topics covered include abstraction, databases, data structures, software development, memory management, websites, and virtualization. The computer languages covered are C, PHP, JavaScript, SQL, XHTML, and CSS. The problems students solve come from real-world ideas in the fields of biology, finance, forensics, gaming, and cryptography. This course is built for computer science majors and non-computer science majors. No programming experience is necessary.

This IT course is taught by Dr. David Malan. He is a professor in the School of Engineering and Applied Sciences at Harvard University. He teaches this course, CS50, along with many others. His research focuses on cybersecurity and computer forensics.

This course was taught twice a week by Harvard University and was recorded Fall 2009.

Introduction to Computer Science 1: Lecture 1

Introduction. Bits. Binary. ASCII. Programming. Algorithms. Scratch. Statements. Boolean expressions. Conditions. Loops. Variables. Threads. Events.
Watch Lecture 1»

Introduction to Computer Science 1: Lecture 2

Introduction. Bits. Binary. ASCII. Programming. Algorithms. Scratch. Statements. Boolean expressions. Conditions. Loops.
Watch Lecture 2»

Introduction to Computer Science 1: Lecture 3

C. Source code. Compilers. Object code. SSH. SFTP. GCC. Functions. Comments. Standard output. Arithmetic operators. Precedence.

Watch Lecture 3»

Introduction to Computer Science 1: Lecture 4

C. Source code. Compilers. Object code. SSH. SFTP. GCC. Functions. Comments. Standard output. Arithmetic operators. Precedence. (cont’d)
Watch Lecture 4»

Introduction to Computer Science 1: Lecture 5

Functions, continued. Global variables. Parameters. Return values. Stack. Frames. Scope. Arrays. Strings. Command-line arguments. Cryptography.
Watch Lecture 5»

Introduction to Computer Science 1: Lecture 6

Linear search. Binary search. Asymptotic notation. Recursion. Pseudorandomness. Bubble sort. Selection sort. Insertion sort. Merge sort. Debugging.
Watch Lecture 6»

Introduction to Computer Science 1: Lecture 7

Linear search. Binary search. Asymptotic notation. Recursion. Pseudorandomness. Bubble sort. Selection sort. Insertion sort. Merge sort. Debugging.
Watch 1 Lecture 7»