RAGHU ENGINEERING COLLEGE (A)
BTECH I YEAR II SEMESTER (AR 23)
Name of the Course: Data Structures Course Code: 2305201
Question Bank
Unit-1
Short Answer Type
1. Define data structure?
2. What is linear data structure and non-linear data structure? Give some examples?
3. Define sorting? List out any two applications?
4. What is searching? List out any two applications.
5. What is ADT (abstract data type)?
6. What does a time complexity and space complexity of an algorithm represent?
7. Contrast linear search with binary search.
8. Write the time complexity (best, average, worst case) of bubble sort, selection sort
and insertion sort.
9. List our various operations that can perform on data structures.
Long Answer Type
1. Illustrate a program to search for an element in the given list of numbers using linear
search approach.
2. Illustrate a program to search for an element in the given list of numbers using binary
search approach.
3. Explain linear search algorithm in detail for the given elements: 21, 54, 32, 67, 2, 45,
21, 45, 8. Consider 21 as a search element.
4. Outline an algorithm to implement Binary Search technique. Use the algorithm to
search 32 in the following list of elements. Explain the process at each Step. 12, 16,
17, 19, 20, 22, 24, 29, 30, 32, 37.
5. Illustrate a program to sort the given elements using Selection Sort.
6. Illustrate Selection sort to identify how many iterations required to place 12 in it's
correct position for the unsorted list 20, 12, 10, 15, 2.
7. Illustrate a program to sort given list of numbers using Insertion Sort.
8. Justify with an example when does Bubble sort is better than Selection sort. And also
give algorithm for both sorting techniques.
9. Outline the steps to sort the elements 35, 70, 25, 50, 45, 10, 65 using Bubble Sort.
Unit-2
Short Answer Type
1. What is linked list?
2. What is node in linked list?
3. List out the applications of linked lists.
4. Discuss the purpose of head node in linked lists.
5. Discuss the drawback of single linked list when compared with double linked list.
6. Discuss the differences between array and linked lists.
7. Why linked lists are called dynamic data structures.
8. Compare single and circular linked list.
9. What is a doubly linked list?
Long Answer Type
1. Discuss the advantages and disadvantages of linked lists.
2. Design a code snippet to traverse single linked list elements.
3. Discuss different cases of insertion operations on single linked lists? Design a pseudo
code for the same.
4. Discuss different cases of deletion operations on single linked lists? Design a code
snippet for the same?
5. With neat diagrams, explain the following operations in singly linked list data
structure.
Insert element at the beginning
Insert element at the end
Insert the specified element
Search the given element.
Sort the given list.
6. Design a code snippet to perform all the insertion operations on Doubly linked list.
7. Design a code snippet to perform all the deletion operations on Doubly linked list.
8. Design a code snippet to perform all the deletion operations on circular linked list.
9. Design a code snippet to perform all the insertion operations on circular linked list.
10. Write the algorithm and explain the steps to perform the following operations on
doubly linked list.
Add an element at the beginning of the list.
Delete an element at the end of the list.
Add an element at specified position of the list.
Display the complete list in a backward manner.
