0 Up votes0 Down votes

140 views11 pagesOct 30, 2012

© Attribution Non-Commercial (BY-NC)

DOC, PDF, TXT or read online from Scribd

Attribution Non-Commercial (BY-NC)

140 views

Attribution Non-Commercial (BY-NC)

- Data Structure
- MC061– 01_computer_programming_in_C_language
- MC0063–01_discrete_mathematics
- SMU_MCA NEW FALL 2010_Discrete Mathematics(MC0063)_SEM_1_ASSIGNMENTS_set1
- bc0043
- Discrete Mathematics
- MC0063 August 2010 Q & Ans
- BC0039 Discrete Mathematics
- ERDDataModeling
- BC0038
- BC0038 Data Structure Using C
- BC0039 Discrete Mathematics
- BC0042
- BC0042 Operating Systems
- BC0043
- BC0045
- BC0046 Microprocessor
- BC0040
- Descrete Math
- BC0038 Data Structure Using C

You are on page 1of 11

Ajeesh Moidutty Roll No: 510829270 BCA 2nd Semester 4 BC0039 5 DISCRETE MATHEMATICS

Ans: Solution:

Solutions :

Solutions :

2. If f is a real valued function find the domain of x x a a i y = fffffffffffffffffffffffffffffffffffffff ii y = fffffffffffffffffffff 2 2 x @5x + 6 1+x Ans: Solution:

3. Find the nth term of the following series 1 1 + fffffffffff + ffffffffffffff+ 2.5 5.8 8.11 Solution: The given series is neither in A.P., G.P. nor in H.P. This is special type of series. In this series in each term numerator is 1 and in denominator the corresponding figures are 2.5, 5.8, 8.11 As before the first figure in each term viz 2, 5, 8. forms an A.P. An A.P. nth term

f1fff ff fff ff

where is first term, d is common difference. Now nth term of viz. 2, 5, 8,.... is = 2 + (n -1) 3 = 3n 1 Now, Second, figure in each term viz., 5, 8, 11, forms an A. P. whose nth term is = 5 + ( n -1 ) 3 = 3n + 2 Hence the nth term of given series is

3 3 3 3 2

` a2 nfff+ffffffffffffff ff ff 1 ff f

ii)

(induction hypothesis)

5. Briefly explain in your own words with example the principle of inclusion and exclusion. Ans: Principle of Inclusion and Exclusion: For any two sets P and Q we have

This can be extended to any finite number of sets, which is known as principle of inclusion and exclusion, given following. If A1, A2, A3,An are finite sets, then

We will understand by this example: Determine the number of integers between 1 to 250 that are divisible by any of the integers 2, 3, 5 and 7. Solutions:

Among the permutations of {1, 2, 3, , n}, there are some (called derangements), in which none of the n integers appears in its natural place. In other words: (i1, i2, .in) is a derangement if i1 !=1, i2 != 2 and In != n. If Dn denote the number of derangements of {1, 2, 3, , n}, then for n = 1, 2, 3, we have, D1 = 0, D2 =1 , D3 =2 (that is, the only derangements of (1,2,3) are (2,3,1) and (3,1,2)). The formula for Dn for any positive integer n

Let U be the set on n! Permutations of {1, 2, 3, ., n}. For each i, let Ai be the permutation (b1, b2, ., bn) of {1, 2, 3, ., n} such that bi = i.

6. Explain the problem of tower of Hanoi in your own words. Ans: The problem of tower of Hanoi Given a tower of eight disks, initially stacked in decreasing size on one of three pegs. The objective is to transfer the entire tower to one to the other pegs, moving only one disk at a time and never moving a larger on to smaller (these rules are called Lucas Rules).

Let Tn be the minimum number of moves that will transfer n disks from one peg to another under Lucas rules. Then clearly T0 = 0, since no moves are needed to transfer a tower of n = 0 disks. By observation, T1 = 1, T2 = 3

Now transfer the top disks to the middle peg, then move the third, then bring the other two onto it. So we get T3=7 = 2.3 + 1 = 2 T2 +1. Induction Hypo: Assume for n-1 disks. That is, Tn-1 =2. Tn-2 + 1. Suppose that there are n-disks. We first transfer the (n-1) smallest disks to a different peg. It requires Tn-1 moves. Then move the largest ( It requires one move.), and finally transfer the (n-1) smallest disks back onto the largest ( it requires another Tn-1 moves.).

We must move the largest disk. When we do, the n-1 smallest disks must be on a single peg, and it has taken at least Tn-1 moves to put them there ( we might move the largest disk more than once). After moving the largest disk for the last time, we must transfer the n-1 smallest disks (which must be again on a single peg) back onto the largest.

- Data StructureUploaded byraunak19
- MC061– 01_computer_programming_in_C_languageUploaded byssharma79
- MC0063–01_discrete_mathematicsUploaded byssharma79
- SMU_MCA NEW FALL 2010_Discrete Mathematics(MC0063)_SEM_1_ASSIGNMENTS_set1Uploaded bykiller1
- bc0043Uploaded byamant
- Discrete MathematicsUploaded byAmit Jain
- MC0063 August 2010 Q & AnsUploaded byabhish9k
- BC0039 Discrete MathematicsUploaded byNaz Ahmed
- ERDDataModelingUploaded byAshish Chowdhary
- BC0038Uploaded bygurugabru
- BC0038 Data Structure Using CUploaded bygurugabru
- BC0039 Discrete MathematicsUploaded bygurugabru
- BC0042Uploaded bygurugabru
- BC0042 Operating SystemsUploaded bygurugabru
- BC0043Uploaded bygurugabru
- BC0045Uploaded bygurugabru
- BC0046 MicroprocessorUploaded bygurugabru
- BC0040Uploaded byAmit Jain
- Descrete MathUploaded byajtt38
- BC0038 Data Structure Using CUploaded byJoy Bagga
- Solved, BC0037 Spring Drive AssignmentUploaded byArvind K
- BC0037Uploaded byrzso
- Answer BC0037 C++Uploaded byPartha Roy
- BC0038 Spring Drive Assignment 2012Uploaded byshanvi09
- BC0037 - Programming Using C++Uploaded byNadeem Mohammed
- BC0038-Data Structures Using C-MQPUploaded byari4uonly
- Model Question Paper BC0038 NewUploaded byari4uonly
- BC0039 - Discrete MathematicsUploaded byparshant_jain21
- SEM 2 BC0039 Discrete MathematicsUploaded byneeraj61289
- BC0043-Computer Oriented Numerical MethodUploaded byPrashant Puthran

- Etica in AfaceriUploaded byBogdanAtasiei
- Sharpless Asymmetric Epoxidation.pptxUploaded byjaanabhenchod
- Bab 5Uploaded byIndra Kusuma
- Changes in the 2011 Bar ExaminationUploaded byPot Chek Ü
- GSTR 9 and GSTR 9CUploaded byVeeresh M S
- 3._Wee,_C._H._(1995)._Managing_change._Perspectives_from_Sun_Tzu's_Art_of_War[1].pdfUploaded byDiana Chinchilla Angel
- Social enterprises.docUploaded bysankum7578
- Motivation : Motivation May Be Regarded AsUploaded byUdit Kumar
- Preparations Needed for Performing Stravinsky OctectUploaded byjesusmaelo
- Inside Arthur Andersen - Shifting Values, Unexpected ConsequencesUploaded byapi-3822182
- qi_88.pdfUploaded bynambaccuc
- DEA 1500 NotesUploaded byJean Kwon
- Leading the RevolutionUploaded byalhoholicar
- new finalUploaded byapi-254329199
- Ingrid Kurz: Scribe or Actor?Uploaded byLilla Tatai
- SMITH_The Way Things AreUploaded byRuben
- 231680__908239058Uploaded byanilbarik
- Report BodyUploaded byomer04
- luke11Uploaded byLuke L
- Adverse PossessionUploaded bySellappan Rathinam
- Distribution of Manganese, Iron, Copper, Lead and ZincUploaded byAwan Widhodho
- January 2013 BulletinUploaded bypeb1984
- In Vitro Propagation of Cryptocoryne Ferruginea EnglerUploaded byJuan Medina Sanchez
- MM320 Assignment 1 2011Uploaded byLana Roelandts
- BOSS_Medard_-_Existential Foundations of Medicine and Psychology-Jason Aronson (1983)Uploaded byPedro Milanesi
- Karl Anderson Presents Natural Hygiene ClassicsUploaded byIan Steffa
- 7Uploaded byasjdkfjskaldjf;klasdf
- lec06Uploaded byShengFeng
- Analysis of Portal Frame BuildingUploaded byistiqlalsandi
- Zhang Et Al-2016-Advanced MaterialsUploaded byEduardo Silva

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.