Foundations Of Computer Science 4th Edition Behrouz Forouzan, ISBN-13: 978-1473751040 
Data Structures and Algorithm Analysis in Java 3rd Edition, ISBN-13: 978-0132576277 
Effective Cybersecurity: A Guide to Using Best Practices and Standards William Stallings, ISBN-13: 978-0134772806 
Enhanced Discovering Computers 2017 Enhanced Edition Misty E. Vermaat, ISBN-13: 978-1305657458 
CompTIA Security+ Guide to Network Security Fundamentals 6th Edition, ISBN-13: 978-1337288781 
Guide to Operating Systems 5th Edition, ISBN-13: 978-1305107649 
Elements of Information Theory 2nd Edition Thomas M. Cover, ISBN-13: 978-0471241959 
Basic Engineering Circuit Analysis 11th Edition, ISBN-13: 978-1118539293 
Exploring GPT-3: An unofficial first look at the general-purpose language processing API from OpenAI, ISBN-13: 978-1800563193 
Cyber Threat Intelligence, Advances in Information Security 2018 Edition, ISBN-13: 978-3319739502 
Industrial Network Security 2nd Edition Eric D. Knapp, ISBN-13: 978-0124201149 
The Practice of System and Network Administration Volume 1 3rd Edition Thomas Limoncelli, ISBN-10: 9780321919168 
Operating System Concepts 9th Edition Abraham Silberschatz, ISBN-13: 978-1118063330 
Learn Windows PowerShell in a Month of Lunches 3rd Edition Donald W. Jones, ISBN-13: 978-1617294167 
Description
Algorithms: Design and Analysis – eBook PDF
Algorithms play a key role both in the theory and in the practice of computing. The aim of the authors was to write a textbook that would not belittle the subject but would still be readable by most students on their own. Algorithms: Design and Analysis (PDF) includes over 120 exercises. Some of them are drills; others make important points about the material covered in the ebook or introduce new algorithms not covered there. The ebook also provides programming projects.
From the Table of Contents:
Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation, and Solution techniques, Function, and Growth of functions.
Chapter 2: Different Sorting Techniques and their analysis.
Chapter 3: Greedy approach, Dynamic Programming, Brach and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics.
Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms.
Chapter 5: Binary search tree, Red-black Tree, Binomial heap, B-Tree, and Fibonacci Heap.
Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.
NOTE: The product only includes the ebook Algorithms: Design and Analysis in PDF. No access codes are included.
Olivia Bryant (verified owner) –
Great store, my eBook was delivered instantly.
James Carter (verified owner) –
Hassle-free purchase, eBook arrived right away.