PSC HSST Computer Science Model Questions & Answers : Part 2
76. Which one of the following proposition is a tautology?
(A) p→(p→q) (B) pν(q→p)
(C) pν(p→q) (D) (pνq)→p
Answer: C
77. Relocatable programs
(A) do not need a linker
(B) can be loaded almost anywhere in memory
(C) can be loaded only at one specific location
(D) cannot be used with fixed partitions
Answer: B
78. In the write operation of DMA, the data is transferred
(A) from I/O to memory (B) from memory to memory
(C) from memory to I/O (D) from I/O to I/O
Answer: A
79. Which of the following language paradigms allows the programmer to express algorithms derived from a top-down design?
(A) logic (B) functional
(C) object-oriented (D) procedural
Answer: D
80. The following is an example of bool-expression.
(A) x=6 (B) m1.setText(“Hello”)
(C) cause=bYes (D) 70
Answer: C
81. If every requirement can be checked by a cost-effective process, then the SRS is said to be
(A) verifiable (B) complete
(C) traceable (D) modifiable
Answer: A
82. In order to sort a list L consisting of a sorted list followed by a few “random” elements, which one of the following sorting methods would be suitable?
(A) Quick sort (B) Selection sort
(C) Bubble sort (D) Insertion sort
Answer: D
83. SIMD organization represents
(A) organization of single computer containing a control unit, processor unit and a memory unit
(B) one that includes many processing units under the supervision of a common control unit
(C) a computer system capable of processing several programs at the same time
(D) none of the above
Answer: B
84. The view of total database content is
(A) External view (B) Physical view
(C) Internal view (D) Conceptual view
Answer: D
85. Quick sort algorithm belongs to the ………………… design technique.
(A) Backtracking (B) Dynamic programming
(C) Greedy (D) Divide and Conquer
Answer: C
86. Among the following, which one is NOT a regular expression?
(A) (1+2+0)*(1+2)
(B) [(0+1)-(0b+a1)*(a+b)]*
(C) [(a+b)*(aa+bb)]*
(D) (01+11+10)*
Answer: B
87. Given a 4-input AND gate, how many inputs must be HIGH in order for the output of the logic gate to go HIGH?
(A) any two of the inputs (B) any one of the inputs
(C) any three of the inputs (D) all four inputs
Answer: D
88. Let P be the risk probability, L be the loss, then Risk Exposure(RE) is computed as
(A) RE=P+L (B) RE=P/L
(C) RE=P*L (D) RE=2*P*L
Answer: C
89. Virtual memory is
(A) less efficient in utilization of memory
(B) used in all major commercial operating systems
(C) simple to implement
(D) useful when fast I/O devices are not available
Answer: B
90. If we are to debug an implementation of a quick sort that is supposed to sort an array in ascending order, after the first partition step has been completed, the contents of the array are in the following
2 10 1 14 17 24 22 20
(A) The pivot could have been either 14 or 17
(B) Neither 14 nor 17 could have been the pivot
(C) The pivot could have been 17, but could not have been 14
(D) The pivot could have been 14, but could not have been 17
Answer: A
91. An n-bit microprocessor has
(A) n-bit program counter (B) n-bit ALU
(C) n-bit address register (D) n-bit instruction register
Answer: D
92. Which one of the following is NOT a scripting language?
(A) Javascript (B) HTML
(C) Postscript (D) XML
Answer: C
93. Which one of the language paradigms express the addition of two values as (+10 20)?
(A) procedural (B) object-oriented
(C) logic (D) functional
Answer: D
94. In the spiral model ‘risk analysis’ is performed
(A) before using spiral model
(B) in the first and second loop
(C) in every loop
(D) in the first loop
Answer: C
95. Merging four sorted files containing 50, 10, 25 and 15 records respectively takes ……………….. time
(A) O(200) (B) O(175)
(C) O(125) (D) O(100)
Answer: D
96. Which one of the following is NOT a fundamental process state?
(A) blocked (B) ready
(C) terminated (D) executing
Answer: A
97. The circuit that is used to store one bit of data is
(A) Decoder (B) Register
(C) Encoder (D) Flip Flop
Answer: D
98. Average time required to reach a storage location in memory and read its contents is
(A) turnaround time (B) transfer time
(C) seek time (D) access time
Answer: D
99. Using Bubble sort, the number of interchanges required to sort 5, 1, 6, 2 and 4 in ascending order is
(A) 7 (B) 5
(C) 8 (D) 6
Answer: B
100. SRD atands for
(A) Software Requirements Definition
(B) Structured Requirements Diagram
(C) Software Requirements Diagram
(D) Structured Requirements Definition
Answer: Question Cancelled
Part 1 : PSC HSST Computer Science Model Questions & Answers
51. The ……………….. sort relatively passes through a list to exchange the first element with any element less than it and then repeats with a new first element
(A) selection sort (B) quick sort
(C) insertion sort (D) heap sort
Answer: B
The correct answer is Selection Sort. i.e, Option A
Selection sort replaces ith element with ith smallest element (not any element smaller than it)
85. Quick sort algorithm belongs to the ………………… design technique.
(A) Backtracking (B) Dynamic programming
(C) Greedy (D) Divide and Conquer
Answer: C
It is D) Divide and Conquer 🙂
PLEASE give me the logic of qn no56..
23. The device that is used to forward data packets from one network to another is called a …………………
(A) Bridge (B) Hub
(C) Switch (D) Gateway
Answer: C
Correct answer is D(Gateway/Router)