Download Introductory algebra 2018, 2019&2020 - MTH212 Past Question PDF

You will find Introductory algebra 2018, 2019&2020 past question PDF which can be downloaded for FREE on this page. Introductory algebra 2018, 2019&2020 is useful when preparing for MTH212 course exams.

Introductory algebra 2018, 2019&2020 past question for the year 2019 examines 200-level Science and Technology students of UNIUYO, offering MTH212 course on their knowledge of Algebra, mapping, mathematical induction, division algorithm, Peano postulates, truth table, binary operation

Technical Details
Updated at:
Size: 3.73 MB
Number of points needed for download: 33
Number of downloads: 7

Past Questions related to Introductory algebra 2018, 2019&2020

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

MODERN ALGEBRA 1

Year: 2018

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: MTH504

Topics: matrix, algebra, Cartesian, mapping, Boolean

Algebra with marking guide

Year: 2016

School: Federal University of Agriculture, Abeokuta

Department: Science and Technology

Course Code: MTS101

Topics: set theory, binary operation, surd, real numbers

ABSTRACT ALGEBRA 1

Year: 2019

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: MTH301

Topics: abstract algebra, set, Cartesian, operation

Algebra and Number Theory E-Test solution by dy'howner

Year: 2019

School: Federal University of Technology, Minna

Department: Science and Technology

Course Code: MAT111

Topics: partial fraction, set theory, mapping, function, Binomial theorem

Algebra and Number Theory E-Test solution

Year: 2018

School: Federal University of Technology, Minna

Department: Science and Technology

Course Code: MAT111

Topics: Partial fraction, mapping

Algebra and Number Theory

Year: 2020

School: Federal University of Technology, Minna

Department: Science and Technology

Course Code: MAT111

Topics: Partial fraction, binomial expansion, sequence, series, set, mapping

Algebra and number theory

Year: 2019

School: Federal University of Technology, Minna

Department: Science and Technology

Course Code: MAT111

Topics: Binomials, Complex number, Sequence, series, mapping, binomial expansion

120 Algebra and Number Theory E-Test solution by InfoMas

Year: 2019

School: Federal University of Technology, Minna

Department: Science and Technology

Course Code: MAT111

Topics: Algebra, Number Theory

Algebra and Number Theory E Test Questions and solution By Sir Lake

Year: 2019

School: Federal University of Technology, Minna

Department: Science and Technology

Course Code: MAT111

Topics: Algebra, number theory

Set,Logic and algebra

Year: 2018

School: University of Nigeria, Nsukka

Department: Science and Technology

Course Code: MTH211

Topics: Sets, logic, Algebra

General Mathematics and Algebra

Year: 2020

School: Air Force Institute of Technology

Department: Science and Technology

Course Code: MTH101

Topics: Algebra, sets, binomial expansion, trigonometry, quadratic 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

Discrete Structures

Year: 2021

School: Air Force Institute of Technology

Department: Science and Technology

Course Code: CSC208

Topics: Discrete Structures, Venn diagram, set, Hasse diagram, De Morgan's law, truth table, diagraph, subgraph, Hasse diagram, Poset diagram

Books related to Introductory algebra 2018, 2019&2020

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

Abstract Algebra

Author: MAT211

School: University of Ibadan

Department: Science and Technology

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

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

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

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

The green book of algebra

Author: SA Ilori, DOA Ajayi

School: University of Ibadan

Department: Science and Technology

Course Code: MAT111

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

MAT111 (DLC Algebra)

Author: SA Ilori

School: University of Ibadan

Department: Science and Technology

Course Code: MAT111

Topics: Algebra, Polynomials, Polynomial Equations, Inequalities, Rational Functions, Curve Sketching, mathematical induction, permutations, combinations, binomial theorem, sequence, series, complex numbers, matrix, linear equations, determinants, Cramer's rule, sets

Algebra and Trigonometry

Author: Alhassan Charity Jumai

School: Edo University

Department: Science and Technology

Course Code: MTH111

Topics: Algebra, Trigonometry, real number system, set theory, Venn diagram, sequence, series, arithmetic progression, arithmetic mean, geometric progression, partial fraction, mathematical induction, complex numbers, permutations

Schaum's Outline of Theory and problems of modern algebra

Author: Frank ayres

School: University of Ilorin

Department: Science and Technology

Course Code: MAT203

Topics: set, Venn diagram, relation, operation, natural numbers, integer, natural number, real number, complex number, group, ring, integral domain, division ring, field, polynomial, vector space, matrix, matrix polynomial

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

The Concept of a Mapping

Author: Marcel Finan

School: University of Ilorin

Department: Science and Technology

Course Code: MAT112

Topics: Mapping

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

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

Elementary mathematics 2 lecture note

Author: Sampor

School: University of Ilorin

Department: Science and Technology

Course Code: MAT112

Topics: inequality, indices, logarithm, matrix, Cartesian product, mapping, bisection, composition, inverse mapping, binary operation, associativity, identity element, invertible element, distributivity, Geometry

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 and Application Software

Author: FUNAAB

School: Federal University of Agriculture, Abeokuta

Department: Science and Technology

Course Code: CSC211

Topics: algorithm, program, algorithm analysis, Basic flowchart shapes, algorithm structure, application software, Microsoft access

Digital Design, 6th edition

Author: Morris Mano, Michael Ciletti

School: Edo University

Department: Engineering

Course Code: EEE314

Topics: digital design, binary numbers, digital system, number-base conversions, octal numbers, hexadecimal numbers, signed binary numbers, binary codes, binary storage, binary logic, Boolean Algebra, logic gates, Boolean functions, logic operations, digital logic gates, integrated circuits, gate level minimization, truth table, combinational logic, decoders, encoders, multiplexers, behavioral modeling, logic simulation, Synchronous Sequential Logic, sequential circuits, flip flops, registers, counters, shift registers, ripple counters, Synchronous Counters, memory, programmable logic, random access memory, memory decoding, error detection, error correction, read only memory, programmable array logic, Sequential Programmable Devices, Algorithmic State Machines, sequential binary multiplier, control logic

Algorithm and complexity analysis

Author: David Acheme

School: Edo University

Department: Science and Technology

Course Code: CSC214

Topics: Algorithm, Algorithm complexity analysis, arrays, iteration, invariants, Linked List Data Structure, Queue Data Structure, queue operations, stacks

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

Truth tables

Author: CSC111

School: University of Ilorin

Department: Science and Technology

Course Code: CSC111

Topics: truth table, logic gate

Novrazbb Yotjob distinctquote yourowndir muttcat scholarship carlesto newsfunt