Data Structures Practical (Using JAVA or C++ )
CODE: 220C31/226C31/227C31
(For Candidates admitted from 2023-2024)
Question Bank – Practical Examinations
B.C.A./[Link]. DEGREE COURSE IN COMPUTER SCIENCE with ARTIFICIAL INTELLIGENCE /
COMPUTER SCIENCE with DATA SCIENCE
Choice Based Credit System
Core III – Third Semester
PRACTICAL – Data Structures Practical (Using JAVA or C++ )
Time : Three hours Maximum : 60 marks
Question Bank is provided by the University for the candidates admitted from the academic year 2023-2024 for
B.C.A./[Link]. COMPUTER SCIENCE with ARTIFICIAL INTELLIGENCE/ COMPUTER SICENCE
with DATA SCIENCE Degree Practical Examinations. The Principal/Chief Superintendent/ Examiners are
requested to read the given instruction carefully and strictly adhere to the same at the time of conducting the
practical examinations.
INSTRUCTIONS TO THE PRINCIPAL/CHIEF SUPERINTENDENT/EXAMINERS
1. Select the questions from the Question Bank provided by the University on the basis of
student’s strength.
2. Not more than three candidates should get the same question in a batch
3. Each question must be separated from the selected questions from the Question Bank and
should be pasted on the answer paper in such a way that each answer paper is pasted with
only one question.
4. The answer paper pasted with question must be displayed, without showing the questions to
the students. The Students should only one answer paper pasted with question and do the
practical.
5. Selected questions from the Question Bank should be used in each batch consisting of
maximum 30 students. Arrangements may kindly be made to take required number of copies
of the questions at the college.
6. No question must be prescribed by the examiner other than the selected questions from the
question bank provided by the University for the [Link]. COMPUTER SCIENCE with
ARTIFICIAL INTELLIGENCE / COMPUTER SICENCE with DATA SCIENCE practical
examinations.
7. After selecting the questions, the Question Bank should be handed over to the Principal at
once. The Principal are asked to keep the Question Bank, which is a permanent record, under
safe custody and to utilize when conducting the practical examinations of the subject
concerned.
1. Implement a stack using an array and perform push, pop, and display operations.
2. Implement a queue using an array and perform enqueue, dequeue, and display operations.
3. Convert a given infix expression to postfix using a stack.
4. Implement a stack using a linked list and perform push, pop, and peek operations.
5. Implement a queue using a linked list and perform enqueue and dequeue operations.
6. Implement and perform Inorder, Preorder, and Postorder traversals of a binary tree.
7. Implement Linear Search on a sorted array and count the number of occurrences of a specific
element.
8. Implement Binary Search on an unsorted array and sort the array before performing the search.
9. Perform Depth-First Search (DFS) on a graph represented using an adjacency matrix.
10. Perform Breadth-First Search (BFS) on a graph represented using an adjacency matrix.
11. Find the single source shortest path in a weighted graph using Dijkstra's algorithm.
12. Implement a singly linked list and perform insert, delete, and display operations.
13. Find the single source shortest path in a weighted graph using Dijkstra's algorithm.
14. Implement a circular queue using an array and perform enqueue, dequeue, and display operations.
15. Write a program to reverse a given string using a stack.
16. Write a program to evaluate a postfix expression using a stack.
17. Write a program to find the height of a binary tree and the number of leaf nodes.
18. Write a program to reverse a singly linked list.
19. Perform Depth-First Search (DFS) on a graph using dynamic memory allocation.
20. Perform Breadth-First Search (BFS) on a graph using dynamic memory allocation.
21. Write a program to check if a given string is a palindrome using a stack.
22. Perform Depth-First Search (DFS) on a graph represented using an adjacency matrix.
23. Perform Breadth-First Search (BFS) on a graph represented using an adjacency matrix.
****************************************************************************************