• Intro to Programming
  • 1.  Elements of Programming
    • 1.1  Your First Program
    • 1.2  Built-in Types of Data
    • 1.3  Conditionals and Loops
    • 1.4  Arrays
    • 1.5  Input and Output
    • 1.6  Case Study: PageRank
  • 2.  Functions
    • 2.1  Static Methods
    • 2.2  Libraries and Clients
    • 2.3  Recursion
    • 2.4  Case Study: Percolation
  • 3.  OOP
    • 3.1  Data Types
    • 3.2  Creating Data Types
    • 3.3  Designing Data Types
    • 3.4  Case Study: N-Body
    • 3.5  Purple America
    • 3.6  Inheritance
  • 4.  Data Structures
    • 4.1  Performance
    • 4.2  Sorting and Searching
    • 4.3  Stacks and Queues
    • 4.4  Symbol Tables
    • 4.5  Case Study: Small World

• Intro to CS
  • 0.  Prologue
  • 5.  A Computing Machine
    • 5.1  Data Representations
    • 5.2  TOY Machine
    • 5.3  TOY Instruction Set
    • 5.4  TOY Programming
    • 5.5  TOY Simulator
  • 6.  Building a Computer
    • 6.1  Combinational Circuits
    • 6.2  Sequential Circuits
    • 6.3  Building a TOY
  • 7.  Theory of Computation
    • 7.1  Formal Languages
    • 7.2  Regular Expressions
    • 7.3  Finite State Automata
    • 7.4  Turing Machines
    • 7.5  Universality
    • 7.6  Computability
    • 7.7  Intractability
    • 7.8  Cryptography
  • 8.  Systems
    • 8.1  Library Programming
    • 8.2  Compilers
    • 8.3  Operating Systems
    • 8.4  Networking
    • 8.5  Applications Systems
  • 9.  Scientific Computation
    • 9.1  Floating Point
    • 9.2  Symbolic Methods
    • 9.3  Numerical Integration
    • 9.4  Differential Equations
    • 9.5  Linear Algebra
    • 9.6  Optimization
    • 9.7  Data Analysis
    • 9.8  Simulation

• Algorithms, 4th Edition
  
• Web Resources
  • FAQ
  • Data
  • Code
  • Errata
  • Appendices
    • A.   Operator Precedence
    • B.   Writing Clear Code
    • C.   Gaussian Distribution
    • D.   Java Cheatsheet
    • E.   Matlab
  • Lecture Slides
  • Programming Assignments

     

Lecture Slides

Here are lecture slides and demos that accompany An Introduction to Programming in Java: An Interdisciplinary Approach. Powerpoint slides available by request for instructors who adopt the textbook.

#	TOPIC	SLIDES	DEMOS
1.1	Your First Program	1up · 4up	–
1.2	Built-In Types of Data	1up · 4up	–
1.3	Conditionals and Loops	1up · 4up	While loop
1.4	Arrays	1up · 4up	Shuffle
1.5	Input and Output	1up · 4up	–
1.6	Random Surfer	1up · 4up	–
2.1	Functions	1up · 4up	Function call
2.2	Libraries and Clients	1up · 4up	–
2.3	Recursion	1up · 4up	Factorial · Factorial · Towers of Hanoi
2.4	Percolation	1up · 4up	–
3.1	Data Types	1up · 4up	–
3.2	Creating Data Types	1up · 4up	Mandelbrot explorer
3.3	Designing Data Types	1up · 4up	–
3.4	N-Body Simulation	1up · 4up	–
3.5	Purple America	1up · 4up	US Elections (1960–2008)
4.1	Performance	1up · 4up	–
4.2	Sorting and Searching	1up · 4up	Binary search · Merging
4.3	Stacks and Queues	1up · 4up	Linked list · Iteration
4.4	Symbol Tables	1up · 4up	Inorder · Growing Tree
4.5	Small-World Phenomenon	1up · 4up	BFS · Oracle of Kevin Bacon

Here are lecture slides for the forthcoming textbook An Introduction to Computer Science.

A COMPUTING MACHINE
0	Prologue	LFSR
5.1 - 5.3	A von Neumann Machine	Visual X-TOY
5.4 - 5.5	Machine Language Programming	Crazy 8
BUILDING A COMPUTER
6.1 - 6.2	Boolean Logic and Gates	Hydraulic computer
6.3	Sequential Circuits
6.5	TOY Machine Architecture
THEORY OF COMPUTATION
7.1 - 7.3	Regular Expressions and DFAs	DFA
7.4 - 7.6	Turing Machines	Turing machine simulator · Adder
7.7	Intractability
7.8	Cryptography	Crypto history [rsa.com]
SYSTEMS
8.4	Networking
SCIENTIFIC COMPUTING
9.1	Floating Point
9.8	Monte Carlo Simulation

Last modified on July 29, 2011.

Copyright © 2002–2012 Robert Sedgewick and Kevin Wayne. All rights reserved.