book

Computer Fundamentals and Programming in C (RMK)

Name: Computer Fundamentals and Programming in C (RMK)
ISBN: 9789332578135

by Anita Goel, Ajay Mittal

December 2016

Intermediate to advanced

737 pages

25h 7m

English

Pearson India

Read now

Unlock full access

Cover
Copyright
Roadmap to the Syllabus
Brief Contents
Contents (1/2)
Contents (2/2)
Preface
Why and How I Wrote this BookC Programming LanguageAbout the Book
Structure of the Book
Salient Features and Strengths of the Book
Typographical Conventions
Web ResourcesAcknowledgements
Part – I: Computer Fundamentals

1: Basics of Computer
1.1 Introduction
1.2 Digital and Analog Computers1.3 Characteristics of Computer
1.4 History of Computer
1.5 Generations of Computer
1.5.1 First Generation (1940 to 1956): Using Vacuum Tubes1.5.2 Second Generation (1956 to 1963): Using Transistors1.5.3 Third Generation (1964 to 1971): Using Integrated Circuits1.5.4 Fourth Generation (1971 to present): Using Microprocessors
1.5.5 Fifth Generation (Present and Next): Using Artificial Intelligence
1.6 Classification of Computer1.6.1 Microcomputers1.6.2 Minicomputers1.6.3 Mainframe Computers1.6.4 Supercomputers
1.7 The Computer System
1.7.1 The Input-Process-Output Concept1.7.2 Components of Computer Hardware
1.8 Central Processing Unit
1.8.1 Arithmetic Logic Unit1.8.2 Registers
1.8.3 Control Unit
1.9 Memory Unit1.9.1 Cache Memory1.9.2 Primary Memory1.9.3 Secondary Memory
1.10 Instruction Format
1.11 Instruction Set
1.12 Instruction Cycle
1.13 Microprocessor
1.14 Interconnecting the Units of a Computer
1.14.1 System Bus
1.14.2 Expansion Bus
1.14.3 External Ports1.15 Performance of a Computer
1.16 Inside a Computer Cabinet
1.16.1 Motherboard1.16.2 Ports and Interfaces1.16.3 Expansion Slots1.16.4 Ribbon Cables1.16.5 Memory Chips
1.16.6 Storage Devices
1.16.7 Processor1.17 Application of Computers
1.18 Summary
Exercise Questions (1/2)
Exercise Questions (2/2)
Additional Questions
2: Data Representation and Programming Fundamentals
2.1 Data Representation
2.2 Number System2.2.1 Decimal Number System2.2.2 Binary Number System2.2.3 Octal Number System2.2.4 Hexadecimal Number System
2.3 Conversion from Decimal to Binary, Octal, Hexadecimal
2.3.1 Converting Decimal Integer to Binary, Octal, Hexadecimal2.3.2 Converting Decimal Fraction to Binary, Octal, Hexadecimal2.3.3 Converting Decimal Integer.Fraction to Binary, Octal, Hexadecimal
2.4 Conversion of Binary, Octal, Hexadecimal to Decimal
2.5 Conversion of Binary to Octal, Hexadecimal
2.6 Conversion of Octal, Hexadecimal to Binary
2.7 Binary Arithmetic
2.7.1 Binary Addition2.7.2 Binary Subtraction
2.8 Signed and Unsigned Numbers
2.8.1 Complement of Binary Numbers
2.9 Binary Data Representation
2.9.1 Fixed Point Number Representation
2.9.2 Floating Point Number Representation
2.10 Binary Coding Schemes2.10.1 EBCDIC2.10.2 ASCII2.10.3 Unicode
2.11 Logic Gates
2.12 Programming Fundamentals
2.13 Program Development Life Cycle
2.14 Algorithm
2.15 Control Structures
2.16 Flowchart
2.16.1 Flowchart Symbols2.16.2 Preparing a Flowchart
2.17 Pseudo Code
2.17.1 Preparing a Pseudo Code
2.18 Programming Paradigms
2.18.1 Structured Programming2.18.2 Object-Oriented Programming (OOP)2.18.3 Aspect-Oriented Programming (AOP)
2.19 Problem Formulation and Problem Solving
2.19.1 Problem Solving2.19.2 Problem Formulation2.20 Summary
Exercise Questions (1/2)
Conceptual Questions and AnswersAdditional Questions
Exercise Questions (2/2)
Programming Exercise
Part – II: Basics of C Programming
3: Data Types, Variables and Constants
3.1 Introduction
3.2 C Standards3.2.1 Kernighan & Ritchie (K&R) C Standard3.2.2 ANSI C/Standard C/C89 Standard3.2.3 ISO C/C90 Standard3.2.4 C99 Standard
3.3 Learning Programming Language and Natural Language: An Analogy
3.4 C Character Set
3.5 Identifiers and Keywords
3.5.1 Identifiers
3.5.2 Keywords
3.6 Declaration Statement
3.7 Data Types
3.7.1 Basic/Primitive Data Types3.7.2 Derived Data Types3.7.3 User-defined Data Types
3.8 Type Qualifiers and Type Modifiers
3.8.1 Type Qualifiers3.8.2 Type Modifiers3.9 Difference Between Declaration and Definition
3.10 Data Object, L-value and R-value
3.10.1 Data Object3.10.2 L-value3.10.3 R-value
3.11 Variables and Constants
3.11.1 Variables3.11.2 Constants3.11.2.1 Literal Constant3.11.2.1.1 Integer Literal Constant3.11.2.1.2 Floating Point Literal Constant3.11.2.1.3 Character Literal Constant3.11.2.1.3.1 Printable Character Literal Constant3.11.2.1.3.2 Non-printable Character Literal Constant3.11.2.1.4 String Literal Constant3.11.2.2 Qualified Constants
3.11.2.3 Symbolic Constants
3.12 Structure of a C Program3.12.1 Comments3.12.1.1 Single-line Comment3.12.1.2 Multi-line Comment3.12.2 Section1: Preprocessor Directive Section3.12.3 Section 2: Global Declaration Section
3.12.4 Section 3: Functions Section
3.12.4.1 Header of a Function3.12.4.2 Body of a Function3.13 Executing a C Program
3.14 Compilation and Linking process
3.15 More Programs for Startup
3.16 Summary
Exercise QuestionsConceptual Questions and Answers
Code Snippets
Multiple-choice Questions
Outputs and Explanations to Code Snippets
Answers to Multiple-choice Questions
Programming Exercises
Test Yourself
4: Operators and Expressions
4.1 Introduction
4.2 Expressions4.2.1 Operands4.2.2 Operators4.3 Simple Expressions and Compound Expressions
4.3.1 Precedence of Operators
4.3.2 Associativity of Operators4.4 Classification of Operators (1/3)4.4.1 Classification Based on Number of Operands4.4.2 Classification Based on Role of Operator4.4.2.1 Arithmetic Operators
4.4 Classification of Operators (2/3)
4.4.2.2 Relational Operators4.4.2.3 Logical Operators
4.4 Classification of Operators (3/3)
4.4.2.4 Bitwise Operators4.4.2.5 Assignment Operators4.4.2.6 Miscellaneous Operators4.4.2.6.1 Conditional Operator4.4.2.6.2 Comma Operator4.4.2.6.3 sizeof Operator
4.4.2.6.4 Address-of Operator
4.5 Combined Precedence of All Operators
4.6 Reading Strings from the Keyboard
4.7 Printing Strings on the Screen
4.8 Unformatted Functions
4.9 Summary
Exercise Questions (1/8)
Conceptual Questions and Answers
Exercise Questions (2/8)
Code Snippets
Exercise Questions (3/8)
Multiple-choice QuestionsOutputs and Explanations to Code Snippets
Exercise Questions (4/8)
Exercise Questions (5/8)
Exercise Questions (6/8)
Exercise Questions (7/8)
Answers to Multiple-choice QuestionsProgramming Exercises
Exercise Questions (8/8)
Test Yourself
5: Decision-Making and Looping Statements
5.1 Introduction
5.2 Statements5.3 Classification of Statements5.3.1 Based Upon the Type of Action they Perform5.3.1.1 Non-executable Statements5.3.1.2 Executable Statements5.3.2 Based Upon the Number of Constituent Statements5.3.2.1 Simple Statements5.3.2.2 Compound Statements5.3.3 Based Upon their Role5.3.3.1 Declaration Statement and Definition Statement5.3.3.2 Null Statement and Expression Statements
5.3.3.3 Labeled Statements
5.3.3.3.1 Identifier-labeled Statements5.3.3.3.2 Case-labeled Statements
5.3.3.3.3 Default-labeled Statements
5.3.3.4 Flow Control Statements5.4 Branching Statements (1/3)5.4.1 Selection Statements5.4.2 if Statement5.4.3 if-else Statement
5.4 Branching Statements (2/3)
5.4.4 Nested if Statement5.4.5 Nested if-else Statement5.4.6 switch Statement
5.4 Branching Statements (3/3)
5.4.7 Jump Statements5.4.8 goto Statement5.4.9 break Statement5.4.10 continue Statement5.4.11 return Statement
5.5 Iteration Statements (1/3)
5.5.1 Counter-Controlled Loops5.5.2 for Statement5.5.3 while Statement
5.5 Iteration Statements (2/3)
5.5.4 do-while Statement5.5.5 Sentinel-Controlled Loops5.5.6 Nested Loops5.5.7 Semantics of break and continue Statements5.5.7.1 Semantics of break Statement
5.5 Iteration Statements (3/3)
5.5.7.2 Semantics of continue Statement
5.6 Summary
Exercise QuestionsConceptual Questions and Answers
Code Snippets
Multiple-choice Questions
Outputs and Explanations to Code Snippets
Answers to Multiple-choice Questions
Programming Exercises
Test Yourself
Part – III: Arrays, Pointers and Strings
6: Arrays and Pointers
6.1 Introduction
6.2 Arrays
6.3 Single-dimensional Arrays (1/2)
6.3.1 Declaration of a Single-dimensional Array6.3.2 Usage of Single-dimensional Array6.3.2.1 Reading, Storing and Accessing Elements of a One-dimensional Array6.3.3 Memory Representation of Single-dimensional Array
6.3 Single-dimensional Arrays (2/2)
6.3.4 Operations on a Single-dimensional Array6.3.4.1 Subscripting a Single-dimensional Array6.3.4.2 Assigning an Array to Another Array
6.3.4.3 Equating an Array with Another Array
6.4 Pointers (1/2)6.4.1 Operations on Pointers6.4.1.1 Referencing Operation6.4.1.2 Dereferencing a Pointer6.4.1.3 Assigning to a Pointer
6.4 Pointers (2/2)
6.4.2 Arithmetic Operations (Pointer Arithmetic)6.4.2.1 Addition Operation6.4.2.2 Increment Operation6.4.2.3 Subtraction Operation6.4.2.4 Decrement Operation6.4.3 Relational (Comparison) Operations
6.4.4 Illegal Pointer Operations
6.5 void pointer6.5.1 Operations on void Pointer
6.6 Null Pointer
6.7 Relationship Between Arrays and Pointers
6.8 Scaling up the Concept (1/2)
6.8.1 Array of Arrays (Multi-dimensional Arrays)6.8.2 Two-dimensional Arrays6.8.2.1 Declaration of a Two-dimensional Array6.8.2.2 Usage of a Two-dimensional Array6.8.2.2.1 Reading, storing and accessing elements of a 2-D array
6.8 Scaling up the Concept (2/2)
6.8.2.3 Memory Representation of a Two-dimensional Array6.8.2.3.1 Row Major Order of Storage6.8.2.3.2 Column Major Order of Storage6.8.3 Three-dimensional Arrays
6.8.3.1 Declaration of a Three-dimensional Array
6.9 Array of Pointers
6.10 Pointer to a Pointer
6.11 Pointer to an Array
6.12 Advantages and Limitations of Arrays
6.13 Searching6.13.1 Binary Search
6.14 Sorting (1/4)
6.14.1 Selection Sort6.14.2 Bubble Sort
6.14 Sorting (2/4)
6.14.3 Insertion Sort6.14.4 Merge Sort
6.14 Sorting (3/4)
6.14.5 Quick Sort
6.14 Sorting (4/4)
6.14.6 Shell Sort
6.14.7 Radix Sort
6.15 Summary
Exercise Questions (1/9)
Conceptual Questions and Answers
Exercise Questions (2/9)
Code Snippets
Exercise Questions (3/9)
Multiple-choice QuestionsOutputs and Explanations to Code Snippets
Exercise Questions (4/9)
Exercise Questions (5/9)
Exercise Questions (6/9)
Answers to Multiple-choice QuestionsProgramming Exercises
Exercise Questions (7/9)
Exercise Questions (8/9)
Exercise Questions (9/9)
Test Yourself
7: Strings and Character Arrays
7.1 Introduction
7.2 Strings
7.3 Character Arrays
7.4 Importance of Terminating Null Character
7.5 String Library Functions (1/4)
7.5.1 strlen Function7.5.2 strcpy Function7.5.3 strcat Function7.5.4 strcmp Function7.5.5 strcmpi Function
7.5 String Library Functions (2/4)
7.5.6 strrev Function7.5.7 strlwr Function7.5.8 strupr Function7.5.9 strset Function7.5.10 strchr Function
7.5 String Library Functions (3/4)
7.5.11 strrchr Function7.5.12 strstr Function7.5.13 strncpy Function7.5.14 strncat Function
7.5 String Library Functions (4/4)
7.5.15 strncmp Function7.5.16 strncmpi Function
7.5.17 strnset Function
7.6 List of Strings7.6.1 Array of Strings7.6.1.1 Declaration of Array of strings7.6.1.2 Reading List of Strings from the Terminal7.6.2 Array of Character Pointers7.6.2.1 Use of Array of Character Pointers
7.7 Command Line Arguments
7.8 Summary
Exercise Questions (1/9)
Conceptual Questions and Answers
Exercise Questions (2/9)
Code Snippets
Exercise Questions (3/9)
Multiple-choice QuestionsOutputs and Explanations to Code Snippets
Exercise Questions (4/9)
Exercise Questions (5/9)
Answers to Multiple-choice Questions
Exercise Questions (6/9)
Programming Exercises
Exercise Questions (7/9)
Exercise Questions (8/9)
Test Yourself
Exercise Questions (9/9)
Part – IV: Functions
8: Functions
8.1 Introduction
8.2 Functions
8.3 Classification of Functions
8.3.1 Based Upon who Develops the Function8.4 User-defined Functions8.4.1 Function Declaration8.4.2 Function Definition8.4.2.1 Header of a Function8.4.2.2 Body of a Function
8.4.3 Function Invocation/Call/Use
8.4.3.1 Function with No Input–Output8.4.3.2 void Functions8.4.3.3 Function with Inputs and No Output
8.4.3.4 Function with Inputs and One Output
8.4.3.5 return Statement
8.5 Function with Inputs and Outputs (1/5)
8.5.1 Passing Arguments by Value8.5.2 Passing Arguments by Address/Reference8.5.3 Returning More Than One Value Indirectly8.5.4 Passing Arrays to Functions8.5.4.1 Passing One-dimensional Arrays to Functions8.5.4.2 Passing Two-dimensional Arrays to Functions
8.5 Function with Inputs and Outputs (2/5)
8.5.4.3 Default Arguments8.5.4.4 Command Line Arguments8.5.5 Recursion8.5.5.1 Direct and Indirect Recursion
8.5 Function with Inputs and Outputs (3/5)
8.5.5.2 Tail Recursion and Non-tail Recursion8.5.5.3 Pattern of Recursive Calls8.5.5.3.1 Linear Recursion8.5.5.3.1.1 How Recursion Works8.5.5.3.2 Binary Recursion
8.5 Function with Inputs and Outputs (4/5)
8.5.5.3.2.1 Tower of Hanoi Problem8.5.5.3.3 n-ary Recursion8.5.6 Pointers to Functions
8.5 Function with Inputs and Outputs (5/5)
8.5.6.1 Declaration of a Function Pointer8.5.6.2 Assigning or Initializing a Function Pointer8.5.6.3 Calling a Function Using Function Pointer8.5.7 Array of Function Pointers
8.5.8 Passing Function to a Function as an Argument
8.6 Library Functions8.6.1 Declaration of Library Functions/Role of Header Files8.6.2 Use of Library Functions8.6.2.1 Library of Mathematical Functions
8.6.2.2 Library of Standard Input/Output Functions
8.6.2.3 Library of String Processing Functions8.7 Based upon the Number of Arguments a Function Accepts8.7.1 Fixed Argument Functions8.7.2 Variable Argument Functions
8.8 Summary
Exercise Questions (1/8)
Conceptual Questions and Answers
Exercise Questions (2/8)
Code Snippets
Exercise Questions (3/8)
Exercise Questions (4/8)
Multiple-choice QuestionsOutputs and Explanations to Code Snippets
Exercise Questions (5/8)
Exercise Questions (6/8)
Answers to Multiple-choice QuestionsProgramming Exercises
Exercise Questions (7/8)
Test Yourself
Exercise Questions (8/8)
Part – V: Structures and Unions
9: Structures and Unions
9.1 Introduction
9.2 Structures9.2.1 Defining a Structure
9.2.2 Declaring Structure Objects
9.2.3 Operations on Structures9.2.3.1 Aggregate Operations9.2.3.1.1 Accessing Members of an Object of a Structure Type
9.2.3.1.2 Assigning a Structure Object to a Structure Variable
9.2.3.1.3 Address-of a Structure Object9.2.3.1.4 Use of sizeof Operator on Structures
9.2.3.1.5 Equating Structure Objects of the Same Type
9.2.3.2 Segregate Operations
9.3 Pointers to Structures
9.3.1 Declaring Pointer to a Structure9.3.2 Accessing Structure Members Via a Pointer to a Structure
9.4 Array of Structures
9.5 Structures within a Structure (Nested Structures)
9.6 Functions and Structures
9.6.1 Passing Each Member of a Structure Object as a Separate Argument9.6.2 Passing a Structure Object by Value9.6.3 Passing a Structure Object by Address/Reference
9.7 typedef and Structures
9.8 Unions
9.9 Practical Application of Unions (1/2)
9.9.1 Calling DOS and BIOS Functions9.9.2 Interrupt Programming
9.9 Practical Application of Unions (2/2)
9.10 Enumerations (1/2)
9.10 Enumerations (2/2)
9.11 Bit-fields
9.12 Summary
Exercise Questions (1/8)
Conceptual Questions and Answers
Exercise Questions (2/8)
Exercise Questions (3/8)
Code Snippets
Exercise Questions (4/8)
Multiple-choice Questions
Exercise Questions (5/8)
Outputs and Explanations to Code Snippets
Exercise Questions (6/8)
Answers to Multiple-choice QuestionsProgramming Exercises
Exercise Questions (7/8)
Exercise Questions (8/8)
Test Yourself
10: Storage Class and Preprocessor Directives
10.1 Storage Duration/Lifetime of an Object
10.2 Storage Classes (1/2)
10.2.1 The auto Storage Class10.2.2 The register Storage Class10.2.3 The static Storage Class
10.2 Storage Classes (2/2)
10.2.4 The extern Storage Class10.2.5 The typedef Storage Class
10.3 The C Preprocessor
10.4 Translators
10.5 Phases of Translation (1/5)
10.5.1 Trigraph Replacement10.5.2 Line Splicing10.5.3 Tokenization10.5.4 Preprocessor Directive Handling10.5.4.1 Macro Replacement Directives10.5.4.1.1 Types of Macro10.5.4.1.1.1 Object-like Macros
10.5 Phases of Translation (2/5)
10.5.4.1.1.2 Function-like Macros10.5.4.1.2 Common Macro Pitfalls10.5.4.1.2.1 Magical White Space10.5.4.1.2.2 Operator Precedence Problems10.5.4.1.2.3 Arguments with a Side-effect10.5.4.1.2.4 Undesirable Semicolon10.5.4.1.3 Stringification/Token Replacement
10.5 Phases of Translation (3/5)
10.5.4.1.4 Concatenation/Token Pasting10.5.4.1.5 Predefined Macros10.5.4.1.6 undef Directive
10.5 Phases of Translation (4/5)
10.5.4.1.7 Scope of Macro Definitions10.5.4.2 Source File Inclusion Directive10.5.4.3 line Directive10.5.4.4 error Directive10.5.4.5 pragma Directive
10.5 Phases of Translation (5/5)
10.5.4.6 Conditional Compilation Directives
10.5.4.7 Null Directive
10.6 Summary
Exercise Questions (1/6)
Conceptual Questions and Answers
Exercise Questions (2/6)
Code Snippets
Exercise Questions (3/6)
Exercise Questions (4/6)
Multiple-choice QuestionsOutputs and Explanations to Code Snippets
Exercise Questions (5/6)
Answers to Multiple-choice QuestionsProgramming Exercises
Exercise Questions (6/6)
Test Yourself
Index (1/2)
Index (2/2)

Content preview from Computer Fundamentals and Programming in C (RMK)

2.18 Computer Fundamentals

Number System Base Complements possible

Binary 2 1’s complement and 2’s complement

Octal 8 7’s complement and 8’s complement

Decimal 10 9’s complement and 10’s complement

Hexadecimal 16 15’s complement and 16’s complement

Let us now see how to find the complement of a binary number. There are two types of

complements for the binary number system—1’s complement and 2’s complement.

1. 1’s Complement of Binary Number is computed by changing the bits 1 to 0 and the bits

0 to 1. For example,

1’s complement of 101 is 010

1’s complement of 1011 is 0100

1’s complement of 1101100 is 0010011

2. 2’s Complement of 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

Computer Fundamentals and Programming in C (RMK)

Publisher Resources

ISBN: 9789332578135

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Computer Fundamentals and Programming in C (RMK)

by Anita Goel, Ajay Mittal

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

Computer Fundamentals and Programming in C (RMK)

Express Learning - Computer Fundamentals and Programming

Programming Visual Basic .NET

The C# Programming Language (Covering C# 4.0), Fourth Edition

Publisher Resources