Introduction to the design and analysis of algorithms ,3rd edition by Anany Levitin, Soumen Mukherjee, Arup Kumar Bhattacharjee PDF free download

Anany Levitin, Soumen Mukherjee, Arup Kumar Bhattacharjee Introduction to the design and analysis of algorithms ,3rd edition PDF, was published in 2011 and uploaded for 200-level Science and Technology students of University of Ibadan (UI), offering CSC242 course. This ebook can be downloaded for FREE online on this page.

Introduction to the design and analysis of algorithms ,3rd edition ebook can be used to learn 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.

Technical Details
Updated at:
Size: 2.39 MB
Number of points needed for download: 64
Number of downloads: 10

Books related to Introduction to the design and analysis of algorithms ,3rd edition

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

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

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

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

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

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

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

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

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

Numerical Analysis, Second edition

Author: Walter Gautschi

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: MTH222, MTH421

Topics: Machine Arithmetic, Real Numbers, Machine Numbers, Rounding, Condition Numbers, Approximation, Interpolation, Least Squares Approximation, Polynomial Interpolation, Spline Functions, Numerical Differentiation, Numerical Integration, Nonlinear Equations, Iteration, Convergence, Efficiency, Method of False Position, Secant Method, Newton’s Method, Fixed Point Iteration, Algebraic Equations, Systems of Nonlinear Equations, Initial Value Problems for ODE, One-Step Methods, Numerical Methods, Euler’s Method, Taylor Expansion, Runge–Kutta Method, Error Monitoring, Step Control, Stiff Problems, Multistep Methods, Adams–Bashforth Method, Adams–Moulton Method, Predictor–Corrector Method, Two-Point Boundary Value Problems for ODEs, Initial Value Technique, Finite Difference Methods, Variational Methods

Digital Communication

Author: OD Adeniji

School: University of Ibadan

Department: Science and Technology

Course Code: CSC222

Topics: Digital Communication, Communication Error Correction, Information Compression Error, Information Compression, Data Compression, data Coding, Huffman Coding Algorithm, Error Correction, Linear Block Codes, noise, convolutional coding, Viterbi decoding of convolutional codes, Systematic Code, Convolution Codes, Hamming Codes, Convolutional Codes, Convolutional Code Construction, Parity Equations, Shift-Register View, State-Machine View, Decoding Problem, Viterbi Decoder, Soft-Decision Decoding, Signal to Noise Ratio, linear Time-Invariant Systems, Baseband Signal, Modulation, Demodulation, Baseband Channel, Linear Time-Invariant Models, Baseband Channel Model, Signal Spectra, Discrete-Time Fourier Transform, Fourier Transform, Discrete-Time Fourier Series, Fourier Series, Channel Distortions, Binary Phase Shift Keying, Quadrature Phase Shift Keying, Quadrature Amplitude Modulation, Media Access Protocols, Shared Media Satellite communications, Satellite communications, Time Division Multiple Access, ALOHA, Carrier Sense Multiple Access, Circuit Switching, Packet Switching, Little’s Law, Network Routing, Routing, Broadcast routing, Routing Protocol, Reliable Data Transport Protocols

Operations Research Theory And Application ,Sixth Edition

Author: JK Sharma

School: Modibbo Adama University of Technology

Department: Administration, Social and Management science

Course Code: MM307

Topics: Linear Programming, Linear Programming Model Formulation, Graphical Method, Simplex Method, Duality in Linear Programming, Dual Linear Programming Problem, Sensitivity Analysis, Integer Linear Programming, Goal Programming, Transportation Problem, Assignment Problem, Decision Theory, Decision Trees, Theory of Games, game theory, Project Management, Deterministic Inventory Control Models, Probabilistic Inventory Control Models, Queuing Theory, Replacement Models, Maintenance Models, Markov Chains, Simulation, Sequencing Problems, Information Theory, Dynamic Programming, Classical Optimization Methods, Non-Linear Programming Methods, Revised Simplex Method, Dual-Simplex Method, Bounded Variables Linear Programming Problem, Parametric Linear Programming

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

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

Logic circuit

Author: DK Kaushik

School: Federal University of Technology, Minna

Department: Engineering

Course Code: EEE211

Topics: number system, binary number system, octal number system, hexadecimal number system, binary addition, binary subtraction, signed numbers, complement representation, binary multiplication, floating point representation, binary codes, binary coded decimal numbers, weighted codes, self implementing codes, cyclic codes, gray code, error detecting codes, error correcting code, Hamming code, BCD addition, alphanumeric codes, Boolean algebra, logic gates, duality principle, Venn diagram, truth table, Karnaugh map, Quine – McCluskey Method, combinational switching circuits, combinational circuits, half adder, full adder, parallel binary adder, 8421 adder, BCD adder, subtractor, multiplexers, demultiplexers, code converter, encoders, priority encoder, magnitude comparator, parity generator, parity checker, programmable logic devices, Field Programmable Logic Array, Programmable Array Logic, Programmable Read Only Memory, Direct Coupled Transistor Logic, Integrated Injection Logic, transistor transistor logic, CMOS Logic, Flip flop, shift registers, counter, Asynchronous Counters, counter ICs, Digital to Analog Converter, Analog to Digital Converter, digital memory, semiconductor memory, read only memory, random access memory, magnetic memory, magnetic bubble memories, charged coupled devices, compact disk read only memory

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

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

Data Mining Multimedia, Soft Computing, and Bioinformatics

Author: Sushmita Mitra, Tinku Acharya

School: National Open University of Nigeria

Department: Science and Technology

Course Code: CIT891

Topics: Data Mining Multimedia, Soft Computing, Bioinformatics, data compression, web mining, data warehousing, neural netowrks, genetic algorithms, multimedia data compression, Source Coding Algorithms, image compression standard, text compression, Linear-Order String Matching Algorithms, string matching, Bayesian Classifiers, Instance-Based Learners, Scalable Clustering Algorithms, Hierarchical Symbolic Clustering, Modular Hybridization, Multimedia Data Mining

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

Concepts of Programming Languages, 10th Edition

Author: Robert Sebesta

School: Edo University

Department: Science and Technology

Course Code: CSC413

Topics: Programming Languages, programming environments, Pseudocodes, functional programming, computerizing business records, time sharing, dynamic languages, object-oriented programming, scripting languages, programming hybrid languages, lexical analysis, syntax analysis, parsing problem, recursive descent parsing, variables, datatypes, array types, associative arrays, arithmetic expressions, subprograms, abstract data types, data abstraction, concurrency, exception handling, event handling, functional programming languages, logic programming languages

Past Questions related to Introduction to the design and analysis of algorithms ,3rd edition

NETWORK TOPOLOGY 1

Year: 2019

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: MTH403

Topics: topology, set, topological space, metric space, open function, discrete topology, discrete space, subspace topology, topological space

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

Reservoir modelling and simulation

Year: 2020

School: Federal University of Technology, Owerri

Department: Engineering

Course Code: PET505

Topics: Reservoir modelling, reservoir simulation, history matching, history matching optimization, reservoir simulation study process, history matching parameters, oil phase partial differential equation, Gaussian elimination method, finite difference approximation, Taylor series expansion, tri-diagonal matrix, incompressible flow equation

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

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

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

Metric Space Topology Continuous Assessment

Year: 2019

School: University of Nigeria, Nsukka

Department: Science and Technology

Course Code: MTH321

Topics: Metric Space Topology, metric space, discrete metric space, Lipschitz function, Contraction Mapping Principle, nonempty set, set

Numerical analysis 1 test&exam-2017&2018

Year: 2018

School: University of Ilorin

Department: Science and Technology

Course Code: MAT332

Topics: Jacobi, Gauss seidel, Chebyshev form, Romberg integration, Natural spline, Orthogonal polynomial, Gram-shmidt, Trapezoidal rule, Simpson rule, metric space

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

MATHEMATICAL METHODS 1-2017 Test &2018

Year: 2018

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: MTH202

Topics: vector, matrix, eigen, cramer rule

INTRODUCTION TO FILE PROCESSING

Year: 2018

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: CSC304

Topics: random file, direct file, data file, file attributes, file, exhaustive index, partial index, index

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

Engineering mathmatics 2-2011,2012,2014,2015,2016,2017

Year: 2017

School: Federal University of Technology, Owerri

Department: Engineering

Course Code: ENG308

Topics: eigenvalues, eigenvectors, cramer's rules, linear programming, dynamic programming, numerical method, integral, Fourier, Dirichlet, Lagrange, state space analysis

Farm power and maintenance

Year: 2017

School: Federal University of Technology, Owerri

Department: Engineering

Course Code: FPE510

Topics: Farm power, farm maintenance, piston, brake power, tractor engine friction power, engine systems, fiel system, cooling system, lubrication system, electrical system, hydraulic system, API hydrometer, fuel specific gravity, traction, dynamic traction ratio, tractive efficiency, travel reduction slip

Tests related to Introduction to the design and analysis of algorithms ,3rd edition

Physics (JAMB)

School: WAEC, JAMB & POST UTME

Department:

Course Code: JAMB

Topics: Physics, JAMB, Friction, work, force, motion, speed, velocity, energy, hydraulic press, relative density, hydrometer, gas law, sound wave, wave, light, mirror,capacitor, electricity, pressure

Novrazbb Yotjob distinctquote yourowndir muttcat scholarship carlesto newsfunt