Skip to main content

Discrete Mathematical Structures.



LAKIREDDY BALI REDDY COLLEGE OF ENGINEERING (AUTONOMOUS), MYLAVARAM B.Tech. (IV Sem.) 17CI03 - DISCRETE MATHEMATICAL STRUCTURES

  Pre-requisites: Basic Mathematical Knowledge

Course Educational Objective: Perform the operations associated with sets, functions, and relations. Relate practical examples to the appropriate set, function, or relation model, and interpret the associated operations and terminology in context. Use formal logic proofs and/or informal but rigorous logical reasoning to, for example, predict the behavior of software or to solve problems such as puzzles.

Course Outcomes: At the end of the course, the student will be able to:
 CO1: Illustrate basic concepts of mathematical logic and predicate                                             

CO2: Analyze the Sets, Relations and Functions concepts. 

CO3: : Importance of Graph theory and its real time applications

CO4: Elaborate Algebraic Structures, Pigeonhole Principle and its Real time applications. 

CO5: Construct Recurrence Relations and Generating Functions. 

Comments

Popular posts from this blog

Design Patterns UNIT-2

 A Case Study: Design a Document Editor ¾     This chapter presents a case study in the design of a "What-You-See-Is-What-You-Get" (or "WYSIWYG") document editor called Lexi. ¾     We'll see how design patterns capture solutions to design problems in Lexi. ¾     A WYSIWYG representation of the document occupies the large rectangular area in the center. ¾     The document can mix text and graphics freely in a variety of formatting styles. ¾     Surrounding the document are the usual pull-down menus and scroll bars, and a collection of page icons for jumping to a particular page in the document.    Design Problems: Seven problems in Lexis's design: Document Structure: The choice of internal representation for the document affects nearly every aspect of Lexis's design.    All editing, formatting, displaying, and textual analysis will require traversing the represent...

Discrete Mathematics UNIT-1 NOTES

                                                            Propositional Logic: Pro positional calculus   is a branch of  logic . It is also called  propositional logic ,  statement logic ,  sentential calculus ,  and sentential logic. There is a need to develop a formal language to state the Rules and Theory. - A formal language is one in which the syntax is well defined. - This formal language is called an object language.  An object language consists of declarative sentences. These can have two truth values 'T' or 'F', denoting whether the statement is True or False. Declarative Statement : A  statement  is said to be declarative if has a truth value, i.e. T or F. Proposition: A proposition is a declarative statement t...