EC232 Data Structures & Algorithms

Course Name: 

EC232 Data Structures & Algorithms


B.Tech (ECE)


Programme Specific Electives (PSE)

Credits (L-T-P): 

(3-0-2) 4


Review of program performance. Array based representation. Linked representation. Arrays and matrices. Stacks and queues, implementation and applications. Skip lists and hashing. Binary and other trees. Heap and heap sort. Binary search trees. Graphs, Greedy method, shortest path and spanning trees. Divide and conquer method. Dynamic programming.

Course Objectives:

On completion of the course, the student should be able to

  • appreciate the concept of algorithm analysis and able to perform analysis of algorithms.
  • Understand simple datastructures such as stacks, queues, linked lists and trees and able to use them in practical scenarios
  • Understand programming paradigms such as divide and conquer, dyanamic programming.
  • Learn elementary graph algorithms.
 Course Outcome
  •  The students are expected to use elementary data structures and algorithms in real-life scenarios
  •  Motivate students to participate in community/open-source projects


Sartaj Sahni, Data Structures, Algorithms and Applications in C++, Universities Press, 2005
A.V. Aho, J.E. Hopcroft and J. D. Ullman, Data structures and Algorithms, Pearson, 2004.
T.H.Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, PHI, 2004
Mark Allen Weiss, Algorithms, Data structures and problem solving with C++, Pearson, 2002.


Electronics and Communication Engineering(ECE)

Contact us

Dr. T. Laxminidhi,  Professor and Head, 
Department of E&C, NITK, Surathkal
P. O. Srinivasnagar,
Mangalore - 575 025 Karnataka, India.

  • Hot line: +91-0824-2473046

Connect with us

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