This action might not be possible to undo. Are you sure you want to continue?

**Master of Computer Application
**

Subject Name : Discrete Mathematics for Computer Science Subject Code : 610003 _____________________________________________________________ Objectives: The objective of this course is to present the foundations of many basic

computer related concepts and provide a coherent development to the students for the courses like Fundamentals of Computer Organization, RDBMS, Data Structures, Analysis of Algorithms, Theory of Computation ,Cryptography, Artificial Intelligence and others. This course will enhance the student’s ability to think logically and mathematically.

**Prerequisites: Knowledge of basic concepts on Sets, different operations on sets,
**

binary operations, functions.

Contents:

1. 2. Mathematical Logic : Introduction, Connectives, statement formulas, principle of substitution, validity of arguments, Quantifiers, Proof techniques. Lattices and Boolean Algebra : Relation and ordering, partially ordered sets, Lattices as poset, properties of lattices, Lattices as algebraic systems, sublattices, direct product and homomorphism, complete lattices, bounds of lattices, distributive lattice, complemented lattices. Introduction, definition and important properties of Boolean Algebra, Sub Boolean algebra, direct product and homomorphism, join-irreducible, meet-irreducible, atoms, anti atoms, Stone’s representation theorem. (Without Proof), Note : No proof is required for Theorems or Results on lattices and Boolean Algebra. Theorems should be justified and explained by suitable examples . Applications of Boolean Algebra : Boolean expressions and their equivalence, Minterms and Maxterms, Free Boolean algebra, Values of Boolean expression, canonical forms, Boolean functions, representation of Boolean function, Karnaugh maps, minimization of Boolean function, Quine_ Mccluskey algorithm, Application to Relational Database. Group Theory : Definition and examples of groups, abelian group, cyclic groups, permutation groups, subgroups & Homomorphism, Cosets and Lagrange’s Theorem (without proof), Normal subgroups, Quotient Groups. Graph Theory : Basic concepts of Graph theory, paths, reachability and connectedness, matrix representation of graph, trees.

3.

4.

5.

**Main Reference Books :
**

1. “Discrete Mathematical Structures with Applications to Computer Science”, J. P. Tremblay and R.Manohar ,Tata McGraw-Hill 2. “Discrete Mathematical Structure”, D. S. Malik, M. K. Sen, Cengage Learning

**Suggested Additional Reading :
**

1. Discrete Mathematics and its applications, Tata McGraw-Hill, 6th edition, K. H. Rosen. 2. Discrete Mathematical Structure, Pearson Education, Bernard Kolmann& others, Sixth Edition 3. Discrete Mathematics with Graph Theory, PHI, Edgar G. Goodaire, Michael M. Parmenter. 4. Logic and Discrete Mathematics, Pearson Education, J. P. Tremblay and W. K. Grassman.

**Chapter wise coverage from the main reference books:
**

1. From Book # 1 Chapter – 2, article 2-3 (2-3.1 to 2-3.9) Chapter-3, article 3-5 (3-5.1 to 3-5.4) upto Theorem 3-5.8 Chapter – 4, articles 4-1 to 4-4 Chapter – 5, article 5-1 (5-1.1 to 5-1.4) 2. From Book # 2 Chapter – 1, articles 1.2 to 1.5 Chapter-3 article 3.3

**Accomplishment of the student after completing the course :
**

The student will be able to apply concepts to RDBMS, perform minimization of Boolean functions, shall learn the fundamentals representations methods of graphs and trees. They shall be able to use different logical reasoning to prove theorems.

- OnlineExam.pdf
- OnlineContentMgmt_v64_v1.pdf
- IJCSI-10-1-1-439-443.pdf
- 3.pdf
- 019
- Sad
- PURCHASE ONLYPowerpoint Tutorial
- System Analysis and Design With UML Version 2.0
- Computer Fundamentals
- PURCHASE ONLYBusiness Communication
- PURCHASE ONLYStrategic Financial Management
- PURCHASE ONLYCost and Accounting
- Learning Microsoft Powerpoint
- Learning Microsoft Word
- Final Portfolio Management
- Application Form Exhibition
- Executive Comm
- Statistics
- Stat
- 1015967398
- Comprehensive Project
- Dining
- 27271411-HRM
- 27271411-HRM-IGNOU
- 98954901 Dining Ettiquete

Sign up to vote on this title

UsefulNot usefulDiscrete Mathematics for Computer Science

Discrete Mathematics for Computer Science

- Discrete Mathematics Structures
- Discrete Mathematical Structures-Kolman.busby.ross
- Discrete Mathematical Structures 4ed (4)
- Logic and Discrete Mathematics
- graph theory by narsing deo
- discrete-mathematics-venkataraman.pdf
- Discrete and Combinatorial Mathematics 5th Ed - R. Grimaldi - Solution Manual
- mathematics_for_computer_science
- Hamacher - Computer Organization (5th Ed)
- Invitation to Discrete Mathematics
- Data Structures Using c by Aaron m Tenenbaum 946
- Discrete Mathematics - C. Liu.pdf
- Higher Engineering Mathematics-BS Grewal
- MATHS 4th
- Fundamentals of Algorithmics - Brassard, Bratley
- MFCS
- Theory of Automata by Cohen
- Suggestion Paper for CS521 - Formal Language & Automata Theory
- Os Lab Manual Final
- Formal.languages.and.Their.relation.to.Automata
- Comprehensive Chess Endings Vol.3 NoPass.pdf
- A Primer in Combinatorics - Alexander Kheyfits.pdf
- Computer System Architecture -john d carpinelli
- Discrete and Combinatorial Mathematics 5E (Textbook)
- Priority and Round Robin Scheduling
- Computer Architecture by Kai Hwang Kai Hwang & F. A. Briggs, “Computer Architecture and Parallel Processing”, McGraw Hill
- Librarybooks
- What is Difference Between Backtracking and Branch and Bound Method
- Discrete Mathematics for Computer Science

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd