BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2015

Similar documents
BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination. June, 2018 ELECTIVE COURSE : MATHEMATICS MTE-02 : LINEAR ALGEBRA

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2016 ELECTIVE COURSE : MATHEMATICS MTE-1 3 : DISCRETE MATHEMATICS

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination ELECTIVE COURSE : MATHEMATICS MTE-02 : LINEAR ALGEBRA

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2014 ELECTIVE COURSE : MATHEMATICS MTE-06 : ABSTRACT ALGEBRA

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination

No. of Printed Pages : 8

ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2017

No. of Printed Pages : 8

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2013 ELECTIVE COURSE : MATHEMATICS MTE-12 : LINEAR PROGRAMMING

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2015 ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS

MTE-04 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2012 ELECTIVE COURSE : MATHEMATICS MTE-04 : ELEMENTARY ALGEBRA

L..4 BACHELOR'S DEGREE PROGRAMME MTE-05 : ANALYTICAL GEOMETRY

Bachelor s Degree Programme Discrete Mathematics (Valid from 1st January, 2013 to 31st December, 2013.)

MTE-10 BACHELOR'S DEGREE PROGRAMME (BDP)

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, Time : 2 hours Maximum Marks : 50 (Weightage : 70%)

BACHELOR'S DEGREE PROGRAMME

No. of Printed Pages : 12 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination 00 0 y 4 December, 2016

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2012 ELECTIVE COURSE : MATHEMATICS MTE-10 : NUMERICAL ANALYSIS

Unit I (Logic and Proofs)

MA Discrete Mathematics

BACHELOR'S DEGREE PROGRAMME MTE-05 : ANALYTICAL GEOMETRY

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)

HOMEWORK #2 - MATH 3260

BACHELOR'S DEGREE PROGRAMME (BDP PHILOSOPHY)

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination -June, 2012 MATHEMATICS MTE-3 : MATHEMATICAL METHODS

CS/IT OPERATING SYSTEMS

1. a. Give the converse and the contrapositive of the implication If it is raining then I get wet.

A L A BA M A L A W R E V IE W

MATH 363: Discrete Mathematics

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination June, 2017

Simplification by Truth Table and without Truth Table

Simplification by Truth Table and without Truth Table

Note : Attempt four questions in all. Questions No. 1 and 2

Propositional Logic. What is discrete math? Tautology, equivalence, and inference. Applications

Simplification by Truth Table and without Truth Table

PHYSICS PHE-14 : MATHEMATICAL METHODS IN PHYSICS-III

T h e C S E T I P r o j e c t

BACHELOR'S DEGREE PROGRAMME MTE-04 : ELEMENTARY ALGEBRA MTE-05 : ANALYTICAL GEOMETRY

BACHELOR'S DEGREE PROGRAMME Term-End Examination June, Time : 2 hours Maximum Marks : 50 (Weightage : 70%)

No. of Printed Pages : 7 BACHELOR OF SCIENCE (B.Sc.) Term-End Examination December, 2013 PHYSICS

Section 4.1: Polynomial Functions and Models

Unit i) 1)verify that [p->(q->r)] -> [(p->q)->(p->r)] is a tautology or not? 2) simplify the Boolean expression xy+(x+y) + y

PHE-5 : MATHEMATICAL METHODS IN PHYSICS-II Instructions : 7. Students registered for both PHE-4 & PHE-5 courses

MASTER OF ARTS (ECONOMICS) Term-End Examination December, 2012 MECE-001 : ECONOMETRIC METHODS

P a g e 3 6 of R e p o r t P B 4 / 0 9

AMTH140 Trimester Question 1. [8 marks] Answer

Math Final Exam December 14, 2009 Page 1 of 5

B.Sc. Examination December, 2015 CHE-01 : ATOMS AND MOLECULES AND CHE-02 : INORGANIC CHEMISTRY

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Fifth Semester. Computer Science and Engineering MA 2265 DISCRETE MATHEMATICS

NP and Computational Intractability

Tutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement

O CHE-1 : ATOMS AND MOLECULES

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points

More NP-Complete Problems

CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 Solutions

No. of Printed Pages : 8 I LSE-09(S)


VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur

Problem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.

CSCE 750 Final Exam Answer Key Wednesday December 7, 2005

Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?

OMT-101 : Preparatory Course in General Mathematics (Revised)

Final Examination 201-NYC-05 - Linear Algebra I December 8 th, and b = 4. Find the value(s) of a for which the equation Ax = b

Projects and Investigations to accompany Mathematics for Electrical Engineering and Computing

REVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms

2 hours THE UNIVERSITY OF MANCHESTER. 6 June :45 11:45

COMPLETENESS WI T H FINITE SYSTEMS OF INTERMEDIATE ASSERTIONS FOR RECURSIVE PROGRAM SCHEMES*

No. of Printed Pages : 8

BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination. June, 2017 ELECTIVE COURSE : MATHEMATICS MTE-08 : DIFFERENTIAL EQUATIONS

CS/MATH 111 Winter 2013 Final Test

Solutions. CS 2800 Fall 2017 Final exam Friday, December 8. NetID: 1. Modular arithmetic [9 pts]

Exam Practice Problems

Dec. 3rd Fall 2012 Dec. 31st Dec. 16th UVC International Jan 6th 2013 Dec. 22nd-Jan 6th VDP Cancun News

CONJECTURE OF KOTZIG ON SELF-COMPLEMENTARY GRAPHS

MATH 114 Fall 2004 Solutions to practice problems for Final Exam

BACHELOR OF SCIENCE (B.Sc.) Term-End Examination

NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S. B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION

Midterm Preparation Problems

Algorithms and Theory of Computation. Lecture 22: NP-Completeness (2)

(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.

BACHELOR OF COMPUTER APPLICATIONS (BCA) (Revised) Term-End Examination December, 2015 BCS-054 : COMPUTER ORIENTED NUMERICAL TECHNIQUES

Lecture #14: NP-Completeness (Chapter 34 Old Edition Chapter 36) Discussion here is from the old edition.

P a g e 5 1 of R e p o r t P B 4 / 0 9

Discrete Mathematics

Zeros and Roots of a Polynomial Function. Return to Table of Contents

MAT 145. Type of Calculator Used TI-89 Titanium 100 points Score 100 possible points

176 5 t h Fl oo r. 337 P o ly me r Ma te ri al s

Math Fall Final Exam. Friday, 14 December Show all work for full credit. The problems are worth 6 points each.

ACO Comprehensive Exam 19 March Graph Theory

Reexam in Discrete Mathematics

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

OH BOY! Story. N a r r a t iv e a n d o bj e c t s th ea t e r Fo r a l l a g e s, fr o m th e a ge of 9

Data Structures and Algorithms (CSCI 340)

SOME COMBINATORICS OF LOTTERIES. Shayle R. Searle. Biometrics Unit, New York State College of Agriculture and Life Sciences

Anna University, Chennai, November/December 2012

Solutions Key Quadratic Functions

Unit 1 Vocabulary. A function that contains 1 or more or terms. The variables may be to any non-negative power.

McGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60

Combinatorial Optimisation, Problems I, Solutions Term /2015

Transcription:

No. of Printed Pages : 8 I MTE-13 BACHELOR'S DEGREE PROGRAMME (BDP) Term-End Examination December, 2015 ELECTIVE COURSE : MATHEMATICS MTE-13 : DISCRETE MATHEMATICS Time : 2 hours Maximum Marks : 50 (Weightage : 70%) Note : Question no. 1 is compulsory. Answer any four questions from questions no. 2 to 7. Use of calculators is not allowed. 1. Which of the following statements are true and which are false? Justify your answer. 5x2=10 (a) -(p q)=-p v -q There exists a simple graph with degree sequence 7, 7, 7, 5, 5, 3, 3. an = an/2 + n, al = 0, where n is a power of 2, is a linear recurrence relation. (d) (e) The partition 4 + 3 + 3 + 1 is self-conjugate. The graph 11/4 5 is Eulerian. 2. (a) Express x5 in terms of falling factorials and hence evaluate S 5m for m = 0, 1, 2, 3, 4, 5. 5 MTE-13 1 P.T.O.

Prove that every tree is bipartite. Is the converse true? Justify. How many five digit numbers are composed of only even digits? 3. (a) Form the truth tables of (p v q) A r and p v (q A r) to verify whether (pvq)a-r -7.-pv(qn-r). Using mathematical induction, prove that 1 1 1 1 + - + - + + 2 - - 1 V n N. 4 9 n2 3 Find the solution of the recurrence relation an = 4 an _ + 5 an _ 2, ao = 0, al = 6. 4 4. (a) Solve the following recurrence relation : un = (n! n) un _ 1 for n 1 with up = 1. 3 Let,$ be a two element Boolean algebra with A, V and ' operations defined in it. Prove that x is also a Boolean algebra stating clearly the operations defined in it. 5 Determine if the following is a valid argument. Explain your conclusion. 2 Proposition : V x e R, x 3 > x2 2 > 0 Proof : V x e R, x x2 (x 1) > 0 (x 1) x3 x2 > 0 x 3 > x 2. MTE-13 2

5. (a) Find a recurrence relation for a n, the number of ways to arrange cars in a row with n spaces if we can use Maruti 800 or Tata Safari or Scorpio. A Tata Safari or Scorpio requires two spaces, whereas a Maruti 800 requires just one space. Assume that you have unlimited number of each type of car and we do not distinguish between 2 cars of the same type. 4 If Km, n for m, n?_ 2, is Hamiltonian, how are m and n related? Justify your answer. 3 Show that if 7 colours are used to paint 50 bicycles and each cycle is coloured with a single colour, at least 8 bicycles will have the same colour. 3 6. (a) A box contains 6 red and 4 green balls. Four balls are selected from the box at random. What is the probability that two of the selected balls will be red and two will be green? 3 Define vertex connectivity and cut vertex set of any graph G. Find the vertex connectivity and cut vertex set for the following graph : a MTE-13 3 P.T.O.

How many numbers from 0 to 759 are not divisible by either 3 or 7? 3 7. (a) Solve the following recurrence relation : an = 2an + 1 if n > 1 and NI = 0, using generating function technique. Also find a 5 using your answer. Is there a 4-regular graph on 7 vertices? If `yes', construct such a graph. If your answer is 'no', justify your answer. 2 Find the Boolean expression in the DNF form for the function defined in tabular form below : 3 x y z f(x, y, z) 1 0 1 1 0 1 0 0 1 1 1 1 1 1 1 0 0 0 0 1 1 1 1 1 0 1 0 0 0 0 MTE-13 4

tuiltict) 441 ki chl t1 91141 (Att.*. TrEff trftati til-elt, 2015 1;19441 xibrstoi :751W 11.t.-13:fkilW lard FITRI : 2 Wu affiiw-dv 3 i : 50 (()0 : 70%) 3/?-1 R. / qww..9ravref * JR7 #. 2 4 7 4" 4 ow WIT 3R.1 *AV / 47c-35dej TR-27/ arylift q-e g/ 1. PHrcirtgcl 4144 war 1:rm atur? 3Tcr4 371k ftz AT-4R I 5x2=10 () (p A q) = p V q (1.4) c1;11?. aript 7, 7, 7, 5, 5, 3, 3 etic, wo 1T9 W. t (TI) an = an/2 + n, ai = 0,,46 n, 2 lefta. t, 7T11 WEIATt I (V) 141-1749. 4 + 3 + 3 + 1 fkigilft t I (3) T'T K4, 5 aikeft t 2. () x5 W'Wet * Trql eeitil AT4R a* tits; m o, 1, 2, 3, 4, 5 S5 +1,t,t1ictoi *1177 I 5 MTE-13 5 P.T.O.

ZEFA:VXE ( ) 1f t I.4'zi-r. (ii) 11% 717 i4-0)1:1 W-A-R I 3 (-4.9411(r 1 TR e icn? 2 3. (*) (p v q) A -rap v (q A r) zit Hczllrcl chk4 rc-r (p V q) A r p v (q A r)r ii,k111i -4T4 I 3 (IN) Trrurtzr alrtritq gri 1 1 1 1 2--VneN. 4 9 n` (T ) T7* Triqm an.4an _ 1 -F5an _ 2, a0 =0, a 1 =6 vi W77 I 4 4. () (Si Ci77% TIW IT " (1 *AR : Uo = 1 n 1 * un = (n! n)un _ i 3 (1:4) 1TF #11-4 3l-444 Vtzt 41\41.4 -t fti irl A, V 3-1-N TrIbTrr ista. t x trkesid TcrEz cbk. ratg 1-11 T-41.4.41\41.4 I 5 (T) AtTiftff Pii &irtgo oci) -grrr -t 31Er4 Pitchti Tcrit*11-A7 I 2 MTE-13 6 *49. : V XE R,x3 >x2 R, x2 > 0 x2 (x - 1) > 0 (x - 1) x3 - x2 > 0 x3 > x2.

5. ( ) 5. era 800 All de.'tb-rft 7rr t n lc4i l tik 4 cr)r. - quo ki,t9eit an * I-Z-R Tui%Triwiz trr-a7 I R* UZI ki441 zff "RiTql 31147.4*UT -0-r-*-grTht 800 Q. clr1 *'t trft I 1TF #0.R atrek xrruc (*A *:1 titizll arftrrral Tr* ucnik tt 2 4)14 art t eirc m, n 2 * rc..r Km, n t, m 3 n rchti 514)1( ITIAHNU t? 3ltr4 3- 'Cr-4R I 3 turf eirc 50 Tri&O. 4Z cia 7 ii11 7.41T 1.4)041 11101 t -5F* tt 14 *4z Rhell t, 8 til*rchril irf.)111 I 3 "cr..4414 6 OM At 4 Tkc1 t Iw4 0411-ootil -5-11 4 rllrl t 1411, TErtterr Nireichoi? 3 I*01 ill NTT G 7rtli tv-ciovict) ti -coei xritvrem W-Au PHiCiRgo tii-swim atik -qftti ti -.00.4 wrff*if-a-l : 4 MTE-13 7 P.T.O.

(TT) o A 759 i+741 (-Itcsii 3 71T 7 A141TTN-d-? 3 7. () Alt) nab-flay 'I cbt 1 1-1(1 ci WAM- C*1 Arr-A7: an =2an _ 1 + 1 ZA 11?_ 1 3* ao = 0. 3374 3Tik a5 1-ft Tff Alf4R (w) -47ETT 7 TET 4-"ftegrff T9 01? ` ~ld i -ktrr TiT -4r-4.R zrr `.0-101 31-0. 3cit 1-R R (TT) iii(unmog -1:1 1:1ftITTREfffc * DNF VtzT oeiact, lid*tr-4 : 5 2 3 x y z f(x, y, z) 1 0 1 1 0 1 0 0 0 0 1 1 1 1 1. 1 1 0 0 0 0 1 1 1 1 0 0 0 0 0 MTE-13 8 2,000