Font size
WorksheetsData Structures and Algorithms Quiz
Total questions: 137
Worksheet time: 1hrs 9mins
Which search algorithm would be best to use with ordered data?
Either binary search or a linear search
A binary search
A linear search
Neither binary search nor a linear search
The number of elements in the adjacency matrix of a graph having 7 vertices is?
14
36
49
7
Given the sequential representation of the binary tree T (a one-dimensional array is used to store the elements of the tree T) and the root node of the tree T is the node 35): Show the sequence of nodes in the tree T that will be visited using post-order traversal algorithm:
22, 45, 25, 47, 32, 40, 42, 56, 23, 30, 35
22, 32, 45, 25, 47, 40, 42, 56, 23, 30, 35
22, 23, 45, 25, 47, 32, 40, 42, 56, 30, 35
22, 25, 45, 47, 32, 40, 42, 56, 23, 30, 35
What is the output of the following list operation? aList = [10, 20, 30. 40, 50, 60, 70, 80] print(aList[2:5])
[30, 40, 50]
[20, 30, 40, 50]
[30, 40, 50, 60]
[20, 30, 40]
Which of the following is the longest proper prefix which is also the suffix of 'ABCA'?
"AB"
"ABC"
“ABCA”
"A"
What will be the output of the following code? def f(n): if (n<10): return n- 5 return f(n+1); print(f(4))
1
-1
0
5
The total number of edges that connect to node u is called
Degree
Out-degree
In-degree
Order
What does the following code do?
def Operation(self, newdata):
NewNode = Node(newdata)
if self.head is None:
self.head NewNode
return
laste = self.head
while(laste.next):
laste laste.next
laste.next=NewNode
Insert a new node at the beginning of the list
Remove the last node
Traverse the list
Insert a new node at the tail of the list
According to Stack data structure, what is output for input "finaltest"?
tsetlanif
final
test
final test
Given a string S = "ABCDEFABCD" and a pattern P = "BC" What is the return value when applying the KMP algorithm? (the string is indexed from 0)
2, 8
1
0
1, 7
Given data compression rate is 0.25 and length of input data is 8. What is the length of output data?
6
0
8
4
Which is the most appropriate definition for recursion?
An in-built method that is automatically called.
A class method that calls another class method.
A function that calls another execution instance of the same function
A function that calls another function
Given an empty queue Q, what does it look like after the following operations?
Q.enqueue(1)
Q.enqueue(2)
Q.dequeue()
Q.enqueue(3)
Q.dequeue()
1 2 3
empty
3
2 3
What is the hash function used in the division method?
h(k) = m mod k
h(k) = k/m
h(k) = m/k
h(k) = k mod m
For the given hash table with size 100 and folding method is used, in what location will the key 2844267 be hashed using probing?
5
67
105
7
The complexity of the binary search algorithm is
O(n*n)
O(log n).
O(n* log n).
O(n)
A graph in which exists a path between any two nodes is called
Digraph
Complete graph
In-directed graph
Connected graph
Suppose a singly linked list of integers is given below:
head ->1-2-3->4->5->None
What will be the output of the following code?
def listprint(self):
printval = self.head
while printval.next is not None:
print (printval.data) printval = printval.next
5 4 3 2 1
1 2 3 4
2 3 4 5
1 2 3 4 5
Following function is used to calculate the factorial number of n. What is the missing line?
def fact(num):
if num == 0:
return 1
else:
return____
num* fact(num - 1)
fact(num)* fact(num - 1}
num*fact(num + 1)
num (num - 1)
What is the result of Post-order traversal of the binary search tree below
7 2 12 10 20 35 50 25 15
15 10 2 7 12 25 50 20 35
7 2 12 20 10 35 50 25 15
15 10 2 7 12 25 20 50 35
Given the sequential representation of the binary tree T (a one-dimensional array is used to store the elements of the tree T) and the root node of the tree T is the node 15): The ancestors of the node 30 are:
15, 20, 12
15, 20, 10
15, 10, 12
15, 20, 25
Which sorting algorithm is the best if the list is already in order?
Quick Sort
Merge Sort
Selection Sort
Insertion Sort
Given a binary search tree as follows What would be the value of root after deleting key 50?
100 or 5
35 or 65
75 or 25
30 or 72
Give a binary tree as belows: The leaves of tree are:
E F G H
G H
G H F
B G H
What does the following function do def Func(self, root): if root: self.Func (root.left) print(root.data) self.Func (root.right)
Traverse the tree in BFT
Traverse the tree in Pre-order
Traverse the tree in In-order
Traverse the tree in DFT
Given a graph in the figure. the breadth-first traversal from node A is:
ABCGEFD
ABFCEDG
ACEBDFG
ABCEDFG
A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a?
Tree
Linked list
Stack
Queue
What will be the output of the following code? a=[1, 2, 3, 4, 5] b=a[2:4] print(b)
[3, 4, 5]
[2, 3, 4]
[2,4]
[3, 4]
In a hash table, an element with key k is stored at index
H(k)
k
Log k
k*k
Given an empty Stack S and a sequence of the following operations: Push(F); Push(P); Pop(S); Push(T); Pop(S); Push(U); What does the stack S look like?
TU
FPTU
FP
FU
Recursion calls are stored on the memory in which data structure?
Queue
Stack
Heap
Tree
A sorting algorithm that uses the divide and conquer technique is?
Bubble sort
Selection sort
Insertion sort
Quick sort
In a stack we can add and remove an element?
at/from any position
at/from middle position
at/from many positions
only at/from one position
Which of the following algorithms does not divide the list?
Merge Sort
Binary search
Linear search
Quick Sort
What is the result of Pre-order traversal of the binary search tree below
15 10 2 12 7 25 20 50 35
72 12 20 10 35 50 25 15
15 10 2 12 25 7 20 50 35
15 10 2 7 12 25 20 50 35
Given a hash table T with 20 slots that stores 1000 elements, the load factor a for T is
20
1000
50
0.02
Linear search is highly inefficient compared to binary search when dealing with:
large and sorted arrays
large and unsorted arrays
small and unsorted arrays
unsorted arrays
What will be the output of the following code? b=[1] *5 print(b)
0
[1, 1, 1, 1, 1]
Error
5
What is the output of the following program? a=[1,2,3,4,5] a[0]=6; print(len(a))
5
1
6
0
Given a graph in the figure, the adjacency matrix of the graph is (visit nodes in ABCD order):
[[0, 2, 0, 0], [0, 0, 7, 0], [0, 0, 0, 0], [0, 4, 8, 0]]
[[0,1, 0, 1], [0, 0, 1, 0], [0, 0, 0, 0], [0, 1, 1, 0]]
[[0, 2, 0, 9], [0, 0, 7, 4], [0, 7, 0, 8], [9, 4, 8, 0]]
[[0, 1, 0, 1], [1, 0, 1, 1], [0, 1, 0, 1], [1, 1, 1, 0]]
What is the output of the following code? my_list = ["Hello", "Python"] print("-".join(my_list))
HelloPython-
Hello-Python
-HelloPython
HelloPython
What is a hash table?
A structure used for storage
A structure that maps values to keys
A structure that maps keys to values
A structure used to implement stack and queue
Using Huffman coding to fill missed data into the following table:
A: 01411, B: 000, C: 0110, D: 0011, E: 0010, F: 010, G: 01110, H: 1
A: 1, B: 01110, C 0110, D: 0011, E: 0010, F: 010, G: 000, H 1
A: 1, B: 01110, C: 0110, D: 0011, E: 0010, F 010, G: 000, H: 01111
A:01111, B: 01110, C: 0110, D: 0011, E: 0010, F: 010. G: 000. H: 1
What is the MAXIMUM number of nodes in a binary search tree with height =3?
7
15
8
16
What will be the output of the following code? def fun(i, j): if (i == 0): retum j else: return fun(i-1,j+1) print(fun(4,8))
16
8
12
4
Given an array A = {6, 7, 4, 1, 2, 9} and Quick Sort is used to sort the array A in increasing order. What is the sequence after pass 2?
467129
146729
674129
124769
What method is used to remove an element from a Queue?
dequeue()
enqueue()
push()
pop()
A sorted array contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this array is
5
4
3
None of above
Which graph in discrete mathematics has a path of edges between every pair of vertices in the graph?
A bipartite graph
A connected graph
A disconnected graph
A directed graph
What is the output of post-order traversal?
abc+*+defg*+*
a+b*c+de+f*g
abc*+de*f+g*+
++a*b*+*defg
In which of the following hash functions, do consecutive keys map to consecutive hash values?
Folding method
Multiplication method
Mid-square method
Division method
The following sorting algorithms maintain two sub-lists. one sorted and one to be sorted?
Quick Sort
Selection Sort
None of these
Merge Sort
Given the sequential representation of the binary tree T (a one-dimensional array is used to store the elements of the tree T) and the root node of the tree T is the node 15 (picture below).
Show all the leaf nodes of the tree T:
5, 12, 7, 19, 2, 4
12, 19, 4
7, 19, 2, 4
12, 7, 19, 2, 4
Given a graph in the figure, the depth first traversal from node B is (visit nodes in ABCDE order):
BAEDC
BCDEA
BACDE
BADCE
Which of the following statement is false?
Infinite recursion can occur if the base case is not properly defined
Every recursive function must have a return value.
A recursive function makes the code easier to understand.
Every recursive function must have a base case
Given 4 graph in the figure, the adjacency matrix of the graph to:
[[0, 2, 0, 9, 4], [1, 0, 1, 0,0], [0, 1, 0, 1, 0], [9, 0, 8, 0, 5], [4, 0, 0, 5, 0]]
[[0, 2, 0, 1, 4], [1, 0, 1, 0,0], [0, 7, 0, 8, 5], [9, 0, 8, 0, 5], [4, 0, 0, 5, 0]]
[[0, 1, 0, 1, 1], [1, 0, 1, 0,0], [0, 1, 0, 1, 0], [1, 0, 1, 0, 1], [1, 0, 0, 1, 0]]
[[1, 0, 1, 0, 0], [0, 1, 0, 1,1], [1, 0, 1, 0, 1], [0, 1, 0, 1, 0], [0, 1, 1, 0, 1]]
What is the shortest path from node A to node G?
A-B-E-G
A-B-C-E-G
A-C-E-G
A-G
Which is the correct code to access data of the second node in a linked list?
head.next.data
head.next.next.data
head.head.data
head.data
What is the best-case time complexity of the Linear search?
O(1)
O(n*n)
O(nlogn)
O(n)
Given a list of 64 elements, how many elements will be checked to look for a value that is larger than the largest value in the list using binary search?
8
6
7
9
What will be the output of the following code? def rec(n): if n > 5 return n else return n + rec(n+2) print(rec(1))
5
16
1
15
List A is defined as follows: A= [1, 2,3, 4, 5] select all of the following statements that remove the middle element 3 from A so that it equals [1, 2, 4, 5]:
A[2:2] = []
A[2].remove()
del A[2]
A[2]=0
The following circular queue can accommodate a maximum six elements with the following data front = 2, rear = 4 queue = ;L; M;N;__; What are the values of front and rear after the add O operation takes place? queue; L; M;N; 0;
front 3, rear=5
front 1, rear= 4
front = 2, rear=5
front = 3, rear =4
Which of the following cases occurs when searching an array using linear search: the value to be searched is equal to the first element of the array?
The best case
The amortized case
The average case
The worst case
The data structure required for Breadth First Traversal on a graph is?
Stack
Linked list
Array
Queue
In Linked List implementation, a node carries information regarding
Data and Link
Node
Link
Data
Given a graph in the figure. the breadth first traversal from node 1 in order of precedence ascending
1432
1423
1342
1324
The following sorting algorithms maintain two sub-lists. one sorted and one to be sorted?
Quick Sort
Insertion Sort
None of these
Merge Sort
Which of the following algorithms has a logarithmic runtime complexity?
Binary search
Linear search
Merge Sort
Selection Sort
Given an undirected graph G with V vertices and E edges. the sum of the degrees of all vertices is
V
2V
E
2E
A chained hash table has an array size of 255. What is the maximum number of elements the table?
There is no limit
2
255
256
What is the best definition of a collision situation in a hash table?
Two entries are identical except for their keys
Two entries with different data have the exact same key.
Two entries with different keys have the same exact hash value.
Two entries with the exact same key have different hash values
List is defined as follows
A= [a', 'b','c']
Which of the following statements adds 'd' and 'e' to the end of A, so that it then equ["a','b', 'c', 'd', 'e']
A.extend(['d', 'e'])
A.append(['d', 'e'])
A[-1] = [d', 'e]
A.append('d', 'e')
Two algorithms, used for finding a Minimum spanning tree, are Kruskal and Dijkstra. Which algorithm uses the Cycle detection method?
The Kruskal algorithm
Bellman Ford algorithm
Huffman algorithm
Conquer algorithm
The Dijkstra algorithm.
What is the output of the following program? a= [5, 4, 7, 2, 9] print(a.index(4))
0
1
2
9
A sequence of the following operations.
Enqueue(15)
ENQUeUe(25)
Enqueue(25)
Dequeue():
Dequeue()
The value of the front element
0
5
15
25
Suppose the frequencies of characters is given by: A[10%], B[20%], C[70%] We want to improve the average length of the codeword by applying the Huffman algorithm to pairs of letters instead of single letters. What is the Huffman code of AB?
0010
001
0110
01
A hash function h defined h (key) = key mod 5, with Quadratic probing , is used to insert the keys 1, 10, 11, 12 into a table index from 0 to 4. What will be the location of key 12?
4
3
0
1
What is direct addressing?
Distinct array position for every possible key
Fewer array positions than keys
Fewer keys than array positions
Same array position for all keys
What is the output of the following list assignment? aList[4, 8, 12, 16] aList[1: 4] = [20, 24, 28] print(aList)
[4, 20. 24, 28. 8. 12. 16]
[4. 20. 24, 28]
[4, 8, 12, 16]
[20, 24, 28]
What will be the output of the following code?
def fact(n):
if n == 0:
return "good"
return fact(n-4)
else:
print(fact((16))
good good good good
good
16
4
What is the value of the shift Folding Hash Function if K = 723-203-541-213-24 and table size = 1000?
704
24
723
1704
Which of these is false about recursion?
Clean code
Takes less memory
Takes more memory
A Complex task is broke
What is the number of swappings needed to sort the numbers 8, 22, 7, 9, 31 in ascending order using bubble sort?
2
3
4
5
Given an array A = {6, 7, 4, 1, 2, 9} and Quick sort is used to sort the array A in increasing order. What is the sequence after the first phase, the pivot is 4?
674129
214769
124769
124679
What is tail recursion?
A recursive function that has two base cases
A function where the recursive functions leads to an infinite loop
A recursive function where the function doesn't return anything and just prints the values
A function where the recursive call is the last thing executed by the function
Which of these is not true about recursion?
Making the code look clean
A complex task can be broken into sub-problems
Recursive calls take up less memory
Sequence generation is easier than a nested iteration
What will be the output of the following code?
S.append(1)
S.append(2)
S.append(3)
print(S.peak())
[1,2,3]
1
3
Error
The complexity of Linear search algorithm is
O(n)
O(log n)
O(n^2)
O(n log n)
Suppose a singly linked list of integers is given below:
head ->1->2->3->4->5->None
What will be the output of the following code?
def listprint(self):
printval = self.head
print (printval.data)
printval = printval.next
12345
2345
1234
54321
What would be the contents of an empty stack S1 after the following operations are executed (visit from bottom to top)?
S1.push(3);
S1.push(5);
S1.push(9);
S1.pop();
S1.push(11);
3 5 9 11
5 9 11
369
3 5 11
An advantage of chained hash table (external hashing) over the open addressing scheme is
Worst case complexity of search operations is less
Space used is less
Deletion is easier
None of these
Given a binary search tree as follows: What is the output of In-order traversal?
10 20 30 40 50
50 40 20 30 10
40 20 50 10 30
40 20 50 30 10
Assume that Binary Trees T is represented as Array-Based Representation (root is stored at index 1) and a node X is stored at index 3. What is position of the left child of X?
3
5
6
7
The concept of prefix and suffix is used in which of the following algorithms?
KMP
Boyer-Moore
Brute Force
Advanced Brute Force
What will be the output of the following code?
def rec(n):
if (n <= 2):
return n
else:
return rec(n-2) + rec(n-1)
print(rec(4))
5
4
0
Error
What is degree of vertex V?
0
5
4
3
What will be the output of the following code?
from collections import deque
S = deque()
S.append(1)
S.append(2)
S.pop()
S.append(3)
S.pop()
print(S)
deque([1])
deque([1, 2, 3])
3
1
What is disadvantage of Recursion?
Recursive calls are expensive (inefficient) as they take up a lot of memory and time
Sequence generation is more difficult with recursion than using some nested iteration
A complex task can not be broken down into simpler sub-problems using recursion
None of these
Given an array A = {6, 7, 3, 4, 1, 2, 9} and Quick Sort is used to sort the array A in increasing order with pivot value 4. What is the array like after the first round?
6, 7, 3, 4, 1, 2, 9
2, 1, 3, 4, 7, 6, 9
1, 2, 3, 4, 7, 6, 9
1, 2, 3, 4, 6, 7, 9
Given a graph in the figure. the depth first traversal from node D is (visit nodes in ABC order):
D, C, B, A, E
D, C, E, A, B
D, A, B, C, E
D, E, A, B, C
Which sorting technique will be most appropriate to sort 1 GB of data with only 100 MB of available main memory?
Insertion sort
Heap sort
Merge sort
Quick sort
Which of the following algorithms use recursion for sorting an array of integers?
Bubble sort and Insertion sort
Bubble sort and Quicksort
Bubble sort and merge sort
Quicksort and merge sort
Which of these is false about recursion?
Recursive function can be replaced by a non-recursive function
Recursive functions usually take more memory space than non-recursive function
Recursive functions run faster than non-recursive function
Recursion makes programs easier to understand
In a hash table, what is called if two different keys are hashed to the same location?
Collision
Addressing
Hashing
Probing
What is the output of the following program? A=[1, 2, 3, 4, 5] A.pop(1) print (A)
1
[1, 3, 4, 5]
[2, 3, 4, 5]
[1, 2, 3, 4, 5]
Given a definition as follows: "a recursive function in which the first statement is a recursive call and then the other operations are performed" What is this?
Tail-Recursion
Non Tail-Recursion
Recursion
None of these
Given a graph in the figure. the weighted matrix of the graph is (visit nodes in ABC order)
[[0, 5, 0, 40], [0, 0, 10, 0], [0, 10, 0, 10], [0, 0, 0, 0]]
[[0, 1, 0, 0], [0, 0, 10, 9], [0, 1, 1, 0], [0, 0, 0, 0]]
[[0, 1, 0, 1], [1, 0, 1, 1], [0, 1, 0, 1], [1, 1, 1, 0]]
[[0, 1, 0, 1], [0, 0, 1, 0], [0, 1, 0, 0], [0, 0, 1, 0]]
Given a string S = "1234512345" and a pattern P = "123". What is brute-force algorithm returns? (the string is indexed from 0)
0
1
5
0, 5
A hash function h defined h(key)= key mod 5, linear probing is used to insert sequentially the keys 24,16, 36 into a hash table indexed from 0 to 4. What will the location of the key 36 be?
0
1
2
3
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
n/2
n*n
n
log(n)
Suppose a circular queue of capacity (n - 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR FRONT = 0. The conditions to detect queue full and queue empty are
Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT
Full: (REAR+1) mod n == FRONT, empty: (FRONT+1) mod n == REAR
Full: REAR == FRONT, empty: (REAR+1) mod n == FRONT
Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT
Given a graph in the figure. the weighted matrix of the graph is (visit nodes in ABC order)
[[0, 2, 0, 9], [0, 0, 7, 0], [0, 0 0, 0], [0, 0, 8, 0]]
[[0, 1, 0, 1], [0, 0, 1, 0], [0, 0, 0, 0], [0, 0, 1, 0]]
[[0, 1, 0, 1], [1, 0, 1, 1], [0, 1, 0, 1], [1, 1, 1, 0]]
[[0, 2, 0, 0], [0, 0, 7, 0], [0, 0, 0, 0], [0, 4, 8, 0]]
The number of elements in the weighted matrix of a graph having 5 vertices is?
5
16
25
36
Given a binary search tree as follows: What are the Internal nodes?
40
25, 35, 45, 60
30, 50
30, 40, 50
Which of these is not true about recursion?
It's easier to code some real-world problems using recursion than non-recursive equivalent
Recursive functions are easy to debug
Recursive calls take up a lot of memory
Programs using recursion take longer time than their non-recursive equivalent
You are given pointers to the first node of a singly linked list, which of the following operations are dependent on the length of the linked list?
Delete the first element
Insert a new element as a first element
Add a new element at the end of the list
None of these
Deleting the last element
Given an array as follows: [4, 1, 2, 9, 8]. How is the array like after the first round of Bubble sort?
4, 1, 2, 9, 8
1, 2, 4, 8, 9
1, 4, 2, 8, 9
1, 4, 2, 9, 8
Given an array as follows: [4, 1, 2, 9, 8]. How is the array like after the first round of Bubble sort?
4, 1,2, 9, 8
1, 2, 4, 8, 9
1, 4, 2, 8, 9
1, 4, 2, 9, 8
Given a binary search tree as follows: What would be the output of Pre-order traversal?
25, 30, 35, 40, 45, 50, 60
40, 30, 25, 35, 50, 45, 60
40, 30, 50, 25, 35, 45, 60
25, 35, 30, 45, 60, 50, 40
What is the search complexity in direct addressing?
O(n)
O(logn)
O(nlogn)
O(1)
A map/dictionary is created and the following key-value pairs are added in the following order: {"a": 2}, {"b": 3}, {"a", 4}, {"c", 5}. What is the value associated with the key "a"?
2
3
4
There's an error
What will be the output of the following code?
S=[]
for i in range(1,5):
if (i%2!= 1):
S.append(i)
while (len(S) > 0):
print(S.pop(0))
1 3
2 4
3 1
4 2
Given an array A = {3, 7, 6. 9, 1} how to A like after the first phase of selection sort in ascending order?
3, 7, 6, 9, 1
1, 3, 7, 6, 9
1, 7, 6, 9, 3
9, 3, 7, 6, 9
What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size n?
O(n/2)
O(log(n))
O(n*n)
O(n)
Which is the correct code to access data of node p in a linked list?
p.data
p.next
p.next.data
head.p.data
What will be the output of the following code?
S=[]
S.append(1)
S.append(2)
S.append(3)
S.pop()
print(S)
[1, 2, 3]
[1, 2]
1
3
Given an array as follows: [4, 2, 5, 8, 6] and a search key x using linear search? The Best case of searching occurs when value of x is
2
4
6
None of these
The data structure required for Depth First Traversal on a graph is?
Stack
Linked list
Array
Queue
How many passes are required for sorting 8 elements list using bubble sort?
8
7
9
6
What is a hash function?
A function has allocated memory to keys
A function that computes the location of the key in the array
A function that creates an array
A function that computes the location of the values in the array
The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?
24
25
26
27
Given a hash table T with 25 slots that stores 2000 elements, the load factor a for T is
80
0.0125
8000
1.25
Let P be a singly linked list. Let Q be the pointer to an intermediate node x in the list. What is the worst-case time complexity of the best known algorithm to delete the node Q from the list?
O(n)
O(logn)
O(1)
O(n*n)
B+ Trees are considered BALANCED because
the lengths of the paths from the root to all leaf nodes are all equal.
the lengths of the paths from the root to all leaf nodes differ from each other by at most 1.
the number of children of any two non-leaf sibling nodes differ by at most 1.
the number of records in any two leaf nodes differ by at most 1.
The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?
2
3
4
6
The postorder traversal of a binary tree is 8, 9, 6, 7, 4, 5, 2, 3, 1. The inorder traversal of the same tree is 8, 6, 9, 4, 7, 2, 5, 1, 3. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is was Numerical Type question. Note -This
2
3
4
5
