Computer science, algorithms and complexity / edited by Adele Kuzmiakova
Material type: Computer fileLanguage: English Publication details: Burlington, Canada : Arcler Press, 2021Description: 1 online resource ( xviii, 276, pages) : color illustrationsContent type:- text
- computer
- online resource
- 9781774077481 (e-book)
- QA164 C73 2021
Item type | Current library | Collection | Call number | Materials specified | Status | Notes | Date due | Barcode |
---|---|---|---|---|---|---|---|---|
Online E-Books | Ladislao N. Diwa Memorial Library Multimedia Section | Non-fiction | OEBP QA164 C73 2021 (Browse shelf(Opens below)) | Available | PAV | OEBP000305 | ||
Compact Discs | Ladislao N. Diwa Memorial Library Multimedia Section | Non-fiction | EB QA164 C73 2021 (Browse shelf(Opens below)) | Room use only | PAV | EB000305 |
Browsing Ladislao N. Diwa Memorial Library shelves, Shelving location: Multimedia Section, Collection: Non-fiction Close shelf browser (Hides shelf browser)
OEBP P96 C74W11 2022 Media and the criminal justice system/ | OEBP P96 E57G17 2021 Media and water : communication, culture and perception / | OEBP QA16 A53Aw7 2020 Awesome math : teaching mathematics with problem-based learning / | OEBP QA164 C73 2021 Computer science, algorithms and complexity / | OEBP QA166 G76 2021 Graphs : theory and algorithms / | OEBP QA20 Y2 2020 Introduction to mathematical literacy / | OEBP QA297 D35 2020 Numerical methods in science and engineering : theories with MATLAB, mathematica, fortran, C and python programs / |
https://portal.igpublish.com/iglibrary/ is required to read this e-book.
Includes bibliographical references and index
1. Basic techniques for design and analysis of algorithms -- 2. Computational complexity theory -- 3. Graph and network algorithms -- 4. Cryptography -- 5. Algebraic algorithms -- 6. Parallel algorithms --
7. Randomized algorithms -- 8. Pattern matching and text compression algorithms -- 9. Genetic algorithms -- 10. Combinational optimization
The book defines complexity as a numerical function T (n)-the relationship between time and input size n, as one of the basic ideas of computer science. The computational complexity is categorized by algorithm based on its nature and function. The (computational) complexity of the algorithm is a measurement of the ratio of computational resources (time and space) consumed when a particular algorithm is running. For these issues, the book tries to locate heuristic algorithms which can almost explain the problem and operate in a reasonable timeframe. Different kinds of algorithms are described such as graph and network algorithms, algebraic algorithms, parallel algorithms and randomized algorithms.
Fund 164 CE-Logic Purchased April 14, 2022 OEBP000305 Carmona Campus PHP No price 0000 0000