Prerequisite Courses: Fundamentals of Programming Languages, Basics of C Programming
Course Objectives:
To make students understand
1. To understand the significance of data structures and implement searching and sorting methods using the C language.
2. To learn the concept and understand the importance of time and space complexity.
3. To understand data representation, implementation and applications of linear and nonlinear data structures.
Course Outcomes:
After successful completion of the course, students will be able to:
CO1: Apply and implement the principle sorting and searching algorithms on the given data using the C language.
CO2: Develop applications of stack and queue using arrays.
CO3: Implement and demonstrate the applicability of a Linked List.
CO4: Build, represent and traverse a Binary Search Tree.
CO5: Build, represent and traverse graphs.
- Teacher: Dr Yogesh Angal