Richard Johnsonbaugh, DePaul University
Martin Kalin, DePaul University

Published December, 1995 by Prentice Hall Engineering/Science/Mathematics

Copyright 1996, 875 pp.
Paper
ISBN 0-02-361141-3

Sign up for future
mailings on this subject.

See other books about:
    C--Intermediate Programming-Computer Science

    C--Intro to Programming/CS1-Computer Science

    C - Programming-General Engineering

    C-IT Continuing Education

The text takes a true introductory approach by assuming no prior programming experience in C or any other language.




sample applications allow students to see the development of a complete C program.
at the end of each chapter there is a “Common Programming Errors” section that alerts students to common pitfalls and mistakes.
programming exercises provide students with practice coding in C.
solutions to the odd-numbered “Section Review Exercises” are contained in the back of the text, allowing students to check their mastery of the section.
a comprehensive, in–depth introduction to C that is very cleanly written.
sample applications allow students to see the development of a complete C program.
NEW—includes a new chapter on computer systems and program development, chapter 0, to provide background for readers with no programming experience.
NEW—includes a new chapter on advanced topics.
offers more than 700 new and improved section review exercises.
provides more than 200 programming exercises.



(NOTE: Each chapter ends with common programming errors and programming exercises).

0. Computer Systems and Program Development.

Algorithms. Computer Systems. Internal representations. Programming Languages. Program Development. Why C?

1. Introduction to C.

A First C Program. Sample application: Conversion of lengths. Identifiers. The while statement. Sample Application: Computing Income Tax. The if statement. More on the if statement. Redirecting input and output. Files.

2. Variables, Operators, and Control Flow.

Characters and integers. Floating-point variables. Arithmetic operations. Relational and logical operators and the assignment operator. Sample application: Statistical measures. The for statement and the comma operator. The operators ++ and —. Sample application: Printing a bar graph.

3. More Operators and Control Flow.

The break and continue statements. Sample application: Generating prime numbers. The switch statement. The goto statement and labels. Conditional expressions. Sample application: Printing a calendar. The cast operator. The sizeof operator. Getchar and putchar. Bitwise operators.

4. Functions and Program Structure.

Introduction. Arguments and parameters. Call by value. Sample application: Computing Resistance. The scope of variables. The preprocessor. Sample application: Simulating a dice game. Recursion. Sample application: Recursive tiling. Functions with a arbitrary number of arguments.

5. Arrays.

Why arrays? Array indexes and cell offsets. Sample application: Tracking and reporting car sales. Character strings as arrays of characters. Sample application: Formatting text with a given line length. Arrays as function arguments. String-handling functions. Sample application: Computing a string's length. Multidimensional arrays. Sample application: Matrix multiplication. Sample application: Sorting and searching. Sample application: Forest fire percolation.

6. Pointers.

Pointer variables. Levels of indirection. Pointers and arrays. Pointers as arguments to functions. Sample application: Reversing a string in place. Sample application: Parallel computing. Pointers and multidimensional arrays. Command line arguments. Pointers to functions. Sample application: Comparing sorting algorithms.

7. Storage Classes and Type Qualifiers.

Storage classes in a single-source file: auto, extern, static. Sample application: Breaking text into pages. The storage class register. Storage classes in multiple-source files. Sample application: An interactive calculator. Nested blocks. Storage classes for functions. Type qualifiers: const and volatile. Sample application: A scheduling problem.

8. Input and Output.

Opening and closing files. Character input/output. Sample application: Determining a source file's size in bytes. String input/output. Formatted input/output. Unformatted input/output. Moving around in a file: fseek, ftell, rewind. Sample application: A random access file.

9. Structures, Unions, and Enumerated Types.

Introduction to structures. Sample application: Pattern recognition. The typedef construct. Operations on structures. Pointers to structures, nested structures, and self-referential structures. Structures and functions. Sample application: Sales reporting. Unions and bit fields. Enumerated types.

10. Introduction to Data Structures.

Compile-time and run-time storage allocation. Linked lists. Sample application: A text editor. Stacks and queues. Sample application: Converting from infix to postfix. Graphs and trees. Tree traversals. Breadth-first search and depth-first search. Sample application: Heuristic graph search.

11. Advanced Topics.

Assertions. Exception-handling and jumps. Graphics support for C. Sample application: Fractals. C and C++.

Appendices. ASCII and EBCDIC tables. Summary of the C language. Syntax diagrams of C. Some C functions. C and UNIX. VAX-11 C Borland C++, and Microsoft C++. Changes from traditional C.
Hints and Solutions to Odd-Numbered Exercises.
Index.

---

© Prentice-Hall, Inc. A Simon & Schuster Company Comments To webmaster@prenhall.com