EC345 Data Structures and Algorithms

Course Name: 

EC345 Data Structures and Algorithms

Programme: 

B.Tech (ECE)

Category: 

Programme Specific Electives (PSE)

Credits (L-T-P): 

(3-0-2) 4

Content: 

Algorithm analysis, Asymptotic notations. Divide and Conquer algorithms, Analysis of divide and conquer algorithms, master method, examples - merge sort, quick sort, binary search, Data structures, Linked list, stacks and queues, insertion/deletion and analysis, Binary search trees Hash Tables – hash function and properties, collision handling, bloom filters, Greedy algorithms and Dynamic programming examples. Graph traversal , DFS, BFS, shortest path algorithms Dijkstra’s and Bellman Ford algorithm, Minimum spanning trees, min cut.

References: 

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.

Department: 

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.