PSC HSST Computer Science – SR for ST Only Solved 2014 – Part 3
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
Answer
B. quick sort
52
Which among the following is the data structure that is used to check balanced parenthesis in an expression
Answer
A. Stack
53
p → q is logically equivalent to
Answer
B. ~pνq
54
Which of the following regular expression over {0,1} denotes the set of all strings not containing 100 as substring?
Answer
D. 0*(10+1)*
55
Which one of the following is NOT a size metric?
Answer
A. Cyclomatic complexity
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 :
Answer
C. Round Robin
58
If a node in a BST has two children, then its inorder predecessor has
Answer
C. no right child
59
The maximum number of processes that may be simultaneously inside the critical section inorder to avoid race condition is
Answer
A. one
60
The time required by a sector to reach below read/write head is called as ...................
Answer
C. Latency time
61
Which one of the following TCP/IP protocol is used for transferring e-mail messages from one machine to another?
Answer
C. SMTP
62
Among the following, which one is used to connect two systems, specifically if the systems use different protocols.
Answer
C. gateway
63
The disadvantage of a pipe is that
Answer
D. All of the above
64
a subschema expresses
Answer
C. the external view
65
Given that modules X and Y operate on the same input and output data, then the cohesion is
Answer
B. Communicational
66
Which among the following sorting methods is the most suitable one for sorting a list which is almost sorted
Answer
A. Bubble Sort
67
..................... is the scheduler which selects processes from secondary storage for scheduling
Answer
C. Medium term scheduler
68
Among the following which one is NOT a weighted code?
Answer
B. Excess 3 code
69
LDAP stands for
Answer
B. Lightweight Directory Access Protocol
70
EPROM is erased by using
Answer
A. Ultraviolet rays
71
The language that has recently become the defacto standard for interfacing application programs with relational database system is
Answer
B. SQL
72
A translator which performs macro expansion is called as ....................
Answer
D. Macro pre-processor
73
The term 'page traffic' refers to
Answer
A. the movement of pages in and out of memory
74
The term 'page traffic' refers to
Answer
A. the movement of pages in and out of memory
75. The running time of the following fragment of code is :
for (int i=0;i<20;i++) for(int j=0;j<N;j++) for (int k=N-2;k<N+2;k++) cout<<i<<" "<<j<<endl;
(A) O(N log N) (B) O(log N)
(C) O(N2) (D) O(N)
Answer: D
PSC HSST Computer Science – SR for ST Only Solved 2014 – Part 1
PSC HSST Computer Science – SR for ST Only Solved 2014 – Part 2
PSC HSST Computer Science – SR for ST Only Solved 2014 – Part 3
PSC HSST Computer Science – SR for ST Only Solved 2014 – Part 4
Discussion
Ask a doubt or share a tip.
No comments yet — start the discussion.