SYLLABUS DATASTRUCTURE THROUGH C & C++ LESSION PLAN 30 DAYS
Duration : 30 Days Per Day: 1 Hour ( 30 × 1 = 30 Hour )
—————————————————————————————————————————————————-
DAY 01 : Algorithms, Asymptotic notations and analysis, Measuring time and space complexities, Data structure and C: Functions, storage structures for arrays, sparse matrices, strings, pattern matching, structures and arrays of structures, Abstract data type, Stacks and Queues: representation and Applications.
DAY 02 : Array. Pointer. Function. Structure. Pointer, Structure with Function. Stack. Applications of Stack. Linear Queue & its Operations. Circular Queue & its Operation. Linked List . (Single ,Double ,Circular,Header). Tree. Graph
Hashing & Searching. Sorting.
DAY 03 : Concept Data Structure. Example. Need of Data structure. Advantages of using DS. Algorithm & Pseudocode:
Algorithm Definition. Characteristics of algorithm. Elements of algorithm. Pseudocode example. Difference of Algorithm & Pseudocode
DAY 04 : Function: What is function. Types of function. How function works. Function recursion and how it works.
DAY 05 : Array: Concept of Array. Types of array. Basic Programs. Array with Functions. Single & 2-dimensional array in function. argument. storage structure for arrays, sparse matrices,
DAY 06 : Pointer: Pointer Basics. Pointer with functions. Call by reference. Array of pointers & pointer to array & Programs.
DAY 07 : Structure: Understanding about Structure. Pointer structure variable. Structure as function argument. using call by member value. hole structure and call by. passing reference of structure.
DAY 08 : Linked List : What is Linked List. Linked Lists: Singly linked lists, Linked stacks and queues, Operation on polynomial,
Linked dictionary. Insert a node into first position , last position , any position. K+1 position , K-1 position , Etc.
DAY 09 : Doubly linked list. Create a doubly linked list. Insert a node into first position , last position , any position. K+1 position , K-1 position , Etc.
DAY 10 : Circular linked list. Create a Single circular linked list. Insert a node into first position , last position , any position. K+1 position , K-1 position , Etc. Doubly circular linked lists.
DAY 11 : Stack: Operations on Stack. Array & Linked Representation. Programs on stack. Push & Pop operations
Traversing. PUSH , POP , PEEP, Algorithm. Stack in Array implementation. Stack in Linked List implementation.
DAY 12 : Applications of Stack : Arithmetic Expression Evaluation. Notations, Infix , Postfix, Prefix. Conversion infix to post fix. Conversion postfix to infix. Evaluation of Postfix and Prefix using stack.
DAY 13 : Queue: Operations on Queue. Array & Linked Representation. Programs on stack. Insert & Delete operations. Circular queue. Rrepresentation. Deque. Priority Queue. Application of queue.
DAY 14 : LinkedList: Concept of linked list. Difference of linklist & array. Single linked list. Representation. Operations. Traversing. Insertion(first node, last node, at a. position, after a node value). Deletion(first node, last node, at a position, after a node value) .
DAY 15 : Double linked list. Representation. Operations, traversing. Insertion (first node, last node, at a. position, after a node value). Deletion (first node, last node, at a. position, after a node value)
Circular link list & header link list example.
DAY 16 : Tree: Tree terminology. Binary tree. Complete Binary Tree. Binary search tree. Tree Traversals. InOrder. PreOrder. PostOrder. Visiting.
DAY 17 : Creation of Binary Tree from traversal methods. Expression Tree & expression. Manipulation. Binary Search Tree. Insertion & deletion in BST(Program). AVL Tree, M-way Search Tree. B+ tree, Insertion & deletion.
DAY 18 : Graph: Graph terminology. Representation of graphs. Path matrix. Adjacent Matrix. Graph Traversal. BFS (breadth first search). DFS (depth first search).
DAY 19 : Minimum spanning Tree. Kruskal’s Algorithm. Prim’s Algorithm. Warshall’s algorithm (shortest path algorithm).
DAY 20 : Hashing & Searching: Linear and binary search methods. Hash functions. Hashing techniques & Chaining.\
DAY 21 : Sorting: General Sort. Bubble sort. Selection sort. Insertion sort.
DAY 22 : Quick sort. Merge sort. Heap sort. Radix sort.
DAY 23 : Topological Sort. Sell Sort.
DAY 24 : Searching: Linear Search , Binary Search.
DAY 25 : Dynamic Storage Management, Garbage collection and compaction, Hashing functions. Hash tables and collision resolution techniques.
Lets Get Started your project with professional way
