Scribd
Upload
39 views3 pages

Table of Content: Lab No. Practical Date Sign

This document contains the table of contents for a lab practical course on data structures and algorithms. It lists 20 practical assignments to be completed over 9 lab sessions between July 2019 to October 2019. The assignments involve implementing operations on arrays, stacks, queues, linked lists, trees, and sorting algorithms like insertion sort, binary search, selection sort, quick sort and heap sort. Students will perform tasks like insertion, deletion, searching in arrays, implementing push, pop on stacks, and traversal of binary search trees.

Uploaded by

rajput0302
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
39 views3 pages

Table of Content: Lab No. Practical Date Sign

This document contains the table of contents for a lab practical course on data structures and algorithms. It lists 20 practical assignments to be completed over 9 lab sessions between July 2019 to October 2019. The assignments involve implementing operations on arrays, stacks, queues, linked lists, trees, and sorting algorithms like insertion sort, binary search, selection sort, quick sort and heap sort. Students will perform tasks like insertion, deletion, searching in arrays, implementing push, pop on stacks, and traversal of binary search trees.

Uploaded by

rajput0302
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

DSA-B.Tech.

/CSE/2ND YEAR/2018-22

TABLE OF CONTENT
Lab Practical Date Sign.
No.
1. W.A.P. to perform the following operations on 1D and 2D arrays:

1.1 Insertion (at beginning, at end and at position input by user) in:
1.1a 1D array
1.1b 2D array
25/07/19
1.2 Deletion (at beginning, at end and at position input by user) in:
1.2a 1D array
1.2b 2D array

2. W.A.P. to search an element in 1D and 2D arrays (sorted and unsorted)


using
2.1 Linear Search on:
2.1a 1D array
2.1b 2D array 01/08/19
2.2 Binary Search on:
2.2a 1D array
2.2b 2D array

3. W.A.P. to sort elements of 1D and 2D arrays:


3. Insertion Sort
4 Bubble Sort 08/08/19
5 Selection Sort

4. W.A.P. for 1D and 2D


6.1 Merging of Arrays 22/08/19
6.2 Sort the final arrays

5. 7. W.A.P. to implement push, pop, and display operations on stack of


integers. The program
should print appropriate messages for stack overflow, stack Underflow &
stack empty. 29/08/19

7.1 Using Array


7.2 Using Linked list

6. 8. W.A.P. to convert & print a given valid parenthesized in fix Arithmetic


expression to postfixexpression. The expression consists of single
character operands &+, - ,*, / operators.

9. W.A.P. to evaluate a valid suffix / postfix expression using a Stack,


assume that the suffix /postfix expression is read as a single line consisting 12/09/19
of non-negative single digit operands &binary arithmetic operands. The
arithmetic operators are + (ADD), - (subtract), *(multiply) & /
(divide).

Dr. B.R. Ambedkar National Institute of Technology Jalandhar


DSA-B.Tech./CSE/2ND YEAR/2018-22

10. W.A.P. to simulate the working recursion using the stack. Show each
step on the output screen..

7. 11. W.A.P. to show the use of backtracking :N Queen.

12. Write a C++ program to simulate the working a queue of integers


using an array. Provide the
a) Insert b) delete c) display

13. Write a C++ program to simulate the working of a circular queue of 26/09/19
integers using an array.Provide the following operations:
a) insert b) delete c) Display

14. Write a program to design a priority queue which is maintained as a


set of queue (assume a maximum of 3 queues). The elements are inserted
based upon the given priority. The deletion ofan element is to be done
starting from the 1st queue, if it is not empty .If it is empty, the elements
from the 2nd queue will be deleted & so on.

8. 15. Write a C++ program using dynamic variable & pointers to construct
a singly linked list consisting of the following information in each node.
Student id (integer), student name (character string) & semester (integer).

16. Write a C++ program using dynamic variables & pointers to


construct an ordered (ascending) singly linked list based on the rank of 10/10/19
the student, where each node consists of the following information student
id( integer)student name(character), rank(integer).

17. Write a C++ program to show operations on a doubly linked where


each node consists of
integers.

9. 18. Write C++ program to construct a binary search tree of integers and
traverse the tree using all the methods i.e. inorder, preorder & postorder
to display the elements in the tree.

19 Write a C++ program to sort a list of N integers using the quick sort 24/10/19
algorithm.

20. Write a C++ program to sort a list of N integers using Heap sort
algorithm.

Dr. B.R. Ambedkar National Institute of Technology Jalandhar


DSA-B.Tech./CSE/2ND YEAR/2018-22

Dr. B.R. Ambedkar National Institute of Technology Jalandhar

You might also like