Algorithm Design and Analysis by Solomon Olalekan Akinola PDF free download

Solomon Olalekan Akinola Algorithm Design and Analysis PDF, was published in 2017 and uploaded for 200-level Science and Technology students of University of Ibadan (UI), offering CSC236 course. This ebook can be downloaded for FREE online on this page.

Algorithm Design and Analysis ebook can be used to learn 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.

Technical Details
Updated at:
Size: 2.78 MB
Number of points needed for download: 25
Number of downloads: 5

Books related to Algorithm Design and Analysis

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

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

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

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

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

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

Introduction to Programming with Fortran, 4th edition

Author: Ian Chivers, Jane Sleightholme

School: University of Ilorin

Department: Science and Technology

Course Code: CSC112, CSC218, MEE505, STA356

Topics: problem solving, programming, arithmetic, array, I/O concept.functions, control structures, characters, complex, logical, derived types, pointers, subroutines, modules, data structuring in FORTRAN, algorithm, big O notation, operator over loading, generic programming, Parameterised Derived Types, Object Oriented Programming, submodules, parallel programming, message passing interface, openMP, coarray FORTRAN, C interop, IEEE arithmetic, derived type I/O, sorting, searching, handling missing data, graphic libraries, Abstract Interface, Procedure Pointer

Languages and Machines, 3rd edition

Author: Thomas Sudkamp

School: Edo University

Department: Science and Technology

Course Code: CSC314

Topics: Languages, regular expression, text searching, grammars, automata, languages, Chomsky normal form, finite automata, deterministic finite automata, Myhill-Nerode theorem, homky, undecidability, Rice's theorem, Mu-recursive functions, numeric computation, incomputable functions, linear-bounded automata, computational complexity, linear speedup, Hamiltonian circuit problem, polynomial-time reduction, satisfiability problem, complexity class relations, optimization problems, approximation algorithms, approximation schemes, space complexity, deterministic parsing

Introduction to Programming

Author: Yetunde Folajimi

School: University of Ibadan

Department: Science and Technology

Course Code: CSC103

Topics: Programming, computer programming, computer languages, programming process, compilation, coding, debugging, syntax, Programming languages, low-Programming languages, high-Programming languages, Modular Programming Languages, Structured Programming Language, Business Oriented Language, Object oriented programming language, Visual Programming Languages, Algorithm, Problem-Solving, Problem Solving Process, Algorithmic Problem Solving, Pseudo-Codes, Pseudocode, Flowcharts, Flowchart Symbols, Flowcharting, Programming Environment, flowchart, Variables, Reserved Words, operators, Data Types, functions, Data Type, Numbers Manipulation, character manipulation, String Manipulation, Decision-Making, Loops, Conditional Statements, arrays, Computer Files, file input, file output, File Operation Modes

Thomas Calculus ,14th edition

Author: GeorgeThomas, Joel Hass, Christopher Heil, Maurice Weir

School: University of Ilorin

Department: Science and Technology

Course Code: MAT112

Topics: Calculus, Trigonometric Functions, functions, limits, continuity, One-Sided Limits, Differentiation Rules, Derivatives, chain rule, implict differentiation, related rates, linearization, differentials, Mean Value Theorem, integrals, Monotonic Functions, First Derivative Test, Concavity, Curve Sketching, Applied Optimization, antiderivatives, Sigma Notation, limits of Finite Sums, Definite integral, Transcendental Functions, inverse functions, natural logarithms, exponential functions, exponential change, seperable differential equation, Indeterminate Form, L’Hôpital’s Rule, Inverse Trigonometric Functions, Hyperbolic Functions, Integration by Parts, integration, trigonometric integrals, trigonometric substitution, Integral Tables, Computer Algebra Systems, probability, numerical integration, improper integrals, probability, First-Order Differential Equations, Slope Fields, Euler’s Method, First-Order Linear Equations, Infinite Sequences, infinite Series, integral test, comparison test, absolute convergence, power series, alternating series, Taylor series, Maclaurin series, Parametric Equations, Polar Coordinates, Conic Sections, vector, Partial Derivatives, Lagrange Multipliers, Multiple Integrals, vector fields, Path Independence, Conservative Fields, Potential Functions, Green’s Theorem, Surface Integrals, Stokes Theorem, Divergence Theorem

Thomas Calculus Early Transcendentals, 13th Edition Instructors Solutions Manual

Author: Elka Block, Frank Purcell

School: University of Ilorin

Department: Science and Technology

Course Code: MAT112

Topics: Calculus, Trigonometric Functions, functions, limits, continuity, One-Sided Limits, Differentiation Rules, Derivatives, chain rule, implict differentiation, related rates, linearization, differentials, Mean Value Theorem, integrals, Monotonic Functions, First Derivative Test, Concavity, Curve Sketching, Applied Optimization, antiderivatives, Sigma Notation, limits of Finite Sums, Definite integral, Transcendental Functions, inverse functions, natural logarithms, exponential functions, exponential change, seperable differential equation, Indeterminate Form, L’Hôpital’s Rule, Inverse Trigonometric Functions, Hyperbolic Functions, Integration by Parts, integration, trigonometric integrals, trigonometric substitution, Integral Tables, Computer Algebra Systems, probability, numerical integration, improper integrals, probability, First-Order Differential Equations, Slope Fields, Euler’s Method, First-Order Linear Equations, Infinite Sequences, infinite Series, integral test, comparison test, absolute convergence, power series, alternating series, Taylor series, Maclaurin series, Parametric Equations, Polar Coordinates, Conic Sections, vector, Partial Derivatives, Lagrange Multipliers, Multiple Integrals, vector fields, Path Independence, Conservative Fields, Potential Functions, Green’s Theorem, Surface Integrals, Stokes Theorem, Divergence Theorem

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

Numerical methods for engineers ,8th edition

Author: Steven Chapra, Raymond Canale

School: University of Uyo

Department: Engineering

Course Code: GRE411

Topics: Mathematical Modeling, Engineering Problem Solving, Programming, Software, structured programming, Modular Programming, EXCEL, MATLAB, Mathcad, Significant Figures, accuracy, precision, error, Round-Off Errors, Truncation Errors, Taylor Series, Bracketing Methods graphical method, bisection method, False-Position Method, Simple Fixed-Point Iteration, Newton-Raphson Method, secant method, Brent’s Method, multiple roots, Roots of Polynomials, Müller’s Method, Bairstow’s Method, Roots of Equations pipe friction, Gauss Elimination, Naive Gauss Elimination, complex systems, Gauss-Jordan, LU Decomposition, Matrix Inversion, Special Matrices, Gauss-Seidel, Linear Algebraic Equations, Steady-State Analysis, One-Dimensional Unconstrained Optimization, Parabolic Interpolation, Golden-Section Search, Multidimensional Unconstrained Optimization, Constrained Optimization, linear programming, Nonlinear Constrained Optimization, Least-Squares Regression, linear regression, polynomial regression, Multiple Linear Regression, Nonlinear Regression, Linear Least Squares, interpolation, Newton’s Divided-Difference Interpolating Polynomials, Lagrange Interpolating Polynomials, Inverse Interpolation, Spline Interpolation, Multidimensional Interpolation, Fourier Approximation, Curve Fitting, Sinusoidal Functions, Continuous Fourier Series, Fourier Integral, Fourier Transform, Discrete Fourier Transform, Fast Fourier Transform, power spectrum, Newton-Cotes Integration Formulas, Trapezoidal Rule, Simpson’s Rules, multiple integrals, Newton-Cotes Algorithms, Romberg Integration, Adaptive Quadrature, Gauss Quadrature, Improper Integrals, Monte Carlo Integration, Numerical Differentiation, High-Accuracy Differentiation Formulas, Richardson Extrapolation, partial derivatives, Numerical Integration, Runge-Kutta Method, Euler’s Method, Boundary-Value Problems, Eigenvalue Problems, Finite Difference, Elliptic Equations, Laplace equation, Boundary Condition, Heat-Conduction Equation, Crank-Nicolson Method, Finite-Element Method

Schaum's Outline of Calculus, 6th edition

Author: Frank Ayres, Elliott Mendelson

School: Nnamdi Azikiwe University

Department: Science and Technology

Course Code: MAT231

Topics: Calculus, linear coordinate systems, absolute value, inequalities, rectangular coordinate systems, lines, circles, parabolas, ellipses, hyperbolas, conic sections, functions, limits, continuity, continuous function, derivative, delta notation, chain rule, inverse functions, implicit differentiation, tangent lines, normal lines, critical numbers, relative maximum relative minimum, cure sketching, concavity, symmetry, points of inflection, vertical asymptotes, trigonometry, trigonometric functions, inverse trigonometric functions, rectilinear motion, circular motion, differentials, Newton's method, antiderivatives, definite integral, sigma notation, natural logarithm, exponential functions, logarithmic functions, L'hopital's rule, exponential growth, decay, half-life, integration by parts, trigonometric integrands, trigonometric substitutions, improper integrals, parametric equations, curvature, plane vectors, curvilinear motion, polar coordinates, infinite sequences, infinite series, geometric series, power series, uniform convergence, Taylor's series, Maclaurin series, partial derivatives, total differential, differentiability, chain rules, space vectors, directional derivatives, vector differentiation, vector integration, double integrals, iterated integrals, centroids, triple integrals, Separable Differential Equations, Homogeneous Functions, Integrating Factors, Second-Order Equations

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

Digital Logic Design

Author: Nancy Woods

School: University of Ibadan

Department: Science and Technology

Course Code: CSC213

Topics: Digital Logic Design, Kirchhoff's law, Thevenin's theorem, Norton's theorem, circuit theory, semiconductors, transistors, digital logic, integrated circuits, digital logic gates, logic gates, combinational logic design, logic circuit diagram, truth table, Boolean expression, Boolean Algebra, Karnaugh Maps, Quine-McCluckskey, standard combinational logic circuits, ombinational logic circuits, combinational logic, binary adder, binary subtractor, digital comparator, multiplexer, digital encoder, binary decoder, sequential logic circuit, Flip-Flop, S-R Flip-Flop, JK Flip-Flop, T Flip-Flop, D-type Flip-Flop, registers, counters, computer codes, binary codes, binary-coded decimal, excess-3 code, gray code, error detection, error correction, digital error, parity bit, Hamming codes, Cyclic redundancy check

Introduction to Linear Regression Analysis ,5th edition

Author: Elizabeth Peck, Geoffrey Vining, Douglas Montgomery

School: University of Ibadan

Department: Science and Technology

Course Code: STA351

Topics: Linear Regression Analysis, Regression, Model Building, Data Collection, Simple Linear Regression Model, Simple Linear Regression, Least-Squares Estimation, Hypothesis Testing, Interval Estimation, Multiple Regression Models, Multiple linear regression, Hypothesis Testing, Confidence Intervals, Standardized Regression Coefficients, Multicollinearity, Residual Analysis, model adequacy checking, Variance-Stabilizing Transformations, Generalized Least Squares, Weighted Least Squares, Regression Models, subsampling, Leverage, Measures of Influence, influence, Polynomial regression Models, Piecewise Polynomial Fitting, Nonparametric Regression, Kernel Regression, Locally Weighted Regression, Orthogonal Polynomials, Indicator Variables, Multicollinearity, Multicollinearity Diagnostics, Model-Building, regression models, Linear Regression Models, Nonlinear Regression Models, Nonlinear Least Squares, Logistic Regression Models, Poisson regression, Time Series Data, Detecting Autocorrelation, Durbin-Watson Test, Time Series Regression, Robust Regression, Inverse Estimation

Introduction to Linear Regression Analysis Solutions Manual for 5th edition

Author: Ann Ryan, Douglas Montgomery, Elizabeth Peck, Geoffrey Vining

School: University of Ibadan

Department: Science and Technology

Course Code: STA351

Topics: Linear Regression Analysis, Regression, Model Building, Data Collection, Simple Linear Regression Model, Simple Linear Regression, Least-Squares Estimation, Hypothesis Testing, Interval Estimation, Multiple Regression Models, Multiple linear regression, Hypothesis Testing, Confidence Intervals, Standardized Regression Coefficients, Multicollinearity, Residual Analysis, model adequacy checking, Variance-Stabilizing Transformations, Generalized Least Squares, Weighted Least Squares, Regression Models, subsampling, Leverage, Measures of Influence, influence, Polynomial regression Models, Piecewise Polynomial Fitting, Nonparametric Regression, Kernel Regression, Locally Weighted Regression, Orthogonal Polynomials, Indicator Variables, Multicollinearity, Multicollinearity Diagnostics, Model-Building, regression models, Linear Regression Models, Nonlinear Regression Models, Nonlinear Least Squares, Logistic Regression Models, Poisson regression, Time Series Data, Detecting Autocorrelation, Durbin-Watson Test, Time Series Regression, Robust Regression, Inverse Estimation

The green book of algebra

Author: SA Ilori, DOA Ajayi

School: University of Ibadan

Department: Science and Technology

Course Code: MAT111

Topics: Polynomials, rational functions, linear equations, simultaenous equation, quadratic equations, remainder theorem, factor theorem, inequalities, domain range, partial fractions, curve sketching, mathematical induction, permutations, combinations, binomial theorem, sequence, series, telescoping series, limits, sums to infinity, complex numbers, Aragand diagram, De Moivre's theorem, matrices, determinants, rank of a matrix, Cramer's rule, sets, vennn diagram, binary operations, real number systems

Past Questions related to Algorithm Design and Analysis

Introduction to Problem Solving

Year: 2021

School: Air Force Institute of Technology

Department: Science and Technology

Course Code: CSC102

Topics: Problem Solving, pseudocode, flowchart, algorithm, software design model, control structures, algorithm constructs, sequence, data types, object oriented design, operators

Computer Programming

Year: 2021

School: Air Force Institute of Technology

Department: Science and Technology

Course Code: CSC202

Topics: computer programming, java class, java recursive program, recursive trees, layout manager, java exceptions, checked exceptions, unchecked exceptions, java exception handling keywords

Complex analysis 2 test and exam

Year: 2018

School: University of Ilorin

Department: Science and Technology

Course Code: MAT326

Topics: Laurent expansion, Liouville theorem, Residue Theorem, Cauchy inequality, Rouche theorem, Analytic continuation, convergence, maximum modulus theorem

Introduction to Computer Science Possible question and answers by Ndukwe chimezirim Joseph

Year: 2019

School: University of Nigeria, Nsukka

Department: Science and Technology

Course Code: COS101

Topics: Algorithm, history of computer, Network, Algorithm design, data design, BASIC, computer, JAVA, Memory, operating system, optical disk

Sets, binary operation, partial fractions, mathematical induction

Year: 2020

School: University of Benin

Department: Science and Technology

Course Code: MTH110

Topics: Sets, binary operation, partial fractions, mathematical induction, real numbers, remainder theorem, factor theorem, polynomial, mapping, complex number, Argand diagram, trigonometric function, sequence, series, recurrency, D'Alembert ratio test, permutation, combination

ALGORITHM

Year: 2019

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: CSC407

Topics: paradigm, algorithm, huffman coding tree, greedy algorithm technique

COMPUTER MODELING SIMULATION AND FORECASTING

Year: 2018

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: CSC510

Topics: model development, mathematical model, markov model, exponential model, cubic model, inverse model, CPU, linear programming, allocation problem

Operations Research 1

Year: 2019

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: STA433

Topics: operation research, programming, simplex method, weak duality theorem, linear programming, PERT, CPM

COMPUTER AND APPLICATIONS 2-2017&2018

Year: 2018

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: CSC202

Topics: Database, data, sequential circuits, data structure, node, object, byte

Algebra and trigonometry & Introductory physiology MOCK CAT

Year: 2018

School: Federal University of Agriculture, Abeokuta

Department: Science and Technology

Course Code: MTS105, BIO103, BIO101

Topics: surd, remainder theorem, partial fraction, series, geometric mean, plant, leaf, homeostasis, environment, photosynthesis

Abstract algebra 2 test & exam-2017-2019

Year: 2019

School: University of Ilorin

Department: Science and Technology

Course Code: MAT306

Topics: group, coset, ring, isomorphic series, normal series

MAT112 Practice questions for UNILORITES

Year: 2013

School: University of Ilorin

Department: Science and Technology

Course Code: MAT112

Topics: Functions, continuity, Limits of Functions, Differentiation, Maxima, minima, Point of inflexion, Taylors series, Maclaurin series

Control system design technology

Year: 2020

School: Federal University of Technology, Owerri

Department: Engineering

Course Code: EEE501

Topics: Control system design technology, PID control equation, feedback control, PID algorithm, digital control design, sampling, discrete time response, zero-order hold model, Z transform, describing function, nonlinear difference equation, linear oscillation, absolute stability, linear systems, non-linear systems, nonlinear system analysis

Computer aided design and computer and computer aided manufacture

Year: 2020

School: Federal University of Technology, Owerri

Department: Engineering

Course Code: MEE505

Topics: Computer aided design, computer aided manufacture, Isometric view drawing, CNC Codes, rapid traverse positioning, CNC turning, computer aided manufacturing operation, tool-holding magazine, machining centers, milling centers, surface finishing operation, Mathematical matrix notation, Bezier cubic curve, Hermite cubic curve, translation transformation, scaling transformation, rotation transformation, parametric modeling, parametric Bezier equations

Novrazbb Yotjob distinctquote yourowndir muttcat scholarship carlesto newsfunt