An ideal sort is an in-place- sort whose additional space requirement is ...............
| A. | O(log2 n) |
| B. | O(nlog2 n) |
| C. | O(1) |
| D. | O(n) |
|
Option: C Explanation : Click on Discuss to view users comments. |
| A. | Flow Control Policy |
| B. | Packet Discard Policy |
| C. | Packet Lifetime Management Policy |
| D. | Routing Algorithm |
|
Option: A Explanation : Click on Discuss to view users comments. |
| A. | that avoids tests at every iteration of the loop |
| B. |
that improves performance by decreasing the number of instructions in a basic block.
|
| C. | that exchanges inner loops with outer loops |
| D. | that reorders operations to allow multiple computations to happen in parallel. |
|
Option: A Explanation : Click on Discuss to view users comments. |
| A. | 0F00 h |
| B. | 0F0F h |
| C. | 01E0 h |
| D. | FFFF h |
|
Option: C Explanation : Click on Discuss to view users comments. |
| A. |
Top-down parsers are LL parsers where first L stands for left-to- right scan and second L stands for a leftmost derivation.
|
| B. |
(000)* is a regular expression that matches only strings containing an odd number of zeroes, including the empty string.
|
| C. |
Bottom-up parsers are in the LR family, where L stands for left-to- right scan and R stands for rightmost derivation
|
| D. |
The class of context-free languages is closed under reversal. That is, if L is any context-free language, then the language L R ={W R :wϵL} is context free.
|
|
Option: B Explanation : Click on Discuss to view users comments. |
