By: Tim Bower

Applications in C for Engineering Technology Study Guide

This study guide is available from timbower.us.

This study guide is made available by the Creative Commons Attribution 3.0 United States License.

This Applications in C for Engineering Technology Study Guide provides notes and information for the Applications in C Programming for Engineering Technology (CMST 302) course offered by K–State Salina, which is the campus of Kansas State University located in Salina, Kansas. Self study of the material in the Study Guide is welcome.

Announcements

• Make sure that you save an html file on your jump drive for easy access to the study guide.
• The abs() function in gcc is for integer data. When dealing with floating point (double) data, use fabs() instead.

Contents:

• 1. Introduction
  • 1.1. Weekly Schedule
  • 1.2. Relationship of C to other programming Languages
  • 1.3. History of C
• 2. Topic 1 - Getting Started
  • 2.1. The Programming Process
  • 2.2. Compile Stages
  • 2.3. Integrated Development Environments
  • 2.4. Using Visual Studio
  • 2.5. Linux Tools for generating a running program
  • 2.6. A simple C program
  • 2.7. Declaring Variables
  • 2.8. Arithmetic operations and assignments
  • 2.9. Basic Input / Output (I/O)
  • 2.10. Control Constructs
  • 2.11. Functions
  • 2.12. Arrays
  • 2.13. Strings
  • 2.14. File I/O
  • 2.15. Example of developing a C program
• 3. Topic 2 - Fundamentals of C
  • 3.1. Lexical Elements
  • 3.2. Fundamental Data Types
  • 3.3. Mathematical Functions
  • 3.4. Enumeration Types and Typedef
• 4. Topic 3 - Flow of Control
  • 4.1. Boolean Expressions
  • 4.2. Selection Statements
  • 4.3. Loops
  • 4.4. A Word about Style
• 5. Topic 4 - Functions and Structured Programming
  • 5.1. Basics of Using Functions
  • 5.2. The assert() macro
  • 5.3. Invocation – call-by-value
  • 5.4. Rules of Scope
  • 5.5. Variables in Memory
  • 5.6. Program Design with functions
  • 5.7. Recursion
• 6. Topic 5 - Pointers, Arrays and Strings
  • 6.1. Basics of pointers
  • 6.2. Arrays
  • 6.3. Multi-dimensional arrays
  • 6.4. Strings
  • 6.5. The string library
  • 6.6. Dangers of Buffer overflows
  • 6.7. String Example - ReadLine
  • 6.8. A trick to describe complex data types
  • 6.9. Dynamic memory allocation
  • 6.10. Pointers to Functions
• 7. Topic 6 - File I/O
  • 7.1. File I/O
  • 7.2. File I/O example
  • 7.3. fopen modes
  • 7.4. Safe fopen
  • 7.5. Setting the file position indicator
  • 7.6. getchar() and putchar()
  • 7.7. fgetc() and fputc()
• 8. Topic 7 - Data structures
  • 8.1. Basic Data Structures
  • 8.2. Allocating memory for structures
  • 8.3. Self-Referential (linked list)
  • 8.4. Example - Linked Lists
  • 8.5. Linked List Bubble Sort
  • 8.6. Other self-referential data structures
  • 8.7. Union
• 9. Topic 8 - Advanced Topics
  • 9.1. Multi-process Programming
  • 9.2. Signals
  • 9.3. Multi-threaded Programming
  • 9.4. File Descriptor Example
• 10. Introduction to C++
  • 10.1. Background
  • 10.2. Fundamental Data Types
  • 10.3. Input / Output
  • 10.4. Variables, pointers, and references
  • 10.5. Class Definition
  • 10.6. Memory Management
  • 10.7. Characters and Strings
  • 10.8. Templates and Containers
• 11. Home Work
  • 11.1. Homework 1 - A simple equation
  • 11.2. Homework 2 - Prompt for input
  • 11.3. Homework 3 - Control Constructs and Newton’s Square Root Algorithm
  • 11.4. Homework 4 - Newton’s Square Root Algorithm in a Function
  • 11.5. Homework 5 - Mean and Standard Deviation of Numbers
  • 11.6. Homework 6 - Flow Control Program - Prime Numbers
  • 11.7. Homework 7 - Using a Static Local Variable
  • 11.8. Homework 8 - A Recursive Function
  • 11.9. Homework 9 - Function to Calculate 2-Dimensional Array Data
  • 11.10. Homework 10 - Cryptography on Strings
  • 11.11. Homework 11 - No Tabs
  • 11.12. Homework 12 - Numerical Proof of Euler’s Formula
  • 11.13. Homework 13 - Morse Code Decoder
  • 11.14. Homework 14 - RPN Calculator

Indices and tables

• Index
• Module Index
• Search Page