Data Structures Using C
Price: 725.00 INR
ISBN:
9789354977190
Publication date:
02/08/2023
Paperback
241.0x184.0mm
Price: 725.00 INR
ISBN:
9789354977190
Publication date:
02/08/2023
Paperback
241.0x184.0mm
The third edition of Data Structures using C is a comprehensive textbook for undergraduate engineering students of computer science as well as postgraduate students of computer applications to understand the fundamental concepts of data structures and their implementation in C programming language. The book covers all the essential topics of data structures, including arrays, linked lists, stacks, queues, trees, and graphs, providing readers with a thorough understanding of each concept's strengths and limitations. With clear explanations and easy-to-follow code examples, this book is perfect for students and professionals seeking a solid foundation in data structures and their applications. The book utilizes a systematic approach wherein the design of each of the data structures is followed by algorithms of different operations that can be performed on them, and the analysis of these algorithms in terms of their running times.
Rights: World Rights
Description
The third edition of Data Structures using C is a comprehensive textbook for undergraduate engineering students of computer science as well as postgraduate students of computer applications to understand the fundamental concepts of data structures and their implementation in C programming language. The book covers all the essential topics of data structures, including arrays, linked lists, stacks, queues, trees, and graphs, providing readers with a thorough understanding of each concept's strengths and limitations. With clear explanations and easy-to-follow code examples, this book is perfect for students and professionals seeking a solid foundation in data structures and their applications. The book utilizes a systematic approach wherein the design of each of the data structures is followed by algorithms of different operations that can be performed on them, and the analysis of these algorithms in terms of their running times.
Table of contents
Chapter 1: Introduction to C
Chapter 2: Introduction to Data Structures and Algorithms
Chapter 3: Arrays
Chapter 4: Strings
Chapter 5: Structures and Unions
Chapter 6: Linked Lists
Chapter 7: Stacks
Chapter 8: Queues
Chapter 9: Trees
Chapter 10: Efficient Binary Trees
Chapter 11: Multi-way Search Trees
Chapter 12: Heaps
Chapter 13: Graphs
Chaper 14: Searching and Sorting
Chapter 15: Hashing and Collision
Chapter 16: Files and Their Organization
Appendx A: Memory Allocation in C Programs
Appendix B: Garbage Collection
Appendix C: Backtracking
Appendix D: File Handling in C
Appendix E: Address Calculation Sort
Appendix F: Program Optimization Techniques
Appendix G: Answers
Features
- New to the Third Edition
- Sections on best practices to be followed while writing a C program, need and selection of a data structure
- Updated chapters to demonstrate real-world applications of data structures
- Appendices on code optimization techniques and case studies
- Practical implementation of the algorithms using tested C programs
- Objective type questions to enhance the analytical ability of the students
- Solution Manual
- PowerPoint Presentation
- Projects
- Chapter-wise Programming exercises
- Additional C Programmes
- Interview and Quiz questions
Online Resources
For Instructors
For Students
Description
The third edition of Data Structures using C is a comprehensive textbook for undergraduate engineering students of computer science as well as postgraduate students of computer applications to understand the fundamental concepts of data structures and their implementation in C programming language. The book covers all the essential topics of data structures, including arrays, linked lists, stacks, queues, trees, and graphs, providing readers with a thorough understanding of each concept's strengths and limitations. With clear explanations and easy-to-follow code examples, this book is perfect for students and professionals seeking a solid foundation in data structures and their applications. The book utilizes a systematic approach wherein the design of each of the data structures is followed by algorithms of different operations that can be performed on them, and the analysis of these algorithms in terms of their running times.
Read MoreTable of contents
Chapter 1: Introduction to C
Chapter 2: Introduction to Data Structures and Algorithms
Chapter 3: Arrays
Chapter 4: Strings
Chapter 5: Structures and Unions
Chapter 6: Linked Lists
Chapter 7: Stacks
Chapter 8: Queues
Chapter 9: Trees
Chapter 10: Efficient Binary Trees
Chapter 11: Multi-way Search Trees
Chapter 12: Heaps
Chapter 13: Graphs
Chaper 14: Searching and Sorting
Chapter 15: Hashing and Collision
Chapter 16: Files and Their Organization
Appendx A: Memory Allocation in C Programs
Appendix B: Garbage Collection
Appendix C: Backtracking
Appendix D: File Handling in C
Appendix E: Address Calculation Sort
Appendix F: Program Optimization Techniques
Appendix G: Answers