Upon successful completion of this course, the student will be able to
describe the usage of various data structures including stacks, queues, lists, tree, and graphs.
Upon successful completion of this course, the student will be able to
analyze the performance characteristics of algorithms using mathematical and measurement techniques.
Upon successful completion of this course, the student will be able to
implement the sorting, searching and graph algorithms by incorporating suitable data structures.
Upon successful completion of this course, the student will be able to
design appropriate data structures for a given problem.