School of Engineering
Subject Name: Data Structures using Python Subject Code: MR20-A0503
Question Bank
Unit I
1. A. What are OOPS concept? Explain with examples
B. Explain Linear and Non-linear data structures with examples.
2. What is inheritance? Explain various types with examples
3. A. Explain Polymorphism and Method Overriding with an example.
B. Explain the difference between List and Arrays.
4. Explain how to create a class, Constructor, Objects , Instance variables and methods
with suitable examples.
5. Explain list Comprehension in Python with an example.
Unit II
1. Explain Singly linked list and its operations with Examples.
2. Explain double linked list and its operations with Examples?
3. Implement Circular Singly linked list using Python with example.
4. What is a stack? Explain the various stack operations with an example.
5. What is a Queue? Explain various types of operations on queue with examples?
Unit III
1. Define Searching. What are different types of searching and Explain with example
2. Write a Python program to sort a list of elements using the bubble sort algorithm
3. Write a Python program to sort a list of elements using the Selection sort algorithm
4. Write a Python program to sort a list of elements using the Merge sort algorithm
5. Write a Python program to sort a list of elements using the Quick sort algorithm
Unit IV
1. What is Binary Search tree? How to perform search and insert operation in BST?
2. Explain Balanced Binary Search Tree (BST) using an array (given) elements where
array elements are sorted in ascending order with program.
3. Write a Python program to delete a node with the given key in a given Binary search
tree (BST).
4. Write a Python program to convert a given array elements to a height balanced Binary
Search Tree (BST).
5. Explain In-order, Pre-order and post-order Tree traversal techniques with example
Unit V
1. What is Graph Data Structure? Explain with an example.
2. Distinguish between Breadth First and Depth First Searching Algorithms.
3. Write a Python program to implement Breadth First Search.
4. Write a program to implement Depth First Search.
5. How to find Shortest Path in Directed Acyclic Graph? Explain with an example.