Sunday, 31 July 2016

HSST Computer Science Solved Paper (SR For ST) 144/2013 - Part 6

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
52.       Which among the following is the data structure that is used to check balanced parenthesis in an expression
(A) Stack           (B) Tree
(C) Queue         (D) Array
Answer: A
53.       p → q is logically equivalent to
(A) ~q → p         (B) ~pνq
(C) ~pΛq            (D) ~p → q
Answer: B
54.       Which of the following regular expression over {0,1} denotes the set of all strings not containing 100 as substring?
(A) 0*1*01*        (B) 0*1010*
(C) 0*(1*0)*       (D) 0*(10+1)*
Answer: D
55.       Which one of the following is NOT a size metric?
(A) Cyclomatic complexity      (B) Function count
(C) LOC                                     (D) Program Length
Answer: A

56.       How many times is the symbol '&' printed by the call sample(4)?
void sample(int i){
if(i>1){
sample(i/2);
sample(i/2);
}
cout<<"&";
}
(A) 3       (B) 4
(C) 7       (D) 8
Answer: C
57.       The scheduling policy that is most suitable for a time-shared operating system is :
(A) SJF                          (B) Elevator
(C) Round Robin         (D) FCFS
Answer: C
58.       If a node in a BST has two children, then its inorder predecessor has
(A) no child                   (B) no left child
(C) no right child          (D) two children
Answer: C
59.       The maximum number of processes that may be simultaneously inside the critical section inorder to avoid race condition is
(A) one                          (B) zero
(C) more than two        (D) two
Answer: A
60.    The time required by a sector to reach below read/write head is called as ...................
(A) Seek time                (B) Access time
(C) Latency time          (D) None
Answer: C


0 comments:

Post a Comment