Kerala PSC HSST Computer science Previous Question paper part 2

Kerala PSC HSST Computer science solved paper part 2
Question Paper Code: 86/2016/OL

Category Code: 099/2015

Exam: HSST Computer Science SR For SC/ST

Date of Test 29-12-2016

Alphacode A

26:-Which one of the following is an associative container ?
A:-list
B:-queue
C:-map
D:-string
Answer:- Option-C

27:-Which one of the following is a sequence container ?
A:-stack
B:-deque
C:-queue
D:-set
Answer:- Option-B

28:-What does the acronym BCPL stands for ?
A:-Basic Combined Programming Language
B:-Basic Compiler Programming Language
C:-Beginners Combined Programming Language
D:-None of the above
Answer:- Option-A

29:-What was Ken Thompson's version of C called ?
A:-C++
B:-B
C:-P
D:-None of the above
 Answer:- Option-B

30:-What does the fopen() function return ?
A:-address
B:-pointer
C:-file pointer
D:-all of the above
 Answer:- Option-C

31:-Recursive algorithms are based on
A:-Divide and conquer approach
B:-Top-down approach
C:-Bottom-up approach
D:-Hierarchical approach
 Answer:- Option-C

32:-The Sorting method which is used for external sort is
A:-Bubble sort
B:-Quick sort
C:-Merge sort
D:-Radix sort
 Answer:- Option-C

33:-Worst case efficiency of binary search is
A:-`log_(2) n + 1`
B:-n
C:-`2^(n)`
D:-log n
 Answer:- Option-D

34:-What is the type of the algorithm used in solving the 8 Queens problem ?
A:-Dynamic
B:-Backtracking
C:-Branch and Bound
D:-None of the above
 Answer:- Option-B

35:-The time taken by NP-class sorting algorithm is
A:-O(1)
B:-O(log n)
C:-`O(n^(2))`
D:-O(n)
 Answer:- Option-D

36:-How many nodes are there in a full state space tree with n = 6 ?
A:-65
B:-64
C:-63
D:-32
 Answer:- Option-C

37:-Prims algorithm is based on __________ method.
A:-Divide and conquer method
B:-Greedy method
C:-Dynamic programming
D:-Branch and bound Answer:- Option-B

38:-Graph Colouring is which type of algorithm design stratergy
A:-Backtracking
B:-Greedy
C:-Branch and Bound
D:-Dynamic programming
 Answer:- Option-A

39:-The asymptotic notation for defining the average time complexity is
A:-Equivalence
B:-Symmetric
C:-Reflexive
D:-All of the above
 Answer:- Option-A

40:-The complexity of merge sort algorithm is
A:-O(n)
B:-`O(n^(2))`
C:-O(log n)
D:-O(n log n)
 Answer:- Option-D

41:-Dijkstra's banking algorithm in an operating system, solves the problem of
A:-Deadlock recovery
B:-Mutual exclusion
C:-Deadlock avoidance
D:-None of these
 Answer:- Option-C

42:-Interval between the time of submission and completion of the job is called
A:-Waiting time
B:-Response time
C:-Throughput
D:-Turnaround time
 Answer:- Option-D

43:-The example of non-preemptive scheduling is
A:-First-Come-First-Served
B:-Round Robin
C:-Last-In-First-Out
D:-Shortest-Job-First
 Answer:- Option-A

44:-__________ is a process-to-process protocol that adds only port addresses, checksum, error control and length information to the data from the upper layer.
A:-TCP
B:-UDP
C:-IP
D:-None of the above
 Answer:- Option-B

45:-The RSA algorithm uses a ___________ cryptography method.
A:-Public Key
B:-Private Key
C:-Symmetric Key
D:-All the above
 Answer:- Option-A

46:-The __________ attack is related to confidentiality.
A:-Fabrication
B:-Interception
C:-Modification
D:-Interruption
 Answer:- Option-B

47:-The cryptography method in which the plaintext BBBB becomes the ciphertext BCDE. This is probably
A:-Transposition cipher
B:-Monoalphabetic substitution cipherC:-Polyalphabetic substation cipher
D:-None of the above
 Answer:- Option-C

48:-The following service is not provided by digital signature
A:-Integrity
B:-Authentication
C:-Nonrepudiation
D:-Confidentiality
 Answer:- Option-D

49:-_________ is a technique of temporarily removing inactive programs from the memory of computer system.
A:-Swapping
B:-Spooling
C:-Semaphore
D:-Scheduling
 Answer:- Option-A

50:-Fence register is used for
A:-CPU protection
B:-Memory protection
C:-File protection
D:-Processor protection
 Answer:- Option-B

<<<Previous |||Next>>>