This book attempts to put together all the essential topics of discrete mathematical structures for easy reference. The undergraduate students of computer science and engineering, postgraduate students of computer applications and computer science and engineering will find this book very useful. It contains several multiple-choice questions under each chapter which will be useful for those who aspire to write the GATE examination. This book could be a good textbook for undergraduate students of Computer Science, Computer Science and Engineering and postgraduate students of Computer Applications.

This book is an outcome of long years of teaching experience for undergraduate as well as post graduate students, and is an attempt to put together all the essential topics of data structures and Algorithms for easy reference. The under-graduate students of computer science and engineering, post-graduate students of computer applications and computer science and engineering will find this book very useful. It contains several multiple choice questions under each chapter which will be useful for those who aspire to write the GATE examination. A brief course on C-programming language is given to help the students in implementing the algorithms. Salient Features: The data structures are explained with simple relevant examples. Algorithms are written in simple pseudo-code and are easy to convert to any programming language. Concepts are well supported with suitable examples and diagrams for the students to find it easy to follow. Includes review questions as well as MCQs with answers. Critical examples with stepwise explanation makes it a great instructor resource.