ANNA UNIVERSITY: CHENNAI 600025

MCA DEGREE EXAMINATIONS MAY/JUNE-2013

Second Semester
MC9229: ALGORITHMS LAB
(REGULATIONS 2009)
Time: 3 Hours
Maximum Marks: 100
-------------------------------------------------------------------------------------------------------------------------------

a. Develop a program to perform Quick sort on an array of N numbers.

90

b. Viva- Voice

10

Marks Awarded:

Internal Examiner

External Examiner

-------------------------------------------------------------------------------------------------------------------------------

ANNA UNIVERSITY: CHENNAI 600025

MCA DEGREE EXAMINATIONS MAY/JUNE-2013
Second Semester
MC9229: ALGORITHMS LAB
(REGULATIONS 2009)
Time: 3 Hours
Maximum Marks: 100
-------------------------------------------------------------------------------------------------------------------------------

a. Develop a program for constructing a Graph and construct minimal

spanning tree using Prims algorithm.

90

b. Viva- Voice

10

Marks Awarded:

Internal Examiner

External Examiner

-------------------------------------------------------------------------------------------------------------------------------

ANNA UNIVERSITY: CHENNAI 600025

MCA DEGREE EXAMINATIONS MAY/JUNE-2013
Second Semester
MC9229: ALGORITHMS LAB
(REGULATIONS 2009)
Time: 3 Hours
Maximum Marks: 100
-------------------------------------------------------------------------------------------------------------------------------

a. Develop a program for constructing a Graph and find the shortest path from a node
(source) in a graph to another node (destination) using Dijkstras algorithm.
90
b. Viva- Voice

10

Marks Awarded:

Internal Examiner

External Examiner

-------------------------------------------------------------------------------------------------------------------------------

ANNA UNIVERSITY: CHENNAI 600025

MCA DEGREE EXAMINATIONS MAY/JUNE-2013
Second Semester
MC9229: ALGORITHMS LAB
(REGULATIONS 2009)
Time: 3 Hours
Maximum Marks: 100
-------------------------------------------------------------------------------------------------------------------------------

a. Develop a program for constructing a binary tree and perform the following operations:
i Insert a Node
ii Delete a Node
iii Search
90
b.

Viva- Voice

10

Marks Awarded:

Internal Examiner

External Examiner

-------------------------------------------------------------------------------------------------------------------------------

ANNA UNIVERSITY: CHENNAI 600025

MCA DEGREE EXAMINATIONS MAY/JUNE-2013
Second Semester
MC9229: ALGORITHMS LAB
(REGULATIONS 2009)
Time: 3 Hours
Maximum Marks: 100
-------------------------------------------------------------------------------------------------------------------------------

a. Develop a program for constructing a binary tree and perform the following traversals:
i Inorder Traversal
ii Preorder Traversal
iii Post Order Traversal
90
b. Viva- Voice

10

Marks Awarded:

Internal Examiner

External Examiner

-------------------------------------------------------------------------------------------------------------------------------

ANNA UNIVERSITY: CHENNAI 600025

MCA DEGREE EXAMINATIONS MAY/JUNE-2013
Second Semester
MC9229: ALGORITHMS LAB
(REGULATIONS 2009)
Time: 3 Hours
Maximum Marks: 100
-------------------------------------------------------------------------------------------------------------------------------

a. Develop a program for constructing a Weighted Graph with ten nodes and construct
minimal spanning tree using Prims algorithm.

90

b. Viva- Voce

10

Marks Awarded:

Internal Examiner

External Examiner

-------------------------------------------------------------------------------------------------------------------------------

ANNA UNIVERSITY: CHENNAI 600025

MCA DEGREE EXAMINATIONS MAY/JUNE-2013
Second Semester
MC9229: ALGORITHMS LAB
(REGULATIONS 2009)
Time: 3 Hours
Maximum Marks: 100
-------------------------------------------------------------------------------------------------------------------------------

a. Develop a program for implementing linear search on an array of N numbers.

50

b. Given a set of integers, there is a non-empty subset whose sum is zero. For
example, given the set {-7,-3,-2, 5, 8}, the subset {-3,-2,-5) sums to zero.
Develop a program for implementing the Subset Sum problem using
backtracking.

40

c. Viva- Voice

10

Marks Awarded:

Internal Examiner

External Examiner

-------------------------------------------------------------------------------------------------------------------------------

ANNA UNIVERSITY: CHENNAI 600025

MCA DEGREE EXAMINATIONS MAY/JUNE-2013
Second Semester
MC9229: ALGORITHMS LAB
(REGULATIONS 2009)
Time: 3 Hours
Maximum Marks: 100
-------------------------------------------------------------------------------------------------------------------------------

a. Develop a program to solve the Knapsack problem using backtracking.

90

b. Viva- Voice

10

Marks Awarded:

Internal Examiner

External Examiner

-------------------------------------------------------------------------------------------------------------------------------

ANNA UNIVERSITY: CHENNAI 600025

MCA DEGREE EXAMINATIONS MAY/JUNE-2013
Second Semester
MC9229: ALGORITHMS LAB
(REGULATIONS 2009)
Time: 3 Hours
Maximum Marks: 100
-------------------------------------------------------------------------------------------------------------------------------

a. Develop a program for implementing binary search on a sorted array

of N numbers.

40

b. Develop a program to implement Strassens matrix multiplication.

50

c. Viva- Voice

10

Marks Awarded:

Internal Examiner

External Examiner

-------------------------------------------------------------------------------------------------------------------------------

ANNA UNIVERSITY: CHENNAI 600025

MCA DEGREE EXAMINATIONS MAY/JUNE-2013
Second Semester
MC9229: ALGORITHMS LAB
(REGULATIONS 2009)
Time: 3 Hours
Maximum Marks: 100
-------------------------------------------------------------------------------------------------------------------------------

a. Develop a program for constructing a Graph with eight nodes and find the shortest
path from a node (source) in a graph to another node (destination) using
Dijkstras algorithm.
90
b.

Viva- Voice

10

Marks Awarded:

Internal Examiner

External Examiner

-------------------------------------------------------------------------------------------------------------------------------

ANNA UNIVERSITY: CHENNAI 600025

MCA DEGREE EXAMINATIONS MAY/JUNE-2013
Second Semester
MC9229: ALGORITHMS LAB
(REGULATIONS 2009)
Time: 3 Hours
Maximum Marks: 100
-------------------------------------------------------------------------------------------------------------------------------

a. Develop a program for constructing a Graph with ten nodes and find the shortest
path from a node (source) in a graph to another node (destination) using
Warshalls algorithm.
90
b. Viva- Voice

10

Marks Awarded:

Internal Examiner

External Examiner

-------------------------------------------------------------------------------------------------------------------------------

ANNA UNIVERSITY: CHENNAI 600025

MCA DEGREE EXAMINATIONS MAY/JUNE-2013
Second Semester
MC9229: ALGORITHMS LAB
(REGULATIONS 2009)
Time: 3 Hours
Maximum Marks: 100
-------------------------------------------------------------------------------------------------------------------------------

a. Develop a program for implementing linear search on an array of N numbers.

40

b. Develop a program for implementing binary search on a sorted array of N numbers. 50

c. Viva- Voice

10

Marks Awarded:

Internal Examiner

External Examiner

-------------------------------------------------------------------------------------------------------------------------------