CSCI 135 ANALYSIS & DESIGN 1 HUNTER COLLEGE CITY UNIVERSITY OF NEW YORK
CSCI 135 Syllabus Gradescope Coding Style Guide
Text: Tony Gaddis, Starting out with C++ Early Objects, 9th or 10th ed. – hard copy or PDF (9th Ed Global)
GCC compiler (Linux or MacOS or Linux container on Windows) and 0.7mm erasable pens, for written tests and exams.
Recitations: [Syeda Rahman[(mailto:sr6437@hunter.cuny.edu){:target=”_blank”} • Emily Kelper • Melissa Lynch • Kazi Mansha.
Supplimentary Lecture Materials
| DATE |
TOPIC |
SLIDES |
LIVE CODE |
LABS |
| 8/31 |
Syllabus
CSCI127 C++ |
Lab 12 • Lab 13
Programming Problems 53-60 |
|
Lab 1 |
| / |
Functions |
6.1 Modular Programming, 6.2 Definitions
6.3 Prototypes, 6.4 Parameters, 6.5 Pass-By-Value
6.6 Return, 6.7 Value, 6.8 Boolean, 6.9 Menu-Driven
6.10 Scope, 6.11 Static, 6.12 Default Parameters
6.13 Pass-By-Reference Parameters
6.14 Overloading, 6.15 Exit, 6.16 Stubs, Drivers
6.17 Case Studies: Loto, 6.18 Jack-o-lantern |
|
Lab 2
Lab 3 |
| / |
Classes |
7.1 ADT, 7.2 ObjectOriented Paradigm, 7.3 Classes
7.4 Objects, 7.5 Member Functions
7.6 Constructors, 7.7 Destructors
7.8 Private Members, 7.9 Passing Objects
7.10 Composition, 7.11 Spec vs Implementation
7.13 Enums, 7.14 Case Study
7.15 Object Oriented Analysis & Design
7.16 Screen Control, 7.17 Yoyo |
|
Lab 4
Lab 5 |
| / |
Arrays |
8.1 Many Elements, 8.2 Accessing, 8.3 Input/Output
8.4 Array Initialization
8.9 Arrays as Function Arguments |
|
Lab 6 |
| / |
Pointers,
Dynamic
Memory |
10.1 « & » , 10.2 Pointer Variables, 10.3 Array Duality
10.4 Pointer Arithmetic, 10.5 Initialize, 10.6 Compare
10.7 As Function Parameter, 10.8 Constant Pointers
10.9 Dynamic Memory Allocation, 10.10 Returning
10.11 Pointers to Objects, 10.12 CS, 10.14 In Total |
|
Lab 7 |
| / |
Linked Node
Structures |
17.1 Introduction to the Linked List ADT
17.2 Linked List Operations |
|
Lab 8 |
| / |
More
Arrays |
18.1 Array Implementation of the Stack ADT
8.5 The Range-Based for Loop
8.6 Processing Array Contents
8.7 Using Parallel Arrays
8.10 2-D Arrays
8.12 Vectors
8.13 Arrays of Objects
8.14 Case Studies Bank, 8.15 RockPaperScissors
9.1 Introduction to Search Algorithms
9.2 Searching Arrays, 9.5 Searching Vectors, 9.8 Secret Messages |
|
Lab 9 |
| / |
More
Classes |
11.1 this Pointer and Constant Functions, 11.2 Static Members
11.4 Memberwise Assignment, 11.5 Copy Constructors
11.11 Aggregation and Composition
11.12 Simple Inheritance, 11.13 Protected
11.14 Constructor, Destructor, 11.15 Override |
|
Lab 10 |
| / |
Recursion |
14.1 Intro, 14.2 Factorial, 14.3 Greatest Common Divisor
14.4 Solving, 14.9 Vs Iteration, 14.5 Binary Search
14.7 The Towers of Hanoi
14.10 All Together: Infix and Prefix Expressions |
|
Lab 11 |
TEACHER EVALUATIONS:
www.hunter.cuny.edu/te
OR
www.hunter.cuny.edu/mobilete (for smartphones)