CS103 Spring 2017 Introduction to Programming

CS103 Spring 2017: Introduction to Programming

Lecture Notes / Schedule

Week Tue Thu
1 Overview, course intro
Reading: Ch. 1


Unit 0 Slides

Data Representation, Basic C Variables, Expressions, Basic I/O
Reading: Ch. 2


 

2 Data Representation, Basic C Variables, Expressions, Basic I/O
Reading: Ch. 2


Unit 1 Slides

More Expressions, Functions Overview, Control Structures
Reading: Ch. 5.1, Ch. 3


 

3 Control Structures (While/For Loops)
Reading: Ch. 4


Unit 2 Slides

Randomness, Array Basics
Reading: Ch. 4


 

4 Arrays
Reading: Ch. 6.1-6.6, 7.1-7.3


Unit 5 Slides

Functions, Parameter Passing
Reading: Ch. 5.2-5.8


Unit 4 Slides

5 More functions, C-Strings Multidimensional Arrays, Images
Reading: Ch. 6.6


 

6 Pointers
Reading: Ch. 7.1


Unit 6 Slides

Pass-by-reference and Pointer Arguments
Reading: Ch. 7.2-7.3, 7.5, 8.5


 

7 Dynamic Memory OverviewReading: Ch. 7.4


 

Pointer Practice, Midterm Review


 

**Written Midterm** - Thursday 2/23, 7 PM
8  Deep/Shallow Copy


 

Redirection, File I/O,
Reading: Ch. 8,
Reading: Ch. 12
Reading: Ch. 11


Unit 7 Slides

9 Recursion, Complexity and Algorithm Analysis


Unit 8 Slides

Using objects, C++ strings
Reading: Ch. 7.7


 

10 Structs & Classes
Reading: Ch. 9


Unit 9 Slides, Unit 10 Slides

Linked Lists
Reading: Ch.13


Unit 11 Slides

11 Linked lists, STL Lists (Vectors and Deques)Reading: Ch. 6.7


Unit 12 Slides

More STL


 

**Programming Midterm** - Thursday, 3/30, 7 PM
12 Doubly-Linked Lists


Unit 15 Slides

Streams (stringstreams)


Unit 14 (stringstreams) slides

13 C++ References, ComplexityReading: Ch. 5.9


Unit 8b (Algo) Slides

Unit 13 C++ References

PA5/6 Topic Explanation
Reading: Ch. 20, pgs. 1361-1376


 

14 Recursion Revisited


 

15 Even More Recursion Final Review

Review Slides

**Final** - Tue, 5/9, 4:30-6:30 PM