book

Programming In C, 3rd Edition

Name: Programming In C, 3rd Edition
Author: Kamthane
ISBN: 9789332547179

by Kamthane

April 2024

Intermediate to advanced

688 pages

24h 35m

English

Pearson India

Read now

Unlock full access

Cover
Title Page
Copyright Page
Contents (1/2)
Contents (2/2)
Preface
Acknowledgements
About the Author
1 Basics and Introduction to C
1.1 Why to Use Computers?
1.2 Basics of a Computer

1.3 Latest Computers
1.4 Introduction to C
1.5 About ANSI C Standard
1.6 Machine, Assembly and High-Level Language
1.6.1 Assembly Language
1.6.2 High-Level Language1.7 Assembler, Compiler and Interpreter
1.8 Structure of a C Program
1.9 Programming Rules
1.10 Executing the C Program
1.11 Standard Directories
1.12 The First C Program
1.13 Advantages of C
1.14 Header Files
1.15 Algorithm
1.15.1 Program Design
1.16 Classification of Algorithms
1.17 Flowcharts
1.18 Pseudocode
Summary
Exercises
2 The C Declarations
2.1 Introduction
2.2 The C Character Set
2.3 Delimiters
2.4 Types of Tokens
2.5 The C Keywords2.6 Identifiers
2.7 Constants
2.7.1 Numerical Constants
2.7.2 Character Constant
2.8 Variables
2.9 Rules for Defining Variables
2.10 Data Types
2.11 C Data Types
2.12 Integer and Float Number Representations
2.12.1 Integer Representation
2.12.2 Floating-Point Representation
2.13 Declaring Variables
2.14 Initializing Variables
2.15 Dynamic Initialization
2.16 Type Modifiers
2.17 Type Conversion
2.18 Wrapping Around
2.19 Constant and Volatile Variables
2.19.1 Constant Variable2.19.2 Volatile Variable
Summary
Exercises (1/2)
Exercises (2/2)
3 Operators and Expressions
3.1 Introduction
3.2 Operator Precedence
3.3 Associativity
3.4 Comma and Conditional Operator
3.5 Arithmetic Operators
3.6 Relational Operators
3.7 Assignment Operators and Expressions
3.8 Logical Operators
3.9 Bitwise Operators (1/2)
3.9 Bitwise Operators (2/2)
Summary
Exercises
4 Input and Output in C
4.1 Introduction
4.2 Formatted Functions
4.3 Flags, Widths and Precision with Format String (1/3)
4.3 Flags, Widths and Precision with Format String (2/3)
4.3 Flags, Widths and Precision with Format String (3/3)
4.4 Unformatted Functions
4.5 Commonly Used Library Functions
4.6 Strong Points for Understandability
Summary
Exercises
5 Decision Statements
5.1 Introduction
5.2 The if Statement
5.3 The if–else Statement
5.4 Nested if–else Statements
5.5 The if-else-if Ladder Statement (1/2)
5.5 The if-else-if Ladder Statement (2/2)
5.6 The break Statement
5.7 The continue Statement
5.8 The goto Statement
5.9 The switch Statement (1/3)
5.9 The switch Statement (2/3)
5.9 The switch Statement (3/3)
5.10 Nested switch case
5.11 The switch case and nested ifs
Summary
Exercises (1/2)
Exercises (2/2)
6 Loop Control
6.1 Introduction
6.1.1 What is a Loop?
6.2 The for Loop (1/4)
6.2 The for Loop (2/4)
6.2 The for Loop (3/4)
6.2 The for Loop (4/4)
6.3 Nested for Loops (1/5)
6.3 Nested for Loops (2/5)
6.3 Nested for Loops (3/5)
6.3 Nested for Loops (4/5)
6.3 Nested for Loops (5/5)
6.4 The while Loop (1/3)
6.4 The while Loop (2/3)
6.4 The while Loop (3/3)
6.5 The do-while Loop
6.6 The while Loop within the do-while Loop
6.7 Bohm and Jacopini’s Theory
SummaryExercises
7 Data Structure: Array
7.1 Introduction
7.2 Array Declaration
7.3 Array Initialization
7.4 Array Terminology
7.5 Characteristics of an Array
7.6 One-Dimensional Array (1/3)
7.6 One-Dimensional Array (2/3)
7.6 One-Dimensional Array (3/3)
7.7 One-Dimensional Array and Operations
7.8 Operations with Arrays (1/2)
7.8 Operations with Arrays (2/2)
7.9 Predefined Streams
7.10 Two-Dimensional Array and Operations
7.10.1 Insert Operation with Two-Dimensional Array
7.10.2 Delete Operation with Two-Dimensional Array (1/3)
7.10.2 Delete Operation with Two-Dimensional Array (2/3)
7.10.2 Delete Operation with Two-Dimensional Array (3/3)
7.11 Three- or Multi-Dimensional Arrays
7.12 The sscanf() and sprintf() Functions
7.13 Drawbacks of Linear Arrays
Summary
Exercises (1/2)
Exercises (2/2)
8 Strings and Standard Functions
8.1 Introduction
8.2 Declaration and Initialization of String
8.3 Display of Strings with Different Formats
8.4 String Standard Functions (1/5)
8.4 String Standard Functions (2/5)
8.4 String Standard Functions (3/5)
8.4 String Standard Functions (4/5)
8.4 String Standard Functions (5/5)
8.5 String Conversion Functions
8.6 Memory Functions
8.7 Applications of Strings (1/2)
8.7 Applications of Strings (2/2)
Summary
Exercises
9 Pointers
9.1 Introduction
9.2 Features of Pointers
9.3 Pointers and Address
9.4 Pointer Declaration (1/2)
9.4 Pointer Declaration (2/2)
9.5 The Void Pointers
9.6 Wild Pointers
9.7 Constant Pointers
9.8 Arithmetic Operations with Pointers
9.9 Pointers and Arrays
9.10 Pointers and Two-Dimensional Arrays
9.11 Pointers and Multi-Dimensional Arrays
9.12 Array of Pointers
9.13 Pointers to Pointers
9.14 Pointers and Strings (1/2)
9.14 Pointers and Strings (2/2)
Summary
Exercises
10 Functions
10.1 Introduction
10.2 Basics of a Function10.2.1 Why Use Functions?
10.2.2 How a Function Works?
10.3 Function Definition
10.4 The return Statement
10.5 Types of Functions (1/2)
10.5 Types of Functions (2/2)
10.6 Call by Value and Reference
10.7 Function Returning More Values
10.8 Function as an Argument
10.9 Function with Operators (1/2)
10.9 Function with Operators (2/2)
10.10 Function and Decision Statements
10.11 Function and Loop Statements
10.12 Functions with Arrays and Pointers (1/2)
10.12 Functions with Arrays and Pointers (2/2)
10.13 Passing Array to a Function
10.14 Nested Functions
10.15 Recursion
10.16 Types of Recursion
10.17 Rules for Recursive Function
10.18 Direct Recursion
10.19 Indirect Recursion
10.20 Recursion Versus Iterations
10.21 The Towers of Hanoi
10.22 Advantages and Disadvantages of Recursion
10.23 Efficiency of Recursion
10.24 Library Functions
Summary
Exercises
11 Storage Classes
11.1 Introduction
11.1.1 Lifetime of a Variable
11.1.2 Visibility of a Variable
11.2 Automatic Variables
11.3 External Variables
11.4 Static Variables
11.5 Static External Variables
11.6 Register Variables
Summary
Exercises
12 Preprocessor Directives
12.1 Introduction
12.2 The #define Directive
12.3 Undefining a Macro
12.4 Token Pasting and Stringizing Operators
12.5 The #include Directive
12.6 Conditional Compilation
12.7 The #ifndef Directive
12.8 The #error Directive
12.9 The #line Directive
12.10 The #pragma inline Directive12.11 The #pragma saveregs12.12 The #pragma Directive
12.13 The Predefined Macros in ANSI and Turbo-C
12.14 Standard I/O Predefined Streams in stdio.h
12.15 The Predefined Marcos in ctype.h
12.16 Assertions
Summary
Exercises
13 Structure and Union
13.1 Introduction
13.2 Features of Structures
13.3 Declaration and Initialization of Structures
13.4 Structure within Structure
13.5 Array of Structures
13.6 Pointer to Structure
13.7 Structure and Functions
13.8 typedef
13.9 Bit Fields
13.10 Enumerated Data Type
13.11 Union
13.12 Calling BIOS and DOS Services (1/2)
13.12 Calling BIOS and DOS Services (2/2)
13.13 Union of Structures
Summary
Exercises (1/2)
Exercises (2/2)
14 Files
14.1 Introduction of a File
14.2 Definition of File
14.3 Streams and File Types
14.3.1 File Types
14.4 Steps for File Operations
14.4.1 Opening of File
14.4.2 Reading a File14.4.3 Closing a File
14.4.4 Text Modes (1/2)
14.4.4 Text Modes (2/2)
14.4.5 Binary Modes
14.5 File I/O (1/2)
14.5 File I/O (2/2)
14.6 Structures Read and Write
14.7 Other File Function
14.8 Searching Errors in Reading/Writing Files (1/3)
14.8 Searching Errors in Reading/Writing Files (2/3)
14.8 Searching Errors in Reading/Writing Files (3/3)
14.9 Low-Level Disk I/O
14.10 Command Line Arguments
14.11 Application of Command Line Arguments
14.12 Environment Variables
14.13 I/O Redirection
Summary
Exercises
15 Graphics
15.1 Introduction
15.2 Initialization of Graphics15.3 Few Graphics Functions
15.4 Programs Using Library Functions
15.4.1 Program on Moving Moon
15.5 Working with Text
15.5.1 Stylish Lines
15.6 Filling Patterns with Different Colours and Styles
15.7 Mouse Programming
15.8 Drawing Non-common Figures
Summary
Exercises
16 Dynamic Memory Allocation and Linked List
16.1 Dynamic Memory Allocation
16.2 Memory Models
16.3 Memory Allocation Functions (1/2)
16.3 Memory Allocation Functions (2/2)
16.4 List
16.5 Traversal of a List
16.6 Searching and Retrieving an Element
16.7 Predecessor and Successor
16.8 Insertion
16.9 Linked Lists
16.10 Linked List with and without Header
16.10.1 Linked List with Header
Summary
Exercises
Appendix A
American Standard Code for Information Interchange
Appendix B
Priority of Operators and Their Clubbing
Appendix C
Header Files and Standard Library Functions
Appendix D
ROM-BIOS Services
Appendix E
Scan Codes of Keyboard Keys
Index (1/3)
Index (2/3)
Index (3/3)
Back Cover

Content preview from Programming In C, 3rd Edition

422 Programming in C

10.15 RECURSION

So far, we have seen function calling one another. In programming, there might be a situation where

a function needs to invoke itself. The C language supports recursive feature, i.e. a function is called

repetitively by itself. The recursion can be used directly or indirectly. The direct recursion function

calls to itself till the condition is true. In indirect recursion, a function calls to another function and

then called function calls to the calling function.

When a function calls itself until the last call is invoked till that time the first call also remains

open. At every time, a function invoked, ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 9789332547179

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Programming In C, 3rd Edition

by Kamthane

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

More than 5,000 organizations count on O’Reilly

Julian F.

Addison B.

Amir M.

Mark W.

You might also like

Programming in C, Third Edition

Programming in C by Jamwal

C Programming For Dummies, 2nd Edition

Practical C Programming

Publisher Resources