Introduction To C Programming
-
Introduction To Programming
-
Overview Of C
-
Structure Of A C Program
-
Constants, Variables Data Types
-
Operators
-
If-Else
-
While,Do-While And for Statements
-
Nested Loop Statements
-
The “Break” & “Continue” Statement
-
Switch Case Default & Break
Pointers
- What Is Pointer.
- Memory Concept
- Pointers To Variable
- Pointers To Pointers
- Pointers With Operation
Functions
- Introduction To Functions
- Why Functions.
- Standard & User Defined Functions
- Defining & Calling Functions
- Storage Classes:
Automatic Storage Classes Register Storage Classes Static Storage Classes External Storage Classes
- Pass By Value, Pass By Reference
- Return By Value & Return By Address
- Recursive Functions
- C Pre-Processor Directives
- What Is Header File.
- How To Create Our Own Header File.
Arrays
- What Is Array.
- Need For Arrays
- Arrays With Pointers
- Arrays With Functions
- Types Of Arrays
- One Dimensional Arrays
- Two Dimensional Arrays
- Multi Dimensional Arrays
Strings
- What Is String.
- Char Array (String)
- Declaring & Initializing String Variables
- Strings With Pointers
- Strings With Functions
- String Functions
Structures And Unions
- Enum And Typedef
- Introduction To Structure
- Defining Structures
- Structures With Pointers, Arrays, Strings And Functions
- Array ,Strings As Structures Members
- Containership
- Union, Different Between Structure & Union
File Operations
- Introduction To Files
- Types Of Files
- File Pointers
- Opening & Closing Files
- Modifying & Deleting Files
- Interacting With Text, Non-Text Files
- Data Base Files
- Creating Database With File Operation
- Command Line Arguments
DATA STRUCTURES
Linked Lists
-
Introduction To DMA
-
Malloc, Calloc, Realloc And Free
-
Lists
-
Single Linked Lists
-
Double Linked Lists
-
Circular Linked Lists
-
Inserting A Node In Required Position
-
Deleting A Node From Required Position
Stacks And Queues
- Introduction To Stacks & Queues
- Implementation Of Stack Using Array
- Implementation Of Stack Using Lists
- Implementation Of Queue Using Array
- Implementation Of Queue Using Lists
- Implementation Of Priority Queue
- Implementation Of D-Queue
- Implementation Of Circular Queue
- Infix, Prefix And Postfix Notation, Evaluation And Conversion
Trees And Graphs
- Introduction To Trees
- Binary Trees-Terminology
- Binary Tree Traversal
- In Order
- Pre Order
- Post Order
- Introduction To Graphs
- Graphs-Terminology
- Graphs Traversal (Bfs&Dfs)
Searching And Sorting
- Searching & Sorting
- Linear Search
- Binary Search
- Sorting
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort And
- Quick Sort
|