Data Structures

About the book

This book titled “Data Structures” is written to provide a significant amount of flexibility in the order in which the material is covered, as illustrated in the accompanying programs. Selected material from, Chapters 1 and 6 covers a detailed explanation of Linear Data Structures (List, Stack, and Queue). Care has been taken throughout the chapters to include a set of exercises to help readers gain an in-depth idea and incorporate the essential concepts in this chapter. Chapters 7 to 11 cover the concepts of Non-linear data structures. Systematic care has been taken to support the topics with necessary routines and relevant diagrams about Non-Linear Data structure concepts like Trees with types and Graphs with types. Chapters 12 to 14 cover the concepts of Sorting, Searching and Hashing Techniques. These topics are explained with necessary routines and relevant diagrams. learn how to write well-designed programs and how to recognise them. At the same time, they will develop insight into program analysis and learn how to analyse programs to determine their correctness and efficiency. Mr R. Vinston Raja Mrs K. Hema Priya Mrs. R. Jeena Mrs P. Sheela Rani

Key features

• Chapter 1 Linear Data Structures,
• Chapter 2 Linear data structure - Stack,
• Chapter 3 Linear data structure – Queue,
• Chapter 4 Circular Queue,
• Chapter 5 Double ended Queue,
• Chapter 6 Priority Queue,
• Chapter 7 Non Linear Data Structures – Tree
• Chapter 8 Non Linear Data Structures - Graphs
• Chapter 9 BI-Connectivity
• Chapter 10 Euler Circuits
• Chapter 11 Applications Of Graphs
• Chapter 12 Sorting
• Chapter 13 Searching
• Chapter 14 Hashing

Readership

Computer Science and Information Technology