Scribd
Upload
145 views

Dms Question Bank For Mid

This document contains a question bank covering various topics related to mathematics and computer science. It includes 20 questions on topics like expansions of binomial expressions, counting principles, recurrence relations, generating functions, graph theory concepts like planar graphs, Euler paths, minimum spanning trees, and determining if graphs are isomorphic. It also includes 13 multiple part questions related to sets, probability, surveys, and programming languages.

Uploaded by

Harika
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
145 views

Dms Question Bank For Mid

This document contains a question bank covering various topics related to mathematics and computer science. It includes 20 questions on topics like expansions of binomial expressions, counting principles, recurrence relations, generating functions, graph theory concepts like planar graphs, Euler paths, minimum spanning trees, and determining if graphs are isomorphic. It also includes 13 multiple part questions related to sets, probability, surveys, and programming languages.

Uploaded by

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

DMS QUESTION BANK FOR MID-2

Unit-3
1. Find the Coefficient of x9y3 in the expansion of (2x-3y)12
2. EXPAND (x+y)7
3. Find the Coefficient of x5y2 in the expansion of (2x-3y)7
4. xyz2 IN THE EXPANSION (2x-y-z)4
5. Suppose that 200 faculty members can speak French and 50 can speak
6. Russian ,while only 20 can speak both French and Russain .How many
faculty members can speak either French or Russian.
7. How many set of integers between 1 and 250 are not divisible by 2,3,5,or 7
8. How many set of integers between 1 and 1000 are not divisible by 2,3,5,or 7
9. Find |FU R| where |F| = 200, |R| = 50 and |F∩R| = 20

10.Among 18 students in a room, 7 study mathematics, 10 study science,


and 10 study computer programming. Also, 3 study mathematics and
science, 4 study mathematics and computer programming, and 5 study
science and computer programming. We know that 1student studies all
three subjects. How many of these students study none of the three
Subjects
11.A sample of 80 people revealed that 25 like cinema and 60 like Television
programmes. Find the number of people who like both cinema and
Television Programmes?

12. In a survey of students at Florida State University the following information


was obtained:
260 were taking a statistics course, 208 were taking a mathematics course,
160 were taking a computer programming course, 76 were taking statistics
and mathematics, 48 were taking statistics and computer programming, 62
were taking mathematics courses and computer programming, 30 were taking
all 3 kinds of courses, and 150 were taking none of the 3 courses.
i) How many students were surveyed?
ii) How many students were taking a statistics and mathematics course but
not a computer programming course?
iii) How many were taking a statistics course but not taking a course in
mathematics or in computer programming?
13.A certain computer centre employs 100 computer programmers out of 47
can program in FORTRAN ,35 in PASCAL and 23 can program in both
languages. How many can program in neither of these 2 languages
UNIT-4
1.Find the Generating Function of the sequence (1,1,1,1,1,1)
2. Find the Generating Function of the sequence (1,2,3,4…) in closed form of the sequence
3. Find the co-efficient of x32 in ( 1+ x5 + x9 )10
4. Find the coefficient of x9 in (1+X3+X8)10
5.Find the Generating Function for the sequence (1,-1,1,-1,1-1) in closed form
6.Find the generating Function of the sequence an={1/n!}
7.10 distinguishable dice are tossed and the 6 specified dice shows an even
number and the remaining 4 shows an odd number.
8. Find the Coefficient of x5 in (1-2x) -7

9. Find the coefficient of x23 ,x32 in (1+X5+X9)10


10.Find the coefficient of x25 in (x2+x3+x4+x5+x6)7
11.Solve the recurrence relation an=an-1+n2 where
a0=7 by using substitution method
12. Solve the Following Recurrence Relations by using
Substitution method an=an-1+3n where a0=1
13. Solve an=an-1 +n.3n given a0=1
14. Solve the following recurrence relation using generating function
Method a n – 7 a n-1 + 10 a n-2 =0 for n≥2.
15. Solve the following recurrence relation using Generating Function
a n – 6 a n-1 + 12 a n-2 -8 a n-3 =0 for n≥3.
16. Solve the following recurrence relation using characteristic roots equation
method
a n – 5a n-1 + 6a n-2 = 0, where a 0 = 2 and a 1 = 5.
17. Find the complete solution to the following In-homogeneous
recurrence relation
n
a n - 5a n-1 + 6a n-2 = 4 for n≥2.
18. Solve the following recurrence relations by substitution method.
a n = a n-1 + 3n 2 + 3n + 1 where a 0 = 1
19. Solve the following recurrence relation using Generating Function
a n – 7 a n-1 + 16 a n-2 - 12 a n-3 =0 for n≥3.
20. Solve the following In-homogeneous recurrence relation
n.
a n – 2a n-1 +a n-2 =2
21.Solve =for n≥ 2, a0 =2, a1 =5

22.

23.
24.

UNIT-5
1. Define a K – regular graph. Draw an example graph of 2 – regular graph and
3 – regular graph.
2. Find the chromatic number of the following graph.
i) K 41, 38 ii) K 6

3. CHECK WHETHER THE TWO GRAPHS ARE ISOMORPHIC OR NOT

4. Show that the following graphs are not isomorphic


5. If G is a connected planar graph with 6 edges and 4 vertices , find the
number of regions

6. Verify whether the following two graphs are isomorphic or not?

7. Define an Euler path and find Euler path for the given graph.

8. Apply Kruskal’s algorithm on the following graph and find the minimal
spanning tree and also find the cost of it.

9.
10.Using DFS and BFS method,Determine the spanning tree for the graph G with e as the root the tree

11.show that k5 is not planar

12.Find the degrees of the regions of the graph shown below


13.Suppose G is aconnected planar graph with 14 regions each of degree 4,find the number vertices is
in G

14.

15.which of the following graphs are traversable Eulerian or neither


16.

17.

18.

19.
20.

You might also like