Kerala PSC Previous Years Question Paper & Answer

Title : SYSTEM ANALYST / PROGRAMMER KPSC MEDIUM : ENGLISH
Question Code : A

Page:5


Below are the scanned copy of Kerala Public Service Commission (KPSC) Question Paper with answer keys of Exam Name 'SYSTEM ANALYST / PROGRAMMER KPSC MEDIUM : ENGLISH ' And exam conducted in the year 2019. And Question paper code was '017/2019/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: 017/2019/OL

வங்‌ ‏+٤۹۷‎
‎D:-None of these
Correct Answer:- Option-B
Question37:-Which of the following is/are not true in contiguous allocation of disk space
ಹಿ of the file is to be declared in advance
B:-There is no external fragmentation
C:-Difficulty in finding space for a new 816
D:-Both 2 and 3
Correct Answer:- Option-B
Question38:-Interrupt latency for real time 0S should be
A:-Maximum
B:-Zero
C:-Minimal
D:-None of the above
Correct Answer:- Option-C
Question39:-Which of the following is an invalid shell variables?

D:-Both 2 and 3
Correct Answer:- Option-C
Question40:-The output of the following shell programming is
var_1 = good
Readonly var_1
var_1= moming
echo $var 1
exit0
A:-good
B:-moming
C:-program will generate an error message
D:-none of the above
Correct Answer:- Option-A
Question41:-The time complexity of building a heap with 'n’ elements is
ಹಿ-0(೧)
8:-0(106 ೧)
01072
D:-0(n log n}
Correct Answer:- Option-A
Question42:-Which of the following is false regarding AVL trees?
A:-AVL tree is more balanced than binary search tree
B:-AVL tree is more space efficient than binary search tree
C:-AVL tree is more time efficient than binary search tree
D:-None of the above
Correct Answer:- Option-B
Question43:-What is the worst case complexity of quicksort?
A:-0(n log n}
B:-0(n}
01072
D:-Oflog n}
Correct Answer:- Option-C
Question44:-Which data structure can be used to efficiently implement dijkstra's algorithm?
A:-Double ended queue
B:-Priority queue
C:-Stack
D:-Binary search tree
Correct Answer:- Option-B
Question45:-Which data structure is well suited for separate chaining?
A:-Singly linked list
B:-Doubly linked list
C:-Circular linked list

Similar Question Papers

Ask Question

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


Questions & Answers

SYSTEM ANALYST / PROGRAMMER KPSC MEDIUM : ENGLISH : Video