Download JNTU Anantapur (JNTU Anantapur) Master of Computer Applications (MCA) 2019 May Reg-Supply 1st Sem 17F00101 Mathematical Foundations for Computer Science Previous Question Paper
MCA I Semester Supplementary Examinations May/June 2019
MATHEMATICAL FOUNDATIONS FOR COMPUTER SCIENCE
(For students admitted in 2017 & 2018 only)
Time: 3 hours Max. Marks: 60
Answer all the questions
*****
1
Using mathematical induction prove that 1
3
+ 2
3
+ 3
3
+ ? + n
3
=
n
2
( n + 1)
2
4
.
OR
2 With example, explain the properties of binary relations.
3 (a) State and prove Lagrange?s theorem.
(b) Write about group codes.
OR
4 Find all the cosets of the cyclic subgroup H = {id, (1 2)} of the symmetric group S
3
.
5 With example, explain the rules of sum and product.
OR
6 What is a recurrence relation? Solve the recurrence relation T(n) = 2T(n/2) + n for n > 1 and
T(1) = 1.
7 With example, explain about graph traversal techniques.
OR
8 What is Hamiltonian circuit? Check whether the following graph has Hamiltonian circuit or not.
9 What is binary search tree? Write algorithms to insert and remove a node in binary search tree.
OR
10 With the help of following graph, explain Prim?s algorithm.
*****
B
A
C
D
E
F
B
A
C
D
E
F
1
5 5
2
4
6
6
3
5
6
FirstRanker.com - FirstRanker's Choice
This post was last modified on 28 July 2020