|
CS13011 Computer Science IA: Procedural Programming
CS13012 Computer Science IB: Object Oriented Programming
Fall 2021
|
| lecture instructor: | Mikhail Nesterenko |
| office hours are on blackboard: | TH 2:15-4:00pm
guest link
|
| phone: | (330) 672-9101 |
| email: | mikhail AT cs.kent.edu |
| . |
| lectures: |
12:30-1:45pm, CSIB guest link |
| . |
| lab instructors | |
| Joseph Oglio | joglio AT kent.edu |
| Xiangxu Lin | xlin10 AT kent.edu |
| CSIB lab times |
|---|
section
number |
day/time |
location |
instructor |
|---|
| 001 | M 12:05-2:00pm | MSB 139 | Xiangxu |
| 002 | T 9:55-11:50am | MSB 139 | Xiangxu |
| 003 | R 2:15-4:10pm | MSB 139 | Joseph |
|
Textbook:
Problem Solving With C++
by Walter J. Savitch, Pearson, 2017, Tenth Edition, ISBN:
978-0134448282. The textbook is required. No access code is needed.
Older editions may be allowed, check with me for details.
differences between course and textbook
syllabus,
tentative schedule,
labs
, tutoring
example quiz, answer key
example CSIB exam
example CSIB exam answers
CSIB final exam and consultation times, review topics
CSIB blackboad course room, drawings
Mailing list:
list info/subscription,
archive,
previous year's archive
Slides and Examples
| topic |
examples |
book chapters |
recordings |
| CSIA |
|
introduction, history of C++, C++ program outline
|
|
1.1-1.3 |
| first program, development environment
| hello world, area |
1.3-1.4 |
|
|
variables, identifiers, assignment, input/output
|
|
2.1-2.2 |
variables
|
|
types, expressions, more on assignment
|
increment/decrement, digits |
2.3 |
branching
|
| boolean algebra, boolean and
relational operators, branching constructs
|
order, toll, largest |
2.4, 3.1-3.2 |
| iterative constructs: while, do-while, for
|
max, odometer, liftoff
| 2.4, 3.3-3.4 |
looping
looping 2
|
programming style, comments, naming programs
predefined functions (library functions)
|
doghouse, equation, time and random |
2.5, 4.2 |
predefined functions
|
| programmer-defined functions,
local and global variables, call-by-value |
add1, circle area |
4.3,4.5 |
user funcs
|
| separate files, independent compilation,
header files
|
add1 in separate files |
12.1 |
multiple files
|
| void-functions, predicates, call-by-reference
| stack example, swap'em, valueVSreference, predicated greeting |
5.1, 5.2, 14.1 |
void functions |
| defining arrays, arrays with for-loops,
passing arrays as arguments,
|
initialize array, pass as parameter
|
7.1-7.2 |
arrays |
|
| strings |
finding in/updating/passing as parameters/etc. |
8.1,8.2
|
strings
|
| file input/ouput |
sum of three numbers, setw, cerr, to_string, stoi, reading lines from file |
6.1 |
file i/o,
review
|
| . |
| CSIB |
| structures
| simple, complex, passing as parameters, using with arrays |
10.1 |
structures I,
structures II |
| namespaces |
defining, std |
12.2 |
namepsapces
|
| classes |
simple, constructors, inline functions,
friend functions |
10.2 |
classes
|
| pointers |
pointer usage |
9.1 |
pointers
|
| dynamic memory allocation
|
dynamic memory
|
9.2 |
dynamic memory,
dynamic memory II
|
| objects with dynamically allocated members
|
dynamic objects
|
11.4 |
objects with dynamic members
dynamic members II
|
| vectors |
elementary operations, size change,
use with functions, iterators |
8.3, 18.1 |
vectors
|
| multidimenstional arrays, vectors of vectors |
index counting, multiplication table, ragged array
|
7.4 |
unix, multidimensional arrays
|
| recursion |
factorial, write vertical, sum, reverse |
14.1 |
recursion
|
| diagrams |
|
|
|
|
|
review |
| . |
| not covered |