GATE Computer Engineering online test 3
of 17 questions completed
Click on Start Quiz button to take the Online test. Below are some articles to help you prepare for GATE exams.
You can install GATE Mobile App for unlimited online tests with answers.
Read my article on GATE exams for details of exam (eligibility criteria, format etc) and also post your questions or doubts.
Online tests and Books
My article on GATE Computer Science and Information Technology provides details to crack the exam with ease ( free Online tests, recommended books, detailed syllabus).
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
of 17 questions answered correctly
Time has elapsed
You have reached of points, ()
- Not categorized 0%
|Table is loading|
|No data available|
Question 1 of 17
Which one of the following is FALSE?Correct
Question 2 of 17
Match the following:
1) Waterfall model a) Specifications can be developed incrementally
2) Evolutionary model b) Requirements compromises are inevitable
3) Component-based software engineering c) Explicit recognition of risk
4) Spiral development d) Inflexible partitioning of the project into stagesCorrect
Question 3 of 17
Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at cylinder 100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135 and 145. If Shortest-Seek Time First (SSTF) is being used for scheduling the disk access, the request for
cylinder 90 is serviced after servicing ____________ number of requests.Correct
Question 4 of 17
Which one of the following is FALSE?Correct
Question 5 of 17
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 (
PRIMARY KEY (d),
FOREIGN KEY (a) references R)
Which one of the following statements is CORRECT?Correct
Question 6 of 17
Consider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links.
[S1] The computational overhead in link state protocols is higher than in distance vector protocols.
[S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol.
[S3] After a topology change, a link state protocol will converge faster than a distance vector protocol.
Which one of the following is correct about S1, S2, and S3 ?Correct
Question 7 of 17
Which of the following are used to generate a message digest by the network security protocols? (P) RSA (Q) SHA-1 (R) DES (S) MD5Correct
Question 8 of 17
Identify the correct order in which the following actions take place in an interaction between a web browser and a web server.
1. The web browser requests a webpage using HTTP.
2. The web browser establishes a TCP connection with the web server.
3. The web server sends the requested webpage using HTTP.
4. The web browser resolves the domain name using DNS.Correct
Question 9 of 17
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 to the power 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 isCorrect
Question 10 of 17
Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The time taken (in msec) by the TCP connection to get back to 32 KB congestion window isCorrect
Question 11 of 17
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 isCorrect
Question 12 of 17
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x, denoted by r(x) and w(x) respectively. Which one of them is conflict serializable?Correct
Question 13 of 17
Given the following two statements:
S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF.
S2: AB→C, D→E, E→C is a minimal cover for the set of functional dependencies AB→C, D→E, AB→E, E→C.
Which one of the following is CORRECT?Correct
Question 14 of 17
An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of
resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution.
X Y Z X Y Z
P0 0 0 1 8 4 3
P1 3 2 0 6 2 0
P2 2 1 1 3 3 3
There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in a safe state. Consider the following independent requests for additional resources in the current state:
REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z
REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z
Which one of the following is TRUE?Correct
Question 15 of 17
Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds.
Process Name Arrival Time Execution Time
A 0 6
B 3 2
C 5 4
D 7 6
E 10 3
Using the shortest remaining time first scheduling algorithm, the average process turnaround time (in msec) isCorrect
Question 16 of 17
Assume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6, the number of page faults using the optimal replacement policy isCorrect
Question 17 of 17
A canonical set of items is given below
S -> L . > R
Q -> R .
On input symbol < the set hasCorrect