Free e-Course ~ Introduction to Computer Science

Introduction to Computer Science

VU Course ID:	C202
Curriculum:	20 lectures
Fee:	FREE
Textbooks:	None
Prerequisites:	None
Instructor:	David Malan
Provider:	Harvard University
Recordable:	Yes / 2 CEUs

Sponsored Message

Course Description

This course provides an introduction to computer science and the art of programming. Students will learn how to think algorithmically and solve problems efficiently. Topics include abstraction, algorithms, encapsulation, data structures, databases, memory management, security, software development, virtualization and website design. Languages covered include C, PHP, and JavaScript plus SQL, CSS, and HTML. Problem sets are inspired by real-world domains of biology, cryptography, finance, forensics and gaming.

Record Grade Request CEUs eTranscript FAQ

Technology Today (News Feed)

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

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

Lecture 3 C. Associativity. Local variables. Types. Casting. Standard input. Libraries. Boolean expressions, continued. Conditions, continued. Loops, continued.

Lecture 4 Part 1: Functions, continued. Global variables. Parameters. Return values. Stack. Frames. Scope. Arrays. Strings. Command-line arguments. Cryptography.

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

Lecture 6 Part 1: Linear search. Binary search. Asymptotic notation. Recursion. Pseudorandomness. Bubble sort. Selection sort. Insertion sort. Merge sort. Debugging.

Lecture 7 Part 2: Linear search. Binary search. Asymptotic notation. Recursion. Pseudorandomness. Bubble sort. Selection sort. Insertion sort. Merge sort. Debugging.

Lecture 8 Part 1: Structures. Dynamic memory allocation. Stack and heap. Pointers. Debugging, continued.

Lecture 9 Part 2: Structures. Dynamic memory allocation. Stack and heap. Pointers. Debugging, continued.

Lecture 10 Part 1: File I/O. Forensics. Linked lists. Stacks. Queues.

Lecture 11 Part 2: File I/O. Forensics. Linked lists. Stacks. Queues.

Lecture 12 Part 1: Valgrind. Bitwise operators. Hash tables. Trees. Binary search trees. Tries. Huffman coding.

Lecture 13 Part 2: Valgrind. Bitwise operators. Hash tables. Trees. Binary search trees. Tries. Huffman coding.

Lecture 14 Part 1: HTTP. XHTML. PHP. SQL.

Lecture 15 Part 2: HTTP. XHTML. PHP. SQL.

Lecture 16 Part 1: CSS. Inheritance. JavaScript. Events, continued. Ajax.

Lecture 17 Part 2: CSS. Inheritance. JavaScript. Events, continued. Ajax.

Lecture 18 Preprocessing. Compiling. Assembling. Linking. CPUs.

Lecture 19 Guest lectures.

Lecture 20 Exciting conclusion.

Notepad.cc: ~ Leave yourself notes in the cloud!

Open

You can use Notepad.cc to jot down notes and keep track of your studies. If this is your first use, click the Open button, then click in the white space and begin typing! Your notes will be auto-saved as you type.

Create notes for each of your classes and access them using any browser. You also can share notes with a classmate, collaborate in real time, or password-protect your notes for privacy. Click the Expand icon above to access these features.