Overview
This 5-day, carefully paced, hands-on course for novices teaches fundamental C concepts such as algorithmic thinking, problem solving, control structures (if, if…else, switch, while, do…while, for), data types, operators, input/output, functions (user-defined and library) and arrays. The course offers extensive hands-on laboratory experience. Solutions are provided for laboratory exercises. The course includes approximately 60% lecture and 40% laboratory exercises. After taking this course, students will be prepared to take C102—Introduction to C for Non-Programmers: Part 2.
Our introductory classes emphasize achieving program clarity through the proven software-development techniques. Nonprogrammers learn skills that underlie good programming through dozens of complete, working programs—we call this the live-code approach. This hands-on approach rapidly builds the confidence of new programmers, because all programming concepts are presented in the context in which they will be used.
Prerequisites
- General familiarity with your operating system environment
- Ability to create and edit text files
Introduction to C Programming
- A Simple C Program: Printing a Line of Text
- Another Simple C Program: Adding Two Integers
- Memory Concepts
- Arithmetic in C
- Decision Making: Equality and Relational Operators
Structured Program Development in C
- Algorithms
- Pseudocode
- Control Structures
- The if Selection Statement
- The if…else Selection Statement
- The while Repetition Statement
- Formulating Algorithms Case Study 1: Counter-Controlled Repetition
- Formulating Algorithms with Top-Down, Stepwise Refinement Case Study 2: Sentinel-Controlled Repetition
- Formulating Algorithms with Top-Down, Stepwise Refinement Case Study 3: Nested Control Structures
- Assignment Operators
- Increment and Decrement Operators
C Program Control
- Repetition Essentials
- Counter-Controlled Repetition
- for Repetition Statement
- for Statement: Notes and Observations
- Examples Using the for Statement
- switch Multiple-Selection Statement
- do…while Repetition Statement
- break and continue Statements
- Logical Operators
- Confusing Equality (==) and Assignment (=) Operators
- Structured Programming Summary
C Functions
- Program Modules in C
- Math Library Functions
- Functions
- Function Definitions
- Function Prototypes
- Function Call Stack and Activation Records
- Headers
- Calling Functions: Call-by-Value and Call-by-Reference
- Random Number Generation
- Example: A Game of Chance
- Storage Classes
- Scope Rules
- Recursion
- Example Using Recursion: Fibonacci Series
- Recursion vs. Iteration
C Arrays
- Arrays
- Defining Arrays
- Array Examples
- Passing Arrays to Functions
- Sorting Arrays
- Case Study: Computing Mean, Median and Mode Using Arrays
- Searching Arrays
- Multiple-Subscripted Arrays
Price
- $12,995 lecture fee for up to 20 students maximum.
- Client purchases the books, at its own expense, directly from Pearson (the publisher) at the discounted Deitel rate.
- Instructor Travel Reimbursement (if travel is required).
