| |
|
C & Data Structure Duration: 12 Weeks
|
| Introduction |
Inputting the data, Data types, Control Structures, Operators. |
| Arrays |
Address of each element in an array, accessing an array using pointers, Manipulating arrays, Two-Dimensional, Three-Dimensional array, and Pointers arrays. |
| Functions |
Stack, Function call, Parameter Passing, Call by reference, Global variables, Calling Function, Storage of variables, String, Structure, Union. |
| File Handling |
Concept of Files, Direct access files. |
| Searching & Sorting |
Merging of two sorted lists, Transpose of a matrix, Saddle point of a matrix, Heap, Bubble sort, Merge sort, Heap Sort, Searching, Hashing functions. |
| Stack & Queue |
Stack, Queue, Circular Queue |
| Linked list |
Sorting and Reversing a linked list, Inserting & Deleting a node, Counting the number of nodes, Merging of two sorted lists, Erasing a linked list, Sparse Matrices, Inserting and Deleting a node in Double linked list. |
| Trees |
Binary tree representation, Binary tree traversal, Binary search tree, Counting, Searching, Swapping, Deleting a node in binary search tree. |
| Graphs |
Representations, Computing indegree and outdegree, Depth-first traversal, Breadth-first traversal, Minimum Cost spanning tree, Directed Acyclic graph. |
| Problems |
Problems in Data Structures, Arrays, Stacks and Queues, Linked List, Strings, Trees, Graphs, Miscellaneous Problems. |
Duration: 1.5 Hrs / Day --12 Days / Week |
Track
Options: Normal / Fast / Crash / Weekend |
|
|
|
|