Name : Chris Gadekar
Roll no : 19
Batch : A
| Program_Id | Program details | Your File nameHyperlink to the .c file on github |
|---|---|---|
| 1. | Write a C program to check if a given number is Fibonacci number. | [https://github.com/chrisgadekar/DSA/blob/main/fibb_num.c |
| 2. | Write a C program to generate Pascal Triangle using array. | https://github.com/chrisgadekar/DSA/blob/main/pascals_triangle.c |
| 3. | Write a C program to roll_no, name , percentange of 5 students using array of structure and display the records in ascending order of roll list. | https://github.com/chrisgadekar/DSA/blob/main/struct_prog1.c |
| 4. | Write a C program to roll_no, name , percentange of 5 students using array of structure and display the records in descending order of roll list. | https://github.com/chrisgadekar/DSA/blob/main/struct_prog2.c |
| 5. | Write a C program to find largest element in an array | https://github.com/chrisgadekar/DSA/blob/main/largest_element_in_array.c |
| 6. | Write a menu driven program to perform the following operations in an ARRAY 1. INSERT2. DELETE 3. TRAVERSE 4. SEARCH | https://github.com/chrisgadekar/DSA/blob/main/array_ops.c |
| 7. | Define a structure data type called time_struct containing 3 members int hour, int | https://github.com/chrisgadekar/DSA/blob/main/time.c |
| minute and int second. Write functions that accept the structure to perform the | ||
| following operations: | ||
| 1. Input new time | ||
| 2. Display the time | ||
| 3. Update the time such that the function accepts the time_struct and increments the | ||
| time by one second.(If the increment results in 60 seconds, the then second member is | ||
| set to 0 and the minute is incremented by 1. Then, if the result is 60 minutes, the minute | ||
| member is set to 0 and the hour member is incremented by 1. Finally when the hour | ||
| becomes 24, it is set to zero.) | ||
| 8. | Write a function that compares two arrays and returns 1 if they are identical and 0 otherwise. | https://github.com/chrisgadekar/DSA/blob/main/comp.c |
| Program_Id | Program details | Your File nameHyperlink to the .c file on github |
|---|---|---|
| 1. | Write a menu driven program to implement list ADT using SINGLE LINKEDLIST and | https://github.com/chrisgadekar/DSA/blob/main/LinkedListImplementation.c |
| perform the following operations | ||
| 1. CREATE | ||
| 2. INSERT AT BEGINNING | ||
| 3. INSERT AT END | ||
| 4. INSERT AT LOCATION | ||
| 5. DELETE AT BEGINNING | ||
| 6. DELETE AT END | ||
| 7. DELETE AT LOCATION | ||
| 8. DISPLAY | ||
| 10. COUNT | ||
| 11. COPY | ||
| 12. CONCATENTE | ||
| 13. SPLIT | ||
| 14. REVERSE | ||
| 2. | Write a menu driven program to implement list ADT using CIRCULAR LINKEDLIST | https://github.com/chrisgadekar/DSA/blob/main/adt_circular |
| and perform the following operations | ||
| 1. CREATE | ||
| 2. INSERT AT BEGINNING | ||
| 3. INSERT AT END | ||
| 4. INSERT AT LOCATION | ||
| 5. DELETE AT BEGINNING | ||
| 6. DELETE AT END | ||
| 7. DELETE AT LOCATION | ||
| 8. DISPLAY | ||
| 9. SEARCH | ||
| 10. COUNT | ||
| 11. COPY | ||
| 12. CONCATENTE | ||
| 13. SPLIT | ||
| 14. REVERSE | ||
| 3. | Write a menu driven program to implement list ADT using DOUBLE LINKEDLIST | https://github.com/chrisgadekar/DSA/blob/main/double_linked_list.c |
| and perform the following operations | ||
| 1. CREATE | ||
| 2. INSERT AT BEGINNING | ||
| 3. INSERT AT END | ||
| 4. INSERT AT LOCATION | ||
| 5. DELETE AT BEGINNING | ||
| 6. DELETE AT END | ||
| 7. DELETE AT LOCATION | ||
| 8. DISPLAY | ||
| 9. SEARCH | ||
| 10. COUNT | ||
| 11. COPY | ||
| 12. CONCATENTE | ||
| 13. SPLIT | ||
| 14. REVERSE | ||
| 4. | Write a menu driven program to implement list ADT using CIRCULAR DOUBLE | https://github.com/chrisgadekar/DSA/blob/main/circular_double.c |
| LINKEDLIST and perform the following operations | ||
| 1. CREATE | ||
| 2. INSERT AT BEGINNING | ||
| 3. INSERT AT END | ||
| 4. INSERT AT LOCATION | ||
| 5. DELETE AT BEGINNING | ||
| 6. DELETE AT END | ||
| 7. DELETE AT LOCATION | ||
| 8. DISPLAY | ||
| 9. SEARCH | ||
| 10. COUNT | ||
| 11. COPY | ||
| 12. CONCATENTE | ||
| 13. SPLIT | ||
| 14. REVERSE | ||
| 5. | Write a menu driven program to implement STACK ADT using array and perform the | https://github.com/chrisgadekar/DSA/blob/main/StackArr.c |
| following operations | ||
| 1. PUSH | ||
| 2. POP | ||
| 3. DISPLAY | ||
| 4. PEEK | ||
| 6. | Write a menu driven program to implement STACK ADT using linkedlist and perform | https://github.com/chrisgadekar/DSA/blob/main/StackImplementationUsingLinkedList.c |
| the following operations | ||
| 1. PUSH | ||
| 2. POP | ||
| 3. DISPLAY | ||
| 4. PEEK | ||
| 7. | Write a program to REVERSE a given string using a Stack | https://github.com/chrisgadekar/DSA/blob/main/ReverseLinkList.c |
| 8. | Write a program to check if a given number is a PALLINDROME using a stack | https://github.com/chrisgadekar/DSA/blob/main/checking_palindrome_using_stack.c |
| 9. | Write a program to implement PARENTHESES CHECKER using a stack | https://github.com/chrisgadekar/DSA/blob/main/parenthesis.c |
| 10. | Write a program for conversion of INFIX to POSTFIX expression. | https://github.com/chrisgadekar/DSA/blob/main/InfixToPostFix.c |
| 11. | Write a program to evaluate postfix expressions by making use of Stack | https://github.com/chrisgadekar/DSA/blob/main/PostFixEval.c |
| 12. | Write a menu driven program to implement QUEUE ADT using array and perform the | https://github.com/chrisgadekar/DSA/blob/main/NormalQueueImplementation.c |
| following operation | ||
| 1. ENQUEUE | ||
| 2. DEQUEUE | ||
| 3. DISPLAY | ||
| 13. | Write a menu driven program to implement QUEUE ADT using linkedlist and perform | https://github.com/chrisgadekar/DSA/blob/main/QueueImplementationUsingLinkedList.c |
| the following operation | ||
| 1. ENQUEUE | ||
| 2. DEQUEUE | ||
| 3. DISPLAY | ||
| 4. SEARCH | ||
| 14. | Write a menu driven program to implement CIRCULAR QUEUE ADT using array and | https://github.com/chrisgadekar/DSA/blob/main/CircularQueue.c |
| perform the following operation | ||
| 1. ENQUEUE | ||
| 2. DEQUEUE | ||
| 3. DISPLAY | ||
| 4. COUNT | ||
| 15. | Write a menu driven program to implement following operations in a binary search tree | https://github.com/chrisgadekar/DSA/blob/main/BST.c |
| (BST). | ||
| 1. Insertion of node | ||
| 2. Deletion of node | ||
| 3. Counting of nodes | ||
| 4. Preorder Traversal | ||
| 5. Postorder Traversal | ||
| 6. Inorder Traversal | ||
| 7. Search node in the tree | ||
| 16. | Write a program to implement traversal of a directed graph through BFS | https://github.com/chrisgadekar/DSA/blob/main/bfs.c |
| 17. | Write a program to implement traversal of a directed graph through DFS | https://github.com/chrisgadekar/DSA/blob/main/dfs.c |
| 18. | Write a program to implement Binary Search | https://github.com/chrisgadekar/DSA/blob/main/binary_search.c |
| 19. | Write a program to implement Bubble sort | https://github.com/chrisgadekar/DSA/blob/main/bubble_sort.c |
| 20. | Write a program to implement Selection sort | https://github.com/chrisgadekar/DSA/blob/main/selection_sort |
| 21. | Write a program to implement Insertion sort | https://github.com/chrisgadekar/DSA/blob/main/insertion_sort.c |
| 22. | Write a program to implement Quick sort | https://github.com/chrisgadekar/DSA/blob/main/quicksort.c |
| 23. | Write a program to implement Merge sort | https://github.com/chrisgadekar/DSA/blob/main/mergesort.c |