Andhra University 2006 B.E Information Technology COMPUTER SCIENCE
Wednesday, 01 May 2013 08:05Web
Page 7 of 15
g(h(D)) Ê D
g(h(D)) Ç D = f
g(h(D)) Ç (B-D) ¹ f
38. Consider the set {a, b, c} with binary operators + and x described as follows:
+ a b c x a b c
a b a c a a b c
b a b c b b c a
c a c b c c c b
For example, a + c = c, c + a = a, c x b = c and b x c = a. provided the subsequent set of equations:
(a x x)+(a x y)=c
(b x x)+(c x y)=c
the number of solution(s) (i.e., pair(s) (x, y) that satisfy the equations) is
(a) 0 (b) one
(c) two (d) three
39. Let å = (a, b, c, d, e) be an alphabet. We describe an encoding scheme as follows:
g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11.
Let P i denote the i-th prime number (p one = 2)
For a non-empty string s = a 1...a n where every a i Î å , describe f(s) = Õ n i= 1p i g(ai). For
a non-empty sequence (< Sl…Sn>) of strings from å + , describe
h(
Which of the subsequent numbers is the encoding, h of a non-empty sequence of strigs ?
2 73 75 seven
2 83 85 eight
2 93 95 nine
2 105 107 10
40. A graph G = (V,E) satisfies | E | £ three | V | - 6. The min-degree of G is described as
min {degree (v)}. Therefore, min-degree of G cannot be
v Î V
3
4
5
6
41. Consider the subsequent system of linear equations
Notice that the 2nd and the 3rd columns of the coefficient matrix are linearly dependent. For how many values of a , does this system of equations have infinitely many solutions?
0
1
2
infinitely many
42. A piecewise linear function f(x) is plotted using thick solid lines in the figure beneath (the plot is drawn to scale).
I f we use the Newton-Raphson method to obtain the roots of f(x) = 0 using x 0, x one and x two respectively as initial guesses, the roots found would be
(a) 1.3, 0.6, and 0.6 respectively
(b) 0.6, 0.6, and 1.3respectively
(c) 1.3, 1.3, and 0.6 respectively
(d) 1.3,0.6, and 1.3 respectively
43. The subsequent is a scheme for floating point number representation using 16 bits.
| Earning: Approval pending. |
