Scribd
Upload
115 views

Algebraic Structures: by Mrs. Shalini Walia Asstt. Prof. Engineering College Ajmer

This document provides an overview of the topics to be covered in the course Algebraic Structures. The topics include set theory, relations, functions, propositional logic, finite state machines, partially ordered sets and lattices, combinatorics, recurrence relations, algebraic structures like groups and rings, and graph theory. The course objectives are to apply logic and algebraic structures to solve real-world problems, develop discrete mathematical concepts, learn graph applications in algorithms, and master counting techniques and proof methods.

Uploaded by

Vral
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
115 views

Algebraic Structures: by Mrs. Shalini Walia Asstt. Prof. Engineering College Ajmer

This document provides an overview of the topics to be covered in the course Algebraic Structures. The topics include set theory, relations, functions, propositional logic, finite state machines, partially ordered sets and lattices, combinatorics, recurrence relations, algebraic structures like groups and rings, and graph theory. The course objectives are to apply logic and algebraic structures to solve real-world problems, develop discrete mathematical concepts, learn graph applications in algorithms, and master counting techniques and proof methods.

Uploaded by

Vral
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 39

ALGEBRAIC

STRUCTURES
BY Mrs. SHALINI WALIA
ASSTT. PROF.
ENGINEERING COLLEGE AJMER
Set Theory: Definition of sets, countable and uncountable sets, Set operations, Partition of set, Cardinality (Inclusion-Exclusion & Addition Principles)
Venn Diagrams, proofs of some general identities on sets. Relation: Definition, types of relation, composition of relations, Pictorial representation of
relation, Equivalence relation, Partial ordering relation, Job Scheduling problem.
1 Function: Definition, type of functions, one to one, into and onto function, inverse function, composition of functions, recursively defined functions,
pigeonhole principle. Theorem proving Techniques: Mathematical induction, Proof by contradiction. Composition of Functions. The Pigeonhole and
Generalized Pigeonhole Principles.

Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables, tautologies, Contradictions, Algebra of Proposition, logical
2
implications, logical equivalence, predicates, Normal Forms, Universal and existential quantifiers. 2 way predicate logic. Introduction to finite state
machine Finite state machines as models of physical system equivalence machines, Finite state machines as language recognizers.

Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set,
properties of Lattices, bounded and complemented lattices.
3 Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Multimodal Coefficients Recurrence Relation and Generating Function:
Introduction to Recurrence Relation and Recursive algorithms, linear recurrence relations with constant coefficients, Homogeneous solutions, Particular
solutions, Total solutions, Generating functions, Solution by method of generating functions.

Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group, properties of groups, Subgroup, cyclic groups, Cosets,
4 factor group, Permutation groups, Normal subgroup, Homomorphism and isomorphism of Groups, example and standard results, Rings and Fields:
definition and standard results.

Graph Theory: Introduction and basic terminology of graphs, Planer graphs, Multigraphs and weighted graphs, Isomorphic graphs, Paths, Cycles and
5 connectivity, Shortest path in weighted graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits, Graph coloring, chromatic
number, Isomorphism and Homomorphism of graphs, matching, vertex/edge covering.
Course Objectives
Sr. No. Objectives

To be able to read and analyze Technical articles & books with the knowledge of
predicate calculus and to solve real world problem in certain topics of logics
CO1
and to give required knowledge of algebraic structure useful in applications of computer
language and in the study of finite state machine

CO2 To develop the ideas of Basic and discrete structures to real life practical problems.

CO3 To give required &desirable formation of graphs useful in algorithm


CO4 To be able to learn counting techniques and various methods of proof.
THANKS

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy