Data Structures and Algorithms
Published on 30. January 2018
Book
Paperback/Softback
334 pages
978-93-85909-84-9 (ISBN)
Description
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.
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.
More details
Language
English
Place of publication
New Delhi
India
Target group
Professional and scholarly
Dimensions
Height: 229 mm
Width: 152 mm
Weight
450 gr
ISBN-13
978-93-85909-84-9 (9789385909849)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
C V Sastry retired from Regional Engineering College, Rourkela, presently known as National Institute of Technology after working for several years in various capacities in the department of Mathematics and Computer Science. He has guided several students for their Ph.D degrees in theoretical Physics and Computer Science. He visited Imperial College, London as a visiting faculty and was also Guest Scientist at International Center for Theoretical Physics, Trieste. Italy. He is presently honorary director at Regency Institute of Technology, Yanam.
CH Rajaramesh after completing his MSc (Computer Science) from Andhra University, obtained MTech(CSE) from JNTU Kakinada. He has been teaching various subjects from the year 2000 in different engineering colleges and presently he is associate professor in Sri Vasavi Engineering College, Tadepalligudem. His favorite subjects are Data Structures, programming languages and Computer Networks. He has published around 10 papers in the area of data mining and he is currently pursuing PhD degree from KL University, Guntur.
Rakesh Nayak is presently working as a Professor in the Department of Computer Science and Engineering at Sri Vasavi Engineering College, Tadepalligudem. He received his Master in Computer Applications Degree from Indira Gandhi National Open University in the year 2007 and M.Tech (CSE) from Acharya Nagarjuna University in 2010 and his Ph.D. degree in Computer Science from Behrampur University in 2013. Prior to joining the computer science department in 2007, he has worked as Sr. Lecturer in Mathematics for around Eight Years in different Engineering/MCA colleges. He has more than 15 years of teaching experience and has guided 10 M.Tech Students. He has many publications in international journals to his credit.
CH Rajaramesh after completing his MSc (Computer Science) from Andhra University, obtained MTech(CSE) from JNTU Kakinada. He has been teaching various subjects from the year 2000 in different engineering colleges and presently he is associate professor in Sri Vasavi Engineering College, Tadepalligudem. His favorite subjects are Data Structures, programming languages and Computer Networks. He has published around 10 papers in the area of data mining and he is currently pursuing PhD degree from KL University, Guntur.
Rakesh Nayak is presently working as a Professor in the Department of Computer Science and Engineering at Sri Vasavi Engineering College, Tadepalligudem. He received his Master in Computer Applications Degree from Indira Gandhi National Open University in the year 2007 and M.Tech (CSE) from Acharya Nagarjuna University in 2010 and his Ph.D. degree in Computer Science from Behrampur University in 2013. Prior to joining the computer science department in 2007, he has worked as Sr. Lecturer in Mathematics for around Eight Years in different Engineering/MCA colleges. He has more than 15 years of teaching experience and has guided 10 M.Tech Students. He has many publications in international journals to his credit.
Content
- Introduction
- Elementary Data Structures
- Divide and Conquer Technique
- Greedy Technique
- Dynamic Programming
- Backtracking
- Branch and Bound Technique
- NP-Hard and NP-Complete Problems
- Bibliography
- Index
- Elementary Data Structures
- Divide and Conquer Technique
- Greedy Technique
- Dynamic Programming
- Backtracking
- Branch and Bound Technique
- NP-Hard and NP-Complete Problems
- Bibliography
- Index