TY  - BOOK
AU  - Hanly,Jeri R
AU  - Koffman, Elliot B
TI  - Problem solving and program design in C
SN  - 0201357488
AV  - QA76.73.C153 L5 2007
U1  - 005.133 22
PY  - 1999///
CY  - Reading, Massachusetts : 
PB  - Addison Wesley
KW  - C(Computer program language)
N1  - Chapter 1overview of computers, and programming

1.1 Electronic computers then and now
1.2 computer hardware
1.3 computer software
1.4the software development method

Chapter 2 Overview of C
2.1 C language elements
2.2 reserved words and identifiers
2.3 Data types and declarations
2.4 Executable statements
2.5 General form of C++ languages

Chapter 3 Top-Down design with functions and classes
3.1 Building programmes for existing information
3.2 Library functions
3.3 Top-down design and structure charts
3.4 Functions without arguments
3.5 Functions with input arguments

Chapter 4 Selection Structures: if and switch statements
4.1 control structures
4.2 logical expressions
4.3 introduction to the if control statement
4.4 if statements with compound alternatives
4.5 decision steps in algorithms , etc

Chapter 5 Repetition and Loop Statements
5.1 counting loops and the while statements
5.2 accumulating a sum or product in a loop
5.3 the for statement
5.4 condition loops
5.5 loop design and loop patterns, etc

Chapter 6 Modular programming
6.1 Value and reference parameters
6.2 functions with output and input parameters
6.3 stepwise design with functions
6.4 using objects with functions
6.5 debugging and testing a program system, etc

Chapter 7 Simple Data Types
7.1 constants revisted
7.2 internal representations of numeric data types
7.3 character data and functions
7.4 Type bool Data and logical expressions
7.5 enumerations types, etc

Chapter 8 Streams and Files
8.1 the standard input and output streams
8.2 external files
8.3 using the external files for communications between the programs
8.4 more on reading string data
8.5 input/ output manipulators, etc

Chapter 9 Data structures: Arrays and structs
9.1 the array data type
9.2 sequential access to array elements
9.3 array arguments
9.4 reading part of an array
9.5 searching and sorting arrays, etc

Chapter 10 User-Defined Classes
10.1 class definition and use
10.2 class implementation
10.3 summary of rules for use of classes and objects
10.4 classes as Operands and Arguments
10.5 A fraction class, etc

Chapter 11 Modelling Data with Arrays, Structs, and Classes
11.1 multidimensional arrays
11.2 Array of structs
11.3 template classes, etc

Chapter 12 Recursion
12.1 the nature of recursion
12.2 tracing recursive functions
12.3 recursive mathematical functions, etc

Chapter 13 Pointers and Dynamic Data Structures
13.1 pointers and the new operators
13.2 manipulating the Heap
13.3 linked lists, etc
Appendices: A-H
Index
Includes appendices ( A-H) and index
ER  -