Will you please give me question paper for Msc Computer Science 1st semester examination of Andhra university in PDF format ?

here I am giving you question paper for Msc Computer Science 1st semester examination of Andhra university in PDF file attached with it ..

some questions are given below :

1. a). If φ denotes the empty net, write the elements of PP (φ) Where P denotes the power set
b). What is the lcm of 23 35 72 and 24 33 ?
c). State well-ordering property
d). State pegeon-hole principle
e). Find the number of divisors of the number 35 X 49
f). Write the characteristic equation of the recurrence relation an= -3an-1 – 3an-2 –an-3
g). What is the value of the post fix expression 7 2 3 * – 4 ↑ 9 3 / + ?

2. a). Show that the function f : Z+ X Z+ → Z+ defined by f (m, n) =(m + n –2)(m+n-1) + m is
2
one-one and onto
b). Show that (P → q ) ∩ (P → r) and (P ¬ q) → r are logically equivalent
3. a). Prove that ncr + ncr -1 = n+1cr
b). How many bit strings of length four do not have two consecutive 1s? Explain.

4. a). Find the number of solutions of e1+e2+e3 = 17, where e1,e2,e3 are integers such that
2 ≤ e1 ≤ 5, 3 ≤ e2 ≤ 6 and 4 ≤ e3 ≤ 7.
a). Find the solution to the recurrence relation an = 6an-1 –11an-2 + 6an-3 with a0 = 2, a1 = 5 and
a2 = 15.

5. a). Prove that, a connected multi graph has an Euler circuit if and only if each of its vertices
has even degree.

6. a). Prove that there are atmost mh leaves in an m-ary tree of height h
b). Describe the Prims algorithm for finding the minimum spanning tree of a graph.

8. a). Show that, if the language L is recognised by a non deterministic finite-state automation M0
then L is also recognized by a deterinistic finite-state automation M1.
b). Determine the language recognized by the finite-state automata M given by the following
state diagram

Attached Files

AU MSC computer science 1st sem paper.pdf (141.2 KB, 221 views)