Kerala PSC Previous Years Question Paper & Answer
Page:8
Below are the scanned copy of Kerala Public Service Commission (KPSC) Question Paper with answer keys of Exam Name 'LECTURER IN COMPUTER SCIENCE COLLEGIATE EDUCATION' And exam conducted in the year 2018. And Question paper code was '073/2018'. 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.
40. The average number of comparisons in selection sort and insertion sort are respectively
(^) n(n-1)/2 and n(n-1)/4 8) n(n-1)/4 and n(n-1)/2
(() n(n-1)/2 and n(n-1)/2 (D) n(n-1)/4 and n(n-1)/4
41. The time complexity of merging two sorted arrays of size m and n is :
(ക) 0) (8) 09)
(ಲ) O(m") (D) None of the above
42. The use of threaded binary tree helps to :
(^) Reduce the space occupied by nodes
(8) Traversals can be done without stack space
(C) Less number of pointers are required
(D) None of the above
43, The depth first and breadth first traversals of the tree below produces
(A) 53,6,1,4,2and5,3,1,2,4,6 (8) 5,3,4,6,1,2and5,3,1,2,4,6
(೮) 1,2,3,4,5,6and 1,2,3,4,6,5 (D) 5,6,4,3,1,2and5,3,6,4,2,1
44. The order of visiting the edges using Prim’s algorithm for minimum cost spanning tree starting
from node “e¢” are
(^) ef, de, bd, ad (B) €, عل 86, ೩0
(C) 20, €, ४५, ५९ (D) None of these
073/2018 8 A
