Lets Explore,

Data Structures

(Paperback)

S. Lovelyn Rose, R. Venkatesan,

Wiley India Pvt. Ltd (Publisher)

Published

2015

Reviews

Computing and Information Technology Information technology: general topics

By: S. Lovelyn Rose, R. Venkatesan | Publisher: Wiley India Pvt. Ltd | Released: 13 Jan 2015

Ships within 2-4 days

Out Of Stock

₹340.00

₹479.00

29% off

“Data Structures” is a fundamental course for all Computer Science programs of undergraduate and graduate studies. A good understanding of data representation lays a strong foundation for students to design efficient algorithms. Material included in this book could be presented to students in a semester with an associated lab component. It covers the most commonly used data structures with their applications. Algorithms have been provided for understanding the operations associated with each data structure. For appreciating the selection of a data structure for an application, the time and space complexities have been highlighted. The review questions and exercises have been arranged in an increasing order of difficulty to enable the learner to become proficient in the subject.

· Introduction to Algorithms and Data Structures
· Linear Data Structures
· Non-Linear Data Structures
· Advanced Data Structures
· Sorting
· File Structures

About the Author

Dr. R. Venkatesan is currently Professor and Head of the Department of CSE at PSG College of Technology, Coimbatore, where he has been teaching for the last 14 years. He has 18 years of industry experience, where he actively coordinated and managed large-scale software projects. He is also a Fellow of the Institution of Engineers of India and has several publications in national and international journals and conferences. Dr. S. Lovelyn Rose has 12 years of work experience with PSG College of Technology. She has several publications in national and international journals and conferences. Her subject expertise and interest include Data Structures and Algorithms, Algorithm Design Techniques and Data Mining.