Computer Algorithms by Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran PDF free download

Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran Computer Algorithms PDF, was published in 1998 and uploaded for 300-level Science and Technology students of Edo University (EUI), offering CMP315 course. This ebook can be downloaded for FREE online on this page.

Computer Algorithms ebook can be used to learn 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.

Technical Details
Updated at:
Size: 4.45 MB
Number of points needed for download: 63
Number of downloads: 1

Books related to Computer 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 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

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

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

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

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

Elementary numerical analysis, 3rd edition

Author: Samuel Daniel Conte, Carl de Boor

School: Edo University

Department: Science and Technology

Course Code: CMP315

Topics: numerical analysis, number system, interpolation, Fixed-Point Iteration, Polynomial Equations, Real Roots, Complex Roots, Müller’s Method, Triangular Factorization, Determinants, Eigenvalue Problem, Backward-Error Analysis, determinants, Unconstrained Optimization, approximation, data fitting, Orthogonal Polynomials, Fast Fourier Transforms, Piecewise-Polynomial Approximation, differentiation, integration, numerical differentiation, numerical integration, Romberg Integration, Simple Difference Equations, Boundary Value Problems

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

Introduction to digital image processing

Author: William Pratt

School: National Open University of Nigeria

Department: Science and Technology

Course Code: CIT891

Topics: digital image processing, Continuous Image Mathematical Characterization, Continuous Image Characterization, light perception, eye physiology, visual phenomena, monochrome vision model, Photometry, Colorimetry, color matching, color spaces, image sampling, image reconstruction, Monochrome Image Sampling Systems, Monochrome Image Reconstruction Systems, Color Image Sampling Systems, image measurement, Discrete Image Mathematical Characterization, Vector-Space Image Representation, Generalized Two-Dimensional Linear Operator, Image Statistical Characterization, Image Probability Density Models, Linear Operator Statistical Representation, Finite-Area Superposition, Finite-Area Convolution, Sampled Image Superposition, Sampled Image Convolution, Circulant Superposition, circulant Convolution, General Unitary Transforms, Fourier transform, cosine transform, sine transform, Hartley transform, Hadamard Transforms, Haar Transforms, Daubechies Transforms, Karhunen–Loeve Transform, wavelet transforms, Linear Processing Techniques, Transform Domain Processing, Transform Domain Superposition, Fast Fourier Transform Convolution, Fourier Transform Filtering, image improvement, Image Enhancement, Contrast Manipulation, Histogram Modification, noise cleaning, Edge Crispening, Color Image Enhancement, Multispectral Image Enhancement, image restoration, image restoration models, Continuous Image Spatial Filtering Restoration, Pseudoinverse Spatial Image Restoration, Statistical Estimation Spatial Image Restoration, Multi-Plane Image Restoration, Geometrical Image Modification, Morphological Image Processing, binary image, Edge Detection, Image Feature Extraction, Image Segmentation, shape analysis, Image Detection, image Registration, Point Processing Image Compression, image compression, video compression, Spatial Processing Image Compression

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

Principles of concurrent and distributed programming, 2nd edition

Author: Ben-Ari

School: Edo University

Department: Science and Technology

Course Code: CSC413

Topics: concurrent programming, distributed programming, concurrency, concurrent programming abstractions, machine-code instructions, critical section problem, concurrent programs verification, bakery algorithm, fast algorithms, semaphores, monitors, condition variables, protected objects, channels, parallel matrix multiplication, remote procedure calls, Linda model, distributed algorithms, distributed systems, model distributed mutual exclusion, Dijkstra-Scholten algorithm, credit-recovery algorithms, consensus, flooding algorithm, real-time systems, synchronous systems, Pseudocode notation

Statistical Analysis Handbook

Author: Michael de Smith

School: University of Ibadan

Department: Science and Technology

Course Code: STA231, STA322, STA351, STA415

Topics: Statistical Analysis, statistical data, statistical method, sampling, sample size, data preparation, data cleaning, missing data, data errors, statistical error, probability theory, odds, risk, frequentist probability theory, Bayesian probability theory, probability distribution, statistical modelling, computational statistics, inference, bias, confounding, hypothesis testing, statistical significance, confidence intervals, Non-parametric analysis, descriptive statistics, measures of central tendency, statistical indices, key functions, matrix, data transformation, data standardization, Box-cox, power transforms, Freeman-turkey transform, log transform, exponential transforms, logit transform, Normal transform, Z-transform, data exploration, graphic, visualization, exploratory data analysis, randomness, randomization, random numbers, random permutations, correlation, autocorrelation, probability distributions, eestimations, estimators, Maximum likelihood estimation, Bayesian estimation, z-test, T-test, variance test, contigency tables, randomized block designs, factorial designs, Analysis of variance, Analysis of covariance, ANOVA, MANOVA, ANCOVA, regression, smoothing, time series analysis

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

Foundations of Mathematical Analysis

Author: CE Chidume, Chukwudi Chidume

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: MTH301

Topics: real number system, order relation, natural numbers, countable sets, uncountable sets, bounded sets, limits, Monotone Sequences, Sandwich Theorem, limit theorems, Bolzano-Weierstrass Theorem, Limit Superior, Limit Inferior, Cauchy Sequences, continuity, topological notions, One-sided Continuity, Continuity Theorems, Uniform Continuity, Uniform Continuity Theorems, closed sets, compact sets, continuous maps, differentiability, derivative, Rolle’s Theorem, Mean Value Theorem, L’Hospital’s Rule, Nonnegative Real Numbers series, Integral Test, Comparison Test, Limit Comparison Test, Cauchy’s Root Test, D’Alembert’s Ratio Test, Alternating Series, Absolute Convergence, Conditional Convergence, Riemann Integral, Integration, Uniform convergence, Power Series, Equicontinuity, Arzela-Ascoli Theorem

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

Advanced Engineering Mathematics ,10th Edition

Author: Erwin Kreyszig, Herbert Kreyszig, Edward

School: University of Nigeria, Nsukka

Department: Engineering

Course Code: MTH207

Topics: Ordinary Differential Equations, Separable Ordinary Differential Equations, exact Ordinary Differential Equations, linear Ordinary Differential Equations, Orthogonal Trajectories, Homogeneous Linear Ordinary Differential Equations, Differential Operators, Euler–Cauchy Equations, Higher Order Linear Ordinary Differential Equations, nonlinear Ordinary Differential Equations, Power Series, egendre’s Equation, Legendre Polynomials, Extended Power Series, Frobenius Method, Bessel’s Equation, Bessel Functions, Laplace Transforms, First Shifting Theorem, Linear Algebra, Vector Calculus, Matrices, Vectors, Determinants, Linear Systems, Determinants, Cramer’s Rule, Gauss–Jordan Elimination, linear transformation, Matrix Eigenvalue Problems, Eigenvalues, Eigenvectors, Eigenbase, Vector Differential Calculus, vector product, Vector Integral Calculus, Integral Theorems, line integrals, Surface Integrals, Stokes’s Theorem, Fourier Analysis, Partial Differential Equations, Fourier series, Sturm–Liouville Problems, Forced Oscillations, Fourier Integral, Fourier Cosine, Sine Transforms, Fourier Transform, Fast Fourier Transforms, Rectangular Membrane, Double Fourier Series, heat equation, Complex Numbers, Complex Differentiation, Cauchy–Riemann Equations, Exponential Function, Complex Integration, Cauchy’s Integral Formula, Cauchy’s Integral Theorem, Taylor series, Laurent Series, Residue Integration, Conformal Mapping, Complex Analysis, Potential Theory, Numeric Analysis, Numeric Linear Algebra, Unconstrained Optimization, Linear Programming, Combinatorial Optimization, Probability, Statistics, Data Analysis, Probability Theory, Mathematical Statistics

Advanced Engineering Mathematics Student Solutions Manual and Study Guide,10th edition Volume 1&2

Author: Herbert Kreyszig, Erwin Kreyszig

School: University of Nigeria, Nsukka

Department: Engineering

Course Code: MTH207

Topics: Ordinary Differential Equations, Separable Ordinary Differential Equations, exact Ordinary Differential Equations, linear Ordinary Differential Equations, Orthogonal Trajectories, Homogeneous Linear Ordinary Differential Equations, Differential Operators, Euler–Cauchy Equations, Higher Order Linear Ordinary Differential Equations, nonlinear Ordinary Differential Equations, Power Series, egendre’s Equation, Legendre Polynomials, Extended Power Series, Frobenius Method, Bessel’s Equation, Bessel Functions, Laplace Transforms, First Shifting Theorem, Linear Algebra, Vector Calculus, Matrices, Vectors, Determinants, Linear Systems, Determinants, Cramer’s Rule, Gauss–Jordan Elimination, linear transformation, Matrix Eigenvalue Problems, Eigenvalues, Eigenvectors, Eigenbase, Vector Differential Calculus, vector product, Vector Integral Calculus, Integral Theorems, line integrals, Surface Integrals, Stokes’s Theorem, Fourier Analysis, Partial Differential Equations, Fourier series, Sturm–Liouville Problems, Forced Oscillations, Fourier Integral, Fourier Cosine, Sine Transforms, Fourier Transform, Fast Fourier Transforms, Rectangular Membrane, Double Fourier Series, heat equation, Complex Numbers, Complex Differentiation, Cauchy–Riemann Equations, Exponential Function, Complex Integration, Cauchy’s Integral Formula, Cauchy’s Integral Theorem, Taylor series, Laurent Series, Residue Integration, Conformal Mapping, Complex Analysis, Potential Theory, Numeric Analysis, Numeric Linear Algebra, Unconstrained Optimization, Linear Programming, Combinatorial Optimization, Probability, Statistics, Data Analysis, Probability Theory, Mathematical Statistics

Past Questions related to Computer Algorithms

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

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

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

DATA PROCESSING

Year: 2019

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: GPH411

Topics: waveform, graphical representation, aliasing, Fourier series, Fourier transform

Introduction to computer science, workshop practive

Year: 2019

School: Federal University of Technology, Minna

Department: Science and Technology

Course Code: CPT111, WKS110, GST110, BIO111, STA117, PHY113, MAT111, CHM1111, CHM112

Topics: reserve words, program statements, pseudo code, flowchart, programming language, algorithm, plant location, plant layout, accident, electrical hazards, zero error, communication skills, communication, essay writing, technical report writing, essay, cell biology, organelles, cell membrane, microscopy, microscope, biodiversity, hereditary, inheritance, monocotyledons, dicotyledons, frequency distribution, questionnaire, force, tension, pressure, vector, scalar, linear motion, random motion, rotational motion, oscillatory motion, gravitational field strength, escape velocity, logarithm, surd, geometric progression, sets, Bohr postulate, Raoults's law, LeChatelier's principle, chemical bonding, electronic configuration, inorganic chemistry, Dalton atomic theory Avogadro's number

SYSTEM PERFORMANCE EVALUATION

Year: 2018

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: CSC508

Topics: system performance, system capacity, performance of systems

Introduction to computer science 2007-2017

Year: 2017

School: Nnamdi Azikiwe University

Department: Science and Technology

Course Code: CSC101

Topics: Computer science, BASIC programming, binary system, logic gate, flow chart, compilers, storage device, input device, memory, number system, CPU, computer generation

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

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

Year: 2018

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: CSC302

Topics: 6502 Microprocessor, address bus, Charles Babbage, binary octal, number representation

Computer Hardware design

Year: 2020

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: CSC403

Topics: Computer hardware, arithmetic logic unit, registers, data path, logic gate, adder, keyboard, keyboard encoder, keyboard buffer, monitors, interface, data transfer

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