Course info

CO 1 Explain the concept of data structure, abstract data types, algorithms,

analysis of algorithms and basic data organization schemes such as arrays

and linked lists. K2

CO 2 Describe the applications of stacks and queues and implement various

operations on them using arrays and linked lists. K3

CO 3 Describe the properties of graphs and trees and implement various

operations such as searching and traversal on them. K3

CO 4 Compare incremental and divide-and-conquer approaches of designing

algorithms for problems such as sorting and searching. K4

CO 5 Apply and analyze various design approaches such as Divide-and-Conquer,

greedy, and dynamic for problem-solving. K4