Kerala PSC Previous Years Question Paper & Answer
Page:6
Below are the scanned copy of Kerala Public Service Commission (KPSC) Question Paper with answer keys of Exam Name 'COMPUTER OPERATOR KIRTADS' And exam conducted in the year 2015. And Question paper code was '132/2015'. Medium of question paper was in Malayalam or English . Booklet Alphacode was 'A'. Answer keys are given at the bottom, but we suggest you to try answering the questions yourself and compare the key along wih to check your performance. Because we would like you to do and practice by yourself.
The sort method that switches the adjacent elements, if needed after comparison is :
43.
(ಗ) 10% sort (B) Quick sort
(C) Insertion sort (D) Bubble sort
44. Minimum number of queues needed to implement the priority queue :ُو
@ 1 B 2
© 3 0) 4
45. After a sequence of steps in an algorithm, a linked list reaches the following step,
START = NULL
| ~ गुल प्ट अपशन 18,
(^) overflow (B) underflow
(C) initialisation (D) saturation
46. The result of following expression in polish notation is
432+*84/-
ക 13 (8) 12
(6) 8 D) 34
47. The data structure that can implement a recursive procedure is :
(ಗಿ) Tree (B) Linked List
(©) Queue (D) Stack
48. For a sorted linked list of length n, the worst case time required to search a given element is :
(4) - 00) ®) பலே
(0) 00०2") യ 0008, 27)
49. The characteristic of the elements that is maximum utilised in binary search is :
(^) Length of the list (൫) Number of elements in the list
(C) Order of the list (D) Highest value in the list
50. For a binary tree with nine nodes, the result of inorder traversalis: DBAGECHF L
And that of postorder traversalis : D B G E HIF C A. Then the result of preorder traversal
18: ⋅
(A) ABDCEGFHI (B) ABDECFGHI
¢ ADBCEFGHI (D) ADBEFCGHI
182/2015 8 A
