5.1.

13 QUESTIONBANK
UNIT-1
1. i write and explain the Truth Table for the following formula
(P Q) (Q R)
ii Differentiate between Universal Quantifier and Existential Quantifier, with the help of examples.
iii. Describe about NAND and NOR gates.
(Feb-2010)
2. i. Write and Explain the following:
i The rule of Universal Specification.
ii The rule of Universal Generalization.
ii. Describe about Dont Care Conditions.
iii. There are 100 people in a group. In this group, 23 people speak English, 26 people speak Telugu , 30 people
speak Hindi and 7 people speak both English and Telugu , 8 people speak English and Hindi and 10 people
speak English and Hindi .And 3 people speak all three languages. Find howmany people do not speak any
language. (Feb-2010)
3. i. Write and explain in thr Truth Tabble for the following formula. (July 2010)
(P Q) (Q R)
ii. Write the PRedicate Logic for the following statements:
Assume your own predicates.
i. Some apples are red.
ii. All flowers are yellow.
iii. There exists a fruit, which is green and tasty.
iii. Decribe about Disjunctive Normal Forms.
4. i. Determine the setsAand B, whereA-B = {1,3,7,11}, (July 2010)
B-A= {2,6,8} andA B = {4,9},
ii. Write and explain the Principle of Duality in set Theory.
iii. There are 50 students in a group. In this group there are ten students who passed only mathematics eight
students who passed only physics, six students who passed only chemistry. And there are four students
who passed both Mathematics and Physics, three students who passed both Physics and Chemistry and
two students who passed both mathematics and chemistry. Only one student passed all the three subjects.
Find how many students failed all the subjects.
5. i. Define: (i) Conjunction (ii) Disjunction
(iii) Converse (iv) Inverse
ii. Define disjunctive normal formand obtain the disjunctive normal formof p ( ~p ( p (q ~r)))
iii. IfA= {1,2,3,4,5} and R = {(1,1), (1,2),(2,3),(3,4), (4,5)} is relation onA, then compute (i) R2 (ii) R00
6. i. Showthat (~p ^ (~q^r)v (q^r)v(p^r)<=>r
ii. Obtain the sum of projcts canonical form (sum of products canonical form of ( ~p v ~q)>(~p ^ r)
iii. Define : (i) Recursion (ii) Primitive recursive function and show that addition is primitive recursive.
7. i. Show that (Jun 09)
(7P (7Q R) (Q R) (P R) R
ii. Obtain the principal disjunctive normal formof
Self-pity is our worst enemy and if we yield to it, we can never do anything good in the world.
- Helen Keller
47
MCA I Year, I Semester
P ((P Q) 7(7Q 7P).
iii. Find the transitive closure of relation R on X, where X = a,b,c and R = a,b , b,c , c,a

8. i. Define a conditional statement and construct the truth table for (P Q) (Q P). (Jun 09)
ii. Obtain the product-of-sums canonical form of (P Q) (7P RP.
iii. LetMR =






1 1 1
1 1 0
1 0 1
be the relation matrix on the set {a, b, c}.Find the relation matrices of ~
R , 2R
and
Ro ~
R .
9. i. Express the following statements in symbolic form:
Let s,t and u denote the following primitive statement: (Jan 08)
S:Partha goes out for a walk.
T:The moon is out .
U:It is snowing.
i. If it is snowing and the moon is not out ,then Partha will not go out for a walk.
ii. It is not the case that Partha goes out for a walk if and only if it is snowing or the moon is out.
ii. LetX={1,2,3,4,5,6,7}and R={<x,y>/x-y is divisible by 3}.
Show that R is an equivalence relation.Draw the graph of R.
10. i. Showthat the functions f and gwhich both are fromN X N to N given by f(x,y)=x+y and g(x,y)=xy are onto
but not one to-one. (Jan 08)
ii. Let D(x) denote number of divisors of x. Show that D(x) is primitive recursive.
11. With an equivalent formula for P (Q R)V(R P) (Jun 07)
which does not contain biconditional and conditional.
12. Let f: R R and g: R Rwhere R is the set of real numbers. Find fogwhere f(x)= x2-2 and g(x) = x+4.
(Jun 07)
13. Define/Explain
i. Conjunction and Disjunction (Jun 07)
ii. DNF,CNF,PDNF, PCNF. (May 06)
iii. Well-formed formula. Explain howmany is it generated. (Jan 05)
iv. Functionally complete set with examples (Feb 04)
14. Express the following statement in symbolic form using the propositions given below:
C: Rahul is a cricket player.
H: Rahul is a hard worker.
M: Rahul is amathematician.
Rahul is either a hard worker or a cricket player but not both. (Jan 07)
Smell is a potent wizard that transports you across thousand of miles and all the years you have lived.
- Helen Keller
48
MCA I Year, I Semester
15. S.T for any two sets A& B: (Jan 07)
i. A- (A B) =A-B
ii. (A) U (B) (AUB)
(A) (B) = (A B)
16. Prove or disprove whether the following is a tautology.
i. P (P (R P)) (Jan 07)
ii. (Feb 4, Jan 05)
iii. (Aug 04, Jun 07)
iv. (Apr 02)
v. (Jan 07)
vi. (Jun 07)
17. Obtain PDNF and PCNF of:
i. (Jan 07)
ii. (Jul 04), Jun 05,Aug04)
iii. (Jan 05,Feb 04)
iv. (Mar 03)
v. (Apr 02)
vi. (Jan 07,Jun 07)
18. ObtainDNF and CNF for
i. (Jan 07)
ii. (Jun 05)
iii. (Jun 07)
iv. (Jun 07)
v. (Jun 07)
19. Show the following equivalences:
i. (Feb 04).(Jan 07).
ii. (Jan 05, Aug 04, Jan 05, (Jul 04)
iii. (Aug 04 , (Jul 04)
iv. (Apr 02)
20. Express the following the statements in symbolic form. (May 06)
i. Aparna is intelligent but lazy.
ii. Kumar is not intelligent and not lazy.
iii. Babji is neither intelligent nor lazy
iv. Goutam is intelligent and not lazy.
21. Verify whether the following is a tautology or not (May 06)
UNIT-II
1. i. Prove the following by mathematical induction .
1.3+ 2.4 + 3.5 + ..+n(n+2) = ( n ) * ( n+1 ) * ( 2n+7 ) / 6
ii. Write and explain the DivisionAlgorithm. Give an example. (Feb-2010)
No human thing is of serious importance.
- Plato
49
MCA I Year, I Semester
2. i. State and prove the Pigeonhole Principle
ii. Describe the following:
i Inverse Functions ii Lattices. (Feb-2010)
3. i. Prove the following by mathematical induction. (July 2010)
12+32+52+....(2n-1)2 = (n)*(2n-1)*(2n+1)/3
ii. Write and explain the EuclideanAlgorithmGive an example.
4. i. Explain about the following functions. Give suitable examples. (July2010)
i. Onto Functions ii. One-to-One Functions
iii. Inverse Functions iv. Composite Functions
5. i. Define the terms : (i) Partial ordering (ii) LinearOrdering (iii) Lattice and drawtheHasse diagramrepresenting
the postive divisors of 36 (i.e. D36)
ii. Define : BooleanAlgebra. If B is BooleanAlgebra then showthat (a+b)=a;b for all a,bCB.
iii. i If f(x1,x2,x3) = m(0,1,2,5) is a three input function transformf into its canonical sum-of-products
form.
ii. If f(x1,x2,x3) = (0,2,4,5) convert f into its canonical product-of-sums form.
6. i. If (G,*) is a group then show that (July 2010)
(a*b)-1 = b-1*a-1 for all a a,b C G.
ii. Define : Cyclic group and show that every cyclic group is abeliam.
iii. Define: Parity check code and determine the code words for the parity check code (3,4).
7. i. Find the complements of every element of the lattice (S30, D). (Jun 09)
ii. Show that in any Boolean algebra B,
(i) a b a bc b(a c) (ii) a a'b (a b)
For all a, b, c B.
iii. Minimize the Boolean expression.
F (a, b, c, d) = (2, 3, 4, 7, 10, 11, 12, 15)
8. i. Define a semigroup and a free semigroup generated by an alphabet. (Jun 09)
ii. Define minimum distance of a code. Find the minimum distance of the code
C= {<0, 0, 0, 0>, <0 1, 1, 0>, <1, 0, 1, 0>, <1, 1, 0, 0>}
iii. Let H be a k x nmatrix with entries 0 and 1. Then the set of words x = <x1, x2, 000, xn> which belong to the
set C = {x% (x . Ht = 0) mod 2} is a group code under the operation .
9. i. Use the Karnaugh map representation to find a minimal sum of products expression of the following
function: f(a,b,c)= (0,2,3,7). (Jan 08)
ii. Show that if (a*b)2=a2
*b2 for a and b in a group G, then a*b=b*a.
10. i. Let S={1,3,7,9} and G=(S,multiplicationmod 10). ShowthatG is a group.
ii. Consider the (3,9) encoding funcions
e(000)=000 000 000 e(100)=010 011 010
e(001)=011 100 101 e(101)=111 101 011
e(010)=010 101 000 e(110)=001 011 000
e(011)=110 010 001 e(111)=110 000 111
Find the minimumdistance of e. Howmany errors will e detect?
iii. Consider the (3,5) group encoding function e : B3
B5 defined by
e(000) =00000 e(100) =10011
e(001) =00110 e(101) =10101
The price good men pay for indifference to public affairs is to be ruled by evil men.
- Plato
50
MCA I Year, I Semester
e(010) =01001 e(110) =11010
e(011) =01111 e(111) =11100
Decode the following words relative to a maximum likelihood decoding Function (Jan 08)
ii) 00111(i) 11001 (ii) 00111
11. Define Hasse diagram. (Jun 07)
12. Define Boolean algebra. (Jun 07)
13. Obtain the sum of products canonical form:
(Jun 07)
14. Prove that 1 is the only complement of 0 in lattice. (Jun 07)
15. P.T the following lattice is not modular (Jun 07)
16. If G is group such that (a b)n = an bn for three consecutive integers then ab= ba (Jun 07)
17. What is a partial ordering relation ? Let X={1,2,3,..7} and R={ (X,Y)/(X-Y) is divisible by 3} in X. show
that R is an equivalence relation. (Jun 07)
18. Obtain product of sums canonical formof the Boolean expression X1 * X2using four variables X1, X2,X3&
X4. (Jun 07)
19. Using karnaugh solve the following Boolean function.Also draw the circuit diagram after simplification.
f ( a, b, c, d) = (5,7,10,13,15). (Jun 07)
20. Let n be a positive integer and Sn be the set of all divisors of n. Let n=30.
Let D denote the relation of division .such that for any a,b, aDb iff a divides b.
Drawthe lattice <S 30 ,D> (Jan 07)
21. Define Lattice and name the different types of lattices. (Jan 07)
22. The cube representation of a switching function is given below: (Jan 07)
Write the Boolean expression for this function and then simplify it by using laws of Boolean algebra.
23. Use karnough map and find minimum sum of products for
f(w, x, y, z)= (0,1,2,3,13,15) (Jan 07)
It was such a lovely day I thought it was a pity to get up.
- W. Somerset Maugham, "Our Betters", 1923
51
MCA I Year, I Semester
24. Obtain canonical sum of product and product of sum for the expression (Jan 07)
f ( a,b,c)= ab + bc
25. State and prove De Morgans laws in Boolean algebra. (Jan 07)
26. Define the terms and give an example (Jan 07)
i. Semi group
ii. Group
27. Prove that the set {1,2,3,4,5,6} is finite abelian group of order 6 undermultiplicativemodul 7. (Jan 07)
28. Show that in any Boolean algebra
(a + b) (a+ c) = ac + ab = ac + ab +bc. (Jan 07)
29. S.T a lattice < L , , *> is distributive iff (a*b) (b* c) (c* a) =
(a b) * (b c) * (c a) a ,b ,c L. (May 06)
30. Obtain the product of sums canonical form of the expression [( X 1+ X2) (X3 X4 )] and draw the circuit.
(May 06)
31. Obtain the sum of products canonical form and draw the circuit of the Boolean expression
(X 1 X2 ) (X1
1 *X1
3). (May 06)
32. Use karnaughmap and simplify the function f (a, b, c, d)= (1, 3, 5, 7, 9). (May 06)
UNITIII
1. i Determine the number of postive integers n where 1<=n<=100 and n is not divisible by 2,3 or 5
ii. Describe about Rook Polynomials. (Feb 2010)
2. i. LetA={1,2,3,4} and B={u,v,w,x,y,z}. Howmany one-to-one functions f:A>B satify none of the following
conditions? Feb 2010
C1 : f(1) = u or v C2 : f(2) =w
C3 : f(3) =wor x C4 : f(4) x,y, or z
3. i. State and prove Principal of Inclusion and Exclusion. (July 2010)
ii. Find the number of derangement of 1,2,3,4.
iii. Briefly explain about Rook Polynomials.
4. i. Howmany integer solutions are there for the following equation, where c1, c2, c3,c4 > = 0. (July 2010)
c1+c2+c3+c4 = 25
ii. Find the co-efficient of x5 in (1 2x)-7.
iii. Discuss about Exponential Generating Function.
5. i. State and prove Pascals identity. (July 2010)
ii. Find the number of integral solutions to
x1+x2+x3+x4+x5=16
iii. A farmer buys 4 cows, 2 goats and 5 ducks from person who has 7 cows, 5 goats and 8 ducks. Find the
number of choices the farmer has.
6. i. Twelve persons are made to sit around a round table. Find the number of ways they can sit such that 2
specified persons are not together.
ii. Among the integers 1 to 200, find the number of integers that are
Art is merely the refuge which the ingenious have invented, when they were supplied with food and women, to escape the
tediousness of life.
52
MCA I Year, I Semester
i divisible by 2 or 5 or 9
ii. not divisible by 5
iii. Find the coefficient of abc2 in the expansion of (2a-b-c)4 July 2010)
7. i. In how many ways can 10 people be seated in a row so that a certain pair of them are not next to each
other? (Jun 09)
ii How many terms are there in the expression (2x 2y 5 z)8 ? Find the coefficient of x3 y3 z2 in it.
iii. Derive a formula for (n), where n is a natural number and is Eulers phi function, using the principle
of inclusion and exclusion.
8. i. In how many ways can a 8-letter word with 3 different vowels and 5 different consonants (in English
alphabet). How many of these begin with b and end with c? (Jun 09)
ii. Out of 1000 students 200 students can speak Hindi and 50 can speak English, while only 20 can speak both
Hindi and English. Howmany speak neither Hindi nor English.
iii. State and prove Pascals Identity.
9. i. A chain letter is sent to 10 people in the first week of the year. The next week each person who received
a letter sends letters to 10 new people and so on. How many people have received letters after10 weeks
and at the end of the year ? (Jan 08)
ii. Six distinct symbols are transmitted through a communication channel. A Total of 12 blanks are to be
inserted between the symbols with at least 2 blanks between every pair of symbols. In howmany way can
the symbols and blanks be arranged ?
iii. Determine the number of terms in the expansion of (x1+x2+x3+x4+x5)10. Also find the coefficient of x1
2x3x4
3x5
4
in the above expansion.
10. i. In how many ways can 23 different books be given to 5 students so that 2 of the students will have 4
books each and the other 3 will have5 books each? (Jan 08)
ii. Howmanyways are there to distribute 10 balls into 6 boxes with atmost 4 balls in the first 2 boxes (that is,
if xi=the number of balls in box i, then x1+x2 4) if all the balls are indistinguishable ?
iii. Compute howmany integers between 1 and 1000 are not divisible by 2,3,5 or 7.
11. i. Show that A B A B=A (Jun 07)
ii. X={1,2,3},A={a,b}. Howmanymappings are formed?
12. Consider the letters of the alphabet DELHI. Howmanywords of length 7 can be formed fromthis alphabet
with repetitions of the letters are allowed? (Jun 07)
13. i. If 1, 2,................. p belong to a commutative ringAand n is a positive integer then prove that
(1+2,+.................+ p)n= [ n ] 1
n1 2
n2
.p
np.
n1 n2 ...np
ii. When (2x1-3x2+5x3)6 is expanded, the coefficient of x1
3x2x3
2. (Jun 07)
14. Prove that (t) =
N
J
W
0
( j ).(t - 1)j (Jun 07)
15. Showthat g (n, k) = (n/n-k) (n-k/k). (Jun 07)
16. Find the number of 4 permutations of the letters of the word UNIVERSAL. (Jun 07)
The best and most beautiful things in the world cannot be seen or even touched. They must be felt within the heart.
- Helen Keller
53
MCA I Year, I Semester
The time to repair the roof is when the sun is shining.
- John F. Kennedy M
17. Prove that the size of each of these sets that is the cardinality of each of there sets is
[m]n=m(m-1)(m-n+1) (Jun 07)
18. Find the coefficient of x3y7 in (x+y) 10. (Jun 07)
19. Solve the recurrence relation
an+6an-1+99an-2=3 given a0=0&a1=1 (Jun 07)
20. Define partial function. Give an example. (Jan 07)
21. Solve the recurrence relation.
Fn=Fn-1+Fn-2 given F0-1, F1=1. (Jan 07)
22. What is a primitive recursive function? Show that g (x, y) =x*y is primitive recursive. Also find g(x , y)
recursivelywhere x=3&y=3. (Jan 07)
23. Solve an=an-1+1/n(n+1),a0=1 by substitution. (Jan 07)
24. Howmany different passwords are there that involve 1,2,or 3 letters followed by 1,2,3 or 4 digits?(Jan 07)
25. There are 30 females and 35males in a junior classwhile there are 25 females and 20males in the senior class.
In how many ways can a committee of 10 be chosen for a college technical fest so that there are exactly 5
females and 3 juniors on the committee? (Jan 07)
26. Determine the coefficient of x5 in(a+bx+cx2)10 . (Jan 07)
27. Find the coefficient of x1
2x3x4
3x5
4 in (x1+x2+x3+x4+x5)10 (Jan 07)
28. In howmany ways can the letters { 5.a,4.b,3.c} be arranged so that all the letters of the same kind are not in
a single block. (Jan 07)
29. How many integers between 105 and 106 have no digits other than 2,5 or 8? (Nov 06)
30. In how many ways can we choose 3 out of 3n successive positive integers so that their sum is divisible by
3? (Nov 06)
31. Howmanyways are there to distribute 10 balls into 6 boxeswith atmost 4 balls in the first 2 boxes if the balls
are indistinguishable? (Nov 06)
32 Determine the no .of terms in the expansion of (x-7y+3z-w)25. (Nov 06)
33. State that for n 2,
C (n11)-2c (n12) +3c (n13)(-1) n-1nc (n1n) =0 (Nov 06)
34. Show that for n 0
C(n10)2+c(n11)2++c(n1n)2= c(2 n1n). (Nov 06)
35. Howmany integral solutions are there of x1+x2+x3+x4=20 if
1 x1 6, 1 x2 7, 1 x3 8, 1 x4 9 (Nov 06)
54
MCA I Year, I Semester
If you wish to be brothers, let the arms fall from your hands. One cannot love while holding offensive arms.
- Pope Paul VI
36. ThreeAmericans, threeMexicans and three Canadians are to be seated in a row. Howmany ways can they
be seated so that no two country-men sit together. (Nov 06)
31. Find the value of Fun(1024,729) where the Fun (m,n) is recursively defined as follows.
Fun(0,n)=n
Fun(a,b)=Fun(b,a)
Fun(a,b)=Fun(amod b,b ) if a>b. (May 06)
32. State that the function f(x,y)=x+y is primitive recursive. (May 06)
UNIT-IV
1. i Solve the following recurrence relation, where n>=1, and a2 = 98. (Feb 2010)
an=7an-1
ii. Explain about Non-homogeneus Recurrence Relations.
2. i. Write and explain the procedure Binary Search. (Feb 2010)
ii. Describe about Algegraic Structures.
iii. Differentiate between Isomorphism and Homomorphism.
3 i Find the Recurrence relation with initial condition ,that uniquely determine the following geometric
progression. (Jul 10)
2,10,50,250,1250..
ii Solve the following recurrence relation ,where n>=1 and a0=7.
An-an-1= 3n2
iii Briefly explain about Divide and Conquer approach.
4. i Explain about the following : (Jul 10)
i Characteristic Equation
ii. Algebraic Structure
iii Abelian Group
iv Cyclic Group.
5. i. Define the termi) Graph ii) Simple graph and Show that the maximumnumber of edges in a simple graph
is n(n-1)/2. (July 2010)
ii Define :Isomorphism of graphs and show that the following graphs G and G are Isomorphic
55
MCA I Year, I Semester
iii. Define the terms i) Tree ii) Binary Tree and show that any non-trivial tree has at least one vertex of
degree one
6 i . Suppose that a tree T has N1 vertices of degree 1,2 vertices of degree 2;4 vertices of degree 4.Find N1
ii. Find the maximum possible height of a binary tree with 13 vertices and draw the graph of the tree
iii. Find network of minimal cost (i .e minimal spanning tree) for the cities (July 2010)
in the figure given below.
7. i. If G = (V, E) is a non-directed graph withV = { v1, v2,, vn}then prove that
n
i 1
deg ( i) = 2%E%. If G is a
k-regular graph then prove that kn = 2 %E%.
ii. Show that the following Graphs G and G are isomorphic.
b
a
c
d
G
p q
s r
G
iii. Prove that a simple non directed graph G is a tree if any only if G is connected and contains no cycles.
8. i. If G is a nontrivial tree then prove that G contains at 2 vertices of degree 1. (Jun 09)
ii. Find 3 spanning trees from the following graph by destruction of cycles.
c
d
a b
e
Do thou restrain the haughty spirit in thy breast, for better far is gentle courtesy.
- Homer
56
MCA I Year, I Semester
iii. Find the minimal spanning of tree of the following connected weighted graph.
9. i. Generalized Peterson Graph P(n,k) consists of an outer n cycle, n spokes incident to the vertices of
this n cycle and an inner n cycle attached by joining its vertices to every K- th spoke . Prove that
P(n,k) is isomorphic to P(n, n k)
ii. Find a depth first search spanning tree for the given graph. (Jan 08)
10. i. What is a binary search tree ? Build a binary search tree for the sequence of numbers 17,23,4,7,9,19,45,6,2,37
and 99. (Jan 08)
ii. Explain Kruskals algorithmfor finding a minimal spanning tree. Apply the same to obtain aminimal
spanning tree from the following graph: (Jan 08)
7 b
11. Define graph and mixed graph. (Jun 07)
12. Show that the following graph G and G1 are isomorphic.. (Jun 07)
Do thou restrain the haughty spirit in thy breast, for better far is gentle courtesy.
- Homer
57
MCA I Year, I Semester
13. Show that a graph G is a tree iff G has no cycles and (E) = (Jun 07)
14. Drawthe parsing tree of the formula [(p->(7Q))->(p^Q)]. (Jun 07)
15. Determine a telephone network of minimal cost for the cities in the given figure. (Jun 07)
16. Derive a formula for the maximumpossible height of a complete directed tree of degree k with n vertices
(Jan 07)
17 Show that if H(n) is the maximum possible height of a height balanced binary tree with n vertices then it is
in 0(log n). (Jan 07)
18. Prove that an isomorphic to the given digraphs (Jan 07)
19. Show that the sum of the out-degree and the in-degree of a node v is equal to total degree, for a given
digraph
20. Define
i. tree
ii. Binary tree
iii. complete graph
iv. pseudograph and give the examples. (Jan 07)
21. Using the prims algorithm fine the minimum spanning tree of the graph (Dec 06)
How vain it is to sit down to write when you have not stood up to live.
- Henry David Thoreau
58
MCA I Year, I Semester
I met a hundred men going to Delhi and everyone is my brother.
- Indian Saying
UNITV
1. i Explain about the following, with the help of examples. (Feb 2010)
i Spanning Subgraph ii Isomorphic Graphs
ii Write and explan the Kruskals Algorithm.
2. Explain about the following. (Feb 2010)
Give suitable exaple
a) Euler example b) Planner Graph
c) Hamiltonian Path d) Spanning Tree
3 i. Explain about HamitonianCycle. Give an Example . (Jul 10)
ii Explain when two graphs are said to be isomorphic,Give an example.
iii Write and explain the PrimsAlgorithm.
4. Explain about the following. Give suitable examples (Jul 10)
i Regular Graph.
ii Bipartite Graph
iii Graph Colouing
iv Hypercube
5. i Show that the following graph G is Planer
ii Show that the graph G given below is Eulerial and find an Eulerian circuit in :
iii. Find three distinct Hamiltonian circuits in the weighted graph given below .Also find their weights
59
MCA I Year, I Semester
To express the most difficult matters clearly and intelligently, is to strike coins out of pure gold.
- Geibel
6. i. If a graph G has more than two vertices of odd degree, then show tat there can be no Euler path in G.
ii Show that every tree with 2 or more verticles is 2-chromatic.
iii. Find the chromatic number of the following graph G:
7. i. State and prove Eulers formula for connected plane graphs. (Jun 09)
ii. Show that K3, 3 is non planer.
8. i. Prove that a non directed multi graph has an Eulerian path if and only if it is connected and has 0 or exactly
2 vertices of odd degree. Jun 09)
ii. Determine the chromatic number of the following graph.
9. i. State the conditions for a nondirected multigraph to have an Euler path and Euler circuit. (Jan 08)
ii. Using Grinbergs theoremdetermine whether the graph with regions of degree 5, 8 and 9 with exactly one
region of degree 9 is Hamiltonian or not.
iii. What is the chromatic number of a cycle and a tree ?
10. i. With the help of Kempe Chain argument, show that a planar graph G with less than 30 edges is 4
colorable. (Jan 08)
ii. At a certain chemical company, the owner has received three shipments that contain a total of seven
different chemicals. The nature of these chemicals is such that for all 1did5, chemical i cannot be stored
in the same storage compartment as chemical i + 1 or chemical i + 2. Determine the smallest number of
separate storage compartments needed to safely store these seven chemicals.
11. If Gisagroup s.t (ab)n= an bn for three consecutive integers ,s.t ab=ba (Dec 06)
60
MCA I Year, I Semester
Smell is a potent wizard that transports you across thousand of miles and all the years you have lived.
- Helen Keller
12. Show that every simple planar is 5 colourable. (Dec 06)
13. DefineWalk, trail (Dec 06)
14. Compare Euler graph and Hamiltonian graph (Dec 06)
15. Prove that a complete graph kn is planar iff n4 (Dec 06)
16. Check for Euler circuit and euler path for a given graph. (May 06)
17. Prove that every tree with two or more vertices is 2- chromatic (May 06)
18. Write short notes on (May 06)
i. Euler graph
ii. Four color theorem
iii. Flow in the transport network
iv. Max flowmin cut theorem
19. S.T If G is a connected planar graph then : (Dec 06)
|V| -| E | +|R| = 2.
20. Find the chromatic number of (Dec 06)
i. Cycle
ii. Tree