Trees 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
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
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
When lemon grows on Orange trees summary
Author: Sammy Crown, Diekara Oloruntoba-Oju
School: Federal University of Agriculture, Abeokuta
Department: General studies
Course Code: GNS101
Topics: Adesewa, When lemon grows on Orange trees
When Lemon Grows on Orange Trees
Author: Diekara Oloruntoba-oju
School: Federal University of Agriculture, Abeokuta
Department: General studies
Course Code: GNS101
Topics: When Lemon Grows on Orange Trees, Fiction, literature
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
Building Materials, Revised Third Edition
Author: SK Duggal
School: Bayero University, Kano
Department: Engineering
Course Code: CIV3302
Topics: Building Materials Principal Properties, Structural Clay Products, Brick's Classification, Brick's Testing, Clay Tiles, Terracotta, Porcelain, stoneware, Earthenware, Glazing, Rocks, Stones, Rock-forming minerals, Rock's Classification, Stone Durability, Stones Application, Stone seasoning, wood, wood Products, Trees Classification, Trees growth, Timber Preservation, Timber testing, Timber Structure, Timber's Fire Resistance, Properties of wood, wood products, wood-products applications, Material for making concrete, Cements, Portland cement, Raw materials chemical composition, Cement Hydration, Rate of Hydration, Hydration water requirement, Cements manufacturing, Cements testing, Cement Types, Cements storage, Aggregates, Aggregates classification, Aggregates characteristics, Deleterious Materials, Organic Impurities, Soundness, Aggregates Thermal Properties, Fine Aggregates, Coarse Aggregates, Cinder Aggregates, Mixing water Quality, Effect of mixing water from different source, Water for washing aggregates, Curing water, Lime, Limestone's Impurities, Limestone's Storage, Lime Vs Cement, Pozzolanas, Concrete, water-cement ratio, workability, Maturity, Defects, Re-vibration, Rheology, Non-destructive testing, Admixture for concrete, Concrete Mix design, Building Mortars, Ferrous Metals, Non-Ferrous Metals, Ceramic Materials, Polymeric Materials, Paints, Enamels, Varnishes, Tar, Bitumen, Asphalt, Gypsum, Special Cements, Cement Concretes, Adhesives, Water proofing materials, Fiber, Geosynthetics, Composite Materials, Smart materials, Asbestos, Thermoc0ol, Heat Insulating Materials, Sound Insulating Materials.
Logic & philosophy A modern introduction, 13th edition
Author: Alan Hausman, Frank Boardman, Howard Kahane
School: Edo University
Department: General studies
Course Code: GST112
Topics: Logic, philosophy, argument, deduction, induction, deductive argument forms, truth, validity, sentential logic, atomic sentences, compound sentences, truth tables, Logical Form, Tautologies, Contradictions, Contingent Sentences, Logical Equivalences, Argument forms, Disjunctive Syllogism, Hypothetical Syllogism, Simplification, Conjunction, Constructive Dilemma, proofs, Sentential Logic Truth Trees, Sentential Logic Truth Tree Method, predicate logic, Predicate Logic Symbolization, Predicate Logic Semantics, Proving Invalidity, Predicate Logic Proofs, Relational Predicate Logic, Predicate Logic Truth Trees, modal logic, Modal Logic Semantics, Syllogistic Logic
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
Engineering Economic Analysis, 14th edition
Author: Donald Newnan, Ted Eschenbach, Jerome Lavelle, Neal Lewis
School: Bayero University, Kano
Department: Engineering
Course Code: CIV5201
Topics: Engineering Economic Analysis, economic decisions making, estimating engineering costs, interest, present worth analysis, annual cash flow analysis, rate of return analysis, depreciation, income tax, economic life, replacement analysis, inflation, price change, accounting, engineering economy, Decision-Making Process, costs, estimating models, cash flow diagrams, time value of money, equivalence, arithmetic gradient, annuity due, incremental analysis, future worth analysis, breakeven analysis, probability, Joint Probability Distributions, Economic Decision Trees, risk, Investment Tax Credit
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