Advanced Data Structures and Algorithms 

Publisher:
BPB Publications
| Author:
Abirami A, Priya R L
| Language:
English
| Format:
Paperback

719

Save: 10%

In stock

Ships within:
1-4 Days
15 People watching this product now!

In stock

ISBN:
SKU 9789355517937 Category
Page Extent:
194

“Advanced Data Structures and Algorithms” is an important subject area in Computer Science that covers more complex and advanced topics related to data structures and algorithms.
This book will teach you how to analyze algorithms to handle the difficulties of sophisticated programming. It will then help you understand how advanced data structures are used to store and manage data efficiently. Moving on, it will help you explore and work with Divide and Conquer techniques, Dynamic programming, and Greedy algorithms. Lastly, the book will focus on various String Matching Algorithms such as naïve string matching algorithms, Knuth–Morris–Pratt(KMP) Algorithm, and Rabin-Karp Algorithm.
By the end of the book, you will be able to analyze various algorithms with time and space complexity to choose the best suitable algorithms for a given problem.

0 reviews
0
0
0
0
0

There are no reviews yet.

Be the first to review “Advanced Data Structures and Algorithms ”

Your email address will not be published. Required fields are marked *

You have to be logged in to be able to add photos to your review.

Description

“Advanced Data Structures and Algorithms” is an important subject area in Computer Science that covers more complex and advanced topics related to data structures and algorithms.
This book will teach you how to analyze algorithms to handle the difficulties of sophisticated programming. It will then help you understand how advanced data structures are used to store and manage data efficiently. Moving on, it will help you explore and work with Divide and Conquer techniques, Dynamic programming, and Greedy algorithms. Lastly, the book will focus on various String Matching Algorithms such as naïve string matching algorithms, Knuth–Morris–Pratt(KMP) Algorithm, and Rabin-Karp Algorithm.
By the end of the book, you will be able to analyze various algorithms with time and space complexity to choose the best suitable algorithms for a given problem.

About Author

Mrs. Abirami A has completed her M.E (Information Technology) from Mumbai University, and is currently pursuing Ph.D. (Information Technology), from Noorul Islam Centre for Higher Education, Kumaracoil, Tamil Nadu. Her research interests are Computer Networks, Cyber security, Network Forensics and Analysis of algorithms. She has 17 years of teaching experience and has published many papers in national and international conferences and journals and work as an editorial board member of the Editorial Board of various SCI/SCOPUS indexed journals. Asst. Professor III - Information Technology Department, Bannari Amman Institute of Technology, Sathyamangalam, Erode, Tamil Nadu. Mrs. Priya R. L is currently working as an Assistant Professor in V.E.S Institute of Technology, Mumbai, having 18 years of teaching experience for undergraduate students of Computer Engineering and Information Technology disciplines in different Engineering Institutes. She obtained her Master’s degree in Information Technology Engineering from Mumbai University. She has also worked as a Software Engineer in different firms in Chennai and Mumbai for 4 years. Her research interest is more into Artificial Intelligence, Internet of Things (IoT), Software engineering, Data Structures, Data Mining and Next Generation Networks. She has published more than 40 papers in various reputed SCI / SCOPUS indexed journals and international conferences.
0 reviews
0
0
0
0
0

There are no reviews yet.

Be the first to review “Advanced Data Structures and Algorithms ”

Your email address will not be published. Required fields are marked *

You have to be logged in to be able to add photos to your review.

YOU MAY ALSO LIKE…

Recently Viewed