Computer Science - A Structured Programming Approach Using C

Curriculum Design and Instruction To Teach

Computer Science: A Structured Programming

Approach Using C:



Author: Charles Hayes:


C is a general-purpose, block

structured, procedural, imperative

computer programming language developed

in 1972 by Dennis Ritchie at the Bell

Telephone Laboratories for use with the

Unix operating system. It has since spread

to many other platforms. Although predominantly

used for system software, C is also widely

used for applications. C has also greatly

influenced many other popular languages,

especially C++, which was designed as an

enhancement to C.






Special Features Of The Curriculum

Design and Instruction Include:

* Phases For Conducting a Needs Assessment:

* Curriculum Design Supplement:

* |a|. Subject-Questions-Answers:

* Curriculum Design Plan:

* Curriculum Design Goals:

* Curriculum Design Objectives:

* Instructional Goals:

* Instructional Objectives:

* Instructional Activities:

* Instructional Evaluation Techniques:

* Lesson Plans:

* Standard Vocabulary:

* Learning Objectives:

* A Limited Glimpse:






Topics Include:

* Introduction:

@ Introduction To Computers:

1. Computer Systems:

2. Computer Hardware:

3. Computer Software:

A. System Software:

B. Application Software:

4. Computing Environments:

A. Personal Computing Environment:

B. Time-Sharing Environment:

C. Client/Server Environment:

5. Computer Languages:

A. Machine Languages:

B. Symbolic Lnaguages:

C. High-Level Languages:

D. Natural Languages:

6. Writing, Editing, Compiling,

and Linking Programs:

A. Step 1: Writing and Editing Programs:

B. Step 2: Compiling Programs:

C. Step 3: Linking Programs:

7. Program Execution:

8. System Development:

A. System Development Life Cycle:

B. Program Development:

9. Software Engineering and

Programming Style:

10. Tips and Common Programming Errors:

11. Summary:

* Introduction:

@ Introduction To The C Language:

1. Background:

2. C Programs:

A. Structure of a C Program:

B. A Simple Program:

C. Your First Program:

D. Comments:

3. Indentifiers:

4. Types:

A. Void:

B. Integer:

C. Character:

D. Floating Point:

E. Logical Data:

5. Variables:

A. Variable Declaration and

Definition:

B. Variable Initialization:

6. Constants:

A. Integer Constants:

B. Floating-Point Constants:

C. Character Constants:

D. String Constants:

7. Coding Constants:

A. Literal Constants:

B. Defined Constants:

C. Memory Constants:

8. Formatted Input/Output:

A. Standard Files:

B. Formatted Output:

C. Formatted Input:

9. Programming Examples:

A. Print "Nothing":

B. Print Character Values:

C. Define Constants:

D. Print Report:

10. Software Engineering and Programming

Style:

A. Program Documentation:

B. Data Names:

C. Data Hiding:

11. Tips and Common Programming Errors:

12. Summary:

* Introduction:

@ Structure Of A C Program:

1. Expressions:

A. Primary Expressions:

B. Binary Expressions:

C. Assignment Expressions:

D. Postfix Expressions:

E. Unary Expressions

2. Precedence and Associativity:

A. Precedence:

B. Associativity:

3. Side Effects:

4. Evaluating Expressions:

A. Warning:

5. Mixed Type Expressions:

A. Implicit Type Conversion:

B. Explicit Type Conversion (Cast):

6. Statements:

A. Expression Statements:

B. Compound Statements:

G. Statements and Defined Constants:

7. Sample Programs:

A. Example: Calculate Quotient and

Remainder:

B. Example: Print Right Digit:

C. Example: Calculate Average:

D. Example: Degrees to Radians:

E. Example: Fahrenheit to Celsius:

F. Example: Calcualte Sales Total:

G. Example: Calculate Student Score:

8. Software Engineering and Programming

Style:

A. KISS:

B. Parentheses:

C. User Communication:

9. Tips and Common Programming Errors:

10. Summary:

* Introduction:

@ Functions:

1. Designing Structured Programs:

2. Functions in C:

3. User-Defined Functions:

A. Void Functions with No Paramenters:

B. Void Functions with Parameters:

C. Functions That Return Values:

D. Function Definition:

E. Prototype Declaration:

F. Function Examples:

G. Parameter Passing:

4. Standard Library Functions:

A. Standard Functions for Mathematical

Manipulations:

B. General Library Functions:

C. Scaling Random Numbers:

5. Scope:

A. Global Scope:

B. Local Scope:

6. A Programming Example-Calculator

Program:

7. Software Engineering and

Programming Style:

A. Structure Charts:

B. Structure Chart Rules and Symbols:

C. Functional Cohesion:

D. Top-Down Development:

8. Tips and Common Programming Errors:

9. Summary:

* Introduction:

@ Selection-Making Decisions:

1. Logical Data and Operators:

A. Logical Data in C:

B. Logical Operators:

C. Evaluating Logical Expressions:

D. Relational Operators:

2. Two-Way Selection:

A. If...else:

B. Null else Statement:

c. Nested if Statements:

D. Dangling else Problem:

E. Simplifying if Statements:

F. Conditional Expressions:

G. Handling Major Erros:

H. Two-Way Selection Example:

3. Multiway Selection:

A. The switch Statement:

B. The else-if:

4. More Standard Library Functions:

A. Standard Characters Functions:

B. A Classification Program:

5. A Menu Program

6. Software Engineering and

Programming Style:

A. Dependent Statements:

B. Negative Logic:

C. Rules for Selection Statements:

D. Selection in Structure Charts:

7. Tips and Common Programming Errors:

8. Summary:

* Introduction:

@ Repetition::

1. Concept of a a Loop:

2. Pretest and Post-Test Loops:

3. Initialization and Updating:

A. Loop Initialization:

B. Loop Update:

4. Event-Controlled and Counter-

Controlled Loops:

A. Event-Controlled Loops:

B. Counter-Controlled Loops:

C. Loop Comparison:

5. Loops in C:

A. The while Loop:

B. The for Loop:

C. The Do ... while Loop:

D. The Comma Expression:

6. Loop Examples:

A. (for) Loops:

7. Other Statements Related to

Looping:

8. Looping Applications:

A. Summation:

B. Product:

C. Smallest and Largest:

D. Inquiries:

9. Recursion:

A. Iterative Definition:

B. Recursive Definition:

C. Interative Solution:

D. Recursive Solution:

E. Designing Recursive Functions:

F. Fibonacci Numbers:

G. Limitations of Recursion:

H. The Towers of Hanoi:

J. Recursive Solution of the

Towers of Hanoi:

10. Programming Example-The

Calculatior Program:

11. Software Engineering and Programming

Style:

A. Loops in Structure Charts:

B. Determining Algorithm Efficiency:

C. Linear Loops:

D. Logarithmic Loops:

E. Nested Loops:

F. Big-O Notation:

G. Standard Measures of Efficiency:

12. Tips and Common Programming Errors:

13. Summary:

* Introduction:

@ Text Files:

1. Concept of a File:

2. Files and Streams:

A. File Table:

B. Standard Files:

C. User Files:

D. File-Stream Association:

3. Standard Library Input/Output Functions:

A. Format Strings:

B. Two Common Mistakes:

C. Print Side Effect and Value:

D. File Examples:

5. Character Input/Output Functions:

6. Character Input/Output Examples:

A. Create Text File:

B. Copy Text File:

C. Count Words in File:

7. Software Engineering and

Programming Style:

A. Testing Files:

B. Data Terminology:

8. Tips and Common Programming Errors:

9. Summary:

* Introduction:

@ Arrays:

1. Concepts:

2. Using Arrays in C:

A. Declaration and Definition:

B. Accessing Elements in Arrays:

C. Storing Values in Arrays:

D. Precedence of Index Operators:

F. Index Range Checking:

3. Arrays and Functions:

A. Passing Individual Elements:

B. Passing the Whole Array:

4. Array Applications:

A. Frequency Arrays:

B. Histograms:

C. Random Number Permutations:

5. Sorting:

A. Selection Sort:

B. Selection Sort Algorithm:

C. Bubble Sort:

D. Bubble Sort Algorithm:

E. Insertion Sort:

F. Insertion Sort Algorithm:

G. Insertion Sort Reprogrammed:

H. Sort Conclusions:

6. Searching:

A. Sequential Search:

B. Binary Search:

7. Two-Dimensional Arrays:

A. Declaring and Defining Two-

Dimensional Arrays:

B. Passing a Two-Dimensional Array to

a Function:

C. Array Example:

8. Multidimensional Arrays:

A. Declaring and Defining Multi-

Dimensional Arrays:

9. Programming Example-Calculate

Averages:

10. Software Engineering and

Programming Style:

A. Testing Sorts:

B. Testing Searches:

C. Analyzing Sort Algorithms:

D. Analyzing Search Algorithms:

11. Tips and Common Programming Errors:

12 Summary:

* Introduction:

@ Pointers:

1. Concepts:

A. Pointer Constants:

B. Pointer Values:

2. Pointer Variables:

3. Accessing Variables Through

Pointers:

A. The Indirection Operator:

4. Pointer Declaration and Definition:

A. Example: Print with a Pointer:

5. Initialization of Pointer Variables:

A. Example: Change Variables-Fun with

Pointers:

B. Example: Add Two Numbers:

C. Example: Pointer Flexibility:

D. Example: Multiple Pointers for

One Variable:

6. Pointers and Functions:

A. Pointers as Formal Paramenters:

B. Functions Returning Pointers:

7. Pointers to Pointers:

A. Pointer-to-Pointer Example:

8. Compatibility:

A. Compatibility and the Void Pointer:

B. Casting Pointers:

9. Lvalue and Rvalue:

10. Pointer Applications:

A. Convert Seconds to Hours:

B. Quadratic Equations:

11. Software Engineering and

Programming Style:

A. Quality Defined:

B. Quality Factors:

C. The Quality Circle:

D. Conclusion:

12. Tips and Common Programming

Errors:

13. Summary:

* Introduction:

@ Pointer Applications:

1. Arrays and Pointers:

2. Pointer Arithmetic and Arrays:

A. Pointers and One-Dimensional Arrays:

B. Pointers and Other Operators:

C. Using Pointer Arithmetic:

D. Pointers and Two-Dimensional Arrays:

3. Passing an Array to a Function:

4. Understanding Complex Declarations:

5. Memory Allocation Functions:

A. Memory Usage:

B. Memory Allocation (malloc):

C. Contiguous Memory Allocation (calloc):

D. Reallocation of Memory (realloc):

E. Releasing Memory (free):

6. Array of Pointers:

7. Programming Applications:

A. Selection Sort Revisited:

B. Dynamic Array:

8. Array of Pointers:

9. Programming Applications:

A. Selection Sort Revisited:

B. Dynamic Array:

10. Software Engineering and

Programming Style:

A. Pointers and Function Calls:

B. Pointers and Arrays:

C. Array Index Commutativity:

D. Dynamic Memory: Theory Versus Practice:

9. Tips and Common Programming Errors:

10. Summary:

* Introduction:

@ Strings:

1. String Concepts:

A. Fixed-Length Strings:

B. Variable-Length Strings:

2. C Strings:

A. Storing Strings:

B. The String Delimiter:

C. String Literals:

D. String and Characters:

E. Strings as Variables:

F. Strings and Pointers:

3. String Input/Output Functions:

A. Formatted String Input/Output:

B. String Input/Output:

C. Examples:

4. Arrays of Strings:

5. String Manipulation Functions:

A. String Length (Strlen):

B. String Copy:

C. String Compare:

D. String Concatenate:

E. character in String:

F. String in String:

G. String Span:

H. String to Number:

I. String Examples:

6. Memory Formatting:

A. Scan Memory String (sscanf):

B. Format Memory String (sprintf):

7. A Programming Example-Morse Code:

8. Software Engineering and Programming

Style:

A. Program Design Concepts:

B. Information Hiding:

C. Cohesion:

D. Summary:

9. Tips and Common Programming Errors:

10. Summary:

* Introduction:

@ Derived Types-Enumerated,

Structure, and Union:

1. The Type Definition (typedef):

2. Enumerated Types:

A. Enumerated Type Definition:

3. Structure:

A. Structure Declaration and Definition:

B. Initialization:

4. Accessing Structures:

A. Referencing Individual Fields:

B. Precedence of Member Operator:

C. Structure Operations:

D. Pointer to Structures:

E. Selection Operator:

5. Complex Structures:

A. Nested Structures:

B. Structures Containing Arrays:

C. Structure Containing Pointers:

6. Array of Structures:

A. Insertion Sort Revisited:

7. Structures and Functions:

A. Sending Individual Members:

B. Sending the Whole Structure:

C. Passing Structures through Pointers:

8. Unions:

A. Referencing Unions:

B. Unions in Structures:

C. Internet Addresses:

9. Programming Application:

10. Software Engineering and

Programming Style:

A. Coupling:

B. Data Hiding:

C. Summary:

11. Tips and Common Programming

Errors:

12. Summary:

* Introduction:

@ Binary Files:

1. Classification of Files:

A. Text Files:

B. Binary Files:

2. Using Binary Files:

A. State of a File:

B. Opening Binary Files:

C. Update Mode:

D. Closing Binary Files:

B. Standard Library Functions

for Files:

A. Block Input/Output Functions:

B. File Status Functions:

C. Positioning Functions:

D. Block Input/Output Example:

Append Files:

E. System File Operations:

4. Converting File Type:

A. Creating a Binary File

from a Text File:

B. Creating a Text File from a

Binary File:

5. File Program Examples:

A. Random File Accessing:

B. Merge Files:

6. Software Engineering and

Programming Style:

A. Update Files:

B. Sequential File Update:

C. The Update Program Design:

D. Update Errors:

E. Update Structure Chart:

F. Update Logic:

G. Summary:

7. Tips and Common Programming Errors:

8. Summary:

* Introduction:

@ Linked Lists:

A. Linked List Structure:

1. Nodes:

2. Type Definition for a Linked List:

3. Pointers to Linked Lists:

4. Link List Order:

2. Primitive Linked List Functions:

A. Functional Design Approach:

B. Insert a Node:

C. Delete a Node:

D. Locating Data in Linked Lists:

3. Traversing Linked Lists:

A. Print Linked Listed:

B. Linked List Average:

4. Building a Linked List:

A. Build Chronological List:

B. Build Key-Sequenced List:

C. Remove a Node:

D. Linked List Test Driver:

5. Programming Examples:

A. Append Lists:

B. Array of Linked Lists:

6. Software Engineering and

Programming Style:

A. Atomic and Composite Data:

B. Data Structure:

C. Abstract Data Type:

D. A Model for an Abstract

Data Type:

E. ADT Data Structure:

7. Tips and Common Programming

Errors:

8. Summary:

* Introduction:

@ Bitwise Operators:

1. Logical Bitwise Operators:

2. Shift Operators:

3. Bitwise Use:

A. Creating Masks:

B. Using Masks:

C. Rotating Bits:

4. Bitwise Applications:

A. Print Binary Revisited:

B. Bit Rotation:

5. Software Engineering and

Programming Style:

A. Payroll Case Study:

B. Program Design Steps:

C. Structure Chart Design:

6. Tips and Common Programming Errors:

7. Summary:

* STATE OF THE ART CURRICULUM DESIGN:

* NEW:

* GLOSSARY:

* DIAGRAMS:

* CHARTS:

* ILLUSTRATIONS

* PHOTOS:

* ASCII TABLES:

* RESERVED WORDS:

* FLOWCHARTING:

* NUMBERING SYSTEMS:

* STANDARD LIBRARIES:

* FUNCTION PROTOTYPES:

* PREPROCESSOR DIRECTIVES:

* PROGRAM STANDARDS AND STYLES:

* COMMAND-LINE ARGUMENTS:

* POINTERS TO FUNCTIONS:

* STORAGE CLASSES AND TYPE QUALIFIERS:

* SEPARATE COMPILATION:

* BIBLIOGRAPHY:

* REFERENCES:

* PAPERBACK:

* TRANSPARENT FRONT PAGE:

* BLACK-WHITE-RED OR BLUE BACK PAGE COVER:

* BINDED WIRE-0: BLACK-WHITE-RED OR BLUE:

* 500 WHITE PAGES: 8x11"

* ALLOW 6 TO 8 WEEKS TO RECEIVE ITEM:

* ORDER EARLY WHILE SUPPLIES LAST: