Professional Documents
Culture Documents
com/papers
MCA (Revised)
N Term-End Examination
00
June, 2011
C
,MCS-031 : DESIGN AND ANALYSIS OF
ALGORITHM
MCS-031 1 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 2
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 3 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
and List B = (b b b, b a, a)
D = (a b b, b a, b b)
MCS-031 4
Download More:- https://www.ignouassignmentguru.com/papers
MCA (Revised)
Term-End Examination 12240
December, 2011
MCS-031 1 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
12
1 1 (3n + 1 _
1) for all n 1.
MCS-031 2
Download More:- https://www.ignouassignmentguru.com/papers
(ii) Selection
(iii) Repetition
[ 5 61 1— 7 61
A = — 4 3] ; B [ 5 9]
MCS-031 3
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 4 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 5
Download More:- https://www.ignouassignmentguru.com/papers
MCA (Revised)
Term-End Examination
June, 2012
N
CO
C.) MCS-031 : DESIGN AND ANALYSIS OF
ALGORITHM
MCS-031 1 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 2
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 3 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 4
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 1 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
E--->E+E/E*E/a is ambiguous.
MCS-031 2
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 3 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 4
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 1 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 2
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 3 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 4
Download More:- https://www.ignouassignmentguru.com/papers
O December, 2013
MCS-031 1 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 2
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 3 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
T(n) = 4T(--1)+n2
MCS-031 4
Download More:- https://www.ignouassignmentguru.com/papers
T(n) T (nA) + n
Give a divide and conquer based algorithm 4
to find ith largest element in an array of
size n.
What is regular expression ? Write a regular 6
expression over 1= {a, b} to generate all
string that start with a and end with two
b's.
MCS-031 1 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 2
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 3
Download More:- https://www.ignouassignmentguru.com/papers
MCA (Revised)
11324 Term-End Examination
December, 2014
-1- ) + 1 for (n 2)
T(n) = T (1
2
=1 n < 2. 4+4+4
MCS-031 2 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
a b c d e
a — 1 15 — 5
b 1 — 2 — 10
c 15 2 — 8 6
d — — 8 — 3
e 5 10 6 3 —
MCS-031 3 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 4 11,000
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 2 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
a b c d e
a — 1 15 — 5
b 1 — 2 — 10
c 15 2 — 8 6
d — — 8 — 3
e 5 10 6 3 —
(1) L = (01)n, n 1.
MCS-031 3 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 4 8,000
Download More:- https://www.ignouassignmentguru.com/papers
MCA (Revised)
Term-End Examination
December, 2015
MCS-031 1 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 2
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 3 14,000
Download More:- https://www.ignouassignmentguru.com/papers
06022
MCS-031 : DESIGN AND ANALYSIS OF
ALGORITHMS
MCS-031 1 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
fn fn - 1 - fn - 2 =
such that fo = 0 and f1 = 1.
MCS-031
Download More:- https://www.ignouassignmentguru.com/papers
6
(b) Sort the following sequence of numbers,
using Selection Sort. Also find the number
of comparisons and copy operations
required by the algorithm in sorting this
list : 10
20 5 15 8 6 28
MCS-031 3 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 4 7,000
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 1 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 2
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 3 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 4 9,000
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-0 3 1 2
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 3,500
Download More:- https://www.ignouassignmentguru.com/papers
[5 6 —7 6
A= ,B=
—4 3 5 9
MCS-031 4 8,000
Download More:- https://www.ignouassignmentguru.com/papers
MCA (Revised)
Term-End Examination
June, 2018
I 11 •• ■••
MCS-031(S) 1 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031(S) 2
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031(S) 3 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031(S) 4 7,000
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 1 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
18
11
(e) Construct a Deterministic Finite Automata
(DFA) for the following Regular Expression : 5
(0 + 1)* (00 + 11) (0 + 1)*
(f) Write the Recursive and Iterative
algorithm to compute the Greatest
Common Divisor (GCD) of two numbers
X and Y. 5
(g) Explain the V. Strassen's matrix
multiplication method of multiplying two
matrices of size (n x n). Show that its
running time is 0 (n 1og27). 6
2. (a) Write the Dijkstra's algorithm for shortest
path. Apply the same for the following
graph, to find the shortest path from
node 8
16
24
17
MCS-031 2
Download More:- https://www.ignouassignmentguru.com/papers
n
(i) T(n) = 3T (— ) + n log n
4
MCS-031 4 7,000
Download More:- https://www.ignouassignmentguru.com/papers
0, 1
MCS-031
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 3 P.T.O.
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 4 8,500
Download More:- https://www.ignouassignmentguru.com/papers
- 0 0 37`3
No. of Printed Page : 5 I MCS- 0 31
MCA (REVISED)
MCS-031 ( 1 ) [P.T.O.]
Download More:- https://www.ignouassignmentguru.com/papers
[5]
( S <— SS XaXaX 1 1°
bX
MCS-031 , ( 2 )
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 (4)
Download More:- https://www.ignouassignmentguru.com/papers
MCS-031 ( 5) 5000
Download More:- https://www.ignouassignmentguru.com/papers
5674
Number of Printed Pages : 4 MCS-031
MCA (Revised)
(n
2T — +0(n2 ) , n >1
T (n)= ‘,2
1 , n <1
MCS-031/7000 (2)
Download More:- https://www.ignouassignmentguru.com/papers
a b c d e
a - 1 15 - 5
b 1 - 2 - 10
c 15 2 - 8 6
d - - 8 - 3
e 5 10 6 3 -
MCS-031/7000
Download More:- https://www.ignouassignmentguru.com/papers
(I) (a + b).
ab* a* (a + b)
ab(a + b).
(0 2" = 0(5")
(ii) L = 0(n")
(c) Explain limitations of Strassen's algorithm for
matrix multiplications. [6]
(4)
Download More:- https://www.ignouassignmentguru.com/papers
language L =
lanbne :n 5
clan of problems. 6
divisible by 3} . 6
multiplications. 10
- X-
MASTER OF COMPUTER
APPLICATION (MCA) (Revised)
Term-End Examination
December, 2020
MCS-031 : DESIGN AND ANALYSIS OF
ALGORITHMS
Lot-I P. T. O.
Download More:- https://www.ignouassignmentguru.com/papers
[2] MCS-031
=(ii) L {anbmcmdn m, n ≥ 1} 5
[3] MCS-031
P. T. O.
Download More:- https://www.ignouassignmentguru.com/papers
[4] MCS-031
MCS–031 5,640