3 Credit Hour Course
Intended For Level 1 Term 2 Students
Prerequisite: CSE101, CSE103
Introduction to algorithms; Asymptotic analysis: growth of functions, O, Ω, Θ, o, ω notations; Correctness proof of algorithms; Analysis of algorithms: Master theorem, etc.; Elementary data structures: arrays, linked lists, stacks, queues, trees and tree traversals, graphs and graph representations, heaps, binary search trees; Graph traversals: DFS, BFS, applications of DFS and BFS; Methods for the design of efficient algorithms: divide and conquer, greedy methods, dynamic programming; Sorting: sorting algorithms, sorting in linear time; Lower bound theory; Data structures for set operations.
