## Are you sure?

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

“If the band could not play rock music or the refreshments were not delivered on time, then the New year’s party would have been cancelled and Alice would have been angry. If the party were cancelled, then refunds would have to be made. No refunds were made”. (ii) Show that R ∨ follows logically from the premises S

→ ∨S C D, (C ∨ D ) → ¬H, ¬H → (A ∧ ¬ )and (A ∧¬ B) ( R ). ∨ B

**∀ x[C ( x ) ∨ ∃ y ( C(y )∧ F (x, y )]. Here C(x) : x has a computer, F(x ,y) : x and y are
**

friends. The universe for both x and y is the set of all students of your college.

2. Translate the following predicate calculus formula into English sentence

** 3. Prove that ( p ) ∧( p → r) ∧ q → r) → r is a tautology. ( ∨q
**

∨ ∧ ∨ ∧ 4. Find the PDNF and PCNF of ( p ∧q ) (¬p r ) (q r ).

5. Check whether the hypothesis “ It is not sunny this afternoon and it is colder than yesterday”, “ we will go swimming only if it is sunny” , “If we do not go swimming then we will take a canoe trip” and “ If we take a canoe trip, then we will be home by sunset” lead to the conclusion “we will be home by sunset”. UNIT II 1. Show that 1.2.3 + 2.3.4 + 3.4.5 + . . . +n (n +1)(n +2) =

n( n + 1)(n + 2)( n + 3) ,n ≥ 1. 4

2. Using generating function method to solve the Fibonacci series 3. Solve s(k) – 10 s(k-1) + 9 s(k-2) = 0 with s(0) = 3 , s(1) = 11. 4. Using mathematical induction show that 2n + 2 + 32 n +1 is divisible by 7, n ≥ 0 . 5. Prove the principle of inclusion-exclusion using mathematical induction 6. Find the number of positive integers not exceeding 100 that are divisible by 5 or 7.

UNIT III 1. Define Eulerian graph and Hamiltonian graph. Give an example of (I) a graph which is Hamiltonian but not Eulerian. (II) a graph which is Eulerian but not Hamiltonian. (III) a graph which is both Eulerian and Hamiltonian. (IV) a graph which is non Eulerian and non Hamiltonian 2. . Check the given graph is strongly connected, weakly connected and unilaterally connected or not. If G is a simple graph with n- vertices and k- components then the no.of

State and prove Fundamental theorem on homomorphism of groups Let ( G . p UNIT IV 1. Let f : G → G be given by f(x) = a*x*a-1 for every x ∈ G prove that f is an isomorphism of G onto G. Let M be the maximum degree of the vertices of G and let m be the minimum degree of the vertices of G.. q) graph. Find the Hamiltonian path and Hamiltonian cycle. * ) be a finite cyclic group generated by an element a ∈ G. 5 Let G be a (p. …. an = e} where n is the least positive integer for which an = e. * ) be a group and a ∈ G. Prove that every finite group of order n is isomorphic to a permutation group of degree n 3.H . Let (G . A connected graph G is Eulerian if and only if every vertex of G is of even degree. Also identify the Euler circuit 4. 2. Check the given two graphs G and G’ are Isomorphic or not. If G is of order n. a2 .edges is atmost (n − k ) (n − k + 1) 2 3. if it exist.prove that an = e and G = { a . . Show that m ≤ 2q ≤M.

For any a. a ≤ b ⇔ a ∧ b = a ⇔ a ∨ b = b. The intersection of any two normal subgroup of a group is a normal subgroup. 3. 7. a ≤ b ⇔ a *b '= 0⇔ a ⊕ b= 1 b ≤ a ' ' ⇔ ' . 4.Morgan’s laws in a Boolean Algebra. State and prove distributive inequalities of a Lattice Show that in a complemented and distributed lattice 1. State and prove Lagranges Theorem 5. Whether the converse is true? Justify Your claim Establish De. In a distributive lattice prove that a *b = a * c and a ⊕ b = a ⊕ c implies that b = c Show that every distributive lattice is modular. UNIT V In a Lattice show that a ≤ b and c ≤ d implies a *c ≤ b * d. Let ( L. 5. b ∈ L. A subgroup H of G is normal iff each left coset of H in G is equal to the right coset of H in G. 6.4. 6. ≤ ) be a lattice. 2.

- DS-Unit-V Newuploaded byMathiazhagan Arumugam
- Mathematics & Logics for Basic Computer Scienceuploaded byIsuru Udana Senarath
- QUESTION_BANK_OF_DISCRETE_MATHEMATICS.pdfuploaded bybhattoo07
- GraphTheoryKVIuploaded byDeept Gautam
- GraphTheory NU Moodleuploaded byAtif Imam
- DuardoSanchez Aliuska TD 2014uploaded byAnonymous vhMCGI
- Scientia Magna, Vol. 5, No. 2uploaded byscience2010
- BroadcastRouting09_ChuandsdsdsdHanuploaded byRostomPiraCastueras
- MITHFH_lecturenotes_8uploaded byyashbhardwaj
- A Novel Approach Towards Automatic Text Summarization Using Lexical Chainsuploaded byEditor IJRITCC
- 17447_Ch1uploaded byRuchir Gupta
- Discrete Mathematics Question Paperuploaded byRajkumar Raaz
- Hierholzer's Algorithmuploaded byShikhin
- Discrete Mathematics Question Paperuploaded byRajkumar Raaz
- Project 1_Report.pdfuploaded byVenuAgarwal
- Mc 0082 Solveuploaded byAvijit Roy
- 00723735uploaded byysf1991
- Using Linear Algebra to Solve Graph Problemsuploaded byGo Bluth
- cs1927 15s2 - Week09 Tutuploaded byVictor
- Data Structureuploaded byjeenanu
- 7. Mathematics - Ijmcar-Ascending Detour Radius Decomposition of a Graphuploaded byTJPRC Publications
- Louis H. Kauffman- Math 215 Assignmentsuploaded byOkomm
- miningceuploaded byapi-19969042
- graphs_Iuploaded byMarlon Boucaud
- Dynamic Programming examplesuploaded byCoeus Apollo
- Graph Distance, Optimal Communication and Group Stability: A Preliminary Conjectureuploaded byIlieCraciun
- cryptolog_41uploaded byJohn Ohno
- Algo Problems for Learninguploaded bywebtoolkit
- Intro Cdrawuploaded byiDucky
- Knowledge Process - Development Griduploaded byAmila Kumanayake

Close Dialog## Are you sure?

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

Loading