- Cover
- Preface
- Contents (1/2)
- Contents (2/2)
- Course Syllabus
- Chapter 1: Program Development Styles and Basics of C
- 1.1 Program Development Methodologies
- 1.2 Programming Style
- 1.3 Stepwise Refinement and Modularity
- 1.4 Problem Solving Techniques
- 1.5 Algorithm
- 1.6 Flowcharts
- 1.7 Pseudocode
- 1.8 Sequence and Selection
- 1.9 Iteration and Recursion
- 1.10 Recursion Versus Iteration
- 1.11 Overview of Compilers and Interpreters
- 1.12 Structure of A C Program
- 1.13 Programming Rules
- 1.14 Executing the Program
- Summary
- Exercises
- Chapter 2: The C Declarations
- Chapter 3: Operators and Expressions
- Chapter 4: Input and Output in C
- Chapter 5: Decision Statements
- 5.1 Introduction
- 5.2 The if Statement
- 5.3 The if . . . else Statement
- 5.4 Nested if - else Statement (1/2)
- 5.4 Nested if - else Statement (2/2)
- 5.5 The break Statement
- 5.6 The continue Statement
- 5.7 The goto Statement
- 5.8 The switch Statement (1/3)
- 5.8 The switch Statement (2/3)
- 5.8 The switch Statement (3/3)
- 5.9 Nested switch () Case
- 5.10 The switch () Case and Nested IFS
- Summary
- Exercises
- Chapter 6: Loop Control Statements
- 6.1 Introduction
- 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/6)
- 6.3 Nested for Loops (2/6)
- 6.3 Nested for Loops (3/6)
- 6.3 Nested for Loops (4/6)
- 6.3 Nested for Loops (5/6)
- 6.3 Nested for Loops (6/6)
- 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 (1/2)
- 6.5 The do-while (2/2)
- 6.6 The do-while Statement with while Loop
- Summary
- Exercises
- Chapter 7: Arrays
- 7.1 Introduction
- 7.2 Array Initialization
- 7.3 Definition of Array
- 7.4 Characteristic of Array
- 7.5 One-dimensional Array (1/3)
- 7.5 One-dimensional Array (2/3)
- 7.5 One-dimensional Array (3/3)
- 7.6 Predefined Streams
- 7.7 Two-dimensional Array (1/4)
- 7.7 Two-dimensional Array (2/4)
- 7.7 Two-dimensional Array (3/4)
- 7.7 Two-dimensional Array (4/4)
- 7.8 Three- or Multi-dimensional Arrays
- 7.9 The sscanf () and sprintf () Functions
- Summary
- Exercises
- Chapter 8: Working with Strings & 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 Applications of Strings (1/2)
- 8.5 Applications of Strings (2/2)
- Summary
- Exercises
- Chapter 9: Pointers
- 9.1 Introduction
- 9.2 Features of Pointers
- 9.3 Pointer Declaration (1/2)
- 9.3 Pointer Declaration (2/2)
- 9.4 Arithmetic Operations with Pointers
- 9.5 Pointers and Arrays (1/2)
- 9.5 Pointers and Arrays (2/2)
- 9.6 Pointers and Two-dimensional Arrays
- 9.7 Array of Pointers
- 9.8 Pointers to Pointers
- 9.9 Pointers and Strings (1/2)
- 9.9 Pointers and Strings (2/2)
- 9.10 Void Pointers
- Summary
- Exercises
- Chapter 10: Functions
- 10.1 Introduction
- 10.2 Definition of a Function
- 10.3 Declaration of a Function
- 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 Functions with Arrays and Pointers (1/2)
- 10.9 Functions with Arrays and Pointers (2/2)
- 10.10 Recursion
- Summary
- Exercises
- Chapter 11: Preprocessor Directives
- 11.1 Introduction
- 11.2 The #define Directive
- 11.3 Undefining a Macro
- 11.4 Token Pasting and Stringizing Operators
- 11.5 The # include Directive
- 11.6 Conditional Compilation
- 11.7 The #ifndef Directive
- 11.8 The #error Directive
- 11.9 The # line Directive
- 11.10 Inline Directive
- 11.11 The #pragma Saveregs
- 11.12 The #pragma Directive
- 11.13 The Predefined Macros in Ansi and Turbo C
- 11.14 Standard I/O Predefined Streams in stdio.h
- 11.15 The Predefined Macros inctype. h
- Summary
- Exercises
- Chapter 12: Structure and Union
- 12.1 Introduction
- 12.2 Features of Structures
- 12.3 Declaration and Initialization of Structures
- 12.4 Structure within Structure
- 12.5 Array of Structures
- 12.6 Pointer to Structure
- 12.7 Structure and Functions
- 12.8 typedef
- 12.9 Bit Fields
- 12.10 Enumerated Data Type
- 12.11 Union
- 12.12 Calling Bios and Dos Services (1/2)
- 12.12 Calling Bios and Dos Services (2/2)
- 12.13 Union of Structures
- Summary
- Exercises
- Chapter 13: Files
- 13.1 Introduction
- 13.2 Streams and File Types
- 13.3 Steps for File Operations
- 13.4 File I/O
- 13.5 Structures Read and Write
- 13.6 Other File Function
- 13.7 Searching Errors in Reading/Writing Files (1/3)
- 13.7 Searching Errors in Reading/Writing Files (2/3)
- 13.7 Searching Errors in Reading/Writing Files (3/3)
- 13.8 Low Level Disk I/O
- 13.9 Command Line Arguments
- 13.10 Application of Command Line Arguments
- 13.11 Environment Variables
- 13.12 I/O Re direction
- Summary
- Exercises
- Chapter 14: Linear Data Structure
- 14.1 Introduction to Data Structure
- 14.2 List
- 14.3 Implementation of a List
- 14.4 Traversal of a List
- 14.5 Searching and Retrieving an Element
- 14.6 Predecessor and Successor
- 14.7 Insertion
- 14.8 Deletion
- 14.9 Sorting
- 14.10 Merging Lists
- 14.11 Representation of a Stack
- 14.12 Stack-Related Terms
- 14.13 Operation on a Stack
- 14.14 Implementation of a Stack
- 14.15 Queues
- 14.16 Various Positions of Queue
- 14.17 Representation of Queue
- 14.18 Single Linked List
- 14.19 Linked List with and without Header
- 14.20 Insertion
- 14.21 Deletion
- 14.22 Double Linked List
- 14.23 Applications
- Summary
- Exercises
- Chapter 15: Non-Linear Data Structure
- 15.1 Trees
- 15.2 Binary Trees
- 15.3 Types of Binary Tree
- 15.4 Binary Tree Representation
- 15.5 Traversing Binary Trees (1/2)
- 15.5 Traversing Binary Trees (2/2)
- 15.6 Binary Search Tree
- 15.7 Insertion and Deletion Operations
- 15.8 Hashing Technology (1/3)
- 15.8 Hashing Technology (2/3)
- 15.8 Hashing Technology (3/3)
- Summary
- Exercises
- Chapter 16: Searching and Sorting
Non-Linear Data Structure 563
return c ;
}
void disp (int fa r r [] ,in t count)
{
int a l;
fo r (a l= l;al<=count;al++)
p r in t f( "%5d", fa r r [ a l ] );
}
void search(int s a r r[] ,int n ,in t co)
{
int a2;
for (a2=l;a2<=co;a2++)
{
i f (n*=ยปsarr [a 2 ])
{
p r in t f ("The position of the number is %d H, a 2 );
break;
}
}
>
OUTPUT:
Enter the number of the elements:l 12 123 12345 1234
The length of 1 is:l
The length of 12 is:2
The length of 123 is:3
The length of 12345 is:5
The length of 1234 is:4
The Hash Table is as follows:
Index 1: 1
Index 2: 12
Index 3: 123
Index 4:1234
Index 5: 12345
Enter the number to search: 12345
The position of the number is 1 in Index 5
-
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click here login for view all page.