Amazon cover image
Image from Amazon.com

A programmer's guide to computer science : a virtual degree for the self-taught developer / William M. Springer

By: Material type: TextTextPublication details: USA : Jaxson Media, c2019Description: 178 pages : illustration : 23cmISBN:
  • 978-1-951204-00-6
Subject(s): LOC classification:
  • GC QA 76 .S67 2019 c.1
Contents:
I. Computer Science FUndamentals -- 1. Asysmpototic Rutime -- 2. Data Structures -- 3. Classes of problems -- II. Graphs and Graphs ALgorithms. -- 4. Introduction to Graph Theory -- 5. Data Structures on Graphs -- 6. Well-Known Graph Algorithms -- 7. Common Graph Classes. III. Non-Graph Algorithms -- 8. Sorting ALgorithms -- IV. Problem-Solving Techniques -- 9. Brute Force or No? 10. Dynamis Programming -- 11. Greedy algorithms -- V. Complexity Theory -- 12. Understanding Complexity Theory -- 13. Language and State Machines -- 14. Turing Machines.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Shelving location Call number Status Date due Barcode
Books Books NU BALIWAG NU BALIWAG Computer Engineering General Circulation GC QA 76 .S67 2019 c.1 (Browse shelf(Opens below)) Available NUBUL000005064

Include appendix.

I. Computer Science FUndamentals -- 1. Asysmpototic Rutime -- 2. Data Structures -- 3. Classes of problems -- II. Graphs and Graphs ALgorithms. -- 4. Introduction to Graph Theory -- 5. Data Structures on Graphs -- 6. Well-Known Graph Algorithms -- 7. Common Graph Classes. III. Non-Graph Algorithms -- 8. Sorting ALgorithms -- IV. Problem-Solving Techniques -- 9. Brute Force or No? 10. Dynamis Programming -- 11. Greedy algorithms -- V. Complexity Theory -- 12. Understanding Complexity Theory -- 13. Language and State Machines -- 14. Turing Machines.

There are no comments on this title.

to post a comment.

© 2023 NU LIBRARY BALIWAG. All rights reserved. Privacy Policy I Powered by: KOHA