Carnegie Mellon University Website Home Page
 
Fall 2013

Lecture Schedule

Use any posted notes as support material for use in class to help you learn more effectively. You might want to print out or save a copy for yourself before class. Note that any handouts posted do NOT substitute for going to class. We will discuss much more than what you see in the slides below. You will need Adobe Acrobat Reader to view these files.

DATE WEEK LEC TOPIC  
8/25
1
1
Intro pdf
8/27
1
2
Java Basics pdf code
8/29
1
3
Random Numbers, & Problem Solving pdf code
9/1
2
4
Arrays pdf code
9/3
2
5
Classes, Objects and OOP pdf code
9/8
3
6
Loose Ends (Quiz 1 review, Classes, Objects, File I/O) pdf
9/10
3
7
Arrays, Objects, File I/O, Arrays Class pdf code
9/15
4
8
HW1/Q2 debrief, 2-d Arrays, ArrayList Intro pdf code
9/17
4
9
ArrayList Operations and Efficiency (O-notation) pdf
9/22
5
10
Linked Lists (Intro) pdf code
9/14
5
11
Recursion pdf code
9/29
6
HW3 review [OPTIONAL]
10/1
6
Midterm review
10/6
7
12
Implementing a generic Linked List class pdf code
10/8
7
13
Implementing a generic Linked List class (continued) code
10/10
7
Midterm (14%)
10/13 Eid al-Adha
10/20
8
Midterm return and discussion
10/22
8
14
Interfaces pdf code
10/24
8
rec
Javadoc code
10/27
9
15
Iterators pdf code
10/29
9
16
Stacks & Queues pdf
11/3
10
17
Searching and Sorting (Quadratic) and Timing Your Code pdf code
11/5
10
18
Sub-Quadratic Sorts and a Sorting Visualization pdf code
11/10
11
19
Trees (Intro) and Binary Search Trees pdf
11/12/13
11
20
Binary Search Tree Implementation pdf code
11/17
12
21
Binary Search Trees wrap-up pdf code
11/19
12
22
Sets and Maps pdf code
11/24
13
23
Hashing (and HashSets & HashMaps) pdf code
11/26
13
24
Priority Queues and Heaps pdf
12/1
14
25
Wrap-Up and Data Structure Review pdf handout
12/3
14
26
Review of Final topics