Introduction to Algorithms, 3rd Edition by Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein PDF free download

Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein Introduction to Algorithms, 3rd Edition PDF, was published in 2009 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 Algorithms, 3rd Edition ebook can be used to learn 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.

Technical Details
Updated at:
Size: 5.04 MB
Number of points needed for download: 57
Number of downloads: 12

Books related to Introduction to Algorithms, 3rd Edition

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

Author: Anany Levitin, Soumen Mukherjee, Arup Kumar Bhattacharjee

School: University of Ibadan

Department: Science and Technology

Course Code: CSC242

Topics: algorithm design, algorithm analysis, Algorithm Efficiency, Algorithm Efficiency analysis, Brute Force, Exhaustive Search, Decrease-and-Conquer, Divide-and-Conquer, Transform-and-Conquer, Space and Time Trade-Offs, Dynamic Programming, Greedy Technique, Iterative Improvement, Algorithm Power, Algorithmic Problem Solving, Nonrecursive Algorithms mathematical analysis, recursive Algorithms mathematical analysis, Selection Sort, Bubble Sort, Sequential Search, Brute-Force String Matching, Closest-Pair Problems, Convex-Hull Problems, depth-First Search, Breadth-First Search, Insertion Sort, Topological Sorting, Variable-Size-Decrease Algorithms, Decrease-by-a-Constant-Factor Algorithms, binary search, Mergesort, quicksort, Binary Tree Traversals, Strassen’s Matrix Multiplication, Gaussian Elimination, presorting, Balanced Search Trees, Heaps, Heapsort, Horner’s Rule, Binary Exponentiation, Problem Reduction, B-Trees, hashing, Knapsack Problem, Optimal Binary Search Trees, Warshall’s Algorithm, Floyd’s Algorithm, Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Huffman Trees, huffman Codes, Simplex Method, Maximum-Flow Problem, Stable Marriage Problem, Lower-Bound Arguments, Decision Trees, Numerical Algorithms, Backtracking, Approximation Algorithms

A Practical Introduction to Data Structures and Algorithm Analysis, Third Edition

Author: Clifford Shaffer

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: CSC305

Topics: Data Structures, Algorithm Analysis, Logarithms, Summations, Summations, Recurrences, recursion, Algorithm Analysis, Asymptotic Analysis, Fundamental Data Structures, Binary Trees, Binary Tree Traversals, Binary Tree Node Implementations, Binary Search Trees, Huffman Coding Trees, Non-Binary Trees, sorting, searching, internal sorting, shellsort, heapsort, File Processing, External Sorting, searching, hashing, indexing, Advanced Data Structures, graphs, Advanced Tree Structures

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

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

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

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

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

Linear Algebra

Author: MAT212

School: University of Ibadan

Department: Science and Technology

Course Code: MAT212

Topics: Linear Algebra, Algebra of Matrices, matrix, Determinants, Matrix Inverse, Systems of Linear Equations, Vector Space, linear equation, Subspaces of Vector Spaces, Rank of a Matrix, Linear Transformations, Linear Transformation, Homogeneous Systems of Linear Equations, Non-Homogeneous Systems of Linear Equations, Eigenvalue, Eigenvector, Minimal Polynomial, Matrix Polynomial, Companion Matrix, Similar Matrix, Diagonal Matrix, Triangular Matrix

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

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

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

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

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

A First Course in Linear Algebra

Author: Robert Beezer

School: Edo University

Department: Science and Technology

Course Code: MTH214

Topics: Linear algebra, vector, Reduced Row-Echelon Form, vector operations, linear combinations, spanning sets, linear independence, orthogonality, matrices, matrix operation, matrix multiplication, matrix inverses, vector spaces, subspaces, matrix determinants, Eigenvalues, Eigen vectors, linear transformations, Injective Linear Transformations, Surjective Linear Transformations, Invertible Linear Transformations, vector representations, matrix representations, complex number operations, sets

Intuitive Probability and Random Processes Using MATLAB

Author: Steven Kay

School: University of Ilorin

Department: Science and Technology

Course Code: MAT214, MAT335, PHY416, ELE576

Topics: computer simulation, probability, conditional probability, discrete random variables, conditional probability, mass functions, Discrete N-Dimensional Random Variables, Conditional Probability Density Functions, Continuous N-Dimensional Random Variables, Moment Approximations, limit theorem, MATLAB, random process, Wide Sense Stationary Random Process, linear system, Gaussian Random Process, Poisson Random Process, markov chains

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

Past Questions related to Introduction to Algorithms, 3rd Edition

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

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

Vectors, coordinate geometry and statistics assignment questions

Year: 2020

School: University of Benin

Department: Science and Technology

Course Code: MTH123

Topics: Vectors, coordinate geometry, statistics

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

Introductory Mechanics and Properties of Matter Exercise 1-5 and solution

Year: 2017

School: University of Ibadan

Department: Science and Technology

Course Code: PHY102

Topics: velocity, acceleration, Einstein's relation, Planck's constant, velocity-time graph, acceleration due to gravity, centripetal acceleration, vector, work, energy, power, collisions, rigid bodies, simple harmonic motion

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

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

20 General Physical Chemistry Practice Questions

Year: 2017

School: University of Ilorin

Department: Science and Technology

Course Code: CHM101

Topics: reaction mechanism, zero order reaction, first order reaction, second-order reaction, electrolysis, electrochemistry, fuel cell, Daniel cell

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

Geometry and Trigonometry E Test Questions and solution By Sir Lake

Year: 2019

School: Federal University of Technology, Minna

Department: Science and Technology

Course Code: MAT112

Topics: Geometry, Trigonometry

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

10 Descriptive Statistics tutorial questions

Year: 2020

School: Federal University of Agriculture, Abeokuta

Department: Science and Technology

Course Code: STS101

Topics: Descriptive Statistics, frequency distribution, data representation, data collection, measures of location, ratio, rate

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

Novrazbb Yotjob distinctquote yourowndir muttcat scholarship carlesto newsfunt