Algorithms Books
Introduction to Algorithms, 3rd Edition
Author: Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein
School: University of Ibadan
Department: Science and Technology
Course Code: CSC242
Topics: Algorithms, Insertion sort, analyzing Algorithms, designing Algorithms, growth of functions, asymptotic notation, maximum-subarray problem, Strassen’s algorithm, Probabilistic Analysis, Randomized Algorithms, hiring problem, Indicator random variables, Heapsort, heaps, heapsort algorithm, Priority queues, quicksort, Radix sort, Counting sort, Bucket sort, Data Structures, Hash Tables, has function, open addressing, Perfect hashing, Data Structures, sorting order statistics, Binary Search Trees, Red-Black Trees, Augmenting Data Structures, Dynamic Programming, Greedy Algorithms, Amortized Analysis, B-Trees, Fibonacci Heaps, van Emde Boas Trees, Graph Algorithms, Minimum Spanning Trees, Single-Source Shortest Paths, All-Pairs Shortest Path, maximum flow, Multithreaded Algorithms, Matrix Operations, linear programming, polynomials, Number-Theoretic Algorithms, String Matching, Computational Geometry, NP-Completeness, Polynomial time, Approximation Algorithms
Author: Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran
School: Edo University
Department: Science and Technology
Course Code: CMP315
Topics: Computer Algorithms, pseudocode conventions, recursive algorithms, performance analysis, randomized algorithms, primality testing, elementary data structures, binary search trees, cost amortization, prority queues, sets, graphs, graph representation, merge sort, quick sort, Strassen's matrix multiplication, convex hull, greedy method, knapsack problem, tree vertex splitting, prim's algorithm, dynamic programming, reliability design, backtracking, graph coloring, least cost search, algebraic problems, fast Fourier transform, lower bound theory, comparison trees, ordered searching, Cook's theorem, approximation algorithms, absolute algorithms, polynomial time approximation schemes, mesh algorithms, packet routing, hyper algorithms, PPR routing
Introduction to the design and analysis of algorithms ,3rd edition
Author: Anany Levitin, Soumen Mukherjee, Arup Kumar Bhattacharjee
School: University of Ibadan
Department: Science and Technology
Course Code: CSC242
Topics: algorithm design, algorithm analysis, Algorithm Efficiency, Algorithm Efficiency analysis, Brute Force, Exhaustive Search, Decrease-and-Conquer, Divide-and-Conquer, Transform-and-Conquer, Space and Time Trade-Offs, Dynamic Programming, Greedy Technique, Iterative Improvement, Algorithm Power, Algorithmic Problem Solving, Nonrecursive Algorithms mathematical analysis, recursive Algorithms mathematical analysis, Selection Sort, Bubble Sort, Sequential Search, Brute-Force String Matching, Closest-Pair Problems, Convex-Hull Problems, depth-First Search, Breadth-First Search, Insertion Sort, Topological Sorting, Variable-Size-Decrease Algorithms, Decrease-by-a-Constant-Factor Algorithms, binary search, Mergesort, quicksort, Binary Tree Traversals, Strassen’s Matrix Multiplication, Gaussian Elimination, presorting, Balanced Search Trees, Heaps, Heapsort, Horner’s Rule, Binary Exponentiation, Problem Reduction, B-Trees, hashing, Knapsack Problem, Optimal Binary Search Trees, Warshall’s Algorithm, Floyd’s Algorithm, Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Trees, huffman Codes, Simplex Method, Maximum-Flow Problem, Stable Marriage Problem, Lower-Bound Arguments, Decision Trees, Numerical Algorithms, Backtracking, Approximation Algorithms
Parallel programming, 2nd edition
Author: Barry Wilkinson, Michael Allen
School: Edo University
Department: Science and Technology
Course Code: CMP221
Topics: Parallel programming, parallel computers, cluster computing, message-passing computing, message-passing programming, parallel programs, Partitioning, synchronous computations, synchronous iteration program, load balancing, Distributed Termination Detection Algorithms, Shared Memory Multiprocessors, Parallel Programming Languages, distributed shared memory, distributed shared memory programming, algorithms, sorting algorithms, numerical algorithms, matrices, image processing, Hough transform, branch-and-bound search, genetic algorithms
Data Mining Multimedia, Soft Computing, and Bioinformatics
Author: Sushmita Mitra, Tinku Acharya
School: National Open University of Nigeria
Department: Science and Technology
Course Code: CIT891
Topics: Data Mining Multimedia, Soft Computing, Bioinformatics, data compression, web mining, data warehousing, neural netowrks, genetic algorithms, multimedia data compression, Source Coding Algorithms, image compression standard, text compression, Linear-Order String Matching Algorithms, string matching, Bayesian Classifiers, Instance-Based Learners, Scalable Clustering Algorithms, Hierarchical Symbolic Clustering, Modular Hybridization, Multimedia Data Mining
Author: Uddin Osemengbe
School: Edo University
Department: Science and Technology
Course Code: CSC122
Topics: Data structure, algorithms, Algorithm Analysis, Algorithm Complexity, Space Complexity
Principles of concurrent and distributed programming, 2nd edition
Author: Ben-Ari
School: Edo University
Department: Science and Technology
Course Code: CSC413
Topics: concurrent programming, distributed programming, concurrency, concurrent programming abstractions, machine-code instructions, critical section problem, concurrent programs verification, bakery algorithm, fast algorithms, semaphores, monitors, condition variables, protected objects, channels, parallel matrix multiplication, remote procedure calls, Linda model, distributed algorithms, distributed systems, model distributed mutual exclusion, Dijkstra-Scholten algorithm, credit-recovery algorithms, consensus, flooding algorithm, real-time systems, synchronous systems, Pseudocode notation
Electric Power System Planning Issues, Algorithms and Solutions
Author: Hossein Seifi, Mohammad Sadegh Sepasian
School: Federal University of Technology, Owerri
Department: Engineering
Course Code: PSE513
Topics: Electric Power System Planning, Power System Structure, Optimization Techniques, Heuristic Technique, Load Characteristics, load forecasting, load driving parameters, Spatial Load Forecasting, Long Term Load Forecasting Methods, Single-bus Generation Expansion Planning, Multi-bus Generation Expansion Planning, Linear Programming, Substation Expansion Planning, Network Expansion Planning, Reactive Power Planning, Power System De-regulating, Power System Uncertainties
Introduction to the design and analysis of algorithms ,3rd edition solutions manual
Author: Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein
School: University of Ibadan
Department: Science and Technology
Course Code: CSC242
Topics: algorithm design, algorithm analysis, Algorithm Efficiency, Algorithm Efficiency analysis, Brute Force, Exhaustive Search, Decrease-and-Conquer, Divide-and-Conquer, Transform-and-Conquer, Space and Time Trade-Offs, Dynamic Programming, Greedy Technique, Iterative Improvement, Algorithm Power
Discrete mathematics and its applications ,8th edition
Author: Kenneth Rosen
School: University of Ibadan
Department: Science and Technology
Course Code: CSC242
Topics: Discrete mathematics, logic, sets, functions, sequences, matrices, algorithms, Number theory, cryptography, induction, recursion, counting, discrete probability, advanced counting techniques, counting techniques, Linear Recurrence Relations, modelling computation, Finite-State Machines, relations, graphs, trees, boolean algebra, modelling computation, Boolean Functions, Logic Gates, Minimization of Circuits.Tree Traversal, Spanning Trees, Minimum Spanning Trees, Graph Models, Graph Terminology, Graph Isomorphism, Connectivity, Euler path, Hamilton Path, Shortest-Path Problems, Planar Graphs, Graph Coloring, Representing Relations, Equivalence Relations, Probability Theory, Bayes Theorem, variance, Pigeonhole Principle, permutation combination, binomial coefficient, Recursive Algorithms, Program Correctness, Divisibility, Modular Arithmetic, Integer Representations, Set Operations, Cardinality of Sets
Departments
Administration, Social and Management science
Agriculture and Veterinary Medicine
Arts and Humanities
Education
Engineering
General studies
Law
Medical, Pharmaceutical and Health science
Science and Technology