Contents

1. Problem Solving, Algorithms and Flowcharts

1. Introduction

2. Types of Problems

3. Problem Solving Using Computer

4. Difficulties with Problem Solving

5. Problem Solving Aspects

5.1 Algorithms

5.2 Flowchart

6. Top Down Design

7. Problem solving using Arithmetic Statements

8. Problem Solving using Conditional Statements

9. Problem Solving using Iterative Statements

2. C Fundamentals

1. Introduction to C   

2. Features of ‘C’

3. Structure of a ‘C’ Program

3.1 The main function

3.2 C Program Development Steps

3.3 “Hello World” Program

4. C Tokens

5. The C Character Set

6. Keywords

7. Identifiers

8. Variables

9. Constants

9.1 Integer Constant

9.2 Floating Point Constant

9.3 Character Constant

9.4 String Literals

9.5 Enumeration Constant

9.6 Symbolic Constant

10. Data Types

10.1 Basic or Built-in Types

10.2 Derived Types

10.3 User Defined Types

10.4 Typecasting

10.5 Declarations

11. Operators and Expressions

11.1 Types of Operators

11.2 Arithmetic Operators

11.3 Relational Operators

11.4 Logical Operators

11.5 Increment and Decrement Operators

11.6 Bitwise Operators

11.7 Assignment Operator

11.8 Conditional Operator

11.9 Comma Operator

11.10 sizeof Operator

11.11 Other Operators

11.12 Precedence and Associativity of Operators

3. Control and Iterative Structures

1. Introduction

2. Decision Making Structures

2.1 ‘if’ statement

2.2 ‘if . . . else’ statement

3. Nested ‘if …else’ Statements

3.1 ‘else – if’ ladder

4. Conditional Branching – switch statement

5. Loop Statements

5.1 The ‘while’ loop

5.2 The ‘do-while’ loop

5.3 The ‘for’ Loop

6. Jump Statements

6.1 ‘break’

6.2 ‘continue’

6.3 goto Statement

4. Functions

1. Introduction to Functions 

2. Library and User Defined Functions

2.1 Standard Library Functions

3. User Defined Functions

3.1 Function Declaration

3.2 Function Definition

3.3 The ‘return’ Statement

3.4 Calling a Function

3.5 Function Arguments

4. Methods of Calling a Function

4.1 Call by Value

4.2 Call by Reference

4.3 Difference between Call by value and Call by reference

5. Recursion

6. Storage Classes

5. Arrays

1. Introduction

2. Array Declaration

3. Bounds Checking

4. One–Dimensional Array

4.1 Initializing an Array

4.2 Accessing Array Elements

4.3 Assigning Values to Array Elements

4.4 Limitations of Array

4.5 Sample Programs using 1–D Arrays

5. Two-Dimensional Arrays

5.1 Initializing the Array

5.2 Memory Representation of 2-D Array

5.3 Accepting and Displaying 2-D Array

5.4 Sample Programs using 2–D Arrays

6. Arrays and Functions

6.1 Passing the Array Element By Element

6.2 Passing the Entire Array to a Function

6.3 Sample Programs using Arrays and Functions