Laminar Flow Books
Project Analysis and Implementation
Author: Kadiri Kayode, Eyanuku Julius
School: National Open University of Nigeria
Department: Administration, Social and Management science
Course Code: MGS756, PAD756
Topics: Project Analysis, project Implementation, Project Cycle, project evaluation, Manpower Planning, Demand Analysis, Supply Analysis, Competition, Marketing Plans, Project Cost Analysis, Project Income, Projected Income Statement, Projected Cash Flow Statements, Projected Balance Sheets, Project Evaluation Criteria, economic analysis, Risk, Uncertainty, Cost Benefit Analysis, Social Profitability
Learning to Program with MATLAB Building GUI Tools
Author: Craig Lent
School: University of Ibadan
Department: Science and Technology
Course Code: CSC231
Topics: MATLAB, strings, vectors, plotting, matrix, control flow command, animation, graphical user interface, Graphical user interface components, graphical user interface techniques
Author: BOT141
School: University of Ibadan
Department: Science and Technology
Course Code: BOT141
Topics: Botany, Ecology, ecological concepts, Ecosystem, Autotrophs, Heterotrophs, Phagotrophs, Osmotrophs, Energy Flow, Food Chain, Food Web, Biogeochemical Cycle, Water Cycle, hydrologic cycle, Carbon cycle, Atmospheric Carbon Cycle, Terrestrial biological carbon cycle, Oceanic carbon cycle, Nitrogen cycle, Nitrogen fixation, Nitrogen Assimilation, Ammonification, Nitrification, Denitrification, Marine nitrogen cycle, Oxygen cycle, Phosphorus cycle, Phosphorous, Sulfur cycle, sulfur, Competition, Mutualism, Predation, Parasitism, Commensalism, Ammensalism, niche, succession, biomes
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
Introduction to Computer Science Continuous assessment filler
Author: 1st John
School: University of Nigeria, Nsukka
Department: Science and Technology
Course Code: COS101
Topics: Computer Science, computer, computer system, hardware, software, output device, input device, peripheral device, output interface, memory device, handshaking, monitor, printer, RAM, data storage, number system, binary, decimal, computer software, BASIC, QBASIC, pseudocode, flowchart, JAVA, Computer generations
Author: Anwara Collins
School: Federal University of Technology, Owerri
Department: Engineering
Course Code: PSE413
Topics: Transmission lines, stability, per unit system, line compensations, fault analysi, load flow studies, Power systems
Introduction to Computer Science Continuous assessment filler 2
Author: COS101
School: University of Nigeria, Nsukka
Department: Science and Technology
Course Code: COS101
Topics: Computer Science, computer, computer system, hardware, software, output device, input device, peripheral device, output interface, memory device, handshaking, monitor, printer, RAM, data storage, number system, binary, decimal, computer software, BASIC, QBASIC, pseudocode, flowchart, JAVA, Computer generations
Author: BIO FUNAAB
School: Federal University of Agriculture, Abeokuta
Department: Science and Technology
Course Code: BIO101
Topics: Cell, plasma membrane, Golgi complex, Mitochondria, Chloroplasts, vacuole, Prokaryotic cells, Eukaryotic cells, plant kingdom, virus, algae, fungi, pteridophytes, angiosperm, root system, root modification, Assimilatory roots, stem, Dichotomous Branching, leaf, flower, leaf venation, fruit, seed
Operations Research ,10th edition
Author: Hamdy Taha
School: University of Ibadan
Department: Science and Technology
Course Code: STA343
Topics: Operations Research, Operations Research models, linear programming, two-variable linear programming model, modelling, simplex method, sensitivity analysis, artificial starting solution, duality, post-optimal analysis, primal-dual relationships, simplex algorithms, transportation model, assignment mode, network mode, shortest-route problem, Minimal spanning tree algorithm, maximal flow model, critical path model, revised simplex method, revised algorithm, bounded-variables algorithm, parametric linear programming, goal programming, goal programming formulation, goal programming algorithm, integer linear programming, Heuristic programming, greedy heuristic, local search heuristic, metaheuristic, constriant programming, traveling salesperson problem, deterministic dynamic programming, dynamic programming, inventory modelling, probability, probability distribution, decision analysis, games, game theory, probabilistic inventory models, Markov chains, queuing systems, simulation modeling, classical optimization theory, Nonlinear programming algorithms
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