A book on C / Al Kelley

Public ISBD Titre : A book on C : An introduction to programming in C Type de document : texte imprimé Auteurs : Al Kelley ; Ira Pohl Editeur : Menlo Park, Calif : Benjamin/Cummings Pub. Co Année de publication : 1984 Importance : 1 vol (362 p.) Format : 24 cm ISBN/ISSN/EAN : 978-0-8053-6860-4 Langues : Anglais (eng) Langues originales : Anglais (eng) Catégories : Informatique Mots-clés : Langage C Index. décimale : 005.1 Programmation Note de contenu : Table of Contents Starting from Zero. Why C? 1. An Overview of C. Programming and Preparation. Program Output. Variables, Expressions, and Assignment. The Use of #define and #include. The Use of printf() and scanf(). Flow of Control. The Use of getchar() and putchar(). Functions. Arrays, Strings, and Pointers. Files. An example random numbers and q best possible algorithm Summary Exercices 2. Syntax and the Lexical livel Characters and tokens Syntax Rules. Identifiers. Constants. Keywords. Operators and Punctuators. Strings Constants Summary Exercices 3. Declarations, Expressions, and Assignment. Data Types. Declarations The Fundamental Data Types. Expressions, statements,and Assignment. The Data Type int. Increment and decrement operators with int data The Integral Types short, long, and unsigned. The Floating Types. Mathematical Functions. The data Types short Assignment Operator. Conversions and Casts. Constants Hexadecimal and Octal Constants. Order of evaluation Summary Exercices 4. Flow of Control. Relational, Equality, and Logical Operators. Relational Operators and Expressions. Equality Operators and Expressions. Logical Operators and Expressions. The Compound Statement. The empty Statement. The if and the if-else Statements. The while Statement. The for Statement. An Example: Boolean Variables. The Comma Operator. The do Statement. An Example: Fibonacci Numbers. An Example:prime Numbers. Summary Exercices 5. Functions. Function Definition. The return Statement. Invocation and call by value The type specifier void An Example: elementary statistics Scope Rules. Parallel and Nested Blocks. The Storage Class auto. The Storage Class extern. The Storage Class register. The Storage Class static. Static External Variables. Summary Exercices 6.BRANCHING STATEMENTS, Bitwise EXPRESSION,AND enum THE goto statement THE break qnd continue statements The switch statement The conditional operator Bitwise Binary Logical Operators. Bitwise Binary Logical Operators. Masks. Packing and Unpacking. Multibyte Character Constants. Enumeration Types. An Example: The Game of Paper, Rock, Scissors. Summary Exercices 7. Pointers, ARRAYS,and Strings. Pointers. Pointers parameters in functions. One-dimensional Arrays The Relationship Pointers to Arrays. Pointer Arithmetic and Element Size. Arrays as Function Arguments. An Example: Bubble Sort. An Example: Merge and Merge Sort. Strings. An Example:Word count Multi-dimensional Arrays Arrays of Pointers Arguments to main(). Ragged Arrays. Summary Exercices 8.RECURSION, FUNCTIONS AS ARGUMENTS AND The Preprocessor. RECURSION An Example: Quicksort. An Example: finding the kth rank order element FUNCTIONS AS ARGUMENTS An Example:using bisection tofind the root of a function The Preprocessor. An Example:The Use of qsort(). Summary Exercices 8.RECURSION, FUNCTIONS AS ARGUMENTS AND The Preprocessor. RECURSION An Example: Quicksort. An Example: finding the kth rank order element FUNCTIONS AS ARGUMENTS An Example:using bisection tofind the root of a function The Preprocessor. An Example:The Use of qsort(). Summary Exercices 9. Structures Unions. And typedef The use of typdef Structures. Accessing Members Accessing and function Operator Precedence and Associativity: A Final Look. Using Structures with Functions. Initialization of Structures. An Example: arithmetic An Example: student Records unions Fields. Initialization of structures An Example: playing poker. Summary Exercices 10. Structures and List Processing. Self-referential Structures. Linear Linked Lists. List Operations. Some List Processing Functions. Stacks. An Example: Polish Notation and Stack Evaluation. Binary Trees. Binary Tree Traversal. Creating Trees. General Linked Lists. Summary Exercices 11. Input/Output and the unix Environment The Output Function printf(). The Input Function scanf(). Related Functions fprintf(), sprintf(), fscanf(), and sscanf(). Files The macros in ctype.h An Example:CRUNCH A C PROGRAM. File Descriptor Input/Output. Redirection and piping in unix An Example:printing a table of contents The CC Compiler. The C verifier lint The C pretty print command cb The make command The future of c :some final comments Summary Exercices Appendix index Côte titre : Fs/14425 A book on C : An introduction to programming in C [texte imprimé] / Al Kelley ; Ira Pohl . - Menlo Park, Calif : Benjamin/Cummings Pub. Co, 1984 . - 1 vol (362 p.) ; 24 cm. ISBN : 978-0-8053-6860-4 Langues : Anglais (eng) Langues originales : Anglais (eng) Catégories : Informatique Mots-clés : Langage C Index. décimale : 005.1 Programmation Note de contenu : Table of Contents Starting from Zero. Why C? 1. An Overview of C. Programming and Preparation. Program Output. Variables, Expressions, and Assignment. The Use of #define and #include. The Use of printf() and scanf(). Flow of Control. The Use of getchar() and putchar(). Functions. Arrays, Strings, and Pointers. Files. An example random numbers and q best possible algorithm Summary Exercices 2. Syntax and the Lexical livel Characters and tokens Syntax Rules. Identifiers. Constants. Keywords. Operators and Punctuators. Strings Constants Summary Exercices 3. Declarations, Expressions, and Assignment. Data Types. Declarations The Fundamental Data Types. Expressions, statements,and Assignment. The Data Type int. Increment and decrement operators with int data The Integral Types short, long, and unsigned. The Floating Types. Mathematical Functions. The data Types short Assignment Operator. Conversions and Casts. Constants Hexadecimal and Octal Constants. Order of evaluation Summary Exercices 4. Flow of Control. Relational, Equality, and Logical Operators. Relational Operators and Expressions. Equality Operators and Expressions. Logical Operators and Expressions. The Compound Statement. The empty Statement. The if and the if-else Statements. The while Statement. The for Statement. An Example: Boolean Variables. The Comma Operator. The do Statement. An Example: Fibonacci Numbers. An Example:prime Numbers. Summary Exercices 5. Functions. Function Definition. The return Statement. Invocation and call by value The type specifier void An Example: elementary statistics Scope Rules. Parallel and Nested Blocks. The Storage Class auto. The Storage Class extern. The Storage Class register. The Storage Class static. Static External Variables. Summary Exercices 6.BRANCHING STATEMENTS, Bitwise EXPRESSION,AND enum THE goto statement THE break qnd continue statements The switch statement The conditional operator Bitwise Binary Logical Operators. Bitwise Binary Logical Operators. Masks. Packing and Unpacking. Multibyte Character Constants. Enumeration Types. An Example: The Game of Paper, Rock, Scissors. Summary Exercices 7. Pointers, ARRAYS,and Strings. Pointers. Pointers parameters in functions. One-dimensional Arrays The Relationship Pointers to Arrays. Pointer Arithmetic and Element Size. Arrays as Function Arguments. An Example: Bubble Sort. An Example: Merge and Merge Sort. Strings. An Example:Word count Multi-dimensional Arrays Arrays of Pointers Arguments to main(). Ragged Arrays. Summary Exercices 8.RECURSION, FUNCTIONS AS ARGUMENTS AND The Preprocessor. RECURSION An Example: Quicksort. An Example: finding the kth rank order element FUNCTIONS AS ARGUMENTS An Example:using bisection tofind the root of a function The Preprocessor. An Example:The Use of qsort(). Summary Exercices 8.RECURSION, FUNCTIONS AS ARGUMENTS AND The Preprocessor. RECURSION An Example: Quicksort. An Example: finding the kth rank order element FUNCTIONS AS ARGUMENTS An Example:using bisection tofind the root of a function The Preprocessor. An Example:The Use of qsort(). Summary Exercices 9. Structures Unions. And typedef The use of typdef Structures. Accessing Members Accessing and function Operator Precedence and Associativity: A Final Look. Using Structures with Functions. Initialization of Structures. An Example: arithmetic An Example: student Records unions Fields. Initialization of structures An Example: playing poker. Summary Exercices 10. Structures and List Processing. Self-referential Structures. Linear Linked Lists. List Operations. Some List Processing Functions. Stacks. An Example: Polish Notation and Stack Evaluation. Binary Trees. Binary Tree Traversal. Creating Trees. General Linked Lists. Summary Exercices 11. Input/Output and the unix Environment The Output Function printf(). The Input Function scanf(). Related Functions fprintf(), sprintf(), fscanf(), and sscanf(). Files The macros in ctype.h An Example:CRUNCH A C PROGRAM. File Descriptor Input/Output. Redirection and piping in unix An Example:printing a table of contents The CC Compiler. The C verifier lint The C pretty print command cb The make command The future of c :some final comments Summary Exercices Appendix index Côte titre : Fs/14425

Exemplaires (1)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
Fs/14425	Fs/14425	Livre	Bibliothéque des sciences	Anglais	Disponible Disponible

---

1 (1 - 1 / 1)