Scribd
Upload
47 views3 pages

Adslab

This document outlines the Advanced Data Structures Lab course for 2015. The course covers implementing various data structures like lists, trees, graphs, and their associated algorithms using programming languages like C/C++/Java. The course outcomes include developing programs for sorting, implementing trees and their traversal operations, and graph traversal algorithms. The document provides 16 programming assignments involving operations on linked lists, stacks, queues, binary trees, graphs, and algorithms like quicksort, mergesort, Kruskal's algorithm, Prim's algorithm, and optimal binary search trees.

Uploaded by

sandeepabi25
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
47 views3 pages

Adslab

This document outlines the Advanced Data Structures Lab course for 2015. The course covers implementing various data structures like lists, trees, graphs, and their associated algorithms using programming languages like C/C++/Java. The course outcomes include developing programs for sorting, implementing trees and their traversal operations, and graph traversal algorithms. The document provides 16 programming assignments involving operations on linked lists, stacks, queues, binary trees, graphs, and algorithms like quicksort, mergesort, Kruskal's algorithm, Prim's algorithm, and optimal binary search trees.

Uploaded by

sandeepabi25
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

GVP COLLEGE OF ENGINEERING (A) 2015

ADVANCED DATA STRUCTURES LAB

Course Code: 15IT2109 L P C


0 3 2

Pre requisites:
1. Computer Programming through C.
2. Data Structures.

Course Outcomes:
At the end of the course, a student will be able to
CO1: Implement List ADTs and their operations.
CO2: Develop programs for sorting.
CO3: Develop programs for implementing trees and their traversal
operations.
CO4: Implement graph traversal algorithms.
CO5: Apply algorithm design techniques.

Implement the following using C/C++/Java


1. Write a program to perform the following operations on
singly linked list.
i) Creation ii) Insertion iii) Deletion iv) Traversal.
2. Write a program to perform the following operations on
doubly linked list.
i) Creation ii) Insertion iii) Deletion iv) Traversal in both ways
3. Write a program that implements stack (its operations) using
i) Arrays ii) linked list
4. Write a programs that implements Queue (its operations) using
i) Arrays ii) linked list
5. Write C program that implements the Quick sort method to sort a
given list of integers in ascending order.
6. Write C program that implement the Merge sort method to sort a
given list of integers in ascending order.
7. Write C program that implement the SHELL sort method to sort a
given list of integers in ascending order.

M.TECH-SOFTWARE ENGINEERING 24
GVP COLLEGE OF ENGINEERING (A) 2015

8. Write a program to perform the following: i) Creating a Binary


Tree of integers
ii) Traversing the above binary tree in preorder, inorder and postorder.
9. Write a C program to perform the following:
i) Creating a AVL Tree of integers
ii) Traversing the above binary tree in preorder, inorder and postorder.
10. Write a C program that uses functions to perform the following:
i) Creating a SplayTree of integers
ii) Traversing the above binary tree in preorder, inorder and postorder.
11. Write a C program to perform the following:
i) Creating a B-Tree of integers
ii) Traversing the above binary tree in preorder, inorder and postorder.
12. Write a program that implements Kruskals algorithm using
a disjoint set data structure. The program takes as input a
file (data.txt), in which each line either represents a vertex or an
edge. For the edge lines, the first integer on that line
representing the starting vertex, the second the ending
vertex, and the third the weigh of the edge. Use this file to
construct, line by line, the graph upon which Kruskal’s algorithm
will be run (do NOT hardcode this graph!).
13. Write a program to simulate various graph traversing algorithms.
14. Write a program to find the minimal spanning tree of a graph using
the Prim’s algorithm. The program should be able to read in the
weight matrix of a graph and produce the minimal spanning tree
Generate weight matrices (using a random number generator) with a
large number of nodes and estimate the time complexity of the
algorithm.
15. Write a program to find the closest pair of points using a divide and
conquer strategy. Use the random number generator to generate a
large number of points in a unit square as input to the algorithm.
Test the correctness of the algorithm by using a brute force method.
16. Use dynamic programming to find the optimal binary search tree for
a given set of numbers together with their probabilities. Remember
that the numbers may be generated in any order, so, a presorting step
is also required.

M.TECH-SOFTWARE ENGINEERING 25
GVP COLLEGE OF ENGINEERING (A) 2015

TEXT BOOKS:
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++,
3rd Edition, Pearson Education, 2007.

REFERENCES:
1. Sartaj Sahni, Data Structures Algorithms and Applications in C++,
2nd Edition, Universities Press, 2007.
2. Ellis Horowitz, Sartaj Sahni, Rajasekharan, Fundamentals of
Algorithms, 2nd Edition, Universities Press, 2009.
3. Aho V Alfred, Hapcroft E John, Ullman D Jeffry, Data Structures and
Algorithms, 1st Edition, Pearson Education, 2002.
4. Adam Drozdek, Thomson, Data Structures and Algorithms in JAVA,
3rd Edition, Cengage Learning, 2008.
5. Horowitz, Sahni, Mehta, Fundamentals of Data Structures in C++,
2nd Edition, Universities Press, 2007.

WEB REFERENCES:
www.nptel.iitm.ac.in/video.php?subjectid=106102064

M.TECH-SOFTWARE ENGINEERING 26

You might also like