1 votes
162
22 votes
163
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is$O (n \log...
1 votes
165
Which of the following is false regarding the evaluation of computer programming language:Application oriented featuresEfficiency and reliabilitySoftware developmentHardw...
0 votes
168
3 votes
171
Pipelining improves performance bydecreasing instruction latencyeliminating data hazardsexploiting instruction level parallelismdecreasing the cache miss rate
0 votes
172
Optical fiber uses reflection to guide light through a channel, in which angle of incidence is ____ the critical angleequal toless thangreater thanless than or equal to
3 votes
175
5 votes
178
A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in a graph shown below?2456...
0 votes
179
0 votes
190
Match the following w.r.t. programming languages $:$$\begin{array}{clcl} & \textbf{List – I} & & \textbf{List – II} \\ \text{(a)} & \text{JAVA} & \text{(i)} & \text...