Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
TABLE OF CONTENTS
1. Introduction to C
1.1 Introduction to C
1.2 Uses of C
1.3 Evolution of C
1.4 Characteristics of C
1.5 Structure of C Program
1.6 C Compilation Model
1.7 Features of C
1.8 Summary
1.9 Review Questions
2. C Declarations
2.1 Introduction
2.2 Character Set
2.3 Tokens
2.3.1 Keywords
2.3.2 Identifiers
2.3.3 Constants
2.3.4 Strings
2.3.5 Special Symbols
2.3.6 Operators
2.4 Data Types
2.5 Summary
4. Control Statements
4.1 Introduction
4.2 Selection Statements
4.2.1 Simple if
4.2.2 if…else
4.2.3 Nested if…else
4.2.4 else if ladder
4.2.5 switch
4.3 Iterative Statements
4.3.1 while loop
4.3.2 do…while loop
4.3.3 for loop
4.4 Jumping Satements
4.4.1 break
4.4.2 continue
4.4.3 goto
4.5 Summary
4.6 Review Questions
4.7 Programming Exercises
5. Functions
5.1 Introduction
5.2 Benefits of Functions
5.3 Need for Functions
5.4 Function Prototypes
5.5 Function Definition
5.6 Function Call
5.7 Recursion
5.8 Nesting of Functions
5.9 Passing arguments
5.9.1 Call by Value
5.9.2 Call by Reference
5.10 Function Overloading
5.11 Summary
5.12 Review Questions
6. Arrays
6.1 Introduction
6.2 Need for an Array
6.3 Definition of an Array
6.4 Memory Organization of an Array
6.5 Array Declaration
6.6 Accessing Array Elements
6.7 Array Initialization
6.8 Basic Operations on Array
6.9 Getting the values for Array
6.10 Putting out the Array Elements
6.11 Types of Array
6.11.1 One Dimensional Array
6.11.2 Multi-Dimensional Array
6.12 Advantages of an Array
6.13 Limitations of an Array
6.14 Summary
6.15 Review Questions
7. Preprocessors
7.1 Introduction
7.2 File Inclusion
7.3 Macro Substitution
7.4 Conditional Compilation
7.5 Summary
7.6 Review Questions
8. Pointers
8.1
8.4 Summary
8.5 Review Questions
13. Stack
13.1 What is a stack?
13.2 Operations on Stack
13.3 Array based implementation of stack
13.4 Linked list implementation of stack
13.4.1 C Program for linked list implementation of stack
13.5 Applications of Stack
13.5.1 Balancing Symbols
13.5.2 Evaluating Postfix Expression
13.5.3 Conversion of Infix to postfix form
13.5.4 Recursive Function
13.6 Summary
15. Sorting
15.1 Introduction
15.2 Types of Sorting
15.3 Bubble Sort
15.4 Insertion Sort
15.5 Selection Sort
15.6 Shell Sort
15.7 Heap Sort
15.8 Merge Sort
15.9 Quick Sort
15.10Bucket Sort
15.11Indirect Sorting
15.11.1 Two Way Merge
15.11.2. Multi way Merge
15.11.3. Replacement Selection
15.12 Summary
15.13 Review Questions
16. Searching
16.1 Introduction
16.2 Types of Searching
16.3 Linear Search
16.4 Binary Search
16.5 Linear Search vs. Binary Search
16.6 Summary
16.7 Review Questions
17. Hashing
17.1 What is Hashing?
17.2 Hash Function
17.3 Types of Hashing
17.3.1 Separate chaining
17.3.2 Open Addressing
17.4 Types of Open Addressing
17.4.1 Linear Probing
17.4.2 Quadratic Probing
17.4.3 Double Hashing
17.5 Rehashing
17.6 Extendible Hashing
17.7 Applications of Hashing
17.8 Summary
17.9 Review Questions