1 Crore+ students have signed up on EduRev. Have you? Download the App 
I _____ made arrangements had I _____informed earlier.
A rectangular room having dimensions 3.74 m x 5.78 m is required to be tiled using minimum number of identical square tiles. The number of such tiles and area of each tile (in cm^{2}) is given by;
In the following sentence certain parts are underlined and marked P, Q and R. One of the parts may contain certain error or may not be acceptable in standard written communication. Select the part containing an error. Choose D as your answer if there is no error.
The student corrected all the errors (P) that the instructor marked (Q) on the answer book (R)
4 taps marked as T1, T2, T3 and T4 can fill a tank in 8 hours,12 hours, 16 hours and 24hours respectively. We have to fill up 2 identical tanks with 2 out of these 4 taps connected to tank 1 and remaining two taps connected to tank 2 so that the ratio of time taken to fill tank 1 and tank 2 is 2:3. so identify one of the pair of taps?
Given below is information related to installed capacity and generation of electricity in India for a specific year:
The closet integral value of capacity utilization for the entire country in the year under consideration is ____%.
[Capacity utilization is the ratio of Electricity generated per hour and installed capacity. Assume that all plants work 365 days a year for 24 hours per day].
12 years ago, age of a father was 4 times of that of his son. 6 years later age of father would be twice of that of son then what is present age of son?
A water tank of capacity 6000 liters is connected to 2 taps ‘A’ and ‘B’. Water flows from these 2 taps at 90 liters per minute and 60 liters per minute respectively. To fill this empty tank, first tap ‘A’ is opened for some time and once it is closed, tap ‘B’ is opened till the tank is full taking a total of 90 minutes. What is the difference in the time (in minutes) for which the taps are opened to fill the tank?
Two trains from Delhi to Ranchi and from Ranchi to Delhi started at the same time. Due to fog in winter season, after crossing each other, they took 16 hr and 9 hr respectively to complete their journey. If the speed of train going to Ranchi was 45 km/h, what was the speed of train going to Delhi?
Chinnaswamy is driving to pick up his son from school on a Saturday which is a half day. On his way to school, he crossed a church which is 1/5th of the way to school at 9:50 hours and exactly 10 minutes later, he went past a temple which is 1/3rd of the way to school. The time after 10:00 hours at which he reaches his son’s school is ____ minutes.
A group of 3000 students, which includes 1750 girls, in a school are engaged in exactly one of the 5 activities as per details given below in the table. What is the difference in the number of boys opting for craft and dancing when compared with drawing and swimming?
Which of the following is not the disc scheduling algorithm.
For slow and inefficient I/O peripherals, the interrupt mechanism to be designed must be fast enough. The best possible choice for interrupt handling would be;
What is the time complexity to construct binary search tree when inorder and postorder traversal of tree is given?
The different bus arbitration techniques are daisy chaining, polling and independent requesting. The bus grant and bus request lines are only assumed as control lines. For n requesting devices, the number of control lines for daisy chaining, polling and independent requesting are respectively;
Consider a system has three processes and three resources are available of same type. If each process needs maximum two resources, which of the following is correct?
Assume that source S and destination D are connected through two routers. Also there exists a gateway between these two routers. Let 'x' be the number of times a packet visits transport layer, 'y' be the number of times a packet visits network layer and 'z' be the number of times a packet visits data link layer during transmission from source to destination. Then calculate x+2y+3z = __________
A student want to prove a relation between the “gradeup” and “gaterank”. If he prove that gradeup is reducible to “gaterank” and “gaterank” is decidable then which of the following is true? (Assume gradeup & gaterank are two problems)
Which of the following is functionality complete set?
Consider the following dependencies in a database
D → A A → E
N → R R → N
C → C → I
(R, C) → G
The relation (R, N, D, A) is
If L1 is DCFL and L2 is CFL , then which statement is true:
Consider the matrix
Find the eigenvalue of A for which the normalized eigen vector is given by;
Consider the three problems :
For the matrix
ONE of the normalized eigen vector is given as;
IPv4 addressing system already gives information about network and host. Along with the Internet Protocol address of host, subnet mask is also needed by the routers inorder to direct the packet to intended network. Host doesn’t redirect packets, then Why does host need subnet mask?
Consider the following BST.
Its preorder and postorder are inserted in two separate arrays(arrays having same starting index) of same size in traversal sequence. How many elements will have same index numbers in the both the arrays?
Consider two relations R1 and R2 given below:
How many tuples are there in relation (Natural join) R1 R2?
In the spanning tree shown, what will be the minimum cost?
Identify the true statements
I. Maintaining connection semantics between two directly connected nodes is done by network layer.
II. Recovering lost packet between two directly connected nodes is done by transport layer.
III. Recovering lost packets between two nodes separated by multiple hops is done by data link control.
IV. Arbitration is done between multiple nodes attached to a single medium to resolve conflicts.
Find the output of the following program.
main()
{
int i =_1_abc(10);
print f ("%d\n",i);
}
int_1_abc(int i)
{
return(i ++);
}
Consider the following grammar 
S > ABa/BAc
A > d/e/epsilon
B > f/epsilon
Which of the following is true regarding the FIRST() & FOLLOW() function of LL(1) parser?
Consider the following statements :
S1 : DCFL's are closed under complement
S2 : DCFL's are closed under Homomorphism
S3 : DCFL's are closed under union with regular
Which option is correct ?
The input of the undirected graph is shown. Select the appropriate output of this graph.
Which of the following traversal is sufficient to construct Binary search tree from traversal?
I. Preorder
II. Inorder
III. Postorder
Which of the following condition is user for every process by ‘Highest Response Ratio Next” scheduling to select the process with highest response ratio?
Consider the following data:
Suppose round robin scheduling is applied on the given data with time quantum=2 units. It is also given that scheduling of a process or context switch will take 1 unit of time. What is the completion time and turnaround time of process P4?
What is the time complexity of the following recursive function:
int DoSomething (int n) {
if (n <= 2)
return 1;
else
return(DoSomething(floor(sqrt(n))) + n);
Consider the given SDT which will be executed in connection with a bottomup parser. For the input babbba, what will be the final output?
S →aS { print “x”}
S →bS { print “y”}
S →a { print “z”}
S →b { print “z”}
The grammar which is equivalent to 
A > A+A/AA/B
B > B*B/a
After eliminating the left factoring is –
Consider the weighted undirected graph below
Assume that edge FG is added to the minimum spanning tree. For what maximum value of FG does this new edge belong to the minimum spanning tree?
Consider the following “Maxheapify” algorithm.Array has size at least n and 1in.After applying The Maxheapify noded at A[i], the result will be the subtree of A[1,….n] rooted at A[i] is a maxheapify.{ Assume that except root A[i], all its children satisfies heap property]
Max –heapify (int A[ ], int n,int i)
{ int p,m;
p = i;
while (2pn)
{
if(Y && Z)
m = 2p+1;
else m =2p;
if(A[p]<A[m])
[swap (A[p],A[m]);
p=m;
}
else
return ;
}
}
Find missing statement at Y and Z respectively to apply the heapify for subtree rooted at A[i].
Find the type of error produced by the following program 
int main()
{
int b=10;
if(b==10)
printf("Hii user );
printf("Compiler Design");
}
Consider n activities in the activity selection problem a1, a2, a3,…,an. For activity ai, let si be the starting time and fi be the finishing time. Then two activities ai and aj are compatible when;
TCP/IP was included by a _______ operating system .
Consider the following operations.
(i) Reversal
(ii) Positive closure
(iii) Difference
How many of the above operations are not closed for DCFLs?
Match the following
ListI
(Protocol Layers)
A Application layer
B Network layer
C Data link layer
ListII
(Type of address used)
1 IP address
2 Port address
3 MAC address
Which of the following is true regarding kernel level threads?
Consider a system such that the number of clock for a polling operation (including transferring to the polling routine, accessing the device and restarting) is 400 cycles, and that the processor executes with a 500 MHz clock. Determine the fraction of CPU consumed when the mouse must be polled 30 times per second.
Match the following Lists:
ListI (Logic)
A
B XY
C
ListII (Function)
1 Sum
2 NAND
3 Carry
4 NOR
Which of the following is false?
Let X be a continuous random variable with probability density function given as
Find the mean of the above distribution.
Consider a system employing an interrupt driven I/O for a articular device that transfers data at an average of 8 KB/s on a continuous basis. Assume that interrupt processing takes about 100 micro seconds (i.e. jump to the interrupt service routine (ISR); execute it and return to the main program). Determine what fraction of processor time is consumed by this I/O device when it is interrupted for every byte.
Consider two processes P0 and P1 which shares a global variable ‘flag’. The value of flag is either 0 or 1 where 0 indicates “P0 is permitted to enter the criticalsection” and 1 indicates for P1. Assume P0(i=0) and P1(i=1) are concurrent processes which are executing the following code with initial value of flag as 0.
while (1)
{
while( flag!=1);
<critical section>
flag = i1;
<remainder section>
}
If P0 starts executing first, which of the following holds by the above execution.
Consider an ER model with four entity set, E1(A, B), E2(C, D), E3 (E, F), and E4 (G, H). Relation R1 is following “one to many mapping“ between E1 and E Relation R2 is following “many to one“ between E3 and E4. E1 and E4 are linked with a relation R5 following “many to many mapping”. E2 and E4 are related to each other by a one to one relationship which is R4. E1 and E3 are also related to each other by a one to one relationship (R3) but one end is showing total participation.
What is the minimum no of tables required to store the given ER Model ________
Consider the following Fibonacci recursive function used by dynamic programming.
Assume for every function call F(i) it checks the table first, if its value is already computed it retrieves the value from table. Otherwise it calls a recursive function call to compute its return value. Whenever a function F(i) computes first time its return value is stored in the table to avoid the redundant function calls.
How many function calls need the support of stack to complete the execution of the function F(5)?
Find postfix expression for the following infix expression? Assume ↑ as the highest precedence and follow right to left associativity.
Infix: (a+b) ↑ (p+q) ↑ (r*s*t)
Match the following 3 address code notation with the type of address they carry in their table 
Identify the false statements:
: Separate I/O address space does not necessarily mean that I/O address lines are physically separated.
: Address decoder is an essential part of I/O interface.
Consider the following statements about Dijkstra’s algorithm.
1. Dijkstra’s algorithm produces an incorrect result only if the graph contains a negative weight cycle.
2. If a graph contains a negative weight cycle, then Dijkstra's algorithm may not terminate.
Which of the above statements is true?
Match the following 
LIST I
a) Token
b) Pattern
c) Lexeme
LIST – II
I) A rule describing the set of lexemes that can represent a particular token in the source program
II) A sequence of characters in the source program that is matched by the pattern for a token
III) A set of characters grouped together
Assume a person has 10 distinct numbered balls. He wants to place these balls in 10 fixed slots of binary search tree (initially all slots are empty). In how many ways can the person place those balls in the slots of binary search tree? Each slot can occupy atmost 1 ball.
Consider the following sequential circuit:
If T is the propagation delay of each flipflop, what is the maximum clock frequency which can be applied for valid functioning of the circuit?
Consider the following producer and consumer code.
# define N = 100
int mutex = 1; // Binary semaphore variable
int empty = N; // Counting semaphore variable
int full = 0; // counting semaphore variable

Void producer ( )
{
int item;
while (1)
{
item=produceritem();
down (empty);
down (mutex);
insert_item (item);
up (mutex);
up (full);
}
}

Void consumer ( )
{
int item;
while (1)
{
down (mutex);
down (full);
item=consume_item();
up (mutex);
up (empty);
}
}

In the above code mutex, empty and full are semaphore shared variables and item is local to the both producer and consumer.
Inser_item (item) function will place “item” into buffer and consume_item function removes an item from the buffer. Which of the following holds by the code?
The value of constant ‘a’ so that the vector
is solenoidal:;
152 docs216 tests

GATE Mock Test Computer Science Engineering (CSE)  1 Test  65 ques 
GATE Mock Test Computer Science Engineering (CSE)  2 Test  65 ques 
GATE Mock Test Computer Science Engineering (CSE)  3 Test  65 ques 
GATE Mock Test Computer Science Engineering (CSE)  4 Test  65 ques 
GATE Mock Test Computer Science Engineering (CSE)  5 Test  65 ques 
152 docs216 tests

GATE Mock Test Computer Science Engineering (CSE)  1 Test  65 ques 
GATE Mock Test Computer Science Engineering (CSE)  2 Test  65 ques 
GATE Mock Test Computer Science Engineering (CSE)  3 Test  65 ques 
GATE Mock Test Computer Science Engineering (CSE)  4 Test  65 ques 
GATE Mock Test Computer Science Engineering (CSE)  5 Test  65 ques 