MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 406 Mcqs, each offering curated multiple-choice questions to sharpen your Graduate Aptitude Test (GATE) knowledge and support exam preparation. Choose a topic below to get started.
| 351. |
A low memory can be connected to 8085 by using |
| A. | INTER |
| B. | RESET IN |
| C. | HOLD |
| D. | READY |
| Answer» E. | |
| 352. |
Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a non pipelined but identical CPU, we can say that |
| A. | T1 <= T2 |
| B. | T1 >= T2 |
| C. | T1 < T2 |
| D. | T1 is T2 plus the time taken for one instruction fetch cycle |
| Answer» C. T1 < T2 | |
| 353. |
The literal count of a boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal count of (xy + xz') is 4. What are the minimum possible literal counts of the product-of-sum and sum-of-product representations respectively of the function given by the following Karnaugh map ? Here, X denotes "don't care". |
| A. | (11, 9) |
| B. | (9, 13) |
| C. | (9, 10) |
| D. | (11, 11) |
| Answer» D. (11, 11) | |
| 354. |
For a pipelined CPU with a single ALU, consider the following situations1. The j + 1-st instruction uses the result of the j-th instruction as an operand2. The execution of a conditional jump instruction3. The j-th and j + 1-st instructions require the ALU at the same timeWhich of the above can cause a hazard ? |
| A. | 1 and 2 only |
| B. | 2 and 3 only |
| C. | 3 only |
| D. | All of above |
| Answer» E. | |
| 355. |
The microinstructions stored in the control memory of a processor have a width of 26 bits. Each microinstruction is divided into three fields: a micro-operation field of 13 bits, a next address field (X), and a MUX select field (Y). There are 8 status bits in the inputs of the MUX. How many bits are there in the X and Y fields, and what is the size of the control memory in number of words? |
| A. | 10, 3, 1024 |
| B. | 8, 5, 256 |
| C. | 5, 8, 2048 |
| D. | 10, 3, 512 |
| Answer» B. 8, 5, 256 | |
| 356. |
Assuming all numbers are in 2's complement representation, which of the following numbers is divisible by 11111011? |
| A. | 11100111 |
| B. | 11100100 |
| C. | 11010111 |
| D. | 11011011 |
| Answer» B. 11100100 | |
| 357. |
Consider the partial implementation of a 2-bit counter using T flip-flops following the sequence 0-2-3-1-0, as shown below. To complete the circuit, the input X should be |
| A. | Q2' |
| B. | Q2 + Q1 |
| C. | (Q1 ⊕ Q2)' |
| D. | Q1 ⊕ Q2 |
| Answer» E. | |
| 358. |
If 73x (in base-x number system) is equal to 54y (in base-y number system), the possible values of x and y are |
| A. | 8, 16 |
| B. | 10, 12 |
| C. | 9, 13 |
| D. | 8, 11 |
| Answer» E. | |
| 359. |
Consider the ALU shown below. If the operands are in 2's complement representation, which of the following operations can be performed by suitably setting the control lines K and C0 only (+ and - denote addition and subtraction respectively) ? |
| A. | A + B, and A - B, but not A + 1 |
| B. | A + B, and A + 1, but not A - B |
| C. | A + B, but not A - B, or A + 1 |
| D. | A + B, and A - B, and A + 1 |
| Answer» B. A + B, and A + 1, but not A - B | |
| 360. |
Which of the following addressing modes are suitable for program relocation at run time ?(i) Absolute addressing(ii) Based addressing(iii) Relative addressing(iv) Indirect addressing |
| A. | (i) and (iv) |
| B. | (i) and (ii) |
| C. | (ii) and (iii) |
| D. | (i), (ii) and (iv) |
| Answer» D. (i), (ii) and (iv) | |
| 361. |
Consider the following circuit composed of XOR gates and non-inverting buffers. The non-inverting buffers have delays d1 = 2 ns and d2 = 4 ns as shown in the figure. Both XOR gates and all wires have zero delay. Assume that all gate inputs, outputs and wires are stable at logic level 0 at time 0. If the following waveform is applied at input A, how many transition(s) (change of logic levels) occur(s) at B during the interval from 0 to 10 ns ? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» E. | |
| 362. |
Consider the grammar rule E → E1 - E2 for arithmetic expressions. The code generated is targeted to a CPU having a single user register. The subtraction operation requires the first operand to be in the register. If E1 and E2 do not have any common sub expression, in order to get the shortest possible code |
| A. | E1 should be evaluated first |
| B. | E2 should be evaluated first |
| C. | Evaluation of E1 and E2 should necessarily be interleaved |
| D. | Order of evaluation of E1 and E2 is of no consequence |
| Answer» C. Evaluation of E1 and E2 should necessarily be interleaved | |
| 363. |
How many serial schedules are possible using n-transactions? |
| A. | (n-1)! |
| B. | n! |
| C. | n(n-1)! |
| D. | n(n+1)! / 2 |
| Answer» C. n(n-1)! | |
| 364. |
Consider the set of relations shown below and the SQL query that follows.Students: (Roll_number, Name, Date_of_birth) Courses: (Course number, Course_name, Instructor) Grades: (Roll_number, Course_number, Grade) select distinct Name from Students, Courses, Grades where Students. Roll_number = Grades.Roll_number and Courses.Instructor = Korth and Courses.Course_number = Grades.Course_number and Grades.grade = AWhich of the following sets is computed by the above query? |
| A. | Names of students who have got an A grade in all courses taught by Korth |
| B. | Names of students who have got an A grade in all courses |
| C. | Names of students who have got an A grade in at least one of the courses taught by Korth |
| D. | None of the above |
| Answer» D. None of the above | |
| 365. |
Consider the relation Student (name, sex, marks), where the primary key is name, pertaining to students in a class that has at least one boy and one girl. What does the following relational algebra expression produce? (Note: r is the rename operator). The condition in join is "(sex = female ^ x = male ^ marks ≤ m)" |
| A. | names of girl students with the highest marks |
| B. | names of girl students with more marks than some boy student |
| C. | names of girl students with marks not less than some boy students4) |
| D. | names of girl students with more marks than all the boy students |
| Answer» E. | |
| 366. |
Let R1 (A, B, C) and R2 (D, E) be two relation schema, where the primary keys are shown underlined, and let C be a foreign key in R1 referring to R2. Suppose there is no violation of the above referential integrity constraint in the corresponding relation instances r1 and r2. Which one of the following relational algebra expressions would necessarily produce an empty relation ? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 367. |
Is the corresponding schedule is conflict serializable schedule? |
| A. | Yes |
| B. | No |
| C. | Can't say |
| D. | None of these |
| Answer» B. No | |
| 368. |
A database of research articles in a journal uses the following schema.(VOLUME, NUMBER, STARTPGE, ENDPAGE, TITLE, YEAR, PRICE) The primary key is (VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the following functional dependencies exist in the schema.(VOLUME, NUMBER, STARTPAGE, ENDPAGE) -> TITLE(VOLUME, NUMBER) -> YEAR(VOLUME, NUMBER, STARTPAGE, ENDPAGE) -> PRICE The database is redesigned to use the following schemas.(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE)(VOLUME, NUMBER, YEAR) Which is the weakest normal form that the new database satisfies, but the old one does not? |
| A. | 1NF |
| B. | 2NF |
| C. | 3NF |
| D. | BCNF |
| Answer» C. 3NF | |
| 369. |
Which of the following relational query languages have the same expressive power?1.Relational algebra2.Tuple relational calculus restricted to safe expressions3.Domain relational calculus restricted to safe expressions |
| A. | II and III only |
| B. | I and II only |
| C. | I and III only |
| D. | I, II and III |
| Answer» E. | |
| 370. |
Consider a relational table with a single record for each registered student with the following attributes.1. Registration_Num: Unique registration number of each registered student2. UID: Unique identity number, unique at the national level for each citizen3. BankAccount_Num: Unique account number at the bank. A student can have multiple accounts or join accounts. This attribute stores the primary account number.4. Name: Name of the student5. Hostel_Room: Room number of the hostel Which one of the following option is INCORRECT? |
| A. | BankAccount_Num is candidate key |
| B. | Registration_Num can be a primary key |
| C. | UID is candidate key if all students are from the same country |
| D. | If S is a superkey such that S∩UID is NULL then S∪UID is also a superkey |
| Answer» B. Registration_Num can be a primary key | |
| 371. |
A company maintains records of sales made by its salespersons and pays them commission based on each individual's total sales made in a year. This data is maintained in a table with following schema:salesinfo = (salespersonid, totalsales, commission)In a certain year, due to better business results, the company decides to further reward its salespersons by enhancing the commission paid to them as per the following formula:If commission < = 50000, enhance it by 2% If 50000 < commission < = 100000, enhance it by 4% If commission > 100000, enhance it by 6%The IT staff has written three different SQL scripts to calculate enhancement for each slab, each of these scripts is to run as a separate transaction as follows: T1 Update salesinfoSet commission = commission * 1.02Where commission < = 50000; T2 Update salesinfoSet commission = commission * 1.04Where commission > 50000 and commission is < = 100000; T3 Update salesinfoSet commission = commission * 1.06Where commission > 100000; Which of the following options of running these transactions will update the commission of all salespersons correctly? |
| A. | Execute T1 followed by T2 followed by T3 |
| B. | Execute T2, followed by T3; T1 running concurrently throughout |
| C. | Execute T3 followed by T2; T1 running concurrently throughout |
| D. | Execute T3 followed by T2 followed by T1 |
| Answer» E. | |
| 372. |
Consider the following Employee tableID salary DeptName1 10000 EC2 40000 EC3 30000 CS4 40000 ME5 50000 ME6 60000 ME 7 70000 CS How many rows are there in the result of following query?SELECT E.IDFROM Employee EWHERE EXISTS (SELECT E2.salary FROM Employee E2 WHERE E2.DeptName = 'CS' AND E.salary > E2.salary) |
| A. | 0 |
| B. | 4 |
| C. | 5 |
| D. | 6 |
| Answer» D. 6 | |
| 373. |
Given relations r(w, x) and s(y, z), the result ofSELECT DISTINCT w, x FROM r, s is guaranteed to be same as r, provided |
| A. | r has no duplicates and s is non-empty |
| B. | r and s have no duplicates |
| C. | s has no duplicates and r is non-empty |
| D. | r and s have the same number of tuples |
| Answer» B. r and s have no duplicates | |
| 374. |
Determine whether the following transaction is |
| A. | Serializable |
| B. | Conflict serializable |
| C. | View serializable |
| D. | Not – serializable |
| Answer» E. | |
| 375. |
In the following figure |
| A. | Deadlock occurs |
| B. | Deadlock never occurs |
| C. | Can’t say |
| D. | None of these |
| Answer» B. Deadlock never occurs | |
| 376. |
Which of the following schedule are not conflict serializable? |
| A. | r₁(A); w₁(A); r₂ (A); w₂(A); w₁(B) |
| B. | r₁(A); r₁ (B); w₂(A); r₃(A); w₁(B); w₃(A); r₂ (B); w₂ (B) |
| C. | r₁(A); w₁(A); r₂ (A); w₂(A); w₁(B) |
| D. | w₃ (A); r₁ (A); w₁ (B); r₂ (B); w₂(c); r₃ (c) |
| Answer» E. | |
| 377. |
Which of the following relational calculus expressions is not safe? |
| A. | a |
| B. | b |
| C. | c |
| D. | d |
| Answer» D. d | |
| 378. |
Consider the following database schedule with two transactions, T1 and T2.S = r2(X); r1(X); r2(Y); w1(X); r1(Y); w2(X); a1; a2;where ri(Z) denotes a read operation by transaction Ti on a variable Z, wi(Z) denotes a write operation by Ti on a variable Z and ai denotes an abort by transaction Ti . Which one of the following statements about the above schedule is TRUE? |
| A. | S is non-recoverable |
| B. | S is recoverable, but has a cascading abort |
| C. | S does not have a cascading abort |
| D. | S is strict |
| Answer» D. S is strict | |
| 379. |
Which of the following statement is/are incorrect? A: A schedule following strict two phase locking protocol is conflict serializable as well as recoverable.B: Checkpoint in schedules are inserted to ensure recoverability. |
| A. | Only 1 |
| B. | Only 2 |
| C. | Both 1 and 2 |
| D. | None |
| Answer» C. Both 1 and 2 | |
| 380. |
Consider three data items D1, D2 and D3 and the following execution schedule of transactions T1, T2 and T3. In the diagram, R(D) and W(D) denote the actions reading and writing the data item D respectively. Which of the following statements is correct? |
| A. | The schedule is serializable as T2; T3; T1 |
| B. | The schedule is serializable as T2; T1; T3 |
| C. | The schedule is serializable as T3; T2; T1 |
| D. | The schedule is not serializable |
| Answer» E. | |
| 381. |
Consider the following three schedules of transactions T1, T2 and T3. [Notation: In the following NYO represents the action Y (R for read, W for write) performed by transaction N on object O.](S1) 2RA 2WA 3RC 2WB 3WA 3WC 1RA 1RB 1WA 1WB(S2) 3RC 2RA 2WA 2WB 3WA 1RA 1RB 1WA 1WB 3WC(S3) 2RA 3RC 3WA 2WA 2WB 3WC 1RA 1RB 1WA 1WBWhich of the following statements is TRUE? |
| A. | S1, S2 and S3 are all conflict equivalent to each other |
| B. | No two of S1, S2 and S3 are conflict equivalent to each other |
| C. | S2 is conflict equivalent to S3, but not to S1 |
| D. | S1 is conflict equivalent to S2, but not to S3 |
| Answer» E. | |
| 382. |
In a token ring network the transmission speed is 10^7 bps and the propagation speed is 200 metres/micro second. The 1-bit delay in this network is equivalent to: |
| A. | 500 metres of cable |
| B. | 200 metres of cable |
| C. | 20 metres of cable |
| D. | 50 metres of cable |
| Answer» D. 50 metres of cable | |
| 383. |
There are n stations in a slotted LAN. Each station attempts to transmit with a probability p in each time slot. What is the probability that ONLY one station transmits in a given time slot? |
| A. | (1-p)^(n-1) |
| B. | np(1-p)^(n-1) |
| C. | p(1-p)^(n-1) |
| D. | 1-(1-p)^(n-1) |
| Answer» C. p(1-p)^(n-1) | |
| 384. |
In Ethernet when Manchester encoding is used, the bit rate is: |
| A. | Half the baud rate |
| B. | Twice the baud rate |
| C. | Same as the baud rate |
| D. | None of the above |
| Answer» B. Twice the baud rate | |
| 385. |
Frames of 1000 bits are sent over a 10^6 bps duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the minimum number of bits (i) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames. |
| A. | i = 2 |
| B. | i = 3 |
| C. | i = 4 |
| D. | i = 5 |
| Answer» E. | |
| 386. |
Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of bits in error? |
| A. | G(x) contains more than two terms |
| B. | G(x) does not divide 1+x^k, for any k not exceeding the frame length |
| C. | 1+x is a factor of G(x) |
| D. | G(x) has an odd number of terms |
| Answer» D. G(x) has an odd number of terms | |
| 387. |
Consider a selective repeat sliding window protocol that uses a frame size of 1 KB to send data on a 1.5 Mbps link with a one-way latency of 50 msec. To achieve a link utilization of 60%, the minimum number of bits required to represent the sequence number field is ________. |
| A. | 3 |
| B. | 4 |
| C. | 5 |
| D. | 6 |
| Answer» D. 6 | |
| 388. |
Consider a token ring network with a length of 2 km having 10 stations including a monitoring station. The propagation speed of the signal is 2 × 10^8 m/s and the token transmission time is ignored. If each station is allowed to hold the token for 2 μsec, the minimum time for which the monitoring station should wait (in μsec)before assuming that the token is lost is _______. |
| A. | 28 to 30 |
| B. | 20 to 22 |
| C. | 0 to 2 |
| D. | 31 to 33 |
| Answer» B. 20 to 22 | |
| 389. |
The message 11001001 is to be transmitted using the CRC polynomial x^3 + 1 to protect it from errors. The message that should be transmitted is: |
| A. | 11001001000 |
| B. | 11001001011 |
| C. | 11001010 |
| D. | 110010010011 |
| Answer» C. 11001010 | |
| 390. |
Consider the following Boolean function of four variables: f(w,x,y,z) = ∑(1,3,4,6,9,11,12,14) The function is: |
| A. | independent of one variables |
| B. | independent of two variables |
| C. | independent of three variables |
| D. | dependent on all the variables |
| Answer» C. independent of three variables | |
| 391. |
Let f(w, x, y, z) = ∑(0, 4, 5, 7, 8, 9, 13, 15). Which of the following expressions are NOT equivalent to f? |
| A. | x'y'z' + w'xy' + wy'z + xz |
| B. | w'y'z' + wx'y' + xz |
| C. | w'y'z' + wx'y' + xyz + xy'z |
| D. | x'y'z' + wx'y' + w'y |
| Answer» E. | |
| 392. |
Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of n variables. What is the minimum size of the multiplexer needed? |
| A. | 2^n line to 1 line |
| B. | 2^(n+1) line to 1 line |
| C. | 2^(n-1) line to 1 line |
| D. | 2^(n-2) line to 1 line |
| Answer» D. 2^(n-2) line to 1 line | |
| 393. |
What is the minimum number of gates required to implement the Boolean function (AB+C)if we have to use only 2-input NOR gates? |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 5 |
| Answer» C. 4 | |
| 394. |
Define the connective * for the Boolean variables X and Y as: X * Y = XY + X' Y'. Let Z = X * Y.Consider the following expressions P, Q and R.P: X = Y⋆Z Q: Y = X⋆Z R: X⋆Y⋆Z=1Which of the following is TRUE? |
| A. | Only P and Q are valid |
| B. | Only Q and R are valid |
| C. | Only P and R are valid |
| D. | All P, Q, R are valid |
| Answer» E. | |
| 395. |
How many 3-to-8 line decoders with an enable input are needed to construct a 6-to-64 line decoder without using any other logic gates? |
| A. | 7 |
| B. | 8 |
| C. | 9 |
| D. | 10 |
| Answer» D. 10 | |
| 396. |
If P, Q, R are Boolean variables, then (P + Q')(PQ' + PR)(P'R' + Q') simplifies |
| A. | PQ' |
| B. | PR' |
| C. | PQ' + R |
| D. | PR'' + Q |
| Answer» B. PR' | |
| 397. |
Consider the table employee(empId, name, department, salary) and the two queries Q1 ,Q2 below. Assuming that department 5 has more than one employee, and we want to find the employees who get higher salary than anyone in the department 5, which one of the statements is TRUE for any arbitrary employee table?Q1 : Select e.empId From employee e Where not exists (Select * From employee s where s.department = “5” and s.salary >=e.salary)Q2 : Select e.empId From employee e Where e.salary > Any (Select distinct salary From employee s Where s.department = “5”) |
| A. | Q1 is the correct query |
| B. | Q2 is the correct query |
| C. | Both Q1 and Q2 produce the same answer |
| D. | Neither Q1 nor Q2 is the correct quer |
| Answer» C. Both Q1 and Q2 produce the same answer | |
| 398. |
Given the following statements: S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL. S2: Given the table R(a,b,c) where a and b together form the primary key, the following is a valid table definition. CREATE TABLE S ( a INTEGER, d INTEGER, e INTEGER, PRIMARY KEY (d), FOREIGN KEY (a) references R) Which one of the following statements is CORRECT? |
| A. | S1 is TRUE and S2 is FALSE |
| B. | Both S1 and S2 are TRUE |
| C. | S1 is FALSE and S2 is TRUE |
| D. | Both S1 and S2 are FALSE |
| Answer» E. | |
| 399. |
Consider the following relational schema:Suppliers(sid:integer, sname:string, city:string, street:string)Parts(pid:integer, pname:string, color:string)Catalog(sid:integer, pid:integer, cost:real)Consider the following relational query on the above database:SELECT S.sname FROM Suppliers S WHERE S.sid NOT IN (SELECT C.sid FROM Catalog C WHERE C.pid NOT IN (SELECT P.pid FROM Parts P WHERE P.color<> 'blue'))Assume that relations corresponding to the above schema are not empty. Which one of the following is the correct interpretation of the above query? |
| A. | Find the names of all suppliers who have supplied a non-blue part. |
| B. | Find the names of all suppliers who have not supplied a non-blue part. |
| C. | Find the names of all suppliers who have supplied only blue parts. |
| D. | Find the names of all suppliers who have not supplied only blue parts. |
| Answer» B. Find the names of all suppliers who have not supplied a non-blue part. | |
| 400. |
A relational schema for a train reservation database is given below. Passenger (pid, pname, age) Reservation (pid, class, tid)Table: Passenger pid pname age----------------- 0 Sachin 65 1 Rahul 66 2 Sourav 67 3 Anil 69Table : Reservationpid class tid--------------- 0 AC 8200 1 AC 8201 2 SC 8201 5 AC 8203 1 SC 8204 3 AC 8202What pids are returned by the following SQL query for the above instance of the tables? SELECT pid |
| A. | 1, 0 |
| B. | 1, 2 |
| C. | 1, 3 |
| D. | 1, 5 |
| Answer» D. 1, 5 | |