WEEK |
TITLE |
Week-1 |
Introduction of Data
Structures using C and Data Structures Operations in Linear Array |
Week-2 |
Linked List with
implementation using C |
Week-3 |
Data Structures
implementation using C, Stacks and Queues |
Week-4 |
Binary Trees and its
types |
Week-5 |
Balanced AVL Tree and
M-way Trees |
Week-6 |
B-Trees |
Week-7 |
Graph Theory |
Week-8 |
Greedy Methods |
Week-9 |
Hash Functions and
sorting |
Week-10 |
Sorting |
Week-11 |
Sorting and Asymptotic
Notations |
Week-12 |
Complexity Analysis
and Applications of Data Structures |
Data Structures Schaum’s outlines,Tata McGraw Hill Gilberg and Forouzan: “Data Structure- A Pseudo code approach with C”
Exam Registration URL: Announcements will be made when the registration form is open for registrations.
The online registration form has to be filled, and the certification exam fee needs to be paid.
CRITERIA TO GET A CERTIFICATE
30 Marks will be allocated for Internal Assessment (Final Quiz- Mandatory) which will be available at the end of the course and 70 Marks will be allocated for end term proctored examination.
A minimum of 40% passing marks (i.e. at-least 12 marks in Internal Assessment (Final Quiz- Mandatory) & 28 Marks in external proctored examination) will be required for being eligible for SWAYAM Certificate.
DOWNLOAD APP
FOLLOW US