Course Outcomes

ECUL304.1

Analyze algorithms and execution time complexities, and apply asymptotic notations to determine time and space complexities of simple non-recursive algorithms.

ECUL304.2

Apply array storage, expression evaluation using stacks, and recursion, mastering data structure manipulation and algorithmic problem-solving.

ECUL304.3

Implement and compare linear linked lists, stacks, queues, and dequeues, and utilize linked lists for polynomial representation and manipulation.

ECUL304.4

Demonstrate operations on trees and discuss various types of Trees.

ECUL304.5

Analyze and implement graph algorithms for traversal, finding connected components, spanning trees, and shortest paths, alongside sorting and searching algorithms.