ANNA UNIVERSITY: CHENNAI - 600025
M.E. DEGREE EXAMINATIONS JANUARY - 2014
Regulations R-2013
Semester: 01
M.E. Computer Science And Engineering
CP7111: Advanced Data Structures Laboratory
Time: 3 Hrs
Max Marks : 100
1.
Write a Java program using the idea of breadth first search to find a shortest cycle 100
starting from any given vertex v.
2.
Write a Java program to visit all vertices in a graph G with 8 vertices reachable 100
from any vertex v.
3.
Write a Java program to implement breadth first graph traversal and depth first 100
graph traversal.
4.
Write a Java program to produce a spanning tree for an undirected connected 100
graph using depth first search.
5.
Write a Java program to implement Ford Fulkerson algorithm to maximize flow 100
of packets in a network.
6.
Write a Java program to maximize the flow of vehicles in a bridge with 100
limitations using minimum cut technique.
7.
Write a Java program to solve transshipment problems using network flow 100
algorithmic design technique.
8.
Write a Java program to solve assignment problems in allocating jobs to 100
machines so that total cost is minimized using any flow algorithm.
9.
Write a Java program to implement simplex algorithm in solving linear 100
programming problem
10.
Write a linear program to find the shortest path between two vertices in a graph 100
G.
11.
Write a linear program to find the maximum flow in a network G with source s 100
and sink t.
12.
Write a linear program in Java that, given a bipartite graph G = ( V, E) as input, 100
solves the maximum bipartite matching problem.
13.
Write a Hill climbing program in Java to solve 8 queens problem
100
14.
Develop a hill climbing program in Java to solve travelling salesman problem.
100
15.
Develop a Java program to schedule jobs in a assembly line using dynamic 100
programming design technique
16.
Develop a Java program to find the longest common subsequences present in any 100
given two strings as input using dynamic programming design technique.
17.
Develop a Java program to solve knapsack problem using backtracking design 100
technique.
18.
Write a Java program to find the sum of subsets using backtracking design 100
technique.
19.
Write a Java program to find the Hamiltonian cycles present in a graph G using 100
backtracking design technique
20.
Write a Java program to implement randomized quick sort algorithm
21.
Write a Java program to implement insertion, deletion and search operations in a 100
concurrent singly linked list with necessary constructors.
22.
Write a Java program to implement insertion, deletion and search operations in a 100
concurrent doubly linked list.
23.
Write a Java program to implement insertion, deletion and search operations in a 100
concurrent queue
24.
Write a Java program to implement insertion, deletion and search operations in a 100
concurrent stack.
Marks Split Up
Aim
Algorithm
15
& Source
code Results
compilation
50
25
Viva
Total
10
100
100
