Programming in ANSI C / (Record no. 2680)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 07235pam a2200193 a 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780070681828 (pb) |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | CUS |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.13 |
| Item number | BAL/P |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Balagurusamy, E |
| 245 10 - TITLE STATEMENT | |
| Title | Programming in ANSI C / |
| Statement of responsibility, etc. | E Balagurusamy |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 5th ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | New Delhi : |
| Name of publisher, distributor, etc. | Tata Mcgraw-hill ; |
| Date of publication, distribution, etc. | 2011. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xii, 549 : |
| Other physical details | ill. (some col.) ; |
| Dimensions | 25 cm. |
| 500 ## - GENERAL NOTE | |
| General note | Previous ed. published 1990 under title: Applications programming in ANSI C. |
| 500 ## - GENERAL NOTE | |
| General note | Includes index. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Preface to the Fifth Edition<br/>1 Overview of C<br/>1.1 History of C 1<br/>1.2 Importance of C 3<br/>1.3 Sample Program 1: Printing a Message 3<br/>1.4 Sample Program 2; Adding Two Numbers 6<br/>1.5 Sample Program 3: Interest Calculation 8<br/>1.6 Sample Program 4; Use of Subroutines 10<br/>1.7 Sample Program 5: Use of Math Functions 11<br/>1.8 Basic Structure of C Programs 12<br/>1.9 Programming Style 14<br/>1.10 Executing a 'C Program 14<br/>1.11 Unix System 16<br/>1.12 Ms-Dos System 18<br/>Review Questions 19-<br/>Programming Exercises 20<br/>2 Constants, Variables, and Data Types<br/>2.1 Introduction 23<br/>2.2 Character Set 23<br/>2.3 C Tokens 25<br/>2.4 Keywords and Identifiers 25<br/>2.5 Constants 26<br/>2.6 Variables 30<br/>2.7 Data Types 31<br/>2.8 Declaration of Variables 34<br/>2.9 Declaration of Storage Class 37<br/>2.10 Assigning Values to Variables 38<br/>2.11 Defining Symbolic Constants 44<br/>2.12 Declaring a Variable as Constant 45<br/>2.13 Declaring a Variable as Volatile 45<br/>\<br/>2.14 Overflow and Underflow of Data 46<br/>Review Questions 49<br/>Programming Exercises 51<br/>3 Operators and Expressions<br/>3.1 Introduction 52<br/>3.2 Arithmetic Operators 52<br/>3.3 Relational Operators 55<br/>3.4 Logical Operators 57<br/>3.5 Assignment Operators 57<br/>3.6 Increment and Decrement Operators 59<br/>3.7 Conditional Operator 61<br/>3.8 Bitwise Operators 61<br/>3.9 Special Operators 61<br/>3.10 Arithmetic Expressions 63<br/>3.11 Evaluation of Expressions 64<br/>3.12 Precedence of Arithmetic Operators 65<br/>3.13 Some Computational Problems 67<br/>3.14 Type Conversions in Expressions 68<br/>3.15 Operator Precedence and Associativity 72<br/>3.16 Mathematical Fimctions 74<br/>Review Questions 78<br/>Programming Exercises 81<br/>4 Managing Input and Output Operations<br/>4.1 Introduction 84<br/>• 4.2 Reading a Character 85<br/>4.3 Writing a Character 88<br/>4.4 Formatted Input 89<br/>4.5 Formatted Output 98<br/>Review Questions 110<br/>Programming Exercises 112<br/>5 Decision Making and Branching<br/>5.1 Introduction 114<br/>5.2 Decision Making with IF Statement 114<br/>5.3 Simple IF Statement 115<br/>5.4 The IF ELSE Statement 119<br/>5.5 Nesting of IF....ELSE Statements 122<br/>5.6 The ELSE IF Ladder 126<br/>5.7 The Switch Statement 129<br/>5.8 The ? ; Operator 133<br/>5.9 The GOTO Statement 136<br/>Review Questions 144<br/>Programming Exercises 148<br/>6 Decision Making and Looping<br/>6.1 Introduction 152<br/>6.2 The WHILE Statement 154<br/>6.3 The DO Statement 157<br/>6.4 The FOR Statement 159<br/>6.5 Jumps in LOOPS 166<br/>6.6 Concise Test Expressions 174<br/>Review Questions 182<br/>Programming Exercises 186<br/>7 Arrays<br/>7.1 Introduction 190<br/>7.2 One-dimensional Arrays 192<br/>7.3 Declaration of One-dimensional Arrays 193<br/>7.4 Initialization of One-dimensional Arrays 195<br/>7.5 Two-dimensional Arrays 199<br/>7.6 Initializing Two-dimensional Arrays 204<br/>7.7 Multi-dimensional Arrays 208<br/>7.8 Dynamic Arrays 209<br/>7.9 More about Arrays 209<br/>Review Questions 223<br/>Programming Exercises 225<br/>8 Character Arrays and Strings<br/>8.1 Introduction 229<br/>8.2 Declaring and Initializing String Variables 230<br/>8.3 Reading Strings from Terminal 231<br/>8.4 Writing Strings to Screen 236<br/>8.5 Arithmetic Operations on Characters 241<br/>8.6 Putting Strings Together 242<br/>8.7 Comparison of Two Strings 244<br/>8.8 String-handling Functions 244<br/>8.9 Table of Strings 250<br/>8.10 Other Features of Strings 252<br/>Review Questions 257<br/>Programming Exercises 259<br/>9 User-defined Functions<br/>9.1 Introduction 262<br/>9.2 Need for User-defined Functions 262<br/>9.3 A Multi-function Program 263<br/>9.4 Elements of User-defined Functions 266<br/>9.5 Definition of Functions 267<br/>9.6 Return Values and their Types 269<br/>9.7 Function Calls 270<br/>9.8 Function Declaration 272<br/>!■ 'i<br/>9.9 Category of Functions 274<br/>9.10 No Arguments and no Return Values 274<br/>9.11 Arguments but no Retxim Values 277<br/>9.12 Arguments with Return Values 280<br/>9.13 No Arguments but Returns a Value 284<br/>9.14 Fxmctions that Return Multiple Values 285<br/>9.15 Nesting of Functions 286<br/>9.16 Recursion 288<br/>9.17 Passing Arrays to Functions 289<br/>9.18 Passing Strings to Functions 294<br/>9.19 The Scope, Visibility and Lifetime of Vzuiables 295<br/>9.20 Multifile Programs 305<br/>Review Questions 311<br/>Programming Exercises 315<br/>10 Structures and Unions<br/>10.1 Introduction 317<br/>10.2 Defining a Structure 317<br/>10.3 Declaring Structure Vgiriables 319<br/>10.4 Accessing Structure Members 321<br/>10.5 Structure Initialization 322<br/>10.6 Copying and Comparing Structure Variables 324<br/>10.7 Operations on Individual Members 326<br/>10.8 Arrays of Structures 327<br/>10.9 Arrays within Structures 329<br/>10.10 Structures within Structmes 331<br/>10.11 Structures and Functions 333<br/>10.12 Unions 335<br/>10.13 Size of Structiires 337<br/>10.14 Bit Fields 337<br/>11 Pointers<br/>Review Questions 344<br/>Programming Exercises 348<br/>11.1 Introduction 351<br/>11.2 Understanding Pointers 351<br/>11.3 Accessing the Address of a Variable 354<br/>11.4 Declaring Pointer Vgiriables 355<br/>11.5 Initialization of Pointer Variables 356<br/>11.6 Accessing a Variable through its Pointer 358<br/>11.7 Chain of Pointers 360<br/>11.8 Pointer Expressions 361<br/>11.9 Pointer Increments and Scale Factor 362<br/>11.10 Pointers and Arrays 364<br/>11.11 Pointers and Character Strings 367<br/>11.12 Array of Pointers 369<br/>11.13 Pointers as Function Arguments 370<br/>11.14 Functions Returning Pointers 373<br/>11.15 Pointers to Functions 373<br/>11.16 Pointers and Structures 376<br/>11.17 Troubles with Pointers 379<br/>Review Questions 385<br/>Programming Exercises 388<br/>12 File Management in C<br/>12.1 Introduction 389<br/>12.2 Defining and Opening a File 390<br/>12.3 Closing a File 391<br/>12.4 Input/Output Operations on Files 392<br/>12.5 Error Handling During I/O Operations 398<br/>12.6 Random Access to Files 400<br/>12.7 Command Line Arguments 405<br/>Review Questions 408<br/>Programming Exercises 409<br/>13 Dynamic Memory Allocation and Linked Lists<br/>13.1 Introduction 411<br/>13.2 Dynamic Memory Allocation 411<br/>13.3 Allocating a Block of Memory: MALLOC 413<br/>13.4 Allocating Multiple Blocks of Memory: CALLOC 415<br/>13.5 Releasing the Used Space: Free 415<br/>13.6 Altering the Size of a Block: REALLOC 416<br/>13.7 Concepts of Linked Lists 417<br/>13.8 Advantages of Linked Lists 420<br/>13.9 Types of Linked Lists 421<br/>13.10 Pointers Revisited 422<br/>13.11 Creating a Linked List 424<br/>13.12 Inserting an Item 428<br/>13.13 Deleting an Item 431<br/>13.14 Application of Linked Lists 433<br/>Review Questions 440<br/>Programming Exercises 442<br/>14 The Preprocessor<br/>14.1 Introduction 444<br/>14.2 Macro Substitution 445<br/>14.3 File Inclusion 449<br/>14.4 Compiler Control Directives 450<br/>14.5 ANSI Additions 453<br/>Review Questions 456<br/>Programming Exercises 457<br/>15 Developing a G Program: Some Guidelines<br/>15.1 Introduction 458<br/>15.2 Program Design 458<br/>15.3 Program Coding 460<br/>15.4 Common Programming Errors 462<br/>15.5 Program Testing and Debugging 469<br/>15.6 Program Efficiency 471 |
| 650 #0 - SUBJECT | |
| Keyword | C (Computer program language) |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | General Books |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Full call number | Accession number | Date last seen | Date last checked out | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Central Library, Sikkim University | Central Library, Sikkim University | General Book Section | 13/06/2016 | 005.13 BAL/P | P18882 | 19/06/2023 | 30/05/2023 | General Books |