Scribd
Upload
446 views2 pages

Advanced Data Structures Lab

This document outlines the course code, prerequisites, course outcomes, and programming assignments for an Advanced Data Structures lab course. The assignments involve implementing various data structures like linked lists, stacks, queues, and trees as well as sorting algorithms like quicksort, mergesort, and shells sort. Graph algorithms like Kruskal's are also to be implemented. Students are expected to write programs in C, C++ or Java to perform operations on these data structures and apply algorithm design techniques.

Uploaded by

bhargavi
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
446 views2 pages

Advanced Data Structures Lab

This document outlines the course code, prerequisites, course outcomes, and programming assignments for an Advanced Data Structures lab course. The assignments involve implementing various data structures like linked lists, stacks, queues, and trees as well as sorting algorithms like quicksort, mergesort, and shells sort. Graph algorithms like Kruskal's are also to be implemented. Students are expected to write programs in C, C++ or Java to perform operations on these data structures and apply algorithm design techniques.

Uploaded by

bhargavi
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/ 2

TEEGALA KRISHNA REDDY ENGINEERING COLLEGE

(UGC-Autonomous)
Approved by AICTE, Affiliated by JNTUH, Accreditated by NAAC- ‘A’ Grade
Medbowli, Meerpet, Balapur, Hyderabad, Telangana- 500097
Mob: 8498085218. Email: [email protected], [email protected]

ADVANCED DATA STRUCTURES LAB (Professional Elective –II)

Course Code: 20CS5PE25


B.Tech. V-Semester LTP C
0 0 3 1.5
Pre requisites
1. Computer Programming through C.
2. Data Structures.

Course Outcomes
At the end of the course, a student will be able to
1. Implement List ADTs and their operations.

2. Develop programs for sorting.

3. Develop programs for implementing trees and their traversal operations.

4. Implement graph traversal algorithms.

5. Apply algorithm design techniques.

Implement the following using C/C++/Java.


1. 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.
TEEGALA KRISHNA REDDY ENGINEERING COLLEGE
(UGC-Autonomous)
Approved by AICTE, Affiliated by JNTUH, Accreditated by NAAC- ‘A’ Grade
Medbowli, Meerpet, Balapur, Hyderabad, Telangana- 500097
Mob: 8498085218. Email: [email protected], [email protected]
7. Write C program that implement the SHELL sort method to sort a given list of integers

in ascending order.
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!).

You might also like