Time Left - 09:00 mins
UPPCL AE 2019: Quiz 4
Attempt now to get your rank among 331 students!
Question 1
The address field of linked list :
Question 2
Given two sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be :
Question 3
A process that is based on IPC mechanism which executes on different systems and can communicate with other processes using message based communication is called ______.
Question 4
In digital logic, if A ⊕ B = C, then which one of the following is true?
Question 5
If each address space represents one byte of storage space, how many address lines are needed to access RAM chips arranged in a 4 x 6 array, where each chip is 8K x 4 bits?
Question 6
If we give a string of length ‘n’ as input then which one of the following will give the output of length ‘n+1’?
Question 7
The output of lexical analyzer is :
Question 8
In tuple relational calculus P1 
P2 is equivalent to :
P2 is equivalent to :Question 9
In classless addressing, there are no classes but addresses are still granted in :
Question 10
Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30 units, respectively. Each process spends the first 20% of execution time doing I/O, the next 70% of time doing computation, and the last 10% of time doing I/O again. The operating system uses a shortest remaining compute time first scheduling algorithm and schedules a new process either when the running process gets blocked on I/O or when the running process finishes its compute burst. Assume that all I/O operations can be overlapped as much as possible. For what percentage of time does the CPU remain idle?
- 331 attempts
- 4 upvotes
- 6 comments
Tags :
GATE & PSU CSGeneralAug 18GATE & PSU CS
