Gate IT 2007

Question 1
Suppose there are two coins. The first coin gives heads with probability 5/8 when tossed, while the second coin gives heads with probability 1/4. One of the two coins is picked up at random with equal probability and tossed. What is the probability of obtaining heads ?
A
7/8
B
1/2
C
7/16
D
5/32
Gate IT 2007    
Discuss it


Question 1 Explanation: 
Either 1st coin is selected or second coin is selected
Probability of 1st coin to be selected = ½
And probability of getting head on it = 5/8
Or
Probability of 2nd coin to be selected = 1/2
And pobability of getting head on 2nd coin = ¼
Probability of getting head (overall) = (Probability of selecting 1st coin * Probability of head on it) +(Probability of selecting 2nd coin * Probability of getting head on it) = (1/2)*(5/8) + (1/2)*(1/4) = 7/16
Question 2
Let A be the \begin{pmatrix} 3&1&1&2\\ 3&1&1&2 \end{pmatrix} . What is the maximum value of xTAx where the maximum is taken over all x that are the unit eigenvectors of A?
A
5
B
(5 + √5)/2
C
3
D
(5 - √5)/2
Gate IT 2007    
Discuss it


Question 2 Explanation: 
|M-λ.I| = 0, where λ is the eigen values and I is the identity matrix
|A-(λ*I)| = 0
(3-λ)(2-λ)-1 = 0
6-3λ -2λ + λ2+1=0
λ2-5λ+5=0
λ = (5+√5)/2 and (5-√5)/2,
λ = (5+√5)/2 is max value another root with negative sign which will not be max value.
For, λ=5+5√2, xTAx=[18.131 21.231 21.231 34.331]
For, λ=5−5√2, xTAx=[Tex]\begin{pmatrix} 14.300&−0.700\\ 6.200&1.200 \end{pmatrix}[/Tex]
Hence, for λ=5+5√2 the value of xTAx is maximum.
Question 3
Consider a weighted undirected graph with positive edge weights and let uv be an edge in the graph. It is known that the shortest path from the source vertex s to u has weight 53 and the shortest path from s to v has weight 65. Which one of the following statements is always true?
A
weight (u, v) < 12
B
weight (u, v) ≤ 12
C
weight (u, v) > 12
D
weight (u, v) ≥ 12
Graph Shortest Paths    Graph Theory    Gate IT 2007    
Discuss it


Question 3 Explanation: 
2007_3 The minimum weight happens when (S,U) + (U,V) = (S,V) Else (S,U) + (U,V) >= (S,V) Given (S,U) = 53, (S,V) = 65 53 + (U,V) >= 63 (U,V) >= 12. This solution is contributed by Anil Saikrishna Devarasetty
Question 4
In the Spiral model of software development, the primary determinant in selecting activities in each iteration is
A
Iteration size
B
Cost
C
Adopted process such as Rational Unified Process or Extreme Programming
D
Risk
Software Engineering    Gate IT 2007    
Discuss it


Question 4 Explanation: 
Spiral model is used to discover all risks associated as early as possible.
Question 5
Which of the following systems is a most likely candidate example of a pipe and filter architecture ?
A
Expert system
B
DB repository
C
Aircraft flight controller
D
Signal processing
Computer Organization and Architecture    Gate IT 2007    
Discuss it


Question 5 Explanation: 
2007_5
Reference: Software Architecture: A Case Based Approach By Vasudeva Varma, Varma Vasudeva
Question 6
A processor takes 12 cycles to complete an instruction I. The corresponding pipelined processor uses 6 stages with the execution times of 3, 2, 5, 4, 6 and 2 cycles respectively. What is the asymptotic speedup assuming that a very large number of instructions are to be executed?
A
1.83
B
2
C
3
D
6
Computer Organization and Architecture    Gate IT 2007    
Discuss it


Question 6 Explanation: 
For non pipeline processor,
It takes, 12 cycles to complete 1 instruction
So, for n instructions it will take 12n cycle
For pipelined processor,
Each stage time = max{each stage cycles} = max{3, 2, 5, 4, 6 and 2} = 6 cycles
So, for n instructions it will take = 6*6+ (n-1)*6 {6*6 for 1st instruction and for rest of n-1 it will take 6}
For a large number of instructions:
Limn->∞ 12n/36 + (n-1)*6 = 12/6 =2
Question 7
Which of the following input sequences for a cross-coupled R-S flip-flop realized with two NAND gates may lead to an oscillation ?
A
11, 00
B
01, 10
C
10, 01
D
00, 11
Digital Logic & Number representation    Gate IT 2007    
Discuss it


Question 7 Explanation: 
RS flip flop using NAND gates. So, 00 input causes indeterminate state which MAY lead to oscillation.
Question 8
The following circuit implements a two-input AND gate using two 2-1 multiplexers.

What are the values of X1, X2, X3?
A
X1=b, X2=0, X3=a
B
X1=b, X2=1, X3=b
C
X1=a, X2=b, X3=1
D
X1=a, X2=0, X3=b
Digital Logic & Number representation    Gate IT 2007    
Discuss it


Question 8 Explanation: 
2007_8_2
F = (bX1' + aX1)X3 + X2X3'
By putting following values: X1 = b, X2 = 0, X3 = a
We will get F = ab.
Question 9
Consider an ambiguous grammar G and its disambiguated version D. Let the language recognized by the two grammars be denoted by L(G) and L(D) respectively. Which one of the following is true ?
A
L (D) ⊂ L (G)
B
L (D) ⊃ L (G)
C
L (D) = L (G)
D
L (D) is empty
Regular languages and finite automata    Gate IT 2007    
Discuss it


Question 9 Explanation: 
By changing grammar, language will not change here. {as converting NFA to DFA language will not be changed}
Question 10
Processes P1 and P2 use critical_flag in the following routine to achieve mutual exclusion. Assume that critical_flag is initialized to FALSE in the main program.
get_exclusive_access ( ) { if (critical _flag == FALSE) { critical_flag = TRUE ; critical_region () ; critical_flag = FALSE; } } Consider the following statements.
i. It is possible for both P1 and P2 to access critical_region concurrently.
ii. This may lead to a deadlock.
Which of the following holds?
A
(i) is false and (ii) is true
B
Both (i) and (ii) are false
C
(i) is true and (ii) is false
D
Both (i) and (ii) are true
Process Management    Deadlock    Gate IT 2007    
Discuss it


Question 10 Explanation: 
2007_9
Say P1 starts first and executes statement 1, after that system context switches to P2 (before executing statement 2), and it enters inside if statement, since the flag is still false. So now both processes are in critical section!! so (i) is true.. (ii) is false By no way it happens that flag is true and no process' are inside the if clause, if someone enters the critical section, it will definitely make flag = false. So no deadlock.
Question 11
Let a memory have four free blocks of sizes 4k, 8k, 20k, 2k. These blocks are allocated following the best-fit strategy. The allocation requests are stored in a queue as shown below.
2007_11
The time at which the request for J7 will be completed will be
A
16
B
19
C
20
D
37
Gate IT 2007    
Discuss it


Question 11 Explanation: 
Initially when a process arrives and needs memory, it would search for a hole big enough to fit the job and if the hole is larger then the remaining hole is returned to the free storage list.
Memory Block Size Job (t=0) Job(t=8) Job(t=10) Job(t=11)
1 4k J3 - 2 units (1K free left)      
2 8k J4 – 8 units (2K free left) J5 - 14 units J5 – 14 units J5 – 14 units
3 20k J2 -10 units(6K free left) J2 -10 units J6 – 11 units J7 – 19 units
4 2k J1 -4 units      
Therefore, the process finishes at J7=19 units Option B  
Question 12
The address sequence generated by tracing a particular program executing in a pure demand paging system with 100 bytes per page is
0100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0410.
Suppose that the memory can store only one page and if x is the address which causes a page fault then the bytes from addresses x to x + 99 are loaded on to the memory.
How many page faults will occur ?
A
0
B
4
C
7
D
8
Memory Management    Gate IT 2007    
Discuss it


Question 12 Explanation: 

Address	        Page faults	last byte in memory
0100 		page fault, 	 199 
0200 		page fault, 	 299
0430		page fault,      529 
0499 		no page fault
0510 		no page fault 
0530 		page fault,     629
0560            no page fault 
0120 		page fault,     219
0220	 	page fault,     319
0240            no page fault 
0260            no page fault 
0320		page fault,     419
0410            no page fault
So, 7 is the answer- (C)
Question 13
Consider the following statements about the timeout value used in TCP. i. The timeout value is set to the RTT (Round Trip Time) measured during TCP connection establishment for the entire duration of the connection. ii. Appropriate RTT estimation algorithm is used to set the timeout value of a TCP connection. iii. Timeout value is set to twice the propagation delay from the sender to the receiver. Which of the following choices hold?
A
(i) is false, but (ii) and (iii) are true
B
(i) and (iii) are false, but (ii) is title
C
(i) and (ii) are false, but (iii) is true
D
(i), (ii) and (iii) are false
Transport Layer    Misc Topics in Computer Networks    Gate IT 2007    
Discuss it


Question 13 Explanation: 
  Time-out timer in TCP: One can’t use static timer used in data link layer (DLL), which is HOP to HOP connection, since nobody knows how many hops are there in the path form sender to receiver as it uses IP service and path may vary time to time. So, dynamic timers are used in TCP. Time-out timer should increase or decrease depending on traffic to avoid unnecessary congestion due to retransmissions. There are three algorithms are for this purpose: 1. Basic algorithm 2. Jacobson’s algorithm 3. Karl’s modification. Solution:
  1. The timeout value is set to the RTT (Round Trip Time) measured during TCP connection establishment for the entire duration of the connection.- FALSE The timeout value can’t be fixed for entire duration as it will turn timer to static timer, we need dynamic timer for timeout.
  1. Appropriate RTT estimation algorithm is used to set the timeout value of a TCP connection.-TRUE Yes, all three algorithm are appropriate RTT estimation algorithm used to set timeout value dynamically.
  1. Timeout value is set to twice the propagation delay from the sender to the receiver.-FALSE This statement is false because, timeout value is set to twice the propagation delay in data link layer where, hop to hop distance is known, not in TCP layer.
This solution is contributed by Sandeep pandey.
Question 14
Consider a TCP connection in a state where there are no outstanding ACKs. The sender sends two segments back to back. The sequence numbers of the first and second segments are 230 and 290 respectively. The first segment was lost, but the second segment was received correctly by the receiver. Let X be the amount of data carried in the first segment (in bytes), and Y be the ACK number sent by the receiver. The values of X and Y (in that order) are
A
60 and 290
B
230 and 291
C
60 and 231
D
60 and 230
Transport Layer    Gate IT 2007    
Discuss it


Question 14 Explanation: 
data in 1st segment is from byte number 230 to byte number 289, that is 60 bytes As 1st is lost so, TCP will send ACK for the next in-order segment receiver is expecting. So it will be for 230.
Question 15
Consider the following two statements: i. A hash function (these are often used for computing digital signatures) is an injective function. A. encryption technique such as DES performs a permutation on the elements of its input alphabet. Which one of the following options is valid for the above two statements?
A
Both are false
B
Statement (i) is true and the other is false
C
Statement (ii) is true and the other is false
D
Both are true
Network Security    Gate IT 2007    
Discuss it


Question 15 Explanation: 
   

Injective Function:

A function F(X) is said to be injective if it has one-to-one mapping. Statement 1: Hash function is an injective function Statement 2: DES Encryption technique performs a permutation on the elements of its input alphabet

1) Generally, a hash function H(X) is mapping from a larger set to a predefined output set For example, let H(X) = (X)%5 The above function H(X) is not injective because Let X1 = 10, X2 = 15 H(10) = H(15) = 0 As the output of H(X1) = H(X2) where X1!= X2 => H(X) is many-to-one function. Statement 1 is false.

2) In DES encryption scheme, it performs P-Box permutation. Statement 1 is false, Statement 2 is true.

This solution is contributed by Anil Saikrishna Devarasetty.

Question 16
The minimum positive integer p such that 3p modulo 17 = 1 is
A
5
B
8
C
12
D
16
Misc    Network Security    Gate IT 2007    
Discuss it


Question 16 Explanation: 
Either use Fermat's Little Theorem (reference)
Or put the value of p and get the answer
Question 17
Exponentiation is a heavily used operation in public key cryptography. Which of the following options is the tightest upper bound on the number of multiplications required to compute bn mod m,0≤b,n≤m ?
A
O(logn)
B
O(√n)
C
O(n/logn)
D
O(n)
Network Security    Gate IT 2007    
Discuss it


Question 17 Explanation: 
This Problem can be solved using Divide And Conquer Paradigm Algorithm :

Binary_exp(b,n)                            // Compute bn mod m

{

    if(n == 0)

        Return 1;

    Else if(n == 1)

        Return b mod m;

    Else

    {

        Half = Binary_exp(b,n/2);

        if(n%2 == 0)                                // n is even

            Return (Half*Half) mod m;

        Else                                    // n is odd

            Return (((Half*Half) mod m)*n) mod m;

}

}          

Recurrence Relation for computing the time complexity of the above given algorithm is T(n) = T(n/2) + constant = (log2n) This solution is contributed by Pranjul Ahuja.
Question 18
A firewall is to be configured to allow hosts in a private network to freely open TCP connections and send packets on open connections. However, it will only allow external hosts to send packets on existing open TCP connections or connections that are being opened (by internal hosts) but not allow them to open TCP connections to hosts in the private network. To achieve this the minimum capability of the firewall should be that of
A
A combinational circuit
B
A finite automaton
C
A pushdown automaton with one stack
D
A pushdown automaton with two stacks
Misc Topics in Computer Networks    Network Security    Gate IT 2007    
Discuss it


Question 18 Explanation: 
A) A combinational circuit => Not possible, because we need memory in Firewall, Combinational ckt has none.
B) A finite automaton => We need infinite memory, there is no upper limit on Number of TCP ckt so Not this.
C) A pushdown automaton with one stack => Stack is infinite. Suppose we have 2 connections , we have pushed details of those on stack we can not access the details of connection which was pushed first, without popping it off. So Big NO.
D) pushdown automaton with two stacks => This is TM. It can do everything our normal computer can do so Yes. Firewall can be created out of TM.
Question 19
Consider the XML document fragment given below:
2007_19
With reference to the HTML lines given above, consider the following statements.
1. Clicking on the point <80, 75> does not have any effect.
2. The web browser can identify the area applicable to the mouse-click within the image and the subsequent action to be taken without additional responses from the web server.
3. The dots in the cgi-bin URL will be resolved by the web browser before it is sent to the web server
4. The "fd.html" request when sent to the web server will result in a GET request.
Exactly how many of the statements given above are correct?
A
0
B
1
C
2
D
3
HTML and XML    Gate IT 2007    
Discuss it


Question 20
Consider the XML document fragment given below:
2007_20
Consider the XPath expression: *[not (self ) : : TOC]
What would be the result of the given XPath expression when the current node is Book?
A
The Title and Content elements
B
The Content and TOC elements
C
The Title and TOC elements
D
The Title Content and TOC elements
HTML and XML    Gate IT 2007    
Discuss it


Question 20 Explanation: 
Out of Syllabus now
Question 21
Which one of these first-order logic formula is valid?
A
∀x(P(x) => Q(x)) => (∀xP(x) => ∀xQ(x))
B
∃x(P(x) ∨ Q(x)) => (∃xP(x) => ∃xQ(x))
C
∃x(P(x) ∧ Q(x)) <=> (∃xP(x) ∧ ∃xQ(x))
D
∀x∃y P(x, y) => ∃y∀x P(x, y)
Propositional and First Order Logic.    Gate IT 2007    
Discuss it


Question 21 Explanation: 
(A) LHS->RHS
LHS: For every x (if P holds then Q holds)
RHS: If P(x) holds for all x, then Q(x) holds for all x.
(B) LHS !->RHS
LHS: An x exist for which either P(x) is true or Q(x) is true.
RHS: If an x exist for which P(x) is true then another x exist for which Q(x) is true.
(C) It is not necessary that on RHS both x are same.
LHS: There exist an x for which both P(x) and Q(x) are true.
RHS: There exist an x for which P(x) is true and there exist an x for which Q(x) is true.
(D) LHS!->RHS
LHS: For every x, there exist a y such that P(x, y) holds.
RHS: There exist a y such that for all x P(x, y) holds.
Question 22
The trapezoidal method is used to evaluate the numerical value of \int_0^1 $e^x$\,dx. Consider the following values for the step size h.
i. 10-2
ii. 10-3
iii. 10-4
iv. 10-5
For which of these values of the step size h, is the computed value guaranteed to be correct to seven decimal places. Assume that there are no round-off errors in the computation.
A
(iv) only
B
(iii) and (iv) only
C
(ii), (iii) and (iv) only
D
(i), (ii), (iii) and (iv)
Numerical Methods and Calculus    Gate IT 2007    
Discuss it


Question 23
A partial order P is defined on the set of natural numbers as follows. Here x/y denotes integer division.
i. (0, 0) ∊ P.
ii. (a, b) ∊ P if and only if a % 10 ≤ b % 10 and (a/10, b/10) ∊ P.
Consider the following ordered pairs:
i. (101, 22)
ii. (22, 101)
iii. (145, 265)
iv. (0, 153)
Which of these ordered pairs of natural numbers are contained in P?
A
(i) and (iii)
B
(ii) and (iv)
C
(i) and (iv)
D
(iii) and (iv)
Numbers    Gate IT 2007    
Discuss it


Question 24
A depth-first search is performed on a directed acyclic graph. Let d[u] denote the time at which vertex u is visited for the first time and f[u] the time at which the dfs call to the vertex u terminates. Which of the following statements is always true for all edges (u, v) in the graph ?
A
d[u] < d[v]
B
d[u] < f[v]
C
f[u] < f[v]
D
f[u] > f[v]
Gate IT 2007    
Discuss it


Question 24 Explanation: 
2007_24
Starting DFS at node V
1] Visit(V) -> DFS(X) ->Visit(X) ->DFS(U) ->Visit(U) -> backtrack(X) -> backtrack(V)
Therefore: d[U] > d[V], d[U] < f[V], f[U] < f[V]
But, visiting order is just opposite of finishing order.
Hence f[U] > f[V]
Question 25
What is the largest integer m such that every simple connected graph with n vertices and n edges contains at least m different spanning trees?
A
1
B
2
C
3
D
n
Graph    Graph Minimum Spanning Tree    Gate IT 2007    
Discuss it


Question 25 Explanation: 
A graph is connected iff all nodes can be traversed from each node. For a graph with n nodes, there will be n-1 minimum number of edges.
Given that there are n edges, that means a cycle is there in the graph.
The simplex graph with these conditions may be:
2007_25
Now we can make a different spanning tree by removing one edge from the cycle, one at a time.
Minimum cycle length can be 3, So, there must be atleast 3 spanning trees in any such Graph.
Question 26
Consider n jobs J1, J2,......Jn such that job Ji has execution time ti and a non-negative integer weight wi. The weighted mean completion time of the jobs is defined to be 2007_26, where Ti is the completion time of job Ji. Assuming that there is only one processor available, in what order must the jobs be executed in order to minimize the weighted mean completion time of the jobs?
A
Non-decreasing order of ti
B
Non-increasing order of wi
C
Non-increasing order of witi
D
None-increasing order of wi/ti
CPU Scheduling    Gate IT 2007    
Discuss it


Question 27
The function f is defined as follows:
int f (int n) {
    if (n <= 1) return 1;
    else if (n % 2  ==  0) return f(n/2);
    else return f(3n - 1);
}
Assuming that arbitrarily large integers can be passed as a parameter to the function, consider the following statements.
1. The function f terminates for finitely many different values of n ≥ 1.
ii. The function f terminates for infinitely many different values of n ≥ 1.
iii. The function f does not terminate for finitely many different values of n ≥ 1.
iv. The function f does not terminate for infinitely many different values of n ≥ 1.
Which one of the following options is true of the above?
A
(i) and (iii)
B
(i) and (iv)
C
(ii) and (iii)
D
(ii) and (iv)
Recursion    Functions    C Quiz - 113    Gate IT 2007    
Discuss it


Question 27 Explanation: 
The function terminates for all values having a factor of 2 {(2.x)2==0}
So, (i) is false and (ii) is TRUE.
Let n = 3, it will terminate in 2nd iteration.
Let n=5, it will go like 5 - 14 - 7 - 20 - 10 - 5 – and now it will repeat.
And any number with a factor of 5 and 2, there are infinite recursions possible.
So, (iv) is TRUE and (iii) is false.
Question 28
Consider a hash function that distributes keys uniformly. The hash table size is 20. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed 0.5.
A
5
B
6
C
7
D
10
Hash    Gate IT 2007    
Discuss it


Question 28 Explanation: 
For each entry probability of collision is 1/20 {as possible total spaces =20, and an entry will go into only 1 place}
Say after inserting x values probability becomes ½
 (1/20).x = ½
 X=10
Question 29
When searching for the key value 60 in a binary search tree, nodes containing the key values 10, 20, 40, 50, 70 80, 90 are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value 60?
A
35
B
64
C
128
D
5040
Binary Search Trees    Tree Traversals    Gate IT 2007    
Discuss it


Question 29 Explanation: 
There are two set of values, smaller than 60 and greater than 60. Smaller values 10, 20, 40 and 50 are visited, means they are visited in order. Similarly, 90, 80 and 70 are visited in order.
= 7!/(4!3!)
= 35
Question 30
Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are:
i. isEmpty (Q) — returns true if the queue is empty, false otherwise.
ii. delete (Q) — deletes the element at the front of the queue and returns its value.
iii. insert (Q, i) — inserts the integer i at the rear of the queue.
Consider the following function:
 void f (queue Q) {
int i ;
if (!isEmpty(Q)) {
   i = delete(Q);
   f(Q);
   insert(Q, i);
  }
}
What operation is performed by the above function f ?
A
Leaves the queue Q unchanged
B
Reverses the order of the elements in the queue Q
C
Deletes the element at the front of the queue Q and inserts it at the rear keeping the other elements in the same order
D
Empties the queue Q
Queue    C Quiz - 113    Gate IT 2007    
Discuss it


Question 30 Explanation: 
As it is recursive call, and removing from front while inserting from end, that means last element will be deleted at last and will be inserted 1st in the new queue. And like that it will continue till first call executes insert(Q,i) function.
So, the queue will be in reverse.
Question 31
Consider the C program given below :
 #include <stdio.h>
int main ()    {
    int sum = 0, maxsum = 0,  i,  n = 6;
    int a [] = {2, -2, -1, 3, 4, 2};
    for (i = 0; i < n; i++)    {
            if (i == 0 || a [i]  < 0  || a [i] < a [i - 1])  {
                     if (sum > maxsum) maxsum = sum;
                     sum = (a [i] > 0) ? a [i] : 0;
            }
            else sum += a [i];
    }
    if (sum > maxsum) maxsum = sum ;
    printf ("%d\n", maxsum);

} 
What is the value printed out when this program is executed?
A
9
B
8
C
7
D
6
Arrays    C Quiz - 113    Gate IT 2007    
Discuss it


Question 31 Explanation: 
If you look for loop carefully, you will notice that it assigns sum variable to some value in if condition and increments it in the else condition. On further thought, it would be clear that this loop stores sum of increasing subsequence of positive integers in sum variable and max of sum in maxsum. Hence, maxsum - maximum sum of increasing subsequence of positive integers will get printed out when this program is executed, which is 3 + 4 = 7. This solution is contributed by Vineet Purswani //output will be 3+4 =7 {for || if 1st argument is true 2nd argument will not be calculated, and if 1st argument is false, 2nd argument will be calculated} Another Solution When i=1 -> i==0 is false, but a[i]<0 is true so condition (1) is true.Now if (sum > maxsum) is true, since sum=2 and maxsum=0.So maxsum=2. sum = (a [i] > 0) ? a [i] : 0; , sum=0 since a[i]<0.
When i=2 -> i==0 is false, a[i]<0 is true and so condition (1) is true.Now if (sum > maxsum) is false, since sum=0 and maxsum=2.Since sum = (a [i] > 0) ? a [i] : 0; , sum=0 since a[i]<0.
When i=3 -> i==0 is false , a[i]<0 is false and a [i] < a [i – 1] is false so condition (1) is false. Now sum += a [i] = 3. When i=4 -> i==0 is false , a[i]<0 is false and a [i] < a [i – 1] is false so condition (1) is false. Now sum += a [i] = 7. When i=5 -> i==0 is false , a[i]<0 is false and a [i] < a [i – 1] is true so condition (1) is true. sum > maxsum is true, since sum=7 and maxsum=2,so maxsum=7.Since sum = (a [i] > 0) ? a [i] : 0, so sum=2 since a[5]>0. This solution is contributed by nirmal Bharadwaj
Question 32
Consider the following C program:
   #include 
           #define EOF -1
           void push (int); /* push the argument on the stack */
           int pop  (void); /* pop the top of the stack */
           void flagError ();
           int main ()
          {         int c, m, n, r;
                     while ((c = getchar ()) != EOF)
                    { if  (isdigit (c) )
                               push (c);
                     else if ((c == '+') || (c == '*'))
                    {          m = pop ();
                                n = pop ();
                                r = (c == '+') ? n + m : n*m;
                                push (r);
                      }
                      else if (c != ' ')
                               flagError ();
             }
              printf("% c", pop ());
}
What is the output of the program for the following input ? 5 2 * 3 3 2 + * +
A
15
B
25
C
30
D
150
Stack    C Quiz - 113    Gate IT 2007    
Discuss it


Question 32 Explanation: 
  The function of the program is:- 1) If the current character is a digit it pushes into stack 2) Else if the current character is operator,  it pops two elements and then performs the operation. Finally it pushes the resultant element into stack. Initially stack s is empty. 5 2 * 3 3 2 + * + 1) 5 -> It pushes into s 2) 2 -> It pushes into s 3) * -> It pops two elements n = 2, m=5 n*m = 10 It pushes 10 into s 4) 3 -> It pushes into s 5) 3 -> It pushes into s 6) 2 -> It pushes into s 7) + -> n=2, m=3 n+m=5 It pushes 5 into s 8) * -> n=5, m=3 n*m=15 It pushes 15 into s 9) + -> n=15, m=10 n+m = 25 It pushes 25 into s.   Finally the result value is the only element present in stack. This solution is contributed  by Anil Saikrishna Devarasetty. Result = 25
Question 33
Consider the program below in a hypothetical language which allows global variable and a choice of call by reference or call by value methods of parameter passing.
 int i ;
program main ()
{
    int j = 60;
    i = 50;
    call f (i, j);
    print i, j;
}
procedure f (x, y)
{           
    i = 100;
    x = 10;
    y = y + i ;
}
Which one of the following options represents the correct output of the program for the two parameter passing mechanisms?
A
Call by value : i = 70, j = 10; Call by reference : i = 60, j = 70
B
Call by value : i = 50, j = 60; Call by reference : i = 50, j = 70
C
Call by value : i = 10, j = 70; Call by reference : i = 100, j = 60
D
Call by value : i = 100, j = 60; Call by reference : i = 10, j = 70
Variable Declaration and Scope    C Quiz - 113    Gate IT 2007    
Discuss it


Question 33 Explanation: 
Call by value: A copy of parameters will be passed and whatever updations are performed will be valid only for that copy, leaving original values intact.
Call by reference: A link to original variables will be passed, by allowing the function to manipulate the original variables.
Question 34
Consider the program below in a hypothetical programming language which allows global variables and a choice of static or dynamic scoping.
 int i ;
program main ()
{
    i = 10;
    call f();
}

procedure f()
{   
    int i = 20;
    call g ();
}
procedure g ()
{   
    print i;
}
Let x be the value printed under static scoping and y be the value printed under dynamic scoping. Then, x and y are
A
x = 10, y = 10
B
x = 20, y = 10
C
x = 10, y = 20
D
x = 20, y = 20
Gate IT 2007    
Discuss it


Question 34 Explanation: 
Static scoping: 1
Question 35
Early binding refers to a binding performed at compile time and late binding refers to a binding performed at execution time. Consider the following statements:
i. Static scope facilitates w1 bindings.
ii. Dynamic scope requires w2 bindings.
iii. Early bindings w3 execution efficiency.
iv. Late bindings w4 execution efficiency.
The right choices of wl, w2, w3 and w4 (in that order) are
A
Early, late, decrease, increase
B
Late, early, increase, decrease
C
Late, early, decrease, increase
D
Early, late, increase, decrease
Gate IT 2007    
Discuss it


Question 35 Explanation: 
Early binding can be done in Static Scoping(during compile time). Early binding increases efficiency (running time will be reduced).
Late binding can be done in Dynamic scoping (during execution time). Late binding decreases efficiency as it needs to be done at run-time. (but it increases flexibility)
Question 36
The floating point unit of a processor using a design D takes 2t cycles compared to t cycles taken by the fixed point unit. There are two more design suggestions D1 and D2. D1 uses 30% more cycles for fixed point unit but 30% less cycles for floating point unit as compared to design D. D2 uses 40% less cycles for fixed point unit but 10% more cycles for floating point unit as compared to design D. For a given program which has 80% fixed point operations and 20% floating point operations, which of the following ordering reflects the relative performances of three designs?
(Di > Dj denotes that Di is faster than Dj)
A
D1 > D > D2
B
D2 > D > D1
C
D > D2 > D1
D
D > D1 > D2
Gate IT 2007    
Discuss it


Question 36 Explanation: 
0.8 * (time taken in fixed point) + 0.2 (time taken in floating point)
Say, t=1
D = 0.8(1) + 0.2(2)
=1.2
D1 = 0.8(1.3)+0.2(1.4)
=1.04 +.28
=1.32
D2 = 0.8(1-0.04) + 0.2(2-2*0.1)
= 0.8*0.96 + 0.2*1.8
= 0.768 +0.36 = 1.128
D1>D>D2
Question 37
Consider a Direct Mapped Cache with 8 cache blocks (numbered 0-7). If the memory block requests are in the following order 3, 5, 2, 8, 0, 63, 9,16, 20, 17, 25, 18, 30, 24, 2, 63, 5, 82,17, 24. Which of the following memory blocks will not be in the cache at the end of the sequence ?
A
3
B
18
C
20
D
30
Gate IT 2007    
Discuss it


Question 37 Explanation: 
Location of memory block in cache  =  block  % number of cache blocks Since it is a direct mapped cache, no replacement policy is required. As we can see in the table, 18 is further replaced by 82 in the 2nd cache block whereas 3,20 and 30 are all present in the cache till the end. Therefore, Answer is B
Memory Block Blocks
0 8, 0, 16, 24
1 9, 17, 25, 63, 17
2 2, 18, 2, 82
3 3
4 20
5 5, 5
6 30
7 63,63
Question 38
The following expression was to be realized using 2-input AND and OR gates. However, during the fabrication all 2-input AND gates were mistakenly substituted by 2-input NAND gates.
(a.b).c + (a'.c).d + (b.c).d + a. d
What is the function finally realized ?
A
1
B
a' + b' + c' + d'
C
a' + b + c' + d'
D
a' + b' + c + d'
Gate IT 2007    
Discuss it


Question 39
Data forwarding techniques can be used to speed up the operation in presence of data dependencies. Consider the following replacements of LHS with RHS.
2007_39
In which of the following options, will the result of executing the RHS be the same as executing the LHS irrespective of the instructions that follow ?
A
(i) and (iii)
B
(i) and (iv)
C
(ii) and (iii)
D
(ii) and (iv)
E
Only (i)
Gate IT 2007    
Discuss it


Question 39 Explanation: 
(i) Is true, as both registers and location are updated
(iii) and (iv) are the same!! and both are wrong because R2 is writing last, not R1.
(ii) false, because R2 get the correct data, but location has not got updated.
Question 40
What is the final value stored in the linear feedback shift register if the input is 101101?
A
0110
B
1011
C
1101
D
1111
Gate IT 2007    
Discuss it


Question 40 Explanation: 
 

The linear feedback shift register makes use of XOR gate for tapping and providing feedback. It works by shifting and placing the feedback value. Feedback value is determined by last bit and second bit tapped and fed to XOR gate.

A

B

XOR

0

0

0

0

1

1

1

0

1

1

1

0

kriti_1 Reference: NPTEL: : http://nptel.ac.in/courses/106105031/19 This solution is contributed by Kriti Kushwaha .
Question 41
Following table indicates the latencies of operations between the instruction producing the result and instruction using the result. 2007_41
 Load R1, Loc 1;	 Load R1 from memory location Loc1
 Load R2, Loc 2;	 Load R2 from memory location Loc 2
 Add R1, R2, R1;	 Add R1 and R2 and save result in R1
 Dec R2;	 Decrement R2
 Dec R1;	 Decrement R1
 Mpy R1, R2, R3;	 Multiply R1 and R2 and save result in R3
 Store R3, Loc 3;	 Store R3 in memory location Loc 3
What is the number of cycles needed to execute the above code segment assuming each instruction takes one cycle to execute ?
A
7
B
10
C
13
D
14
Gate IT 2007    
Discuss it


Question 41 Explanation: 
  In the given question there are 7 instructions each of which takes 1 clock cycle to complete. (Pipelining may be used) If an instruction is in execution phase and any other instructions can’t be in the execution phase. So, atleast 7 clock cycles will be taken. Now, it is given that between two instructions latency or delay should be there based on their operation. Ex- 1st line of the table says that between two operations in which first is producing the result of an ALU operation and the 2nd is using the result there should be a delay of 2 clock cyles. clock cycle : im_07_41_1 1) Load R1, Loc 1; Load R1 from memory location Loc1 Takes 1 clock cycle, simply loading R1 on loc1. 2) Load R2, Loc 2; Load R2 from memory location Loc2 Takes 1 clock cycle, simply loading r2 on loc2. 3) Add R1, R2, R1; Add R1 and R2 and save result in R1 R1=R1+R2; Hence, this instruction is using the result of R1 and R2, i.e. result of Instruction 1 and Instruction 2. As instruction 1 is load operation and instruction 3 is ALU operation. So, there should be a delay of 1 clock cycle between instruction 1 and instruction 3.Which is already there due to I2. As instruction 2 is load operation and instruction 3 is ALU operation. So, there should be a delay of 1 clock cycle between instruction 2 and instruction 3. 4) Dec R2; Decrement R2 This instruction is dependent on instruction 2 and there should be a delay of one clock cycle between Instruction 2 and Instruction 4. As instruction 2 is load and 4 is ALU . Which is already there due to Instruction 3. 5) Dec R1 Decrement R1 This instruction is dependent on Instruction 3 As Instruction I3 is ALU and I5 is also ALU so a delay of 2 clock cycles should be there between them of which 1 clock cycle delay is already there due to I4 so one clock cycle delay between I4 and I5. 6) MPY R1, R2, R3; Multiply R1 and R2 and save result in R3 R3=R1*R2; This instruction uses the result of Instruction 5, as both instruction 5 and 6 are ALU so there should be a delay of 2 clock cycles. 7) Store R3, Loc 3 Store R3 in memory location Loc3 This instruction is dependent on instruction 6 which is ALU and instruction 7 is store so there should be a delay of 2 clock cycles between them. Hence, a total of 13 clock cycles will be there.   This solution is contributed by Shashank Shanker khare.
Question 42
(C012.25)H - (10111001110.101)B =
A
(135103.412)o
B
(564411.412)o
C
(564411.205)o
D
(135103.205)o
Gate IT 2007    
Discuss it


Question 42 Explanation: 
(C012.25)H - (10111001110.101)B
= 1100 0000 0001 0010. 0010 0101 (convert each digit of hexa to 4 bit binary)
- 0000 0101 1100 1110. 1010 0000
= 1011 1010 0100 0011. 1000 0101
= 1 011 101 001 000 011 . 100 001 010 (make pairing of 3 to convert in octal)
= (135103.412)o
Question 43
An error correcting code has the following code words:
00000000, 00001111, 01010101, 10101010, 11110000.
What is the maximum number of bit errors that can be corrected ?
A
0
B
1
C
2
D
3
Gate IT 2007    
Discuss it


Question 43 Explanation: 
While transmitting the data through the channel , noise may be added to the data and thus, may cause errors in the data. Hamming code errors CANNOT be DETECTED if one code converts into another ,so if maximum hamming distance (i.e. the number of 1 s when we XOR 2 hamming codes ) between any two codes is ‘t’ then for detection error should not be more than t-1,otherwise the code could have been converted to another and we may assume that it is a correct hamming code. Similarly,for CORRECTION we should also know which hamming code it was,thus, if the maximum hamming distance is d then d/2 is the partition between two hamming codes from where we can find which code it was.Thus,if we have to correct ‘t’ errors then Max dist = 2*t +1 Max hamming distance is between 01010101 and 10101010 =>8 Thus, 8=2*t+1 t=3.5 We’ll take ceil as taking more than these bits will again make it impossible to correct the error. This solution is contributed by Shashank Shanker khare Another one d=(2t+1) t=number of bits could be corrected
maximum hamming distance between any two of the given code = 8 (between 01010101 and 10101010)
t=3.5, t=3
Question 44
A hard disk system has the following parameters :
    • Number of tracks = 500
    • Number of sectors/track = 100
    • Number of bytes /sector = 500
    • Time taken by the head to move from one track to adjacent track = 1 ms
    • Rotation speed = 600 rpm.
What is the average time taken for transferring 250 bytes from the disk ?
A
300.5 ms
B
255.5 ms
C
255.0 ms
D
300.0 ms
Gate IT 2007    
Discuss it


Question 44 Explanation: 
Avg. time to transfer = Avg. seek time + Avg. rotational delay + Data transfer time
  • Avg Seek Time -  time taken  to move from 1st track to 1sr track : 0ms, 1st to 2nd : 1ms, 2ms, 3ms,....499ms Avg Seek time =( ∑0+1+2+3+...+499)/500 = 249.5 ms
  • Avg Rotational Delay - RMP : 600 , 600 rotations in 60 sec (one Rotation = 60/600 sec = 0.1 sec) So, Avg Rotational Delay = 0.1/2= 50 ms
  • Data Transfer Time: In One 1 Rotation we can read data on one track = 100 * 500 = 50,000 B data is read in one rotation. 250 bytes -> 0.1 * 250 / 50,000 = 0.5 ms
Therfore ATT = 295.5+50+0.5 = 300 ms
Question 45
The line T in the following figure is permanently connected to the ground. 2007_45 Which of the following inputs (X1 X2 X3 X4) will detect the fault ?
A
0000
B
0111
C
1111
D
None of these
Gate IT 2007    
Discuss it


Question 45 Explanation: 
 

We consider circuit in two different configurations to check the inputs. And then apply the three available inputs to get output values. On doing so, we observe that all inputs give same outputs in both the configurations. Thus None of these is the answer.

kriti_2

kriti_3

This solution is contributed by Kriti Kushwaha.

Question 46
The two grammars given below generate a language over the alphabet {x, y, z}
2007_46
Which one of the following choices describes the properties satisfied by the strings in these languages?
A
G1 : No y appears before any x
G2 : Every x is followed by at least one y
B
G1 : No y appears before any x
G2 : No x appears before any y
C
G1 : No y appears after any x
G2 : Every x is followed by at least one y
D
G1 : No y appears after any x
G2 : Every y is followed by at least one x
Gate IT 2007    
Discuss it


Question 47
Consider the following DFA in which s0 is the start state and s1, s3 are the final states.
2007_47
What language does this DFA recognize ?
A
All strings of x and y
B
All strings of x and y which have either even number of x and even number of y or odd number or x and odd number of y
C
All strings of x and y which have equal number of x and y
D
All strings of x and y with either even number of x and odd number of y or odd number of x and even number of y
Gate IT 2007    
Discuss it


Question 48
Consider the grammar given below
S → x B | y A
A → x | x S | y A A
B → y | y S | y B B
Consider the following strings.
(i) xxyyx
(ii) xxyyxy
(iii) xyxy
(iv) yxxy
(v) yxx
(vi) xyx
Which of the above strings are generated by the grammar ?
A
(i), (ii), and (iii)
B
(ii), (v), and (vi)
C
(ii), (iii), and (iv)
D
(i), (iii), and (iv)
Gate IT 2007    
Discuss it


Question 48 Explanation: 
Only iii and iv are possible.
Question 49
Consider the following grammars. Names representing terminals have been specified in capital letters.
2007_49
Which one of the following statements is true?
A
G1 is context-free but not regular and G2 is regular
B
G2 is context-free but not regular and G1 is regular
C
Both G1 and G2 are regular
D
Both G1 and G2 are context-free but neither of them is regular
Gate IT 2007    
Discuss it


Question 49 Explanation: 
Given grammars can be re-written as:
Say, while = w, expr =E, stmt = S, other = o
Here, we can write a right linear grammar for G1 as
S -> w(E)S
S -> o
E->ID
So, L(G1) is regular.
Now for G2 also we can write a right linear grammar:
S -> w(E)S
E -> E+E
E -> E*E
S -> o
So, L(G2) is regular
Question 50
Consider the following finite automata P and Q over the alphabet {a, b, c}. The start states are indicated by a double arrow and final states are indicated by a double circle. Let the languages recognized by them be denoted by L(P) and L(Q) respectively.
2007_50
The automation which recognizes the language L(P) ∩ L(Q) is :
2007_50_a
2007_50_b
2007_50_c
2007_50_d
A
a
B
b
C
c
D
d
Gate IT 2007    
Discuss it


Question 50 Explanation: 
Both accepts strings starting with a or b so option D cancels out.
In P(L) after c both a and b could be accepted, but in Q(L) only a could be accepted. Option C drops out here,
In P(L) aa could be accepted, but in Q(L) aa could not be accepted. Option B drops out here,
Question 51
In the simplified flowchart given below, the shaded boxes represent code that is executed during a test case.
2007_53
The Branch coverage is
A
3/4
B
2/3
C
1/2
D
3/8
Gate IT 2007    
Discuss it


Question 51 Explanation: 
2007_53_sol
3/8 are exposed
Question 52
Consider the CPM activity chart where an arc connecting two milestones is labeled with a task identifier and the time taken in days. For example in order to go from A to B, task T1 takes 180 days. A dashed line depicts an additional dependency that is equivalent to a zero time task.
2007_54
The set of activities that lie on the critical path are
A
T1, T2, T8, T10
B
T1, T3, T8, T10
C
T1, T2, T3, T4, T5, T6, T7, T8, T9, T10
D
T1, T4, T5, T7, T8, T10
Gate IT 2007    
Discuss it


Question 52 Explanation: 
Critical path is the one which takes longest time,
Question 53
Consider the following pseudo-code:
 IF ((A > B) AND (C > D)) THEN
       A = A + 1
       B = B + 1
ENDIF
The cyclomatic complexity of the pseudo-code is
A
2
B
3
C
4
D
5
Gate IT 2007    
Discuss it


Question 53 Explanation: 
Cyclomatic complexity = (π − s + 2)
where π is the number of decision points in the program, and s is the number of exit points.
Question 54
Synchronization in the classical readers and writers problem can be achieved through use of semaphores. In the following incomplete code for readers-writers problem, two binary semaphores mutex and wrt are used to obtain synchronization
wait (wrt)
writing is performed
signal (wrt)
wait (mutex)  
readcount = readcount + 1
if readcount = 1 then S1
S2
reading is performed
S3
readcount = readcount - 1
if readcount = 0 then S4 
signal (mutex)
The values of S1, S2, S3, S4, (in that order) are
A
signal (mutex), wait (wrt), signal (wrt), wait (mutex)
B
signal (wrt), signal (mutex), wait (mutex), wait (wrt)
C
wait (wrt), signal (mutex), wait (mutex), signal (wrt)
D
signal (mutex), wait (mutex), signal (mutex), wait (mutex)
Gate IT 2007    
Discuss it


Question 54 Explanation: 
For S1: if readcount =1 => reader is reading now, so no writer must execute. Hence, S1 has to be wait(wrt) For S2: After readcount has been updated, is made to 1, so other readers can enter into entry section. Multiple readings are allowed. (Only 1 at a time can be in entry section ) hence signal(mutex) For S3: Now at a time only one process can be in Exit section and semaphore mutex is used to implement it (only 1 at a time can be in exit section).Hence wait(mutex) For S4: If readcount is zero i.e no reader is reading, means last reader has completed reading, it should unlock resources so that any writer waiting for it can use it .hence signal(wrt).The above values of S1, S2, S3, and S4 are all nothing but implementing first reader writer problem. References: Readers-writers-problem-set-1-introduction-and-readers-preference-solution/ https://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/6_Synchronization.html This solution is contributed by Nitika Bansal Related Concepts: Process Synchronization|Set1 Mutex Vs Semaphore Monitors Readers-writers_problem (Wikipedia)
Question 55
In a multi-user operating system on an average, 20 requests are made to use a particular resource per hour. The arrival of requests follows a Poisson distribution. The probability that either one, three or five requests are made in 45 minutes is given by :
A
6.9 × 106 × e-20
B
1.02 × 106 × e-20
C
6.9 × 103 × e-20
D
1.02 × 103 × e-20
Gate IT 2007    
Discuss it


Question 55 Explanation: 
In 1 hr. requests received =20
So in 45 min requests received = 15
So, lemda = 15
So, using poission distribution formula: P(x; μ) = (e) (μx) / x!
p(one request) + p(3 request) + p(5 request) = p(1; 15) + p(3; 15) + p(5; 15) = 6.9 * 103 * e-15 = 1.02 × 106 × e-20
Question 56
A demand paging system takes 100 time units to service a page fault and 300 time units to replace a dirty page. Memory access time is 1 time unit. The probability of a page fault is p. In case of a page fault, the probability of page being dirty is also p. It is observed that the average access time is 3 time units. Then the value of p is
A
0.194
B
0.233
C
0.514
D
0.981
Gate IT 2007    
Discuss it


Question 56 Explanation: 
Page fault service time =100
page fault service time =300 (if there is dirty page)
probability of page fault =p
probability of being dirty is =p
so total page fault service time(ps) = p(300)+ (1-p)(100) = 200p+100
now given EAT =3 so
EAT = p(page fault service time +memory access time)+(1-p) memory access time
3= p*page fault service time + memory access time
3 =p(200p+100)+1= 200p2+100p+1
p=0.0194
Question 57
The contents of the text file t1 txt containing four lines are as follows :
a1 b1
a2 b2
a3 b2
a4 b1
The contents of the text file t2 txt containing five lines are as follows :
a1 c1
a2 c2
a3 c3
a4 c3
a5 c4
Consider the following Bourne shell script :
 awk - F '  '  ' {Print $1, $2} ' t1.txt |
while read a b ; do
            awk -v aV = $ a - v by = $b  - F ' '
            aV = = $1 (print aV, bV, $2 ) ' t2.txt
done
Which one of the following strings will NOT be present in the output generated when the above script in run?
(Note that the given strings may be substrings of a printed line.)
A
"b1 c1"
B
"b2 c3"
C
"b1 c2"
D
"b1 c3"
Gate IT 2007    
Discuss it


Question 58
For the network given in the figure below, the routing tables of the four nodes A, E, D and G are shown. Suppose that F has estimated its delay to its neighbors, A, E, D and G as 8, 10, 12 and 6 msecs respectively and updates its routing table using distance vector routing technique.
2007_60
2007_60_1
A.
2007_60_a
B.
2007_60_b
C.
2007_60_c
D.
2007_60_d
A
A
B
B
C
C
D
D
Gate IT 2007    
Discuss it


Question 58 Explanation: 
Distance from F to F is 0 which option C is dropped
Using DV routing protocol, F -> D -> B yields distance as 20 that drops option B and D.
Question 59
In the waveform (a) given below, a bit stream is encoded by Manchester encoding scheme. The same bit stream is encoded in a different coding scheme in wave form (b). The bit stream and the coding scheme are 2007_61
A
1000010111 and Differential Manchester respectively
B
0111101000 and Differential Manchester respectively
C
1000010111 and Integral Manchester respectively
D
0111101000 and Integral Manchester respectively
Gate IT 2007    
Discuss it


Question 59 Explanation: 
In simple language, Manchester encoding has +A to -A transition for the clock cycle for which bit is '1' and transition from -A to +A for the cycle when bit is '0' (A is the amplitude). kriti_9 kriti_10 kriti_11 The amplitudes are bipolar in Differential manchester encoding same as manchester encoding just that it toggles at '1'. When bit is '1' we get transition from +A to -A and it remains the same until next '1' arrives. The output changes to opposite transition (-A to +A) when next '1' arrives. The second encoding resembles the differential manchester code for the given number.   Image source: Google Images NPTEL Videos for Line coding: http://nptel.ac.in/courses/106105082/7 This solution is contributed by Kriti Kushwaha.    
Question 60
Let us consider a statistical time division multiplexing of packets. The number of sources is 10. In a time unit, a source transmits a packet of 1000 bits. The number of sources sending data for the first 20 time units is 6, 9, 3, 7, 2, 2, 2, 3, 4, 6, 1, 10, 7, 5, 8, 3, 6, 2, 9, 5 respectively. The output capacity of multiplexer is 5000 bits per time unit. Then the average number of backlogged of packets per time unit during the given period is
A
5
B
4.45
C
3.45
D
0
Gate IT 2007    
Discuss it


Question 60 Explanation: 
  he capacity of multiplexer is 5000 bits per unit time. This means there are 5 packets per unit time since each source transmits a packet of 1000 bits in a unit time. If the number of packets transmitted is larger than 5 then the extra packets are backlogged. This number gets added to the next number and further backlog is calculated.
Number of packets (+backlog from previous) Backlog
6 1
9+1 5
3+5 3
7+3 5
2+5 2
2+2 0
2 0
3 0
4 0
6 1
1+1 0
10 5
7+5 7
5+7 7
8+7 10
3+10 8
6+8 9
2+9 6
9+6 10
5+10 10
Total Backlog 89
  Average number of backlogged packets = 89/20 = 4.45 This solution is contributed by Kriti Kushwaha .
Question 61
Let us consider a statistical time division multiplexing of packets. The number of sources is 10. In a time unit, a source transmits a packet of 1000 bits. The number of sources sending data for the first 20 time units is 6, 9, 3, 7, 2, 2, 2, 3, 4, 6, 1, 10, 7, 5, 8, 3, 6, 2, 9, 5 respectively. The output capacity of multiplexer is 5000 bits per time unit. Then the average number of backlogged of packets per time unit during the given period is
A
3
B
4.26
C
4.53
D
5.26
Gate IT 2007    
Discuss it


Question 61 Explanation: 
Average hops for a message to reach to root - (3∗8)+(2∗4)+(1∗2)+(0∗1)15 = 2.267 Where, 3 hops & 8 routers for Bottom-most level and similarly the others Similarly average hops for a message to comes down to leaf- (3∗8)+(2∗4)+(1∗2)+(0∗1)15
{Same as above}
So, Total Hops = 2 * 2.267 = 4.53
Question 62
A broadcast channel has 10 nodes and total capacity of 10 Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of 80 μs to poll the next node. Whenever a node is polled, it is allowed to transmit a maximum of 1000 bytes. The maximum throughput of the broadcast channel is
A
1 Mbps
B
100/11 Mbps
C
10 Mbps
D
100 Mbps
Gate IT 2007    
Discuss it


Question 62 Explanation: 
Efficiency = transmission time/(transmission time + polling delay time)
Tt =1000 bytes/10Mbps =800μs.
Polling delay is = 80 μs
Efficiency=800/(800+80)= 10/11
Maximum throughput is =(10/11) * 10 Mbps= 100/11 Mbps
Question 63
Consider a selection of the form σA≤100(r), where r is a relation with 1000 tuples. Assume that the attribute values for A among the tuples are uniformly distributed in the interval [0, 500]. Which one of the following options is the best estimate of the number of tuples returned by the given selection query ?
A
50
B
100
C
150
D
200
Gate IT 2007    
Discuss it


Question 63 Explanation: 
 

Here σA<=100 signifies a selection query which selects all the tuples which has attribute A’s value less than or equal to 100. Attribute A’s values in the range [0,500] are uniformaly distributed among 1000 tuples. So first when we arrange all 1000 tuples in the ascending order of attribute A’s value, then first 200 tuples will have attribute A’s values in the range [0,99] and next 200 tuples will have attribute A’s values in the range [100,199] and so on .So number of tuples returned by the given selection query is 200.

This solution is contributed by Nirmal Bharadwaj.

Question 64
Consider the following two transactions : T1 and T2. 2007_66 Which of the following schemes, using shared and exclusive locks, satisfy the requirements for strict two phase locking for the above transactions? 2007_66_1 2007_66_2
A
A
B
B
C
C
D
D
Gate IT 2007    
Discuss it


Question 64 Explanation: 
  Shared locks are used for Read,exclusive locks are used for Write data. one exclusive lock can not take other exclusive lock which is already taken by other schedule as it will lead to deadlock. Requirements to follow Strict 2PL: 1. Exclusive locks should be released after the commit (Releasing exclusive lock after commit restrict the deadlock condition. i.e. we cannot get lock on item were exclusive lock already taken. 2. No Locking can be done after the first Unlock and vice versa. option (A): Incorrect because to write B,S1 needs exclusive lock on B and to write A,S2 needs exclusive Lock on A. that's why it is incorrect. option (B): Incorrect because one exclusive lock cannot take other's Exclusive Lock. here, S1 has taken exclusive lock on item A, S2 has taken exclusive lock on item B so now S1 can't take exclusive lock on item B and S2 can't take exclusive lock on item A. that's why it is incorrect. option (C): Correct as it is following all the three requirement for strict 2PL. Here,schedule S1 releases exclusive lock on B after commit and schedule S2 releases exclusive lock on A after commit.(condition 1 satisfied) option(D): incorrect as according to condition 1,Exclusive locks should be released after the commit. here,schedule S1 releases exclusive lock on B before commit and schedule S2 releases exclusive lock on A before commit. Hence it is incorrect. This solution is contributed by Nitika Bansal .
Question 65
Consider the following implications relating to functional and multivalued dependencies given below, which may or may not be correct.
i. If A ↠ B and A ↠ C then A → BC
ii. If A → B and A → C then A ↠ BC
iii. If A ↠ BC and A → B then A → C
iv. If A → BC and A → B then A ↠ C
Exactly how many of the above implications are valid?
A
0
B
1
C
2
D
3
Gate IT 2007    
Discuss it


Question 66
Consider the following relation schemas :
    • b-Schema = (b-name, b-city, assets)
    • a-Schema = (a-num, b-name, bal)
    • d-Schema = (c-name, a-number)
Let branch, account and depositor be respectively instances of the above schemas. Assume that account and depositor relations are much bigger than the branch relation. Consider the following query: Пc-nameb-city = "Agra" ⋀ bal < 0 (branch ⋈ (account ⋈ depositor) Which one of the following queries is the most efficient version of the above query ?
A
Пc-namebal < 0b-city = "Agra" branch ⋈ account) ⋈ depositor)
B
Пc-nameb-city = "Agra"branch ⋈ (σbal < 0 account ⋈ depositor))
C
Пc-nameb-city = "Agra" branch ⋈ σb-city = "Agra" ⋀ bal < 0 account) ⋈ depositor)
D
Пc-nameb-city = "Agra" ⋀ bal < 0 account ⋈ depositor))
Gate IT 2007    
Discuss it


Question 66 Explanation: 
  For better record processing, We should always do select before join to avoid unnecessary tuples being considered for join.(For an SQL query this is not strictly required as DBMS will rearrange the query to make it efficient) and processing a smaller table gives more efficiency than the larger one. option (A): П c-name (σ bal < 0 (σ b-city = "Agra" branch ⋈ account) ⋈ depositor) here we are doing join between relatively smaller table(branch) and larger one(account) and the output that this inner table gives (which is smaller in comparison to joins that we are doing in B) is used for join with depositor table with the selection condition.(same as given query). option (B): П c-name (σ b-city = "Agra" branch ⋈ (σ bal < 0 account ⋈ depositor)) here we are doing a join between two massive table account and depositor with selection condition(for balance less than zero) and the output that this inner table gives is used for join with branch table(relatively smaller table) with the selection condition (for city Agra). (same as given query) so option A and option B both are same as given query but there is difference between record processing as the record processing of option A will get reduced by some rate. (as filtered conditions are applied after the join between one smaller and one larger table which will give relatively smaller table than the join of two larger tables). So, overall option A is much better than option B. option (C): П c-name ((σ b-city = "Agra" branch ⋈ σ b-city = "Agra" depositor) Incorrect as there is no b-city column in a-Schema. option (D): П c-name (σ b-city = "Agra" branch ⋈ (σ b-city = "Agra" depositor)) Incorrect as there is no b-city column in a-Schema. ⋀ bal < 0 account) ⋈ ⋀ bal < 0 account ⋈ Note: don't miss this sentence "account and depositor relations are much bigger than the branch relation" because That makes A the best answer. This solution is contributed by Nitika Bansal.
Question 67
Consider the following clauses: i. Not inherently suitable for client authentication. ii. Not a state sensitive protocol. iii. Must be operated with more than one server. iv. Suitable for structured message organization. v. May need two ports on the serve side for proper operation. The option that has the maximum number of correct matches is
A
IMAP-(i), FTP-(ii), HTTP-(iii), DNS-(iv), POP3-(v)
B
FTP-(i), POP3-(ii), SMTP-(iii), HTTP-(iv), IMAP-(v)
C
POP3-(i), SMTP-(ii), DNS-(iii), IMAP-(iv), HTTP-(v)
D
SMTP-(i), HTTP-(ii), IMAP-(iii), DNS-(iv), FTP-(v)
Gate IT 2007    
Discuss it


Question 67 Explanation: 
FTP need to open two ports at server, 1 for control information at 21 and another for data. SMTP- Not suitable for client authentication ,SMTP AUTH an extension is provided for authentication now. HTTP- It doesn’t depend on the state of the device or OS. IMAP- It includes a central server ,hence must have more than one server DNS- Suitable for structured message organization. FTP – needs port 20 and 21 for control and data.   This solution is contributed by Shashank Shanker khare.    

Question 68
Your are given the following four bytes : 10100011            00110111            11101001            10101011 Which of the following are substrings of the base 64 encoding of the above four bytes ?
A
zdp
B
fpq
C
qwA
D
oze
Gate IT 2007    
Discuss it


Question 68 Explanation: 
refer Base 64 table
Question 69
Consider the regular expression R = (a + b)* (aa + bb) (a + b)*<br> Which of the following non-deterministic finite automata recognizes the language defined by the regular expression R? Edges labeled λ denote transitions on the empty string. 2007_71
A
A
B
B
C
C
D
D
Gate IT 2007    
Discuss it


Question 69 Explanation: 
baa is not accepted by B, so B eliminated<br> in D a is accepted that’s not there in regular expression<br> C accepts extra expressions
Question 70
Consider the regular expression R = (a + b)* (aa + bb) (a + b)* Which deterministic finite automaton accepts the language represented by the regular expression R ? 2007_72
A
A
B
B
C
C
D
D
Gate IT 2007    
Discuss it


Question 71
Consider the regular expression R = (a + b)* (aa + bb) (a + b)*<br> Which one of the regular expressions given below defines the same language as defined by the regular expression R?
A
(a(ba)* + b(ab)*)(a + b)+
B
(a(ba)* + b(ab)*)*(a + b)*
C
(a(ba)* (a + bb) + b(ab)*(b + aa))(a + b)*
D
(a(ba)* (a + bb) + b(ab)*(b + aa))(a + b)+
Gate IT 2007    
Discuss it


Question 71 Explanation: 
A accepts ab but given does not
B empty may be accepted, not in given
Question 72
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station gets the token it is allowed to send one frame of fixed size. Ring latency is tp, while the transmission time of a frame is tt. All other latencies can be neglected.
The maximum utilization of the token ring when tt =3 ms, tp = 5 ms, N = 10 is
A
0.545
B
0.6
C
0.857
D
0.961
Gate IT 2007    
Discuss it


Question 72 Explanation: 
Maximum efficiency of token ring = (tt)/(tt +( tp/n))
tt= 3 ms
tp =5 ms and n=10,
efficiency = 3/(3+.5)= .857
Question 73
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station gets the token it is allowed to send one frame of fixed size. Ring latency is tp, while the transmission time of a frame is tt. All other latencies can be neglected.
The maximum utilization of the token ring when tt = 5 ms, tp = 3 ms, N = 15 is :
A
0.545
B
0.655
C
0.9375
D
0.961
Gate IT 2007    
Discuss it


Question 73 Explanation: 
Maximum efficiency of token ring = (tt)/(tt +( tp/n)) tt= 5 ms tt =3 ms and n=15, efficiency = (5)/(5+3/15) = 5/5.2 = .961
Question 74
Consider the sequence <xn>, n>= 0 defined by the recurrence relation xn + 1 = c . xn2- 2, where c > 0. Suppose there exists a non-empty, open interval (a, b) such that for all x0 satisfying a < x0 < b, the sequence converges to a limit. The sequence converges to the value?
A
(1 + (1 + 8c)1/2)/2c
B
(1 - (1 + 8c)1/2)/2c
C
2
D
2/(2c-1)
Gate IT 2007    
Discuss it


Question 74 Explanation: 
  anil_10 This solution is contributed by Anil Saikrishna Devarasetty.
Question 75
Consider the following expression
ad' + (ac)' + bc'd
Which of the following Karnaugh Maps correctly represents the expression?
2007_78
2007_78_2
2007_78_3
2007_78_4
A
A
B
B
C
C
D
D
Gate IT 2007    
Discuss it


Question 76
Consider the following expression
ad' + (ac)' + bc'd
Which of the following expressions does not correspond to the Karnaugh Map obtained for the above expression??
A
c'd'+ ad' + abc' + (ac)'d
B
(ac)' + c'd' + ad' + abc'd
C
(ac)' + ad' + abc' + c'd
D
b'c'd' + acd' + (ac)' + abc'
Gate IT 2007    
Discuss it


Question 77
Let P1, P2,..... , Pn be n points in the xy-plane such that no three of them are collinear. For every pair of points Pi and Pj, let Lij be the line passing through them. Let Lab be the line with the steepest gradient amongst all n(n -1)/2 lines. Which one of the following properties should necessarily be satisfied ?
A
Pa and Pb are adjacent to each other with respect to their x-coordinate
B
Either Pa or Pb has the largest or the smallest y-coordinate among all the points
C
The difference between x-coordinatef Pa and Pb is minimum
D
None of the above
Gate IT 2007    
Discuss it


Question 77 Explanation: 
  anil_12 This solution is contributed by  Anil Saikrishna Devarasetty.
Question 78
Let P1,P2,…,Pn be n points in the xy-plane such that no three of them are collinear. For every pair of points Pi and Pj, let Lij be the line passing through them. Let Lab be the line with the steepest gradient among all n(n−1)/2 lines. The time complexity of the best algorithm for finding Pa and Pb is
A
Θ(n)
B
Θ(nlogn)
C
Θ(nlogsup>2n)
D
Θ(n2)
Gate IT 2007    
Discuss it


Question 79
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. The head is initially positioned at truck number 180. Which of the request sets will cause the head to change its direction after servicing every request assuming that the head does not change direction if there is a tie in SSTF and all the requests arrive before the servicing starts?
A
11, 139, 170, 178, 181, 184, 201, 265
B
10, 138, 170, 178, 181, 185, 201, 265
C
10, 139, 169, 178, 181, 184, 201, 265
D
10, 138, 170, 178, 181, 185, 200, 265
Gate IT 2007    
Discuss it


Question 79 Explanation: 
A. 180->181->184 B. 180->181->178->185->170->201->138->265->10 gat_it_2007 So, B is true
Question 80
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. The head is initially positioned at track number 180. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are 2048 and the head can start from any track?
A
9
B
10
C
11
D
12
Gate IT 2007    
Discuss it


Question 80 Explanation: 
Distance of SSTF changing – >
1 3 7 15 31 63 127 255 511 1023 2047
1 2 3 4 5 6 7 8 9 10 11
  Head is changing it's direction after servicing every request. Maximum Cardinality is thus 11  180->181->178->185->170->201->138->265->10 gat_it_2007
There are 80 questions to complete.

GATE CS Corner


See Placement Course for placement preparation, GATE Corner for GATE CS Preparation and Quiz Corner for all Quizzes on GeeksQuiz.