Scribd
Upload
15 views

DS Practical Syllabus (E-Next - In)

Uploaded by

atharvatsdc
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
15 views

DS Practical Syllabus (E-Next - In)

Uploaded by

atharvatsdc
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

B. Sc.

(Information Technology) Semester – III


Course Name: Data Structures Practical Course Code: USIT3P2
Periods per week (1 Period is 50 minutes) 3
Credits 2
Hours Marks
Evaluation System Practical Examination 2½ 50
Internal -- --

List of Practical
1. Implement the following:
a. Write a program to store the elements in 1-D array and perform the operations like
searching, sorting and reversing the elements. [Menu Driven]
b. Read the two arrays from the user and merge them and display the elements in
sorted order.[Menu Driven]
c. Write a program to perform the Matrix addition, Multiplication and Transpose
Operation. [Menu Driven]

2. Implement the following for Linked List:


a. Write a program to create a single linked list and display the node elements in
reverse order.
b. Write a program to search the elements in the linked list and display the same
c. Write a program to create double linked list and sort the elements in the linked
list.

3. Implement the following for Stack:


a. Write a program to implement the concept of Stack with Push, Pop, Display and
Exit operations.
b. Write a program to convert an infix expression to postfix and prefix conversion.
c. Write a program to implement Tower of Hanoi problem.

4. Implement the following for Queue:


a. Write a program to implement the concept of Queue with Insert, Delete, Display
and Exit operations.
b. Write a program to implement the concept of Circular Queue
c. Write a program to implement the concept of Deque.

5. Implement the following sorting techniques:


a. Write a program to implement bubble sort.
b. Write a program to implement selection sort.
c. Write a program to implement insertion sort.

6. Implement the following data structure techniques:


a. Write a program to implement merge sort.
b. Write a program to search the element using sequential search.
c. Write a program to search the element using binary search.

17

https://E-next.in
7. Implement the following data structure techniques:
a. Write a program to create the tree and display the elements.
b. Write a program to construct the binary tree.
c. Write a program for inorder, postorder and preorder traversal of tree

8. Implement the following data structure techniques:


a. Write a program to insert the element into maximum heap.
b. Write a program to insert the element into minimum heap.

9. Implement the following data structure techniques:


a. Write a program to implement the collision technique.
b. Write a program to implement the concept of linear probing.

10. Implement the following data structure techniques:


a. Write a program to generate the adjacency matrix.
b. Write a program for shortest path diagram.

Books and References:


Sr. No. Title Author/s Publisher Edition Year
1. Data Structures and Rance Necaise Wiley First 2016
Algorithms Using Python

2. Data Structures Using C and Langsam , Pearson First 2015


C++ Augenstein,
Tanenbaum

18

https://E-next.in

You might also like