Que. 1
|
| Banker's algorithm for resource allocation deals with |
| A |
|
|
| deadlock preventation |
| B |
|
|
| deadlock avoidance |
| C |
|
|
| deadlock recvery |
| D |
|
|
| mutual exclusion |
|
| Que.
2 |
| Suppose the domain set of an attribute consists of signed four digit numbers.What
is the % of reduction in storage space of this attribute if it is stored
as an integer rather than in character form? |
| A |
|
|
| 80% |
| B |
|
|
| 20% |
| C |
|
|
| 60% |
| D |
|
|
| 40% |
|
Que. 3
|
| The function of the syntax phase is |
| A |
|
|
| to recognize the major constructs of the language and to call the
appropriate action routine |
| B |
|
|
| to build a literal table |
| C |
|
|
| to build a uniform symbol table |
| D |
|
|
| to parse the source program into the basic elements or tokens of the
language |
|
Que. 4
|
| Abstruct class used in |
| A |
|
|
| Virtual function |
| B |
|
|
| pure virtual function |
| C |
|
|
| member function |
| D |
|
|
| none of these |
|
Que. 5
|
| QUEL is the query language in the system |
| A |
|
|
| ingers. QUEL based on the relation calculus |
| B |
|
|
| Codsyl.QUEL |
| C |
|
|
| SQL.QUEL |
| D |
|
|
| none of the above |
|
Que. 6
|
| What is the name of O.S. system for the laptop computer called Maclite? |
| A |
|
|
| Windows |
| B |
|
|
| DOS |
| C |
|
|
| MS-DOS |
| D |
|
|
| OZ |
|
Que. 7
|
| Queues serve a major role in |
| A |
|
|
| simulation of recursion |
| B |
|
|
| simulation of motion of subatomic particle |
| C |
|
|
| simulation of arbitary linked list |
| D |
|
|
| simulation of limited resources allocation |
|
Que. 8
|
| The results returned by functions under value result and referance parameter
passing conventions |
| A |
|
|
| Donor differ |
| B |
|
|
| differ in presence of loops |
| C |
|
|
| differ in all cases |
| D |
|
|
| may differ in the presence of exceptions |
|
Que. 9
|
| Storage mapping is done by |
| A |
|
|
| loader |
| B |
|
|
| linker |
| C |
|
|
| editor |
| D |
|
|
| compiler |
|
Que. 10
|
| If n is a power of 2, then the minimum number of multiplications needed
to computer a^n is |
| A |
|
|
| log2 n |
| B |
|
|
| [(sqrt)n] |
| C |
|
|
| n-1 |
| D |
|
|
| n |
|
Que. 11
|
| Which of the following is most powerful parsing method? |
| A |
|
|
| LL(1) |
| B |
|
|
| Canonical LR |
| C |
|
|
| SLR |
| D |
|
|
| LALR |
|
Que. 12
|
| How many comparisons are required to sort an array of length 5 if a straight
selection sort is used and the array is already sorted in the opposite order? |
| A |
|
|
| 0 |
| B |
|
|
| 1 |
| C |
|
|
| 10 |
| D |
|
|
| 20 |
|
Que. 13
|
| For marging two sorted lists of sizes m and n into a sorted list of size
m+n we require comparisons of |
| A |
|
|
| O(m) |
| B |
|
|
| O(n) |
| C |
|
|
| O(m+n) |
| D |
|
|
| O(log m + log n) |
|
| Que.
14 |
| The parsing technique that avoides back traacking is |
| A |
|
|
| top down parsing |
| B |
|
|
| recursive descent parsing |
| C |
|
|
| predictive parsing |
| D |
|
|
| both b and c above |
|
| Que.
15 |
| Let L be the set of binary strings whose last two symbols are same.The
number ofstates in the minimum state deterministic finite state automation
accepting L is |
| A |
|
|
| 2 |
| B |
|
|
| 5 |
| C |
|
|
| 8 |
| D |
|
|
| 3 |