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

)

Term-End F.xamination June, 2OO7

**MATHEMATICS CS-07@ : DISCRETE
**

Time : 3 hours Note :

l

**Maximum Marks : 75 Answer any three
**

l

**Qu estion no. 1 is cgmpulsory. questions from the rest.
**

l

1.

(a)

Determine the truth value for each of the following statements : (il 4 + 3: 6 AND 3 + 3 = 6 OR 3+1:5 3

( i i )5 + 3 : 8 (b)

Representthe graph

where e-...is an edge connecting vertices x and y. xy (c) Let G be a non directed graph with L2 edges. If G has 6 vertices each of degree 3 and the rest have degree less than 3, what is the minimum number of vertices G can have ?

G : { ( 12 , 3 , 4 1 , : I x - y I S 1} , "*

3

3

cs-07 @

P.T.O.

converse. (h) Find diameter of treeT v1 v3 3 3 cs-07 @ .(d) Consider the following relation on { 1 . 6 l l . Find f-l(y).V . R = { ( i j..) q ) l+ q 3 3 (0 (g) Calculate -25 + 75 using 2's cornplement. 4 . 5 .2 .j l : 2 1 Is R transitive ? Is R reflexive ? 3 (e) Write inverse. 3 . LetA : {x € R : x *U . x-1 and definef(x) : f is bijective function with Range of f as the set B : {y € R : y * Z }.contrapositivefor t p n ( p . ) l l i .

. then I will get promoted. I will not be happy. cs-07 @ P. If No. Therefore.(i) Consider the graph vl t-----z v2 v5 Does the graph have Eulerian circuit ? If Yes. then I will be happy.O. 0) (a) Show that everydistributivelattice is modular. write Euleriancircuit.T. 2. either I will not get the job or I will not work hard. "lf I get the job and work hard. If I get promoted. Is the directed graph given below strongly connected? (b) Prove the validity of the following argument. justify.

31 failed in Maths and in Physics. (a) Give an example of compl. (a) Out of 250 candidateswho failed in an examination. 30 failed in aggregate and in Physics. Find Minimum Algorithm for v5 Spanning Tree u$ng Prim's cs-07 @ .eteBipartite graph. in Maths but not in Physics. Find how many candidatesfailed (i) (ii) in all three subjects. (iii) in aggregatebut not in Maths. it was revealed that L28 failed in Maths. 87 in Physics and 134 in aggregate.54 failed in aggregateand in Maths. + x4 (d) 4.(c) Function f : R -+ R is defined by f(x) : *2 Is this function one-one ? Justify. 3. (b) Obtain PDNF form for lp v q (c) Draw switching circuit for (xr + xr) x.

000 . 1). 27. (d) Let A : {1.(b) Let X : {51. 53.2 0.5 + + + 51 54 52 53 FindAUB. prove that R-l is also an equivalencerelation.9 ^ A : + + . 9.8 0. Draw Hassediagramof poset (A.of which the following are two fuzry sets : 0.2 0.5 0.+ 51 52 53 n 6 : 1 54 1 0. Using Karnaugh ffiop. g : R -+ R are defined by f ( x: )x + 2 V x € R g(x:*2 vx€ R ) Find (fod (x) and (gof)(x). {a} X ' : A ' B C ' D ' +A B C ' D ' +A ' B C D ' + A B C D ' (b) If R is an equlvalence relationon set A. 3 (c) Apply Dijkstra's algorithm to find shortest path from atof. (c) If f : R -+ R.81}.ANB. simplify 5. cs-07 @ 3. 3. 52. 54} be the universe.

- TSR in C
- pristring
- Concept of Pixel in C Graphics
- Call by Value and Call by Reference
- 14. C Language - The Pre Processor
- 13.1 C Programming - Linked Lists
- 13.0 C Programming - Dynamic Memory Allocation
- 12. C Programming - File Management in C
- 11. C Programming - Pointers
- 10. C Programming - Structures and Unions
- 9. C Programming - Functions (Part-I, II)
- 7. C Programming - ARRAY
- 6. C Programming - Decision Making - Looping
- 5. C Programming - Decision Making - Branching
- 4. C Programming - Managing Input and Output Operations
- 3.1 C Programming - Expressions
- 3.0 C Programming - Operators
- 2.1 C Programming Language - Data Types
- 2.0 C Programming - Constants and Variables
- 1.1 C Programming - An Overview
- 1.0 C Language

Sign up to vote on this title

UsefulNot useful- Discrete Math
- Discrete Mathematics in the Modern World
- Gowers - Rough Structure and Classification.ps
- Bcast Addendum
- 0 Intro
- Vertex Odd Mean and Even Mean Labeling Of Some Graphs
- Handbook of Chemoinformatics-From Data to Knoledge
- MATHEMATICAL COMBINATORICS (INTERNATIONAL BOOK SERIES), Volume 1 / 2014
- International Journal of Mathematical Combinations, Vol. 1, 2014
- decision maths
- A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and Its Applications)
- Solution Manual to Chapter 05
- Algorithmic Graph Theory
- mq-q3-ch12
- Feynman Motives - M. Marcolli (World, 2010) WW
- Eisner.mst Tutorial
- General Abut Nephele
- Tutorial 5 Sol
- a8-rue
- 05409572
- MC0080 SMU MCA SEM4 2011
- Algorithm Graphs with solution
- art%3A10.1007%2Fs00453-014-9922-4
- 04_Graphs1.pdf
- A New S-(a,d) Antimagic Labelling of a Class of Generalized Petersen Graphs
- dosSantos_MICCAI2010
- Dna Based Computing
- Lecture 22
- Lecture 22
- SelfStabilizingSystems
- Discrete Maths