| Description |
1 online resource (unpaged) : illustrations, graphs |
| Series |
Open textbook library |
| Contents |
Publisher's Note -- Acknowledgements -- Algorithms, Big-O, and Complexity -- Recursion -- Sorting -- Search-- Linked Lists -- Stacks and Queues -- Hashing and Hash Tables -- Search Trees -- Priority Queues -- Dynamic Programming -- Graphs -- Hard Problems -- Contributors |
| Summary |
"This textbook serves as a gentle introduction for undergraduates to theoretical concepts in data structures and algorithms in computer science while providing coverage of practical implementation (coding) issues. The field of computer science (CS) supports a multitude of essential technologies in science, engineering, and communication as a social medium. The varied and interconnected nature of computer technology permeates countless career paths making CS a popular and growing major program. Mastery of the science behind computer science relies on an understanding of the theory of algorithms and data structures. These concepts underlie the fundamental tradeoffs that dictate performance in terms of speed, memory usage, and programming complexity that separate novice programmers from professional practitioners" -- taken from Amazon.com |
| Notes |
Reviewers: Aaron Boudreaux and Joshua Kiers; Illustrator: Mia M. Scarlato; Contributor: Edward Mandity (Project Manager) |
|
"This textbook was peer-reviewed, copyedited, and published through the Private Academic Library Network of Indiana (PALNI) PALSave Textbook Creation Grants Program, which is funded by the Lilly Endowment Inc." -- taken from Pressbooks site |
| Bibliography |
Includes bibliographical references |
| Notes |
Attribution |
|
In English |
| Subject |
Algorithms -- Textbooks
|
|
Data structures (Computer science) -- Textbooks
|
|
Computer science -- Textbooks
|
|
Algorithms
|
|
Computer science
|
|
Data structures (Computer science)
|
| Genre/Form |
Textbooks
|
| Form |
Electronic book
|
| Author |
Moser, Lucas, author
|
|
Marian University (Indianapolis, Ind.), affiliated name.
|
| ISBN |
9781956390247 |
|
1956390243 |
|
9781956390230 |
|
1956390235 |
|
