Time Left - 12:00 mins
GATE 2022 Toppers Quiz 12
Attempt now to get your rank among 89 students!
Question 1
A machine needs a minimum of 100 sec to sort 1000 names by quick sort. The minimum time needed to sort 100 names will be approximately _____ sec
Question 2
In the C program given below find the number of tokens present in it.
int main()
{
int l = 5, m= 4;
printf(“abbc ok : %d”, l*m);
printf(“GradeUp”);
return 0;
}
int main()
{
int l = 5, m= 4;
printf(“abbc ok : %d”, l*m);
printf(“GradeUp”);
return 0;
}
Question 3
Consider the following floating point format:
The decimal number 0.413 × 213 has the _____ normalized representation. Assume, the mantissa has an implicit 1 preceding the binary point and only 0’s are padded in while shifting a field
Question 4
Suppose a router has built up the routing table shown below. The router can deliver packets directly over interfaces 0 and 1, or it can forward packets to routers R2, R3, or R4
Consider the following statements :
1) For a packet addressed to the destination 128.96.39.10, router uses interface 0 as the next hop.
2) For a packet addressed to the destination 128.96.40.12, router uses interface 1 as the next hop.
Which of the above is/are correct ?
Question 5
Consider a table ‘T’ in a relational database with key field ‘K ’. A B-tree of order ‘P ’ is used as an access structure on K, where ‘P ’ denotes the maximum number of tree pointers in a B- tree index node. Assume that K is 10B long; disk block size is 512B; each data pointer PD is 6 B long and each block pointer PB is 7 B long. The maximum value of ‘P ’ in order for each B-tree node to fit in a single disk block is ______.
Question 6
Consider the following proposed CPU scheduling algorithm :
Step 1) START
Step 2) Make a ready queue of the Processes say REQUEST.
Step 3) Do steps 4 and 5 WHILE queue REQUEST becomes empty.
Step 4) Pick the first process from the ready queue and allocate the CPU to it for a time interval of up to 1 time quantum.
Step 5) After the time quantum expires, select the process with minimum burst time.
Step 6) END
Let the time quantum = 10 milliseconds
Using this scheduling algorithm , calculate average waiting time for the given following processes.
Step 1) START
Step 2) Make a ready queue of the Processes say REQUEST.
Step 3) Do steps 4 and 5 WHILE queue REQUEST becomes empty.
Step 4) Pick the first process from the ready queue and allocate the CPU to it for a time interval of up to 1 time quantum.
Step 5) After the time quantum expires, select the process with minimum burst time.
Step 6) END
Let the time quantum = 10 milliseconds
Using this scheduling algorithm , calculate average waiting time for the given following processes.
Question 7
Consider a program using Run Time Address Binding, generates physical address of 400. The Relocation Register has the value of 200. The corresponding logical/virtual address is
Question 8
Choose the correct statement:
- 89 attempts
- 0 upvotes
- 1 comment
Tags :
GATE & PSU CSGeneralJun 13GATE & PSU CS
