Abstract Algebra by MAT211 PDF free download

MAT211 Abstract Algebra PDF, was published in 2018 and uploaded for 200-level Science and Technology students of University of Ibadan (UI), offering MAT211 course. This ebook can be downloaded for FREE online on this page.

Abstract Algebra ebook can be used to learn 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.

Technical Details
Updated at:
Size: 940.67 KB
Number of points needed for download: 22
Number of downloads: 24

Books related to Abstract Algebra

Abstract Algebra ,3rd edition

Author: John Beachy

School: University of Ibadan

Department: Science and Technology

Course Code: MAT211

Topics: Abstract Algebra, intergers, functions, groups, polynomials, commutative rings, fields, Congruences, intergers modulo, equivalence relations, permutations, subgroups, isomorphisms, cyclic groups, permutation groups, homomorphism, cosets, factor groups, Ring Homomorphism, quotient fields, Algebraic Elements, geometric constructions

Elements of abstract and linear Algebra

Author: EH Connell

School: University of Ibadan

Department: Science and Technology

Course Code: MAT211

Topics: abstract Algebra, linear Algebra, Sets, Cartesian products, Hausdorff maximality principle, groups, Homomorphisms, permutations, rings, domains, fields, Polynomial rings, Chinese remainder theorem, Boolean rings, matrices, matrix rings, Systems of equations, Determinants, Summands, transpose principle, Nilpotent homomorphisms, Jordan canonical form, Eigenvalues, Euclidean domains, jordan blocks, Jordan canonical form

Digital Logic Circuit Analysis and Design

Author: Victor Nelson, Troy Nagle, Bill Carroll, David Irwin

School: Edo University

Department: Engineering

Course Code: EEE314

Topics: Digital Logic Circuit Analysis, Digital Logic Circuit Design, computing, digital systems, number systems, positional notation, arithmetic, binary arithmetic, octal arithmetic, hexadecimal arithmetic, base conversions, signed number representation, computer codes, numeric codes, error detection codes, correction codes, Boolean algebra, Venn diagram, Duality, switching functions, truth tables, switching circuits, electronic logic gates, combinational circuits, algebraic methods, combinational logic circuits, computer aided design, design cycle, digital circuit modelling, design synthesis, logic simulation, Karnaugh maps, Quine-McCluskey tabular minimization method, Petrick's algorithm, computer aided minimization of switching functions. Modular combinational logic, Decodes, encoders, decoder circuit structures, encoders, multiplexers, demultiplexers, data distributors, adder circuits, comparators, semi custom logic devices, logic array circuits, field-programmable logic arrays, programmable read-only memory, programmable array logic, sequential devices, sequential circuits, memory devices, latches, flip-flops, timing circuits, modular sequential logic shift registers, counters, serial adder unit, serial accumulators, parallel accumulators, multiple-sequence counters, digital fractional rate multipliers, synchronous sequential circuit models, synchronous sequential circuits, registered programmable logic device, programmable gate arrays, sequential circuit design, logic circuit testing, digital logic circuit testing, combinational logic circuit testing, sequential logic circuit testing, electronic slot machine, keyless auto entry system

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

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

Elementary Abstract Algebra

Author: Edwin Clark

School: University of Ibadan

Department: Science and Technology

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

Abstract Algebra

Author: Gregory Lee

School: University of Ilorin

Department: Science and Technology

Course Code: MAT306, MAT327

Topics: relations, set, set operation, integer, modular arithmetic, groups, factor groups, homomorphism, direct products, finite abelian groups, automorphism, morphism, symmetric group, alternating group, sylow theorem, rings, factor rings, isomorphism, domains, Irreducible Polynomials, vector spaces, field extensions, public key cryptography, straightedge, compass constructions

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

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

A Survey of Modern Algebra ,5th edition

Author: Garrett Birkhoff, Saunders Mac Lane

School: University of Ibadan

Department: Science and Technology

Course Code: MAT212

Topics: Modern Algebra, rational numbers, fields, polynomials, real numbers, complex numbers, groups, vectors, vector spaces, algebra of matrices, linear groups, determinants, canonical forms, Boolean Algebre, Lattice, Transfinite arithemetic, rings, ideal, Algrbraic Number fields, Galois theory

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

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

A Book of Abstract Algebra, Second Edition

Author: Charles pinter

School: University of Ilorin

Department: Science and Technology

Course Code: MAT306, MAT327

Topics: Group, function, permutation, isomorphism, group element, subgroup, function, cyclic group, partition, equivalence relation, counting coset, homomorphism, quotient group, homomorphism theorem, ring, quotient ring, integral domain, polynomial, factoring polynomial, extension of fields, vector space, field extension, ruler, compass, Galois theory, set theory

Introduction to Real Analysis, 4th Edition

Author: Robert Bartle, Donald Sherbert

School: Nnamdi Azikiwe University

Department: Science and Technology

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

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

Polynomials

Author: Ogunfolu Bamidele

School: University of Ibadan

Department: Science and Technology

Course Code: MAT101

Topics: Polynomials, polynomial addition, polynomial subtraction, product of polynomials, polynomials division, factor theorem, remainder theorem, quadratic equations theory, discriminant, cubic equations roots

Logic & philosophy A modern introduction, 13th edition

Author: Alan Hausman, Frank Boardman, Howard Kahane

School: Edo University

Department: General studies

Course Code: GST112

Topics: Logic, philosophy, argument, deduction, induction, deductive argument forms, truth, validity, sentential logic, atomic sentences, compound sentences, truth tables, Logical Form, Tautologies, Contradictions, Contingent Sentences, Logical Equivalences, Argument forms, Disjunctive Syllogism, Hypothetical Syllogism, Simplification, Conjunction, Constructive Dilemma, proofs, Sentential Logic Truth Trees, Sentential Logic Truth Tree Method, predicate logic, Predicate Logic Symbolization, Predicate Logic Semantics, Proving Invalidity, Predicate Logic Proofs, Relational Predicate Logic, Predicate Logic Truth Trees, modal logic, Modal Logic Semantics, Syllogistic Logic

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

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

Past Questions related to Abstract Algebra

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

ABSTRACT ALGEBRA 2

Year: 2019

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: MTH405

Topics: field, abelian group, decomposable group, simple group, p-subgroup, field, homomorphism

Introductory algebra 2018, 2019&2020

Year: 2019

School: University of Uyo

Department: Science and Technology

Course Code: MTH212

Topics: Algebra, mapping, mathematical induction, division algorithm, Peano postulates, truth table, binary operation

ABSTRACT ALGEBRA 1

Year: 2019

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: MTH301

Topics: abstract algebra, set, Cartesian, operation

Abstract algebra 2 test & exam-2017-2019

Year: 2019

School: University of Ilorin

Department: Science and Technology

Course Code: MAT306

Topics: group, coset, ring, isomorphic series, normal series

Set,Logic and algebra

Year: 2018

School: University of Nigeria, Nsukka

Department: Science and Technology

Course Code: MTH211

Topics: Sets, logic, Algebra

MODERN ALGEBRA 1

Year: 2018

School: Federal University of Technology, Owerri

Department: Science and Technology

Course Code: MTH504

Topics: matrix, algebra, Cartesian, mapping, Boolean

Introduction to Computer Science 1 study questions

Year: 2017

School: University of Ilorin

Department: Science and Technology

Course Code: CSC111

Topics: data, information, storage device, memory, flowchart, pseudo code, number system, boolean algebra, Karnaugh map, logic gate, operating system, system software, application software

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

Tutorial workbook for MTS101 & MTS102

Year: 2019

School: Federal University of Agriculture, Abeokuta

Department: Science and Technology

Course Code: MTS101, MTS102

Topics: Set theory, real numbers, complex numbers, rational functions, partial fraction, binomial expansion, sequence, series, matrices, Trigonometry, Differentiation, integration

Algebra and trigonometry & Introductory physiology MOCK CAT

Year: 2018

School: Federal University of Agriculture, Abeokuta

Department: Science and Technology

Course Code: MTS105, BIO103, BIO101

Topics: surd, remainder theorem, partial fraction, series, geometric mean, plant, leaf, homeostasis, environment, photosynthesis

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

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

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