Back

Basic Details:

  • Course Code: EM 506
  • Credits: 2
  • Pre-requisites: None
  • Compulsory/Optional: Optional

Couse Content:

Asymptotic notation, Average and worst case analysis

Control structures, Recursion

Arrays, stacks, queues, records, pointers, lists, graphs, trees, heaps

Divide and conquer, Dynamic programing, Huffman codes

Various types of searching and sorting algorithms

Polynomial and exponential times, NP-completeness

Selected applications from Engineering and Computer Science

Time Allocation (Hours):

Lectures
0
Assignments
0

Assessment:

In - course:

Assignment
40%
Course work
60%