MCAN201 Data Structure With Python Questions For 2nd Internal
MCAN201 Data Structure With Python Questions For 2nd Internal
2 Write the enQueue & deQueue functions for the linear queue. 3+3
3 What is circular queue? Why we need circular queue? In which data structure 2+2+2
insertion & deletion of elements can take place from either end? Explain.
4 Write Q-insertion and Q-deletion function / algorithm for circular queue. 3+3
5 Consider the following queue of characters, where queue Q is a circular array which 3
is allocated 5 memory cells: Front = 2, Rear = 3, Q: _, P, Q, _, _. Describe the
following operations on queue: - (a) R is added to the queue. (b) Two letters are
deleted from the queue. (c) S, T, U are added to queue.
6 Write short notes on Priority Queue. What are the applications of priority queue? 3+2
11 Write a python function to delete an element from the rear end of the double ended 3
queue.
12 Point out the difference between array & linked list. 2
13 Write a python function for insertion of a data item after a specified data item into a 3
single linear linked list.
14 Write a python function to print of a linear linked list in reverse order & also count 3
the number of nodes of a linear linked list.
15 Write a python function for insertion of a new node after the last node into a singly 3
linked list.
16 Write a python function to delete the first node from a singly linear linked list 2
17 Write a python function to delete a specific node from a singly linear linked list 3
20 What is singly circular linked list? Why it is better than singly linear linked list? 2+2
21 Write a python function to insert a new node at the beginning of the singly circular 3
linked list.
22 Write a python function to delete a node from the beginning of the singly circular 3
linked list
23 Write a python function to merge two singly circular linked lists. 3
24 Supposed the linked list in the memory consisting of numerical values. Write a function 3x5=15
for each of the following:
a) To find the maximum (MAX) of the values in the list.
b) To find the average (MEAN) of the values in the list.
1
ACADEMY OF TECHNOLOGY, QUESTION BANK, 2022
c) To find the product (PROD) of the values in the list.
25 Write a function to remove the first node from the list and insert it at end, without 5
changing the info part of any node.
26 Is it possible to find a loop in a Linked list? Give reason to your answer. 2
27 Suppose a given linked-list has some odd numbers and even numbers. Write an 5
algorithm to find them and position of them.
28 Which operations are more effective in linked list than arrays? And why? 3x2=6
a) Insertion
b) Deletion
c) Traversal
29 Can we do a Binary search on a linked list? Give reason to your answer. 2
31 What is the difference between Linear & Binary Search? What is the prerequisite for 2+2+2
binary search? What are the advantages of binary search over linear search?
32 “Binary search technique can’t be implemented using linked list”. Justify. 3+2
Derive the worst-case time complexity of Binary search.
33 Write the algorithm to sort an array of integers using Insertion Sort method. Explain 5
the time complexity of this sorting algorithm.
34 Write the algorithm to sort an array of integers using Bubble method. Explain the 5
time complexity of this sorting algorithm.
35 Write the algorithm to sort an array of integers using Selection Sort method. Explain 5
the time complexity of this sorting algorithm.
36 Write the algorithm to sort an array of integers using Modified Bubble Sort method. 5
Explain the time complexity of this sorting algorithm.
37 Write a python function for insertion of a new node before the first node into a double 2
linked list.
38 Write a python function for insertion of a new node after the last node into a double 3
linked list.
39 Write a python function for insertion of a new node after a specific node into a double 3
linked list.
40 Write a python function for deletion of first node from a double linked list. 2
41 Write a python function for deletion of last node from a double linked list. 3
42 Write a python function for deletion of a specific node from a double linked list. 3