Introduction to Algorithms and Data Structures (EE255)

Programme: 

B.Tech (E&E)

Semester: 

Fourth

Category: 

Programme Specific Electives (PSE)

Credits (L-T-P): 

04 (3-1-0)

Content: 

Mathematical basis and notions for algorithm analysis. Sorting, Divide and Conquer, Linear time sorting, Elementary Data Structures, Priority Queues, BST and RBT.

Design and Analysis Paradigms – Dynamic Programming, Greedy Algorithms, Graph Algorithms.

References: 

1. T.H. Cormen, C.E. Leiserson, R.L. Rivest , C. Stein, Introduction to Algorithms, 2nd Edition, PHI, 2004.
2. D.E. Knuth, The Art of Computer Programming, Volumes I and III, Addison-Wesley, 1973.
3. Anany Levitin, Introduction to the Design and Analysis of Algorithms, Pearson Education, 2003.

Department: 

Electrical and Electronics Engineering
 

Contact us

Venkatesa Permul
Associate Professor and Head of the Department
Department of Electrical and Electronics Engineering
National Institute of Technology Karnataka, Surathkal
Srinivasnagar, Surathkal, Mangalore-575025. Karnataka, India.
Ph : +91-824-2473045
Fax: +91-824-2474039
E-mail: hodee[AT]nitk[DOT]ac[DOT]in

Connect with us

We're on Social Networks. Follow us & get in touch.