Code No: 07A3BS04

Set No. 1

II B.Tech I Semester Regular Examinations, November 2008 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. (a) Prove that the proposition: (P Q) (P Q) is a Contingency. (b) Obtain the principal disjunctive normal form of the propositional formula: ( P R) (Q P). [8+8] 2. Write the quantiers of the following statements, where predicate symbols denotes, F(x): x is fruit, V(x): x is vegetable and S(x, y): x is sweeter than y. (a) Some vegetable is sweeter than all fruits (b) Every fruit is sweeter than all vegetables (c) Every fruit is sweeter than some vegetables (d) Only fruits are sweeter than vegetables. [16]

3. (a) What is a Poset? Draw the Hasse diagrams of all the lattices with 5 elements. (b) Let A = {1, 2, 3}, B = {a, b, c} and C = {x, y, z}. The relation R from A to B is {(1, b), (2, a), (2, c)} and the relation S from B to C is {(a, y), (b, x), (c, y), (c, z)}. Find the composition relation, R?S. [8+8] 4. (a) Explain, in detail, the algebraic systems: Endomorphism and Automorphism with suitable examples. (b) Prove that the set Z of all integers with the binary operation a * b = a + b + 1, Z is an abelian group. [8+8] 5. (a) How many anagrams (arrangements of letters) are there of {7.a, 5.c, 1.d, 5.e, 1.g, 1.h, 7.i, 3.m, 9.n, 4.o, 5.t}? (b) How many arrangements are there of 8.a, 6.b, 7.c in which each a is on at least one side of another a.? [8+8] 6. (a) Dene recurrence relation? show that the sequence {a n} is a solution of recurrence relation an = -3 an1 + 4 an2 if an = 1. (b) What is solution of the recurrence relation a n = an1 + 2 an2 with a0 = 2 and a1 =7? [8+8] 7. (a) Prove that a non-directed graph G is connected if and only if G contains a spanning tree.

1 of 2

Code No: 07A3BS04

Set No. 1

(b) Determine the spanning tree of the following gure7b using DFS. [6+10]

Figure 7b 8. (a) Suppose that we know the degrees of the vertices of a non directed graph G. Is it possible to determine the order and size of G? Explain. (b) Suppose that we know the order and size of a non directed graph G. Is it possible to determine the degrees of the vertices of G? Explain. [8+8]

2 of 2

Code No: 07A3BS04

Set No. 2

II B.Tech I Semester Regular Examinations, November 2008 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. (a) Show that the principal disjunctive normal form of the formula: P ( P (Q ( Q R))) is: ( 1, 2, 3, 4, 5, 6, 7). (b) Show that the principal conjunctive normal form of the formula: (P (Q R)) ( P ( Q R)) is ( 1, 2, 3, 4, 5, 6). [8+8]

2. Shows that the following set of premises are inconsistent using indirect method of proof: P Q, Q R, (P R), P R R. [16] 3. (a) Draw the Hasse diagram of: ( P(S), ), where P(S) is power set of the set S = {a, b, c}. (b) How many relations are there on a set with n elements? If a set A has m elements and a set B has n elements, how many relations are there from A to B? If a set A = {1, 2}, determine all relations from A to A. [6+10] 4. (a) Prove that the intersection of two submonoids of a monoid is a monoid. (b) Show that the function f from (N, +) to (N, *), where N is the set of all natural numbers, dened by f(x) = 2x x N . [8+8] 5. (a) In how many dierent orders can 3 men and 3 women be seated in a row of 6 seats if: i. ii. iii. anyone may sit in any of the seats the rst and last seats must be lled by men men and women are seated alternatively

all members of the same sex seated in adjacent seats. iv. (b) How many 6 digit numbers are there with exactly one 5? 6. Find a general expression for a solution to the recurrence relation an - 5 an1 + 6 an2 = n(n-1) for n>=2.

[8+8]

[16] 7. (a) If G is a non directed graph with 12 edges. Suppose that G has 6 vertices of degree 3 and the rest have degree less than 3. Determine the minimum no of vertices. (b) If we know the degree of vertices of a non-directed graph G. Is it possible? to determine the order and size of the G? Explain with example. [8+8] 8. (a) Write the rules for constructing Hamiltonian paths and cycles. 1 of 2

Code No: 07A3BS04

Set No. 2

(b) Write the dierence between Hamiltonian graphs and Euler graphs. [8+8]

2 of 2

Code No: 07A3BS04

Set No. 3

II B.Tech I Semester Regular Examinations, November 2008 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks 1. (a) Show the implication: (P Q) Q P Q (b) Show that the proposition: (P Q) ( P Q) Q is a tautology.[8+8] 2. (a) How does an indirect proof technique dier from a direct proof? (b) Using predicate logic, prove the validity of the following argument: Every husband argues with his wif e. X is a husband. T heref ore, X argues with his wif e. [6+10] 3. (a) Find the inverse of the following functions: i. f(x) =
10 73x 5

. (b) Draw the Hasse diagram for the relation R on A = {1, 2, 3, 4, 5}, whose relation matrix is given below: [8+8] 1 0 1 1 1 MR = 00111 0 1 1 1 1

ii. f(x) = 4e (6x+2)

00010 01 4. Consider the group, G = {1, 2, 4, 7, 8, 11, 13, 14} under multiplication modulo 15: (a) Construct the multiplication table of G. (b) Find the values of: 21, 71 and 111. (c) Find the orders and subgroups generated by 2, 7, and 11. (d) Is G cyclic [16]

5. (a) In how many ways can we draw a heart or spade from ordinary deck of playing cards? a heart or an ace? an ace or a king? A card numbered 2 through 10? (b) How many ways are there to roll two distinguishable dice to yield a sum that is divisible by 3? [8+8] 6. (a) Find a recurrence relation for number of ways to climb n stairs if the person climbing the stairs can take one,two,or three stairs at a time. (b) What are the initial conditions? How many ways can this person climb a ight of eight stairs? [8+8] 1 of 2

Code No: 07A3BS04

Set No. 3
[6+10]

7. (a) Write the algorithm for breadth rst search spanning tree. (b) Apply breadth rst search on the following gure 7b.

Figure 7b 8. (a) Let G = (V,E) be an undirected graph, with G1 = (V1,E1) a subgraph of G. Under what condition(s) is G1 not an induced subgraph of G? (b) For the graph shown in gure8b, nd a subgraph that is not an induced graph. [8+8]

Figure 8b

2 of 2

Code No: 07A3BS04

Set No. 4

II B.Tech I Semester Regular Examinations, November 2008 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE ( Common to Computer Science & Engineering, Information Technology and Computer Science & Systems Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. (a) Find the truth table for the propositional formula: (P Q) (Q P). (b) What is the compound statement that is true when exactly two of the three statements P, Q and R are true? (c) What is the negation of the statement: 2 is even and -3 is negative? [6+5+5] 2. (a) Prove or disprove the conclusion given below from the following axioms: All men are morta. M ahatma Gandhi is a man. Every mortal lives less than 100 years. M ahatma Gandhi was born in 1869. N ow, it is 2008. T heref ore, Is M ahatma Gandhi alive now? (b) Using proof by contradiction, show that 2 is not a rational number. [8+8] 3. (a) Consider the following recursive function denition: If x < y, then f(x, y) = 0; If y x, then f(x, y) = f(x-y, y) + 1. Find the value of f(5861, 7). (b) Let the relation R = {(1, 2), (2, 3), (3, 3)} on the set {1, 2, 3}. What is the transitive closure of R? [8+8] 4. (a) Let (S1, *1), (S2, *2) and (S3, *3) be semi groups and f: S1 S2 and g: S2 S3 be homomorphisms. Prove that the mapping of g o f: S 1 S3 homomorphism. (b) Prove that H = {0, 2, 4} forms a subgroup of (Z 6, +). 5. A group of 8 scientists is composed of 5 psychologists and sociologists: (a) In how many ways can a committee of 5 be formed? (b) In how many ways can a committee of 5 be formed that has 3 psychologists and 2 sociologists? [8+8] 6. (a) In how many ways can Traci select n marbles from a large supply of blue, red and yellow marbles( all of the same size) if the selection must include an even number of blue ones. (b) Determine the sequence generated by f(x) =1/(1-x) + 3x 7 -11. 7. (a) Prove that a tree with n vertices has exactly n-1 edges. (b) Show that graph G is a tree i G is connected and contains no circuits. [8+8] [8+8]

1 of 2

Code No: 07A3BS04

Set No. 4

(c) How many vertices will the following graph contain 16 edges and all vertices of degree 2. [6+6+4] 8. (a) Give an example of a connected graph G where removing any edge of G results in a disconnected graph. (b) Give an example for a bipartite graph with examples. (c) Discuss graph coloring problem with required examples. [4+6+6]

2 of 2