Books

Search Books...

Algorithm Design 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

Design of structural elements, 3rd Edition

Author: Chanakya Arya

School: Bayero University, Kano

Department: Engineering

Course Code: CIV3307, CIV4204, CIV5405

Topics: Structural Design, Design Philosophy, Design Basics, Basic structural concepts, materials properties, Design loads acting on structures, Design loads acting on elements, Structural analysis, Beam design, Column design, British Standard Structural design, Beams, Slabs, Foundations, Retaining walls, Design in structural steelwork to BS5950, Iron, Steel, Design Strength, Connections Design, Design in unreinforced masonry, Design in timber to BS5268, Structural design to Eurocodes

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

Reinforced Concrete Design To Eurocode 2

Author: Bill Mosley, John Bungey, Ray Hulse

School: Bayero University, Kano

Department: Engineering

Course Code: CIV3307

Topics: Reinforced Concrete Design, Design processes, composite action, stress-strain relations, shrinkage, thermal movement, creep, materials specification, Limit state design, Characteristics material strengths, Combination of actions, Load combinations, Beams analysis, Frames Analysis, Shear wall structures resisting horizontal loads, Moments redistribution, Rectangular-parabolic stress block, Triangular stress block, Shear, bond, Torsion, Anchorage bond, span-effective depth ratio, deflection calculation, flexural cracking, Thermal cracking, Shrinkage cracking, Reinforced concrete beams design, Reinforced concrete slabs design, Column design, column classification, slender column design, Foundations design, Retaining walls design, Prestressed concrete, Water-retaining structures, composite construction, Footings, Reinforcement details, Shear connector design

Design of Structural Elements

Author: WMC McKenzie

School: Bayero University, Kano

Department: Engineering

Course Code: CIV3307

Topics: Structural elements design, Structural Analysis Techniques, Shear Force, Bending moment, Shear force diagram, Bending moment diagram, Deflection of Beams, Elastic Shear stress distribution, Elastic Bending stress distribution, Transformed sections, Moment distribution, Bending stiffness, Rotational Stiffness, Carry-over moment, Pinned End, Free Moments, Fixed bending moments, Distribution Factors, Design Philosophies, Permissible stress Design, Load Factor Design, Limit State Design, Design codes, Eurocodes, National Annex, Structural Loading, Dead loads, Imposed loads, Imposed roof loads, Floor load distribution, Load distribution, Structural Instability, Overall Stability, Robustness, Reinforced concrete Element's Design, Structural Steelwork Elements' Design, Structural Timber Elements' Design.

Digital Logic Circuit Analysis and Design

Author: Victor Nelson, Troy Nagle, Bill Carroll, David Irwin

School: Edo University

Department: Engineering

Course Code: EEE314

Topics: Digital Logic Circuit Analysis, Digital Logic Circuit Design, computing, digital systems, number systems, positional notation, arithmetic, binary arithmetic, octal arithmetic, hexadecimal arithmetic, base conversions, signed number representation, computer codes, numeric codes, error detection codes, correction codes, Boolean algebra, Venn diagram, Duality, switching functions, truth tables, switching circuits, electronic logic gates, combinational circuits, algebraic methods, combinational logic circuits, computer aided design, design cycle, digital circuit modelling, design synthesis, logic simulation, Karnaugh maps, Quine-McCluskey tabular minimization method, Petrick's algorithm, computer aided minimization of switching functions. Modular combinational logic, Decodes, encoders, decoder circuit structures, encoders, multiplexers, demultiplexers, data distributors, adder circuits, comparators, semi custom logic devices, logic array circuits, field-programmable logic arrays, programmable read-only memory, programmable array logic, sequential devices, sequential circuits, memory devices, latches, flip-flops, timing circuits, modular sequential logic shift registers, counters, serial adder unit, serial accumulators, parallel accumulators, multiple-sequence counters, digital fractional rate multipliers, synchronous sequential circuit models, synchronous sequential circuits, registered programmable logic device, programmable gate arrays, sequential circuit design, logic circuit testing, digital logic circuit testing, combinational logic circuit testing, sequential logic circuit testing, electronic slot machine, keyless auto entry system

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

Design and Analysis of Experiments

Author: STA FUTO, Aldrian cares

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: STA453

Topics: Experiments Aid Estimation, Hypothesis Testing, experimental design techniques, experimental error, completely randomized design, least square method, confidence interval, ANOVA table, normality assumption, randomized completely block design, sum of squares calculation, relative efficiency, approximate analysis, missing values, incomplete block design, balanced incomplete block design, Latin square design

Systems Analysis and Design Methods, 7th Edition

Author: Jeffrey Whitten, Lonnie Bentley

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: CIT303

Topics: system analysis, information system building blocks, information systems development, project management, fact-finding technique, modeling system requirements, process modeling, data modeling, data analysis, Object-oriented analysis, system design methods, systems design, feasibility analysis, input design, prototyping, database design, user interface design, output design, systems operations, systems construction, systems implementation

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