• To develop skills to design and analyze simple linear and nonlinear data structures.
• To strengthen the ability to identify and apply the suitable data structure for the given real world problem.
• To gain knowledge in practical applications of data structures.
1. Recursion: a) Factorial numbers. b) Fibonacci series.
2. Implementation of Stack Using Array, Implementation of Queue Using Array, Circular queue operations using Array.
3. Postfix-evaluation, Prefix-evaluation, Conversion of Infix to Postfix.
4. Single Linked list, Doubly Linked List, Implementation of Stack and Queue Using Linked List.
5. Binary Tree Traversal, Binary Search Tree.
6. Sorting Techniques: Bubble Sort, Selection Sort, Merge Sort, Quick Sort, Radix Sort, Heap Sort.
7. Searching Techniques: Linear Search, Binary Search
8. Implementation of minimum spanning trees.
9. Implementation of single source shortest path.
10. Implementation of the Floyd-Warshall algorithm for finding the shortest path between all nodes in a graph.
Links:
[1] https://csit.iisuniv.ac.in/courses/subjects/data-structures-using-c-lab-3
[2] https://csit.iisuniv.ac.in/academic-year/2015-16