Vous êtes sur la page 1sur 3

Code No.

: R5210502

R5

II B.Tech I Semester (R05) Supplementary Examinations, November/December 2011

MATHEMATICAL FOUNDATION 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) Construed a truth table for each of there (easy) compound statements i. (p q) (7p q) ii. p (7qV r) (b) Write the negation of the following statements. i. Jan will take a job in industry or go to graduate school. ii. James will bicycle or run tomorrow. iii. If the processor is fast then the printer is slow. (c) What is the minimal set of connectives required for a well formed formula. [8+6+2] 2. Prove using rules of inference or disprove. (a) Duke is a Labrador retriever All Labrador retriever like to swin Therefore Duke likes to swin. (b) All ever numbers that are also greater than 2 are not prime 2 is an even number 2 is prime Therefore some even numbers are prime. UNIVERSE = numbers. (c) If it is hot today or raining today then it is no fun to snow ski today It is no fun to snow ski today Therefore it is hot today UNIVERSE = DAYS. [5+6+5] 3. (a) Determine whether the following relations are injective and/or subjective function. Find universe of the functions if they exist. i. A = {v, w, x, y, z} B = {1, 2, 3, 4, 5} R = {(v,z),(w,1),(x,3),(y,5)} ii. A = {1, 2, 3, 4, 5} B = {1, 2, 3, 4, 5} R = {(1,2),(2,3),(3,4),(4,5),(5,1)} 1 of 3

Code No. : R5210502

R5
(b) If a function is dened as f(x,n) mod n. Determine the i. Domain of f ii. Range of f iii. g(g(g(g(7)))) if g (n) = f(209, n).

[8+8]

4. (a) o is operation dened on Z such that aob = a + b - ab for a, b Z. Is the operation o a binary operation in Z? If so, is it associative and commutative in Z? (b) If G is the set of all positive rational numbers, then G is an abelian group under the composition dened by o such that aob = (ab)/2 for a, b G with usual addition as the operation. Find i. the identity of (G,o) and ii. inverse of each element of G (c) If for a group G, f: G G is given by f(x) = x 2 , x G is a homomorphism, prove that G is abelian. [6+6+4] 5. (a) In howmany ways can we place 4 red balls, 4 white balls and 4 blue balls in 6 numbered boxes. (b) Howmany integers between 1 and 1,00,000 have the sum of digits equal to 18. [16] 6. (a) Solve an - 5an - 1 + 6an - 2 = 2n + n (b) Solve an - 8an - 1 + 16an - 2 = n4n . [8+8]

7. (a) Explain about the adjacency matrix representation of graphs. Illustrate with an example. (b) What are the advantages of adjacency matrix representation. (c) Explain the algorithm for breadth rst search traversal of a graph. [5+3+8] 8. Find which of the following multi graphs have Euler paths, circuits or neither. [16] Figure 8a, Figure 8b

2 of 3

Code No. : R5210502

R5

(a)

Figure 8a

(b)

Figure 8b

3 of 3