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 'HSST COMPUTER SCIENCE KHSE' And exam conducted in the year 2018. And Question paper code was '016/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.
17.
18.
19.
20.
21.
22,
23,
24,
25,
26,
18 ೫೫7 NP complete problem is in P class, then :
(A) P=NP ൫ PI=NP
(C) P=NP (D) None of the above
Which of the following problem is NOT NP-complete ?
(മ) Hamiltonian cycle problem (3) Clique problem
(C) Travelling—salesman problem (2) None of the above
The running time of Kruska'ls algorithm for a graph G=(V, E) for finding
Minimum-spanning-tree is :
മ) ஆ) 0) ೦0೫1೪೫1081)
(೦0 ೦%) യു ൫)
The data structure used in breadth-first-search (BST) is :
(മ) Stack (B) Queue
(C) B-Tree (D) None of the above
Strassen’s algorithm for multiplying n X n matrices runs in :
(ಹ) ೦) 06 (3) O(?) time രര ய യ) லிசி مس
The postfix representation of the expression (8 +b*c) +({d*e +1f)*g) is :
(5) abc*+de*f+g*+ (B) ab+c*de*f+g+*
(ಲ) ab+c*de*f+g*+ (D) abc*+def*+g*+
The worst case time complexity of merge sort is :
(^) லி இ வலை (೦0 ریہ യ) ೦೧೨
A set of n>=0 disjoint trees :
(മ) Tree (8) Forest (C) BTree (D) र्ण the above
Which of the following is a linear data structures ?
(A) Array (B) Linked list
(ಲ) Both (A) and (B) (D) None of the above
The worst case time complexity of Quick sort is :
تہ فص இ வை © ०८) ¢>) ೦೧೪
016/2018 6 A
