B.Tech Electronics and Electrical Engineering

 

EE 390                Data Structure and Algorithms               3-0-0-6

 

Syllabus: Introduction: The Role of Algorithms in Computing, Growth of Functions, Divide-and-Conquer, Probabilistic Analysis and Randomized Algorithms; Sorting and Order Statistics;  Data Structures: Arrays, Linked Lists, Stacks, Queues, Trees, Hash Tables, Binary Search Trees;  Dynamic Programming, Greedy Algorithms, Amortized Analysis; Algorithms: Searching, Tree algorithms, Graph algorithms; Linear Programming, Optimization Algorithms, Linear and Nonlinear Numerical Computation Methods; Approximate Algorithms; Case studies.

 

Texts

  1. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd edition. PHI Learning, 2010.
  2. Sedgewick, Algorithms in C++, 3rd edition. Pearson Education Pvt. Ltd., 2008.
  3. References
  4. Kleinberg and E. Tardos, Algorithm Design, 1st edition. Pearson Education Pvt. Ltd., 2012.
  5. Sahni, Data Structures, Algorithms and Applications in C++, 2nd edition. Universities Press, 2005.
  6. C. Cherniavsky and J. A. Storer, An Introduction to Data Structures and Algorithms, 2nd edition. Birkhauser Boston, 2001.
  7. E. Knuth, The Art Of Computer Programming: Fundamental Algorithms, 3rd Edition, vol. 1. Pearson, 1997.
  8. E. Knuth, The Art Of Computer Programming: Seminumerical Algorithms, 3rd Edition, vol. 2. Pearson, 1998.
  9. E. Knuth, The Art of Computer Programming: Sorting and Searching, 3rd Edition, vol. 3. Pearson, 1998.