0% found this document useful (0 votes)
15 views2 pages

Data Structure Lab

The document provides instructions for a lab evaluation assignment where students must submit programs based on their roll number before a deadline. It lists different programming tasks for even and odd roll numbers related to data structures like heap sort, tree traversal, stacks, queues, and priority queues.

Uploaded by

Vivek
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
0% found this document useful (0 votes)
15 views2 pages

Data Structure Lab

The document provides instructions for a lab evaluation assignment where students must submit programs based on their roll number before a deadline. It lists different programming tasks for even and odd roll numbers related to data structures like heap sort, tree traversal, stacks, queues, and priority queues.

Uploaded by

Vivek
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

Lab Evaluation

Last Date of Submission 20 April 2020.


Dear Students,
Please find out the underwritten program according to your roll number
and upload the same with the generated code and output before given deadline.

INSTRUCTIONS:
1. Not to be copied from any sources or any student.
2. If any discrepancies is found in your assignment, action should be taken
against that from the concerned authorities.
3.Proper functioning of program is essential.

Course Code:-CAP282 Even Roll Numbers

1. Write a program that demonstrate working of heap sort.


2. Write a program to perform preorder and inorder traversal on tree.
3. Write a program that demonstrate working of push and pop operations on
stack.

Course Code:-CAP282 Odd Roll Numbers

1. Write a program to perform insertion and deletion on circular queue.


2. Write a program that demonstrate working of heap sort.
3. Write a program for implementation of priority queues.

You might also like