CE261 : Data Structure and Alorithms
Course Outcome
CO-1 : Understand and Implement Algorithms and core Data Structures such as stack, queue, hash table, priority queue, binary search tree and graph in programming language.
CO-2 : Analyze data structures in storage, retrieval and computation of ordered or unordered data.
CO-3 : Compare alternative implementations of data structures with respect to demand and performance.
CO-4 : Describe and evaluate the properties, operations, applications, strengths and weaknesses of different data structures.
CO-5 : Apply and select the most suitable data structures to solve programming challenges.
CO-6 : Discover advantages and disadvantages of specific algorithms.
Teaching and Examination Scheme
Resource Person