Scribd
Upload
235 views2 pages

2018-Discrete Structure & Theory of Logic - RCS 301

This document appears to be an exam for a Discrete Structures and Theory of Logic course. It contains 7 sections with multiple choice, short answer, and proof-based questions. Section A has 7 short answer questions defining concepts like Eulerian paths/circuits, edge coloring, isomorphic graphs, and properties of rings. Section B has 3 proof-based questions about mathematical induction, graph theory concepts like bipartite/complete graphs, and determining if a relation is a lattice. Section C and following sections each contain one longer proof-based question involving topics like Boolean algebra, group theory, trees, quantified logic, graph algorithms, and solving recurrence relations.

Uploaded by

Shivam Motla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
235 views2 pages

2018-Discrete Structure & Theory of Logic - RCS 301

This document appears to be an exam for a Discrete Structures and Theory of Logic course. It contains 7 sections with multiple choice, short answer, and proof-based questions. Section A has 7 short answer questions defining concepts like Eulerian paths/circuits, edge coloring, isomorphic graphs, and properties of rings. Section B has 3 proof-based questions about mathematical induction, graph theory concepts like bipartite/complete graphs, and determining if a relation is a lattice. Section C and following sections each contain one longer proof-based question involving topics like Boolean algebra, group theory, trees, quantified logic, graph algorithms, and solving recurrence relations.

Uploaded by

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

.

Printed pages:2 Roll No. Sub Code: RCS 301

Paper ID:1002

B.Tech.
(sEM IrI) THEORY EXAMINATION 201?-18
Iliscrete Structures & Theory of Logic
Time: 3 Hours Total Marks: 70

Note: If require any missing


1. Attempt all Sections. data; then choose suitablyl
2. Any special paper specific instruction.
'

SECTIONA

1. Attempt a// questions in brief. 2 x7 :14


a. Define Eulerian path, circuit and graph
b. Let A=(2,4,5,7,8)=B,aRb if and only if a+b<= 1 2.Find relation matrix
c. Explain edge coloring and k egde ioloring.
d. Define Chromatic number and Isomorphic graph.

e. Define union and intertersection of multiset and find for


A=1L,1,4,2,2,3f ,B:11,2,2,6,3,3f .

f. Find the contrapositive of -"If he has courage, then he will win"'

g .Define rings and write its properties.

SECTIONB

2. Attempt *ny threeof the following: 7 x3 =21


a. Prove by mathematical induction
3+3 3+3 3 3+.............. 3 3.. 3 : ( I 0o*r - 9n-10)I 27

b. Define the following with one example:


i) Bipartite gaph.

ii) Connplete graph.

iii) How many edges in Kz and Kt,o

iv) Planar Graph.

c. For any positive integer D36, then find whether (D36,'l') is lattice or not?

,2,3.....7]and R:{(x,y) I (x-y) is divisible by 3)'Is R equivalence


X:tl relation
d. Let
Draw the diagraPh of R
e. Simptify the following Boolean firnction using K-map:
F(x,y,z)=f,(0,2,3,7)
,;; )
l

SECTION C
3. Attempt aay one part of the following: 7 xl=1
(a) Solvear-6ar-1*8 o14:r.4r rgiven 80:8, and a1:1.
(b) Showthat: r * ^q, r v s, s a -g,p -+ q e+ -p are inconsistent

4. Attcmpt ilny orrepart of the following: 7 xl:l


(a) Write the properties of Group. Show that the set(1,2,3,4,5)is not group *d".
addition and multiplication modulo 6.

(b) Prove by mathematical induction


14:-4nz is divisible by 3 for alln>:2.

5. Attempt any one part of the following: 7 xt=1


(a)Explain Modular lattice, distribute lattice and bounded lattice with eg and diagram

(b) Draw the Hasse diagram of (A, S), where

A= {3,4,12,24,48,72} and relation < be such that a < b if a divides b

6. Attempt any one part of the following: 7 xl=1


(a) Given the inorder and postorder traversal of a tree T
Inorder: HFEABIGDC Postorder:BEHFACDGI
Determine the tree T and its Preorder.

O) Translate the following sentences in quantified expressions


of predicate logic.

i) All students need financial aid.


ii) Some co\vs are not white."
iii) Suresh will get if division if and only if he gets first div.
*o'
t?;il:r;:: H'nil: g:T J',Jffi $X
7. Atternpt any orre part of the f'ollowing: 7 xl=7.
(a) Define and Explain any two the following:
1. BFS and DFS in Trees.
2. Euler Graph
3. Adjacency matrix. of a graph.

(b) Solve the reculrence relatisn: ar +4&r-t * 4fr,r-z: tz .

You might also like