Buch, Englisch, 362 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 508 g
A Practical Approach for Beginners
Buch, Englisch, 362 Seiten, Format (B × H): 156 mm x 234 mm, Gewicht: 508 g
ISBN: 978-0-367-61637-3
Verlag: Taylor & Francis Ltd (Sales)
The data structure is a set of specially organized data elements and functions, which are defined to store, retrieve, remove and search for individual data elements. Data Structures using C: A Practical Approach for Beginners covers all issues related to the amount of storage needed, the amount of time required to process the data, data representation of the primary memory and operations carried out with such data. Data Structures using C: A Practical Approach for Beginners book will help students learn data structure and algorithms in a focused way.
- Resolves linear and nonlinear data structures in C language using the algorithm, diagrammatically and its time and space complexity analysis
- Covers interview questions and MCQs on all topics of campus readiness
- Identifies possible solutions to each problem
- Includes real-life and computational applications of linear and nonlinear data structures
This book is primarily aimed at undergraduates and graduates of computer science and information technology. Students of all engineering disciplines will also find this book useful.
Zielgruppe
Postgraduate, Professional, and Undergraduate Advanced
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Spiele-Programmierung, Rendering, Animation
- Mathematik | Informatik Mathematik Algebra Zahlentheorie
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
- Mathematik | Informatik EDV | Informatik Technische Informatik
Weitere Infos & Material
1. Fundamental Principles of Algorithm and Recursion 2. Sequential Representation of Linear Data Structures 3. Void Pointer and Dynamic Memory Management 4. Linked Representation of Linear Data Structures 5. Nonlinear Data Structures: Trees 6. Nonlinear Data Structures: Graph 7. Searching and Sorting Techniques