# PSC HSST Computer Science SR for SC/ST Solved Paper 2016 – Part 2

Last Updated On: 30/04/2018

## PSC HSST Computer Science SR for SC/ST Solved Paper 2016 – Part 2

26. Which one of the following is an associative container?
(A) list
(B) queue
(C) map
(D) string

27. Which one of the following is a sequence container?
(A) stack
(B) deque
(C) queue
(D) set

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

29. What was Ken Thompson’s version of C called?
(A) C++
(B) B
(C) P
(D) None of the above

30. What does the fopen() function return?
(B) pointer
(C) file pointer
(D) all of the above

31. Recursive algorithms are based on
(A) Divide and conquer approach
(B) Top-down approach
(C) Bottom-up approach
(D) Hierarchical approach

32. The Sorting method which is used for external sort is
(A) Bubble sort
(B) Quick sort
(C) Merge sort

33. Worst case efficiency of binary search is
(A) log2 n+1
(B) n
(C) 2n
(D) log n

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

35. The time taken by NP-class sorting algorithm is
(A) O(1)
(B) O(log n)
(C) O(n2)
(D) O(n)

36. How many nodes are there in a full state space tree with n = 6?
(A) 65
(B) 64
(C) 63
(D) 32

37. Prims algorithm is based on …………. method.
(A) Divide and conquer method
(B) Greedy method
(C) Dynamic programming
(D) Branch and bound

38. Graph Colouring is which type of algorithm design strategy
(A) Backtracking
(B) Greedy
(C) Branch and Bound
(D) Dynamic programming

39. The asymptotic notation for defining the average time complexity is
(A) Equivalence
(B) Symmetric
(C) Reflexive
(D) All of the above

40. The complexity of merge sort algorithm is
(A) O(n)
(B) O(n2)
(C) O(log n)
(D) O(n log n)

41. Dijkstra’s banking algorithm in an operating system, solves the problem of
(B) Mutual exclusion
(D) None of these

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

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

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

45. The RSA algorithm uses a ……………. cryptography method.
(A) Public Key
(B) Private Key
(C) Symmetric Key
(D) All the above

46. The ………….. attack is related to confidentiality.
(A) Fabrication
(B) Interception
(C) Modification
(D) Interruption

47. The cryptography method in which the plaintext BBBB becomes the cipher text BCDE. This is probably
(A) Transposition cipher
(B) Monoalphabetic substitution cipher
(C) Polyalphabetic substation cipher
(D) None of the above

48. The following service is not provided by digital signature
(A) Integrity
(B) Authentication
(C) Nonrepudiation
(D) Confidentiality

49. …………… is a technique of temporarily removing inactive programs from the memory of computer system.
(A) Swapping
(B) Spooling
(C) Semaphore
(D) Scheduling

50. Fence register is used for
(A) CPU protection
(B) Memory protection
(C) File protection
(D) Processor protection

PSC HSST Computer Science SR for SC/ST Solved Paper 2016 – Part 1

PSC HSST Computer Science SR for SC/ST Solved Paper 2016 – Part 2

PSC HSST Computer Science SR for SC/ST Solved Paper 2016 – Part 3

PSC HSST Computer Science SR for SC/ST Solved Paper 2016 – Part 4

Sharing is caring
Subscribe
Notify of