|
CS13011 Computer Science IA: Procedural Programming
CS13012 Computer Science IB: Object Oriented Programming
Gold Sections
Spring 2020
|
lecture instructor: | Mikhail Nesterenko |
office: |
on blackboard collaborate, here is the link |
office hours: | TR 1:00-3:30pm |
phone: | (330) 672-9101 |
email: | mikhail AT cs.kent.edu |
. |
lectures: |
TR 11:00am-12:15pm, SMT 110 |
. |
lab instructors | |
Kendric Hood | khood5 AT kent.edu |
Xinyi Huang | xhuang5 AT kent.edu |
CSIB lab times |
section number |
day/time |
location |
instructor |
001 |
M 9:55-11:50am |
MSB 139 |
Xinyi |
002 |
M 02:15-4:10pm |
MSB 139 |
Xinyi |
003 |
F 2:15-4:10pm |
MSB 139 |
Kendric |
Student Instruction |
location | times | instructor |
The sessions is on blackboard collaborate. use this link for access
|
Monday, 4:35pm - 5:35pm
Tuesday, 2:15pm - 3:15pm
Wednesday, 11:00am - 12:00pm
Thursday 2:15pm - 3:15pm
|
Zane Doleh, zdoleh AT kent.edu |
|
This webpage is for Sections 001, 002, and 003. They are gold
sections.
Sections 011, 012, 013 are blue sections. They are for
students who are less familiar with computers. They are taught by
Prof. Volkert. Lectures are in HDN 106, labs are in MSB 162, take a
test here to
see which section suits you best.
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
Blackboad Collaborate Ultra: practice session
post exam consultation: May 8 1:00 - 3:00pm
example quiz, answer key
example CSIA final exam
example CSIA exam answers
example CSIB exam
example CSIB exam answers
final exam and consultation times, review topics
board contents
Mailing list:
list info/subscription,
archive,
previous year's archive
Slides and Examples
topic |
examples |
book chapters |
lecture 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 |
types, expressions, more on assignment
|
increment/decrement, digits |
2.3 |
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 |
programming style, comments, naming programs
predefined functions (library functions)
|
doghouse, equation, time and random |
2.5, 4.2 |
programmer-defined functions,
local and global variables, call-by-value |
add1, circle area |
4.3,4.5 |
separate files, independent compilation,
header files
|
add1 in separate files |
12.1 |
void-functions, predicates, call-by-reference
| stack example, swap'em, valueVSreference, predicated greeting |
5.1, 5.2, 14.1 |
defining arrays, arrays with for-loops,
passing arrays as arguments,
|
initialize array, pass as parameter
|
7.1-7.2 |
strings |
finding in/updating/passing as parameters/etc. |
8.1,8.2
|
file input/ouput |
sum of three numbers, setw, cerr, to_string, stoi, reading lines from file |
6.1 |
. |
CSIB |
structures
| simple, complex, passing as parameters, using with arrays |
10.1 |
classes |
simple, constructors, inline functions,
friend functions |
10.2 |
classes I,
classes II
|
pointers |
pointer usage |
9.1 |
pointers I,
Pointers II |
dynamic memory allocation
|
dynamic memory
|
9.2 |
dynamic memory,
dynamic memory II |
objects with dynamically allocated members
|
dynamic objects
|
11.4 |
dynamic objects
|
vectors |
elementary operations, size change,
use with functions, iterators |
8.3, 18.1 |
dynamic objects II, vectors I,
vectors II |
multidimenstional arrays, vectors of vectors |
index counting, multiplication table, ragged array
|
7.4 |
|
|
|
CSIB course review
|
namespaces |
defining, std |
12.2 |
recursion |
factorial, write vertical, sum, reverse |
14.1 |
diagrams |
|
OMT,
UML |
exception handling |
exceptions |
16.1,16.2 |
|