Kerala PSC Previous Years Question Paper & Answer
Page:10
Below are the scanned copy of Kerala Public Service Commission (KPSC) Question Paper with answer keys of Exam Name 'ASSISTANT PROFESSOR INFORMATION TECHNOLO0GY TECHNICAL EDUCATION ENGINEERING DCOLLEGES' And exam conducted in the year 2016. And Question paper code was '140/2016'. 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.
77.
78.
81.
82.
85.
A problem in NP is NP complete if
(ക Some problem in NP can be reduced to it in polynomial time
(B) The 3-SAT problem can be reduced to it in polynomial time
(C) Ttean be reduced to any other problem in NP in polynomial time
(D) Itean be reduced to the 3SAT problem in polynomial مستا
The maximum number of edges in an acyclic undirected graph with n vertices is :
ಯ ௨-1 2) n+l
© प @) ॐ -1
In a binary tree, the number of internal nodes of degree 1 is 5 and the number of internal
nodes of degree 2 is 10. The number of leaf nodes in the binary tree is :
മ 15 B 11
© 12 @™ 10
Which of the following sequences of array clements forms a heap?
(A) [23,17, 14,6, 13, 10, 1, 12, 7, 5] © [23,17,14,6,13,10,1,5,7, 12]
(0) [23, 17, 14, 7, 18, 10, 1, 5, 6, 12] യ 128, 17, 14, 1, 18, 10, 1, 1, 5,7]
The binary relation r = {(1, 1), (2, 1), (2, 2), (2, 3), (2, 4), (3, 1), (3, 2), (3, 8), (3, वी] on the set
A={1,234}is:
(A) Reflexive ,symmetric and transitive
(B) Neither reflexive, nor irreflexive but transitive
(C) Irreflexive and antisymmetric
(22) Irreflexive, symmetric and transitive
In a room containing 28 people ,there are 18 people who speak English, 15 people who
Hindi and 22 people who speak Kannada, 9 persons speak both English and Hindi,
11 persons speak both Hindi and Kannada where as 13 persons speak both Kannada
English. How many people speak all the three languagea?
കര 6 © 7
(0 8 @ 9
«lb).Whu:h'c'}m“uftheMbmng'mguhrmmmm'isNOTaquwa.\zu‘tmthamgularexpnomn'
ab)* + c*y*?
ബിക ٭ر سس (8) (४५४५५०५)
(0) (a+b+o* D) (a*b* +e*)*
Which of the following statements is TRUE about the regular expression 01*0?
(A) It represents a finite set of finite strings
(ए) It represents an infinite set of finite strings
(C) [४ represents an infinite set of infinite strings
(D) It represents a finite set of infinite strings
Let L be a context free language and M a regular language. Then the language LM is :
(ക Always regular
(B) Always a deterministic context free language
(C) Never regular ↴
(D) Always a context free language
11
ہے 12 140/2016
