Time Remaining :00:00:00

Questions to be answered 20

WIPRO Technical 3

Question No : 1

A byte addressable computer has memory capacity of 2 power m Kbytes and can perform 2 power n operations an instruction involving three operands and one operator needs maximum of ---bits

Question No : 2

In round robin scheduling, if time quantum is too large then it degenerates to

Question No : 3

A sorting algorithm which can prove to be a best time algorithm in one case and a worst time algorithm in worst case i

Question No : 4

What details should never be found in the top level of a top-down design?

Question No : 5

In an absolute loading scheme, which loader function is accomplished by assembler

Question No : 6

Banker's algorithm for resource allocation deals with

Question No : 7

Thrashing can be avoided if

Question No : 8

Which of the following communications lines is best suited to interactive processing applications?

Question No : 9

A feasibility document should contain all of the following except

Question No : 10

What is the main function of a data link content monitor?

Question No : 11

Which of the following is a broadband communications channel?

Question No : 12

Which of the following memories has the shortest access time?

Question No : 13

A shift register can be used for

Question No : 14

In which of the following page replacement policies, Balady's anomaly occurs?

Question No : 15

Subschema can be used to

Question No : 16

The format specifier "-%d" is used for which purpose in C

Question No : 17

Virtual functions allow you to

Question No : 18

If the time quantum is too large, Round Robin scheduling degenerates to

Question No : 19

What will be the O/P?

    int i;
    i = 1;
    i = i + 2 * i++;

Question No : 20

What will be the O/P?

    FILE *fp1,*fp2;

Popular Videos

How to speak to people

How to speak so that people want to listen.

Got a tip or Question?
Let us know