Kerala PSC Previous Years Question Paper & Answer

Title : LECTURER IN COMPUTER SCIENCE COLLEGIATE EDUCATION
Question Code : A

Page:5


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 2015. And Question paper code was '028/2015/OL'. 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.

page: 5 out of 12
Excerpt of Question Code: 028/2015/OL

D:-256
Correct Answer:- Option-C
Question38:-How many pins does a DDR SDRAM DIMM have?
A:-184
B:-168
೧-72
0:-172
Correct Answer:- Option-A
Question39:-UART is
A:-8255
B:-8250
C:-8251
D:-8279
Correct Answer:- Option-B
Question40:-DMA Controller gets complete access to main memory through which technique?
A:-Burst Mode
B:-Memory Stealing
C:-Cycle Stealing
D:-Memory Con
Correct Answer:- Option-A
Question41:-Which of the following represents the average-case performance of a quicksort algorithm?
A:-0(n)
B:-O(log n}
C:-0(n/2)
D:-O(nlog n}
Correct Answer:- Option-D
Question42:-Which of the following is not the required condition for binary search algorithm?
A:-The list must be sorted
B:-There should be direct access to the middle element in any sublist
C:-There must be mechanism to delete and/or insert element in list
D:-None of these
Correct Answer:- Option-C
Question43:-A 3-ary tree is a tree in which every intemal node has exactly 3 children. The number of leaf nodes in such a
tree with 6 intermal nodes will be
A:-10
B:-23
೧-17
0:-13
Correct Answer:- Option-D
Question44:-Of the following sorting algorithms, the one which has a running time that is least dependent भ) the initial
ordering of the input is
A:-Insertion sort
B:-Quick sort
C:-Merge sort
D:-Selection sort
Correct Answer:- Option-C
Question45:-The number of edges in a regular graph of degree d and n vertices is
A:-maximum{n,d}
B:-nt+d
‏لیک‎
‎0:2
‎Correct Answer:- Option-D
Question46:-The depth of a complete binary tree is given by
A:-nlog n
8:16 0+1
419917
D:-nlogn+1
Correct Answer:- Option-B
Question47:-Convert the expression {{A+B}C-(D-E}* (F+G}) to equivalent Postfix notation

Similar Question Papers

Ask Question

(Press Ctrl+g to toggle between English and the chosen language)


Questions & Answers

LECTURER IN COMPUTER SCIENCE COLLEGIATE EDUCATION : Video