This Lecture note is written by Y. Narahari, Indian Institute of Science, Bangalore and is published by Ernet India Education & Research Network.
The Lecture Notes is organized into eleven chapters. Besides the subject matter, each chapter includes a list of problems and a list of programming projects. Also, each chapter concludes with a list of references for further reading and exploration of the subject.
1.Introduction
2.Lists
3.Dictionaries
4.Binary Trees
5.Balanced Trees
6.Priority Queues
7.Directed Graphs
8.Undirected Graphs
9.Sorting Methods
10.NP-Completeness
11.References
Read online/Download
The Lecture Notes is organized into eleven chapters. Besides the subject matter, each chapter includes a list of problems and a list of programming projects. Also, each chapter concludes with a list of references for further reading and exploration of the subject.
1.Introduction
2.Lists
3.Dictionaries
4.Binary Trees
5.Balanced Trees
6.Priority Queues
7.Directed Graphs
8.Undirected Graphs
9.Sorting Methods
10.NP-Completeness
11.References
Read online/Download