book

Computer Programming with C

Name: Computer Programming with C
Author: M. Rajaram
ISBN: 9789332568822

by M. Rajaram

April 2024

Beginner to intermediate

544 pages

18h 6m

English

Pearson India

Read now

Unlock full access

Cover
Contents (1/2)
Contents (2/2)
Preface
RoadMap to the Syllabus
About the Authors
Part I: Fundamentals of Computer
Chapter 0: Introduction to Computers
0.1 Introduction
0.2 Characteristics of Computers
0.3 Evolution of Computers

0.4 Computer Generations
0.4.1 First Generation (1940–1956): Vacuum Tubes0.4.2 Second Generation (1956–1963): Transistors0.4.3 Third Generation (1964 to Early 1970s): Integrated Circuits0.4.4 Fourth Generation (Early 1970s Till Date): Microprocessors0.4.5 Fifth Generation (Present and Beyond): Artificial Intelligence
0.5 Classification of Computers
0.5.1 Micro Computers0.5.2 Mini Computers0.5.3 Mainframe Computer0.5.4 Super Computers
0.6 Application of Computers
0.7 Basic Computer Organization
0.7.1 Hardware
0.8 Number system (1/2)
0.8.1 Types of Number System0.8.2 Conversion between Number Bases
0.8 Number system (2/2)
Summary
Exercises
Part II: Basics of C Programming
Chapter 1: Introduction to ‘C’
1.1 Introduction to C
1.2 About ANSI C Standard
1.3 Machine, Assembly and High-Level Language
1.3.1 Assembly Language
1.3.2 High-Level Language1.4 Assembler, Compiler and Interpreter
1.5 Structure of a C Program
1.6 Programming Rules
1.7 Executing the C Program
1.8 Standard Directories
1.9 The first C program
1.10 Advantages of C
1.11 Header Files
1.12 Problem-Solving Techniques
1.13 Algorithm
1.14 Analysing Algorithm
1.15 Rate of Growth1.15.1 Program Design
1.16 Classification of Algorithms
Summary
Exercises
Chapter 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 Keywords
2.6 Identifiers
2.7 Constants
2.7.1 Numerical Constants2.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 Representation2.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
Chapter 3: Operators and Expressions
3.1 Introduction
3.2 Properties of Operators
3.3 Priority of Operators and Their Clubing
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
Summary
Exercises
Chapter 4: Input and Output in C
4.1 Introduction
4.2 Formatted Functions (1/3)
4.2 Formatted Functions (2/3)
4.2 Formatted Functions (3/3)
4.3 Unformatted Functions
4.4 Commonly Used Library Functions
4.5 Strong Points for Understandability
SummaryExercises
Chapter 5: Decision Statements
5.1 Introduction
5.2 The if Statement
5.3 The if–else Statement
5.4 Nested if–else Statement
5.5 if-else-if Ladder Statement (1/2)
5.5 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
Chapter 6: Loop Control
6.1 Introduction
6.1.1 What is a Loop?
6.2 for Loop (1/4)
6.2 for Loop (2/4)
6.2 for Loop (3/4)
6.2 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 while Loop (1/3)
6.4 while Loop (2/3)
6.4 while Loop (3/3)
6.5 do-while LOOP (1/2)
6.5 do-while LOOP (2/2)
6.6 do-while Statement with while Loop
6.7 BOHM and Jacopini’s Theory
Summary
Exercises
Part III: Arrays and Strings
Chapter 7: Arrays
7.1 Introduction
7.2 Array Initialization
7.3 Array Terminology
7.4 Characteristics of an Array
7.5 One-Dimensional Array (1/3)
7.5 One-Dimensional Array (2/3)
7.5 One-Dimensional Array (3/3)
7.6 One-Dimensional Array and Operations
7.7 Operations With Arrays (1/2)
7.7 Operations With Arrays (2/2)
7.8 Predefined Streams
7.9 Two-Dimensional Array and Operations (1/4)
7.9.1 Insert Operation with Two-Dimensional Array7.9.2 Delete Operation With Two-Dimensional Array
7.9 Two-Dimensional Array and Operations (2/4)
7.9 Two-Dimensional Array and Operations (3/4)
7.9 Two-Dimensional Array and Operations (4/4)
7.10 Three- or Multi- Dimensional Arrays
7.11 The sscanf () and sprintf () functions
7.12 Draw backs of Linear Arrays
SummaryExercises
Chapter 8: Strings
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
Part IV: Pointers and Functions
Chapter 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 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 Array of Pointers
9.12 Pointers to Pointers
9.13 Pointers and Strings (1/2)
9.13 Pointers and Strings (2/2)
Summary
Exercises
Chapter 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 Recursion
10.14 Types of Recursion
10.15 Rules for Recursive Function
10.16 Direct Recursion
10.17 Indirect Recursion
10.18 Recursion Versus Iterations
10.19 The Towers of Hanoi
10.20 Advantages and Disadvantages of Recursion
10.21 Efficiency of Recursion
10.22 Library Function
Summary
Exercises
Part V: Structures and Unions
Chapter 11: Storage Class
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 Register Variables
Summary
Exercises
Chapter 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
Chapter 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
Appendix: American Standard Code for Information Interchange (1/2)
Appendix: American Standard Code for Information Interchange (2/2)
Index

Content preview from Computer Programming with C

0-24

Computer Programming with C

Example 3:

Determine the hexadecimal equivalent of (5112)

16 5112 Remainder Least Signicant Bit

16 319

8 = 8

16 19

15 = F

16 1

3 = 3

16 0

1 = 1

Most Signicant Bit

us, the hexadecimal equivalent of (5112)

is (13F8)

Converting Binary, Octal, and Hexadecimal to Decimal

e method used for the conversion of a binary, octal, or hexadecimal number to a decimal number

involves each digit of the binary, octal, or hexadecimal number to be multiplied by its weighted posi-

tion, and then each of the weighted values is added together to obtain the decimal number.

Example 1:

Determine the decimal equivalent of (11010)

Binary Number ...

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: 9789332568822

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Computer Programming with C

by M. Rajaram

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, 3rd Edition

Programming in C by Jamwal

Practical C Programming

Programming in C++, 2nd Edition

Publisher Resources