This document outlines a course on data structures and algorithms. It includes the course outcomes, which are to understand ADT concepts and analyze time/space complexity, develop C programs using data structures like linked lists and trees, and implement searching/sorting algorithms. It maps these outcomes to program outcomes. The pedagogy implemented includes projects, hands-on work, presentations, assignments, unit tests, midterm analysis, and answering student doubts. Example projects are listed, as are topics covered in seminars. Assignment details and midterm results are also provided.