WorksheetsReckon your Techie Skills-Day3 (DATASTRUCTURES)
Total questions: 25
Worksheet time: 9mins
1. Which of the following is true about the characteristics of abstract data types?
(i) It exports a type
(ii) It exports a set of operations.
True,False
False,True
False,False
True,True
2.Inserting an element to the Stack when not Full is _________ operations and Deleting an element from the Stack when not Empty is called ______ operation.
Insert, Delete
Push,Pop
Pop,Push
Add,Remove
3.__________ is a pile in which items are added at one end and removed at other end.
Stack
Array
List
Queue
4.Which of the Data structure cannot store non-homogeneous elements?
Pointers
Structure
Array
List
5.which of the following is a Non-Linear Data Structure?
Stack
Queue
Trees
Arrays
6.LIFO stands for
(a)
7.Identify the data structure that allows deletion at both ends of the list but insertion only at one end?
Output restricted enqueue
Input restricted dequeue
Stack
Priority Queue
8. Which among the following is a Linear data structure?
Trees
Graphs
Stack
AVL trees
9. The number of comparisons done by a Sequential search is ______
(n/2)+1
(n+1)/2
(n-1)/2
(n+2)/2
10. __________ is a search that starts at the beginning of the list and checks for every element in the list.
Binary search
Hash search
Linear/Sequential search
Binary Tree search
11.Give the postfix conversion of (a+b)*(c+d) (a)
12. Which of the following is not an Internal Sort?
Heap sort
Bubble sort
Insertion sort
Merge Sort
13. convert the infix expression to postfix expression : (a+(b*c)/(d-e)) as (a)
14. In a queue the initial values of front and rear pointer are given as ____
0 and 1
0 and -1
-1 and 0
1 and 0
15. In a circular queue the value of r is given by __________
r=r+1
r=(r+1)% queu_size
r=(r-1)% queu_size
r=(r+1)%(que_size - 1)
16. ________ is not an operation that can be performed on queue.
Insertion
Deletion
Traversal
Retrieval
17. The extra element at the head of the list is called as ________
List header
Antinel
Sentinel
List Head
18.Pick out the applications of stack.
Function calls
Arthimetric expressions
Towers of Hanoi
All the above
19. Name the type of linked list shown in the figure.
Singly Linked list
Doubly Linked list
Circular Singly Linked list
Circular Doubly Linked list
20. Which among the following data structures uses indexed values?
Linked List
Stack
Linear arrays
Queue
21. From the given figure identify the Sorting algorithm?
(a)
22.A data structure where new elements can be added or removed from either ends but not in the middle is __________
Stack
Queue
List
Dequeue
23. When does top value of stack changes?
Before deletion
After deletion
At the time of deletion
While checking underflow
24. Queue is follows (a) order
25. No of pointers defined for Singly, Doubly linked list are __________
1,2
2,2
2,3
2,1
