Course Outcomes:
At the end of the course, Students will be able to
1. CO1: Implement sorting / searching techniques, and validate input/output for the given problem.
2. CO2: Implement data structures (namely Stacks, Queues, Circular Queues, Linked Lists, and Trees), its operations and algorithms.
3. CO3: Implement the algorithm to find whether the given graph is connected or not and conclude on the performance of the technique implemented.
4. CO4: Design and apply appropriate data structures for solving computing problems
5. CO5: Implement the techniques for evaluating the given expression.
1. Write a C program to Implement the following searching techniques
a. Linear Search
b. Binary Search.
2. Write a C program to implement the following sorting algorithms using user defined functions:
a. Bubble sort (Ascending order)
b. Selection sort (Descending order).
3. Write a C Program implement STACK with the following operations
a. Push an Element on to Stack
b. Pop an Element from Stack
4. Implement a Program in C for converting an Infix Expression to Postfix Expression.
5. Implement a Program in C for evaluating an Postfix Expression.
6. Write a C program to simulate the working of a singly linked list providing the following operations:
a. Display & Insert
b. Delete from the beginning/end
c. Delete a given element
7. Obtain the Topological ordering of vertices in a given graph with the help of a c programming.
8. Check whether a given graph is connected or not using DFS method using C programming.
9. From a given vertex in a weighted connected graph, find shortest paths to other vertices Using Dijkstra's algorithm (C programming)
10. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm ( C programming)