C PROGRAMMING LANGUAGE CONTENT
C Language Contents:Introduction to C Languagel�
Role Of Compilers and Assemblersl�
Procedural programming Approachl�
Top to Bottom Approachl�
Introduction to C BasicKeywordsl�
Data typesl�
Variablesl�
Constantsl�
Identifiersl�
Tokensl�
Operatorsl�
memory management in progl�
Flow Control StatementsJump statementsl�
Gotol�
Breakl�
Continuel�
Conditional Statementsl�
If statementl�
If else statementl�
Nested if elsel�
If else if ladderl�
Switch case statementl�
Iteration statementsl�
For loopl�
While loopl�
Do while loo[l�
Nested loopsl�
patternsl�
Arrays:Introduction to Arraysl�
Several examples of Arrays like insert, delete, counter occurrence of items etc. l�
Searchingl�
Sortingl�
2 D Arrayl�
Several Examples of 2 D arraysl�
Multidimensional Array sl�
C WITH DATA STRUCTURE & ALGORITHMS
Strings:Introduction to Stringsl�
String handling built in functionsl�
Several examples of Stringsl�
Array of Stringsl�
Searching in Array of Stringsl�
Sorting in Array of Stringsl�
POINTERSIntroduction to pointersl�
Pointer expressionsl�
Types of Pointersl�
Void Pointerl�
NULL Pointerl�
Wild Pointerl�
Dangling Pointerl�
Various examples of pointersl�
Pointer Arithmetic'sl�
Array using pointersl�
String using pointersl�
Pointers in Functionsl�
deadlock pointerl�
FUNCTIONSIntroduction to functionsl�
Types of functionsl�
Nesting of functionsl�
Various examples of functionsl�
Strings passing is functionsl�
Array Passing in Functionsl�
Pointer passing is functionsl�
Function Returning Addressl�
Function returning address l�
Recursionl�
Various Examples and Interview Questions on Recursion and Functionl�
Storage classesl�
STRUCTUREIntroduction to structurel�
Advantages of structurel�
Array of structurel�
Structure using pointerl�
Structure with functionsl�
Applications of structurel�
UnionIntroduction to unionl�
Advantages of unionl�
Difference between union and structurel�
EnumIntroduction to enuml�
DYNAMIC MEMORY ALLOCATIONIntroduction to dynamic memory allocationl�
Advantage of dynamic memory allocationl�
malloc(), calloc(), realloc(), free()l�
Array implementation using dynamic memory allocationl�
Macro and Compiler Control Directives#definel�
#undefl�
#ifdefl�
#ifndefl�
#elifl�
## Etc.l�
FILE MANAGEMENT Introduction to file managementl�
File opening modesl�
Opening and closing a filel�
Input output operations on filel�
Applications of file managementl�
Projectl�
DATA STRUCTURE AND ALGORITHMS CONTENT (using C)
INTRODUCTION TO DATA STRUCTURE AND ALGORITHMSWhat is data structurel�
Benefits of data structurel�
Types of data structurel�
Introduction to algorithmsl�
Types of Algorithmsl�
Time and Space Complexityl�
Interview Questionsl�
LINEAR DATA STRUCTUREArrayl�
Stringl�
Link listl�
Introduction to link listl�
Array vs. link listsl�
Types of link listsl�
Implementation of link listl�
Singly link listl�
Insertion(at first position, last position and at used specific position) , deletion(at first position, last l�
position and at used specific position) , traversing operations in Singly linked list Doubly link listl�
Insertion (at first position, last position and at used specific position), deletion(at first position, last l�
position and at used specific position) , traversing operations in Doubly linked list Circular link listl�
Insertion(at first position, last position and at used specific position) , deletion(at first position, last l�
position and at used specific position) , traversing operations in Circular linked list Application of link listl�
Interview Questionsl�
Stackl�
Introduction to stackl�
Stack using arrayl�
Stack using linked listl�
Applications of stackl�
Reverse Polish Notations(Infix to Postfix and Infix to Prefix)l�
Interview Questionsl�
Queuel�
Introduction to queuel�
Queue using arrayl�
Queue using linked listl�
Applications of queuel�
Introduction to circular queuel�
Partners :
PITAMPURA (DELHI)NOIDAA-43 & A-52, Sector-16,
GHAZIABAD1, Anand Industrial Estate, Near ITS College, Mohan Nagar, Ghaziabad (U.P.)
GURGAON1808/2, 2nd floor old DLF,Near Honda Showroom,Sec.-14, Gurgaon (Haryana)
SOUTH EXTENSION
www.facebook.com/ducateducation
Java
Plot No. 366, 2nd Floor, Kohat Enclave, Pitampura,( Near- Kohat Metro Station)Above Allahabad Bank, New Delhi- 110034.
Noida - 201301, (U.P.) INDIA 70-70-90-50-90 +91 99-9999-3213 70-70-90-50-90 70-70-90-50-90
70-70-90-50-90
70-70-90-50-90
D-27,South Extension-1New Delhi-110049
+91 98-1161-2707
(DELHI)
l�Application of Circular queue Introduction to DeQueue(Double Ended Queue)l�
Application of Dequeuel�
Priority Queuel�
Interview Questionsl�
Non-linear data structureTreel�
Introduction to treesl�
Types of treesl�
Implementation of tressl�
Binary treel�
Binary search treel�
AVL treel�
Threaded binary treel�
M way treel�
M way search treel�
B treel�
Heapl�
Various operations on treesl�
Application of tressl�
Interview Questionsl�
Searching and sortingSearching in arraysl�
Searching in stringsl�
Linear Search l�
Binary Searchl�
Sortingl�
Various sorting techniquesl�
Selection sortl�
Bubble sortl�
Insertion sortl�
Quick sortl�
Heap sortl�
Merge sortl�
Radix Sortl�
GraphIntroduction of graphl�
Types of graphsl�
Implementation of graph using Adj. l�
Matrix and Adj. list Various operations on graphsl�
Shortest path search in graphl�
Floyd Warshall Algorithml�
Dijkstra Algorithml�
Minimum spanning treel�
Kruskal's Algorithml�
Prims Algorithml�
Applications of graphsl�
Interview Questionsl�
HashingIntroduction of hashingl�
Hash tablel�
Applications of hashingl�
Interview Questionsl�
Interview Questions
Project