Day 1 - Arrays
1.1. Addition of Two Matrices
1.2. Multiplication of Two Matrices
1.3. Sum of Diagonals
1.4. Transpose of a Matrix
1.5. Insert element in array
1.6. Delete element in array
1.7. Merging arrays
1.8. Find duplicate element
1.9. Display the location of given element in array and print it
1.10. Ascending/Descending/Alphabet order
1.11. Check validation of String
1.12. Largest element in matrix
1.13. Repeated twice in array
1.14. Print odd and even in given array
1.15. Sum of row and column in matrix
1.16. Given array elements display 5th iterated element
Day 2 - Recursion and Search
2.1. Find Fibbonacci series upto n numbers and it's sum
2.2. Find the Factorial of a given number
2.3. Find the nth Fibbonacci number using recursion
2.4. Find the Factorial of a given number using recursion
2.5. Linear search of array
2.6. Binary search of array
Day 3 – Singly Linked List
3.1. Implement SLL with following operations(Insert(Beg,Mid,End),Delete(Beg,Mid,End),Display,Search,Sort,Find Max and Min)
3.2. To determine whether a given singly linked list is a palindrome
3.3. To merge two sorted singly linked lists into a single sorted linked list
3.4. Print no of nodes in the given linked list
3.5. Intersect SLL
3.6. Reverse - SLL
Day 4 - Doubly and Circular Linked List
4.1.Implement DLL with following operations(Insert(Beg,Mid,End),Delete(Beg,Mid,End),Display,Search,Sort,Find Max and Min)
4.2.Implement Singly CLL with following operations(Insert(Beg,Mid,End),Delete(Beg,Mid,End),Display,Search,Sort,Find Max and Min)
Day 5 -Stack
5.1.Implement Stack using array with following operations(Push(),Pop(),Display( ),Peek( ))
5.2.Implement Stack using Linked List with following operations(Push(),Pop(),Display( ),Peek( ))
5.3.Consider 2 stacks, add bottom most element and top most element print the value
5.4.Given a stack, delete the middle element of the stack without using any additional data structure
Middle element:- floor((size_of_stack+1)/2) (1-based indexing) from bottom of the stack
Day 6 -Infix and Postfix
6.1.Write a function that takes a string containing parentheses , square brackets and curly braces " ( { [ ] } " and determines if the symbols are balanced.
6.2.Write a function to evaluate a given postfix expression. The expression is "44 2 / 6 -"
6.3.Write a function to convert an infix expression to postfix notation. The infix expression is " "(a + b) * c + d "
Day 7 -Queue
7.1. Implement Queue using array with following operations[ Enqueue( ) Dequeue( ) isEmpty( ) isFull( ) Display( ) front( ) orPeek( ) rear( )]
7.2. Implement Queue using Linked List with following operations [Enqueue( ) Dequeue( ) Display( ) Front( ) Rear( )]
7.3. Implement CircularQueue using array with following operations [Enqueue( ) Dequeue( ) isEmpty( ) isFull( ) Display( ) front( ) orPeek( ) rear( )]
7.4. Implement CircularQueue using Linked List with following operations [Enqueue( ) Dequeue( ) Display( ) Front( ) Rear( )]
7.5. Implement Stack using two queues
7.6. Implement Queue using two Stacks
Day 8 -Tree
8.1. Implement Binary tree
8.2. Implement Binary Search Tree and perform Insertion and Deletion
8.3. Create Binary Search Tree with Tree Traversal (Inorder, Preorder, Postorder and Level order
Day 9 -AVL Tree
9.1 Implement a C program for AVL tree and perform insertion and deletion of nodes
Day 10 -Red-Black & Splay Tree
10.1. Implement a C Program for Red Black tree and perform Insertion and Deletion of Nodes
10.2. Implement a C Program for Splay tree tree and perform Insertion and Deletion of Nodes
Day 11 -B Tree & TRIE
11.1. Implement a C Program for B Tree and perform Insertion of Nodes
11.2. Implement a C Program for TRIE Tree and perform Insertion of Nodes
Day 12 -Hashing
12.1. Implement a C Program to perform Hashing with all collision resolving techniques
12.2. Implement a C Program for Min Heap and Max Heap and perform Insertion of Nodes
12.3. Implement a C Program to perform Heap sort both ascending and Descending order
Day 13 -Sorting
13.1. Bubble Sort
13.2. Insertion Sort
13.3. Radix Sort
13.4. Merge Sort
13.5. Shell Sort
Day 14 -Sorting
14.1. Implement a C Program to perform Quick Sort
14.2. Implement a C Program to perform Selection Sort
Day 15 -Graph 15.1. Implement a C Program to represent a Graph using Matrix 15.2. Implement a C Program to represent a Graph using Linked List 15.3. Implement a C Program to perform Topological ordering
Day 16 -Minimum spaning tree 16.1. Implement a C Program to find MST for the given graph using Prim's Algorithm 16.2. Implement a C Program to find MST for the given graph using Kruskal's Algorithm