Fundamentals of Data Structures and Algorithms

1. Auflage 2026
ISBN: 978-1-041-11010-1
Verlag: CRC Press

Buch, Englisch, 354 Seiten, Format (B × H): 178 mm x 254 mm

Developed in the classroom, Fundamentals of Data Structures and Algorithms is a textbook that provides a comprehensive but concise discussion of fundamental data structures and algorithms that form the foundation of software development.

The book discusses concepts, principles, implementation, and application of various data structures and algorithms including array-lists, vectors, linked lists, stacks, queues, sorting, trees, hashing, graphs, and data compression. It explains algorithms in a generic way that allows for implementation in any programming language. However, programming examples are presented in Java. Each chapter is organized systematically into brief, reader-friendly sections itemizing important points to remember. Diagrams and illustrations also sum up salient points to enhance learning. The Unified Modeling Language (UML) notation for class diagrams has been employed, and students are encouraged to apply this standard in the development of their own algorithms for programming problems. Programming examples are typically based on real-to-life problems that students can draw from long after the course ends.

The text has been prepared specifically to meet three objectives: comprehensive coverage, brevity, and motivating students to strive towards becoming excellent software developers. It aims to give students:

- A working knowledge of fundamental data structures and algorithms necessary for intermediate and advanced software development

- Reinforcement of sound and sustainable programming habits

- Preparation for success in additional advanced courses in computer science at the undergraduate as well as graduate level

- Solid grounding in problem analysis, program design, and construction

Suitable for undergraduate students pursuing a degree in computer science, the textbook also benefits graduate students who need a succinct review of programming fundamentals. With its practical, methodical approach to data structures and algorithms, the book enables students to gain a solid grasp of fundamental data structures and algorithms that will benefit their future studies and professional careers.

Zielgruppe

Postgraduate and Undergraduate Core

Autoren/Hrsg.

Foster, Elvis C

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik EDV | Informatik Informatik
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering

Inhaltsverzeichnis

1. Review of Algorithm Development 2. Introduction to Data Structures 3. Review of Java Programming 4. Introduction to Linear Lists 5. Stacks 6. Queues 7. Sorting and Searching 8. Trees 9. Hashing 10. Graphs 11. Data Compression Appendix. Suggested Assignments

Über Autor(innen)

Elvis C. Foster is Professor of Computer Science at Keene State College. He holds a Bachelor of Science (BS.) in Computer Science and Electronics, as well as a Doctor of Philosophy (PhD) in Computer Science (specializing in software engineering and database systems) from University of the West Indies, Mona Jamaica. His research interests include the design, construction, and evaluation of management support systems (MSSs) as well as intelligent software systems for contemporary organizations. Dr. Foster has over 25 years of combined experience as a software engineer, information technology executive and consultant, and computer science educator. He is the author of ten books, seven of which are textbooks in Software Engineering and Database Systems respectively. Additionally, he has authored a growing online Computer Science Lecture Series. Finally, he has also authored several articles in selected scholarly journals and has served as peer reviewer and/or editor in other selected scholarly publications.