Books

Search Books...

Identifying Errors In Algorithm Books

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

Algorithm Design and Analysis

Author: Solomon Olalekan Akinola

School: University of Ibadan

Department: Science and Technology

Course Code: CSC236

Topics: Algorithm Design, Algorithm Analysis, Algorithm, Problem Solving Techniques, Recursion, Recursive Fibonacci Series, Sorting Techniques, Sorting Techniques, Searching Techniques, Linear Search, Sequential Search, Runtime Analysis, Big ‘O’ Notation, O-Notation, Insertion Sort, Divide and Conquer Algorithm, Merge Sort Algorithm, Quicksort Algorithm, Partitioning, Recursion-Tree Method, Master Theorem, Master method

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

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

Algorithm and Application Software

Author: FUNAAB

School: Federal University of Agriculture, Abeokuta

Department: Science and Technology

Course Code: CSC211

Topics: algorithm, program, algorithm analysis, Basic flowchart shapes, algorithm structure, application software, Microsoft access

Algorithm and complexity analysis

Author: David Acheme

School: Edo University

Department: Science and Technology

Course Code: CSC214

Topics: Algorithm, Algorithm complexity analysis, arrays, iteration, invariants, Linked List Data Structure, Queue Data Structure, queue operations, stacks

A Practical Introduction to Data Structures and Algorithm Analysis, Third Edition

Author: Clifford Shaffer

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: CSC305

Topics: Data Structures, Algorithm Analysis, Logarithms, Summations, Summations, Recurrences, recursion, Algorithm Analysis, Asymptotic Analysis, Fundamental Data Structures, Binary Trees, Binary Tree Traversals, Binary Tree Node Implementations, Binary Search Trees, Huffman Coding Trees, Non-Binary Trees, sorting, searching, internal sorting, shellsort, heapsort, File Processing, External Sorting, searching, hashing, indexing, Advanced Data Structures, graphs, Advanced Tree Structures

Computer 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

Cambridge IGCSE and O level Computer Science, 2nd Edition

Author: David Watson, Helen Williams

School: International Exams

Department:

Course Code: IGCSE

Topics: Data representation, computer, Number systems, data storage, file compression, Data transmission, error detection, symmetric encryption, asymmetric encryption, Hardware, computer architecture, input devices, output devices, network hardware, software, programming language, translators, internet, digital currency, cyber security, automated systems, robotics, artificial intelligence, Algorithm design, problem solving, program development life cycle, computer systems, computer decomposition, test data, identifying errors in algorithm, writing algorithms, amending algorithms, programming, arrays, file handling, Database, Boolean logic, standard logic gate symbols, logic circuits, logic expression, truth tables, problem statements

Applied Numerical Methods with MATLAB, 4th edition

Author: Steven Chapra

School: Edo University

Department: Engineering

Course Code: GEE216

Topics: Numerical Methods, mathematical modeling, MATLAB, mathematical operations, structured programming, errors, roundoff errors, truncation errors, total numerical errors, blunders, model errors, data uncertainty, roots, graphical methods, bracketing methods, bisection, roots, Simple Fixed-Point Iteration, Newton-Raphson, secant methods, Brent's method, MATLAB functions, optimization, linear systems, linear algebraic equations, matrices, Gauss elimination, Naive gauss elimination, tridiagonal systems, LU factorization, matrix inverse, system condition, error analysis, iterative methods, linear systems, nonlinear systems, Eugen values, power method, curve fitting, linear regression, random numbers, linear least-squares regression, polynomial regression, multiple linear regression, QR factorization, nonlinear regression, Fourier analysis, Continuous Fourier series, frequency domain, time domain, Fourier integral, Fourier transform, Discrete Fourier transform, power spectrum, polynomial interpolation, Newton interpolating polynomial, Lagrange interpolating polynomial, inverse interpolation, extrapolation, oscillations, splines, linear splines, quadratic splines, cubic spline, multidimensional interpolation, integration, differentiation, Numerical integration formulas, Newton-Cotes formulas, Trapezoidal rule, Simpson's rules, initial value problem, Runge-Kutta methods, adaptive Runge-Kutta methods, stiff systems, Boundary-value problems, shooting method, finite-difference methods, MATLAB function

Departments

Administration, Social and Management science image

Administration, Social and Management science

Agriculture and Veterinary Medicine image

Agriculture and Veterinary Medicine

Arts and Humanities image

Arts and Humanities

Education image

Education

Engineering image

Engineering

General studies image

General studies

Law image

Law

Medical, Pharmaceutical and Health science image

Medical, Pharmaceutical and Health science

Science and Technology image

Science and Technology

Novrazbb Yotjob distinctquote yourowndir muttcat scholarship carlesto newsfunt