PSC Lecturer in Computer Science Model Questions and Answers

26. The word ‘public servant’ means :
(A) Any person in the service or pay of the Government
(B) Any person in the service or the pay of any local authority
(C) Any person in the service or pay of any corporation established under a State or a Central Act
(D) All of the above
Answer: D

27. The world environment day is celebrated on …………….. of every year
(A) 8th June (B) 5th September
(C) 2nd October (D) 1st May
Answer:-Question Cancelled

28. Every request for obtaining information under the Right to Information Act is to be disposed of with in:
(A) 45 days (B) 90 days
(C) 30 days (D) 60 days
Answer: C

29. The Supreme Court of India recognized sexual harassment at work place as a violation of human rights in the case of :
(A) Ahmed Khan v Shah Bano Begum
(B) Visakha v State of Rajasthan
(C) Tukaram v State of Maharashtra
(D) Bachan Singh v State of Punjab
Answer: B

30. The information exempted from disclosure under Section 8 of the Right to Information Act includes:
(A) Information received in confidence from a foreign government
(B) Cabinet papers including records of deliberations of the council of ministers and secretaries
(C) Information available to a person in his fiduciary relationship
(D) All the above.
Answer: D

31. The binary equivalent of decimal number 20.625 is
(A) 10100.1011 (B) 10100.1100
(C) 10100.1010 (D) 10101.1010
Answer: C

32. A memory that contains 32K memory requires how many different addresses
(A) 32752 (B) 32768
(C) 32640 (D) 31744
Answer: B

33. An SDRAM chip has 4096 rows, a refresh time of 128ms, the memory bus runs at 166MHz and the refresh cycle takes 4 clock cycles. The refresh overhead is:
(A) 0.00076 (B) 0.00770
(C) 0.00740 (D) 0.00748
Answer: A

34. What is the address line for RST 4.5?
(A) 0028H (B) 0018H
(C) 0020H (D) 0024H
Answer: D

35. Which of the following is a software interrupt?
(A) RST 6.5 (B) RST 5
(C) INTR (D) RST 7.5
Answer: B

36. The expression E+((A+B)*D)-C can be written in Reverse Polish Notation as
(A) AB+D*E+C (B) AB+D*+E-C
(C) -+*+ABDEC (D) EAB+D*+C
Answer: D

37. The maximum number of I/O devices that can be connected to 8085 microprocessor is
(A) 255 (B) 512
(C) 65536 (D) 256
Answer: C

38. How many pins does a DDR SDRAM DIMM have?
(A) 184 (B) 168
(C) 72 (D) 172
Answer: A

39. UART is
(A) 8255 (B) 8250
(C) 8251 (D) 8279
Answer: B

40. DMA Controller gets complete access to main memory through which technique?
(A) Burst Mode (B) Memory Stealing
(C) Cycle Stealing (D) Memory Con
Answer: A

41. Which of the following represents the average-case performance of a quicksort algorithm?
(A) O(n) (B) O(log n)
(C) O(n/2) (D) O(nlog n)
Answer: D

42. 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
Answer: C

43. A 3-ary tree is a tree in which every internal node has exactly 3 children. The number of leaf nodes in such a tree with 6 internal nodes will be
(A) 10 (B) 23
(C) 17 (D) 13
Answer: D

44. Of the following sorting algorithms, the one which has a running time that is least dependent on the initial ordering of the input is
(A) Insertion sort (B) Quick sort
(C) Merge sort (D) Selection sort
Answer: C

45. The number of edges in a regular graph of degree d and n vertices is
(A) maximum(n,d) (B) n+d
(C) nd (D) nd/2
Answer: D

46. The depth of a complete binary tree is given by
(A) n log n (B) log n + 1
(C) log n (D) n log n + 1
Answer: B

47. Convert the expression ((A+B)*C-(D-E)^(F+G)) to equivalent Postfix notation
(A) AB+C*DE–FG+^
(B) AB-C*DE–FG+^
(C) AB+CDE*–FG+^
(D) AB+*CDE–FG+^
Answer: A

48. Merge sort uses
(A) Divide and Conquer strategy (B) Backtracking approach
(C) Heuristic search (D) Greedy approach
Answer: A

49. Linked lists are best suited
(A) for relatively permanent collections of data
(B) for the size of the structure and the data in the structure are constantly changing
(C) for both of above situations
(D) for none of above situations
Answer: B

50. The complexity of the average case of an algorithm is
(A) much more complicated to analyze than that of worst case
(B) much more simpler to analyze than that of worst case
(C) some times more complicated and some other times simpler than that of worst case
(D) none of the above
Answer: A