GATE 2022 Rapid Revision Quiz 7
Attempt now to get your rank among 133 students!
Question 1
Question 3
Question 4
Question 5
Figure Ⅱ
At t=0, the inputs to the 4-bit adder are changed to X3X2X1X0 = 1100, Y3Y2Y1Y0 = 0100 and Z0=1. The output of the ripple carry adder will be stable at t (in ns) =________.
Question 6
The pre-emptive shortest job first scheduling algorithm is used and in case of clash lower process id will be given priority(P0>P1>P2>P3). Find out average waiting time and turn round time for the three processes .
X = sum of waiting time of the four processes
Y = sum of turn around time of the four processes
Finally find value of X*Y?
Question 7Multiple Correct Options
EMP( EID, EName, Salary, Start_Date, End_Date)
IN_DEPT (EID, DID, Percent_Time )
BUILDING (BID, BName, Address )
IN_BUILDING( EID ,BID )
DEPT(DID, DName, Annual_Budget )
MANAGES_DEPT(EID, DID )
This is the Reference Database referred to in the following question. There are six tables describing a company, describing employees, departments, buildings, which department(s) an employee works in (and a percentage of the time for each), department managers (possibly more than one per department), and in which building an employee works (an employee may have more than one office). The primary key of each table is the attribute(s) in capitals. Other attributes are not necessarily unique.
Assume that the tables have many rows.
Which of the following queries finds the name of the Department(s) where the highest paid employee works?
Question 8
Compute the speedup.
- 133 attempts
- 1 upvote
- 0 comments
Tags :
GATE & PSU CSGeneral