Donate
We put a lot of effort and resources to keep the materials you enjoy in LearnClax free.
Consider making a donation by buying points.
Discrete mathematics and its applications ,8th edition by Kenneth Rosen
Discrete mathematics and its applications ,8th edition written by Kenneth Rosen was published in the year 2019. It has details on 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 .
Discrete mathematics and its applications ,8th edition was uploaded for 200 level Science and Technology students of University of Ibadan (UI). it is recommended for CSC242 course .
| Technical Details |
|---|
| Uploaded on: 13-January-2021 |
| Size: 6.96 MB |
| Number of points needed for download: 59 |
| Number of downloads: 2 |
other related books
Introduction to Algorithms ,3rd Edition
Department: Science and Technology
Author: Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein
school: University of Ibadan
course code: CSC242
Topics : Algorithms, Insertion sort, analyzing Algorithms, designing Algorithms, growth of functions, asymototic 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
Go to bookIntroduction to the design and analysis of algorithms ,3rd edition
Department: Science and Technology
Author: Anany Levitin, Soumen Mukherjee, Arup Kumar Bhattacharjee
school: University of Ibadan
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
Go to bookMathematical Logic On Numbers, Sets, Structures, and Symmetry
Department: Science and Technology
Author: Roman Kossak
school: University of Ilorin
course code: CSC408
Topics : first-order login, logical seeing, number, number structures, points, lines, structure of real numbers, set theory, relations, structures, geometry, definable elements, definable constants, minimal structure, order-minimal structures, definable sets, complex numbers, first-order properties, symmetries, logical visibility
Go to bookDigital Logic Design
Department: Science and Technology
Author: Nancy Woods
school: University of Ibadan
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
Go to bookComputer Algorithms
Department: Science and Technology
Author: Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran
school: Edo University
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
Go to bookNotes on Discrete Mathematics
Department: Science and Technology
Author: James Aspnes
school: Edo University
course code: MTH214
Topics : discrete mathematics, mathematical logic, functions, proofs, set theory, set operations, axiomatic set theory, real numbers, arithmetic, induction, recursion, summation notation, Asymptotic notation, number theory, graphs, multiplication, exponentiation, binomial coefficients, generating functions, probability theory, random variables, Markov's inequality, probability generating functions, linear algebra, abstract vector spaces, finite fields
Go to bookFoundations of computer science
Department: Science and Technology
Author: Olufade Falade Williams Onifade
school: University of Ibadan
course code: CSC242
Topics : computer science, logic, sets, loops, recursion, Program Correctness, Loop invariant, Hoare’s Axiom, Discrete Probability, Randomized Algorithms, lists, graphs, Cryptography, Mathematical induction
Go to bookRegression and Analysis of Variance I
Department: Science and Technology
Author: Alaba Oluwayemisi Oyeronke
school: University of Ibadan
course code: STA322
Topics : Regression, Analysis of Variance, Correlation Coefficient, Correlation Ratio, Simple Linear Regression, Multiple Linear Regression, Multiple Regression Analysis, Polynomial Regression, Non-Linear Regression Model, ANOVA, Randomized Complete Block Design, Analysis of Variance for Randomized Complete Block Design, Latin Square Design, Least Significant Difference
Go to bookIntroduction to Languages and the Theory of Computation ,4th edition
Department: Science and Technology
Author: John Martin
school: University of Ibadan
course code: CSC242
Topics : Computation, languages, Mathematical Tools, Regular Expressions, Nondeterminism, Kleene’s Theorem, Context-Free Languages, Finite Automata, Pushdown Automata, Non-Context-Free Languages, Undecidable Problems, Decision Problems Involving Turing Machines, turing machines, computable functions, Recursively Enumerable Languages, Computational Complexity
Go to bookDigital Logic Circuit Analysis and Design
Department: Engineering
Author: Victor Nelson, Troy Nagle, Bill Carroll, David Irwin
school: Edo University
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
Go to bookIntroduction to Logic Circuits & Logic Design with Verilog
Department: Engineering
Author: Brock LaMeres
school: University of Ilorin
course code: ELE542, TCS209, PHY457, CSC111
Topics : number system, digital circuitry, interfacing, gate, combinational logic design, Verilog, MSI login, sequential logic design, flip-flop, programmable logic, memory, computer system design, arithmetic circuits
Go to bookIntroduction to Logic Circuits & Logic Design with VHDL, 2nd edition
Department: Engineering
Author: Brock LaMeres
school: University of Ilorin
course code: ELE542, TCS209, PHY457, CSC111
Topics : number system, digital circuitry, interfacing, gate, combinational logic design, VHDL, MSI login, sequential logic design, flip-flop, programmable logic, memory, computer system design, arithmetic circuits
Go to bookElementary Abstract Algebra
Department: Science and Technology
Author: Edwin Clark
school: University of Ibadan
course code: MAT211
Topics : Abstract Algebra, Binary Operations, groups, Symmetric Groups, subgroups, Isomorphism, Cosets, Lagrange's Theorem, Ring Theory, Quaternions, Circle Group, logic, Elementary Number Theory, partitions, Equivalence Relations, functions, Elementary Number Theory, Partitions, Equivalence Relations
Go to bookIntroduction to Real Analysis, 4th Edition
Department: Science and Technology
Author: Robert Bartle, Donald Sherbert
school: Nnamdi Azikiwe University
course code: MAT251
Topics : real analysis, sets, functions, mathematical induction, finite sets, infinite sets, real numbers, absolute value, real line, intervals, sequences, series, limit theorems, monotone sequences, Cauchy criterion, limits, limit theorems, continuous functions, uniform continuity, inverse function, monotone functions, derivative, mean value theorem, L' Hospital rule, Taylor's theorem, Riemann integral, Riemann integral functions, fundamental theorem, Darboux integral, approximate integrations, pointwise convergence, uniform convergence, exponential functions, logarithmic function, trigonometric functions, infinite series, absolute convergence, infinite integrals, convergence theorems, continuous functions, metric spaces
Go to bookAbstract Algebra
Department: Science and Technology
Author: MAT211
school: University of Ibadan
course code: MAT211
Topics : Abstract Algebra, Binary Operations, sets, logic, Switching Algebras, Orders, Lattice, Boolean Algebra, Mapping, Groups, Homomorphism, Rings, Fields, Mathematical Induction, Divisibility, Euclid’s Algorithm, Congruence, Polynomials, Remainder Theorem, factor theorem, Rational Functions
Go to bookModern elementary statistics ,12th edition
Department: Science and Technology
Author: John Freund, Benjamin Perles
school: University of Ibadan
course code: STA121
Topics : statistics, summarizing data, listing, grouping, Numerical data, Stem-and-Leaf Displays, frequency distribution, graphical presentations, Summarizing Two-Variable Data, population, sample, mean, weighted mean, median, mode, grouped data, measures of variation, range, standard deviation, variance, posibility, probability, counting, permutation, combination, sample spaces, events, odds, conditional probability, multiplication rules, Bayes theorem, Mathematical Expectation, expectation, decision, decision making, Statistical Decision Problems, Random Variable, probability distributions, binomial distributions, hypergeometric distributions, Poisson distribution, Multinomial distribution, Mean of a Probability Distribution, Standard Deviation of a Probability Distribution, normal distribution, Continuous Distributions, sampling, random sampling, sample designs, systematic sampling, stratified sampling, cluster sampling, sampling distribuions, central limit theorem, estimation, Tests of Hypotheses, Significance Tests, One-Way Analysis of Variance, analysis of variance, Multiple Comparisons, Two-Way Analysis of Variance, Design of Experiments, Design of Experiments, regression, Curve Fitting, Regression Analysis, Multiple Regression, Nonlinear Regression, Coefficient of Correlation, correlation, Correlation Analysis, Multiple Correlation, Partial Correlation, Nonparametric tests, sign test, signed-rank test, U test, H test, Tests of Randomness, Rank Correlation
Go to bookStatistical Analysis Handbook
Department: Science and Technology
Author: Michael de Smith
school: University of Ibadan
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
Go to bookThomas Calculus ,14th edition
Department: Science and Technology
Author: GeorgeThomas, Joel Hass, Christopher Heil, Maurice Weir
school: University of Ilorin
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
Go to bookThomas Calculus Early Transcendentals, 13th Edition Instructors Solutions Manual
Department: Science and Technology
Author: Elka Block, Frank Purcell
school: University of Ilorin
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
Go to bookUniversity calculus early transcendentals, 4th edition
Department: Science and Technology
Author: Joel Hass, Christopher Heil, Przemyslaw Bogacki, Maurice Weir, George Thomas
school: Federal University of Agriculture, Abeokuta
course code: MTS241
Topics : functions, combining functions, trigonometric functions, exponential functions, inverse functions, logarithms, limit, continuity, derivatives, differentiation rules, chain rule, implicit differentiation, inverse trigonometric functions, related rates, linearization, differentials, mean value theorem, monotonic functions, applied optimization, integrals, transcendental functions, hyperbolic functions, integration, trigonometric integrals, trigonometric substitution, numerical integration, improper integrals, infinite sequences, infinite series, integral test, comparison test, absolute convergence, power series, Taylor series, Maclurin series, parametric equations, polar coordinates, vectors, dot product, cross product, vector-valued functions, partial derivatives, saddle points, multiple integrals, vector fields, Euler equations
Go to bookThe green book of algebra
Department: Science and Technology
Author: SA Ilori, DOA Ajayi
school: University of Ibadan
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
Go to bookrelated Past Questions
REGRESSION AND ANALYSIS OF VARIANCE 1
Department: Science and Technology
Year Of exam: 2019
school: Federal University of Technology, Owerri
course code: STA331
Topics : regression, variance, linear model, partial correlation
Go to past question36 Mammalian forms and functions MSSN
Department: Science and Technology
Year Of exam: 2019
school: University of Ilorin
course code: ZLY106
Topics : Mammalian forms, Mammalian functions
Go to past question120 Algebra and Number Theory E-Test solution by InfoMas
Department: Science and Technology
Year Of exam: 2019
school: Federal University of Technology, Minna
course code: MAT111
Topics : Algebra, Number Theory
Go to past questionAlgebra and Number Theory E Test Questions and solution By Sir Lake
Department: Science and Technology
Year Of exam: 2019
school: Federal University of Technology, Minna
course code: MAT111
Topics : Algebra, number theory
Go to past questionSets, binary operation, partial fractions, mathematical induction
Department: Science and Technology
Year Of exam: 2020
school: University of Benin
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
Go to past questionAlgebra and Number Theory E-Test solution by dy'howner
Department: Science and Technology
Year Of exam: 2019
school: Federal University of Technology, Minna
course code: MAT111
Topics : partial fraction, set theory, mapping, function, Binomial theorem
Go to past questionAlgebra and Number Theory E-Test solution
Department: Science and Technology
Year Of exam: 2018
school: Federal University of Technology, Minna
course code: MAT111
Topics : Partial fraction, mapping
Go to past questionAlgebra and Number Theory
Department: Science and Technology
Year Of exam: 2020
school: Federal University of Technology, Minna
course code: MAT111
Topics : Partial fraction, binomial expansion, sequence, series, set, mapping
Go to past questionAlgebra and number theory
Department: Science and Technology
Year Of exam: 2019
school: Federal University of Technology, Minna
course code: MAT111
Topics : Binomials, Complex number, Sequence, series, mapping, binomial expansion
Go to past questionPhysical Chemistry 1 pre-test and pre-exam by CPMSS,MSSN
Department: Science and Technology
Year Of exam: 2017
school: University of Ibadan
course code: CHE156
Topics : standard potential, rate of appearance, rate of disappearance, radioactivity, chemical reaction, specific heat capacity, thermochemical, kinetic-molecular theory, half-life, oxidation, number, acid heat capacity
Go to past questionPhysical Chemistry 1
Department: Science and Technology
Year Of exam: 2007
school: University of Ibadan
course code: CHE156
Topics : Internal energy, heat of formation, solubility, mean dissociation, mean free path, ideal gas, Lyman series, hybridization, binding energy
Go to past question14 Thermochemistry sample problems
Department: Science and Technology
Year Of exam: 2016
school: University of Ibadan
course code: CHE157
Topics : heat, enthalpy, calorimetry, work
Go to past questionIntroductory Mechanics and Properties of Matter Exercise 1-5 and solution
Department: Science and Technology
Year Of exam: 2017
school: University of Ibadan
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
Go to past questionIntroductory Heat and Thermodynamics pretest and exam by CPMSS,MSSN-2017,2018
Department: Science and Technology
Year Of exam: 2018
school: University of Ibadan
course code: PHY103
Topics : Energy, heat engine, Otto cycle, Carnot engine, Carnot refrigerator, reversible heat engine, thermometer, heat capacity, linear expansivity, Adiabatic expansion, latent heat, steam engine
Go to past questionHeat and Thermodynamics tutorial question 2 by Ben
Department: Science and Technology
Year Of exam: 2018
school: University of Ibadan
course code: PHY115
Topics : latent heat, internal energy, Carnot engine, engine efficiency, mean free path, specific heat, equipartition of energy, entropy, temperature scales, ideal gas law, constant-volume gas thermometer, sound
Go to past questionRecommended Computer Based Tests