top of page

CO1

Understand and analyze the time and space complexity of an algorithm

CO4

Discuss various searching, sorting and graph traversal algorithms

CO2

Understand and implement fundamental algorithms (including sorting algorithms, graph algorithms, and dynamic programming)

CO5

Understand operation on Queue , Priority Queue , D-Queue.

CO3

Discuss various algorithm design techniques for developing algorithms

CO6

 

Course Outcomes (COs)

Datastructures and Algorithms (Theory)

Course Syllabus

Assignments

Question Bank

Lecture Notes

Data Structures Codes

University QP

DS Test Papers with solutions

bottom of page