search
Log In
GATE information Technology (IT) 2005 questions

Recent questions tagged gate2005-it

0 votes
0 answers
1
https://gateoverflow.in/3784/gate2005-it-37 https://gateoverflow.in/8159/gate2015-2-35 (the second answer of this question) both these follow different diagramatic representations how should one go about making these diagrams
asked Jan 11, 2019 in Theory of Computation TUSHAR_BHATT 142 views
40 votes
7 answers
2
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the routing table is empty. ... to node $A$ at time $(t + 100)$ is : $>100$ but finite $\infty$ $3$ $>3$ and $\leq 100$
asked Nov 4, 2014 in Computer Networks Ishrat Jahan 6.9k views
22 votes
5 answers
3
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to relay a packet to its destination and the cost of the path to the destination through that router. Initially, the routing table is empty. ...
asked Nov 4, 2014 in Computer Networks Ishrat Jahan 2.5k views
28 votes
4 answers
4
A sink in a directed graph is a vertex i such that there is an edge from every vertex $j \neq i$ to $i$ and there is no edge from $i$ to any other vertex. A directed graph $G$ with $n$ vertices is represented by its adjacency matrix $A$, where $A[i] [j] = 1$ if there is an edge directed from vertex $i$ to ... $(!A[i][j] \ \left | \right | A[j][i])$ $(A[i][j] \ \left | \right | \ !A[j][i])$
asked Nov 4, 2014 in Algorithms Ishrat Jahan 3.5k views
30 votes
1 answer
5
A sink in a directed graph is a vertex i such that there is an edge from every vertex $j \neq i$ to $i$ and there is no edge from $i$ to any other vertex. A directed graph $G$ with $n$ vertices is represented by its adjacency matrix $A$, where $A[i] [j] = 1$ if there is an edge directed from vertex $i$ to ... $E_1:\ !A[i][j]$ and $E_2 : i = j$; $E_1 : A[i][j]$ and $E_2 : i = j + 1$;
asked Nov 4, 2014 in Algorithms Ishrat Jahan 4.2k views
28 votes
4 answers
6
Consider the context-free grammar $E\rightarrow E+E$ $E\rightarrow (E *E)$ $E\rightarrow \text{id}$ where $E$ is the starting symbol, the set of terminals is $\{id, (,+,),*\}$, and the set of non-terminals is $\{E\}$. For the terminal string $id + id + id + id$, how many parse trees are possible? $5$ $4$ $3$ $2$
asked Nov 4, 2014 in Compiler Design Ishrat Jahan 2.5k views
26 votes
2 answers
7
Consider the context-free grammar $E \rightarrow E + E$ $E \rightarrow (E * E)$ $E \rightarrow id$ where $E$ is the starting symbol, the set of terminals is $\{id, (,+,),*\}$, and the set of nonterminals is $\{E\}$. Which of the following terminal strings has more than one parse tree when parsed according to ... $id + (id* (id * id))$ $(id* (id * id)) + id$ $((id * id + id) * id)$
asked Nov 4, 2014 in Compiler Design Ishrat Jahan 2.3k views
36 votes
3 answers
8
A database table $T_1$ has $2000$ records and occupies $80$ disk blocks. Another table $T_2$ has $400$ records and occupies $20$ disk blocks. These two tables have to be joined as per a specified join condition that needs to be evaluated for every pair of records ... in the outer loop, the reduction in number of block accesses required for reading the data will be $0$ $30400$ $38400$ $798400$
asked Nov 4, 2014 in Databases Ishrat Jahan 5.9k views
40 votes
3 answers
9
A database table $T_1$ has $2000$ records and occupies $80$ disk blocks. Another table $T_2$ has $400$ records and occupies $20$ disk blocks. These two tables have to be joined as per a specified join condition that needs to be evaluated for every pair of records from ... table to be used in outer loop, the number of block accesses required for reading the data are $800000$ $40080$ $32020$ $100$
asked Nov 4, 2014 in Databases Ishrat Jahan 3.5k views
51 votes
4 answers
10
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector of the inner- ... contiguous data starting from the sector $4$ of the outer-most track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$
asked Nov 4, 2014 in Operating System Ishrat Jahan 5.6k views
33 votes
3 answers
11
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. What is the total amount of data that can be stored on the disk if it is used with a drive that rotates it with Constant Linear ... $80 \ \text{MB}$; II. $360 \ \text{MB}$ I. $360 \ \text{MB}$; II. $80 \ \text{MB}$
asked Nov 4, 2014 in Operating System Ishrat Jahan 5.5k views
1 vote
3 answers
12
Given below is an excerpt of an xml specification. <!DOCTYPE library SYSTEM "library.dtd"> <Book> <title> GATE 2005 </title> <type value = "BROCHURE"/> <accno>10237623786</accno> </Book> <Book> <type value = "FICTION"/> <accno>0024154807</accno> </Book> ... type, accno)> <!ELEMENT title (#PCDATA)> <!ELEMENT type EMPTY> <!ATTLIST type value (BROCHURE/FICTION/TECHNICAL)> <!ELEMENT accno (#PCDATA)>
asked Nov 4, 2014 in Web Technologies Ishrat Jahan 578 views
27 votes
3 answers
13
Suppose that two parties $A$ and $B$ wish to setup a common secret key (D-H key) between themselves using the Diffie-Hellman key exchange technique. They agree on $7$ as the modulus and $3$ as the primitive root. Party $A$ chooses $2$ and party $B$ chooses $5$ as their respective secrets. Their D-H key is $3$ $4$ $5$ $6$
asked Nov 4, 2014 in Computer Networks Ishrat Jahan 3.2k views
25 votes
4 answers
14
Consider the following message $M = 1010001101$. The cyclic redundancy check (CRC) for this message using the divisor polynomial $x^5+x^4+x^2+1$ is : $01110$ $01011$ $10101$ $10110$
asked Nov 4, 2014 in Computer Networks Ishrat Jahan 4.3k views
37 votes
4 answers
15
Assume that "host1.mydomain.dom" has an IP address of $145.128.16.8$. Which of the following options would be most appropriate as a subsequence of steps in performing the reverse lookup of $145.128.16.8$ ? In the following options "NS" is an abbreviation of "nameserver". ... NS for 128.145.in-addr.arpa domains Directly query a NS for 145.in-addr.arpa and then a NS for 128.145.in-addr.arpa domains
asked Nov 4, 2014 in Computer Networks Ishrat Jahan 4.1k views
26 votes
6 answers
16
A company has a class $C$ network address of $204.204.204.0$. It wishes to have three subnets, one with $100$ hosts and two with $50$ hosts each. Which one of the following options represents a feasible set of subnet address/subnet mask pairs? $204.204.204.128/255.255.255.192$ ... $204.204.204.128/255.255.255.128$ $204.204.204.64/255.255.255.192$ $204.204.204.0/255.255.255.192$
asked Nov 4, 2014 in Computer Networks Ishrat Jahan 6k views
43 votes
4 answers
17
In a TDM medium access control bus LAN, each station is assigned one time slot per cycle for transmission. Assume that the length of each time slot is the time to transmit $100$ $\text{bits}$plus the end-to-end propagation delay. Assume a propagation speed of $2 \times 10^8 m/sec$. The ... be allowed in the LAN so that the throughput of each station can be $2/3$ $\text{Mbps}$is $3$ $5$ $10$ $20$
asked Nov 4, 2014 in Computer Networks Ishrat Jahan 6.7k views
23 votes
4 answers
18
In a communication network, a packet of length $L$ bits takes link $L_1$ with a probability of $p_1$ or link $L_2$ with a probability of $p_2$. Link $L_1$ and $L_2$ have bit error probability of $b_1$ and $b_2$ ... $[1 - (b_1 + b_2)^L]p_1p_2$ $(1 - b_1)^L (1 - b_2)^Lp_1p_2$ $1 - (b_1^Lp_1 + b_2^Lp_2)$
asked Nov 4, 2014 in Computer Networks Ishrat Jahan 3.5k views
56 votes
9 answers
19
On a TCP connection, current congestion window size is Congestion Window = $4$ KB. The window size advertised by the receiver is Advertise Window = $6$ KB. The last byte sent by the sender is LastByteSent = $10240$ and the last byte acknowledged by the receiver is LastByteAcked = $8192$. The current window size at the sender is: $2048$ bytes $4096$ bytes $6144$ bytes $8192$ bytes
asked Nov 4, 2014 in Computer Networks Ishrat Jahan 11.7k views
19 votes
3 answers
20
A channel has a bit rate of $4$ $kbps$ and one-way propagation delay of $20$ $ms$. The channel uses stop and wait protocol. The transmission time of the acknowledgment frame is negligible. To get a channel efficiency of at least $50$\text{%}$, the minimum frame size should be $80$ $\text{bytes}$ $80$ $\text{bits}$ $160$ $\text{bytes}$ $160$ $\text{bits}$
asked Nov 4, 2014 in Computer Networks Ishrat Jahan 4.7k views
19 votes
2 answers
21
A network with CSMA/CD protocol in the MAC layer is running at $1 \text{Gbps}$ over a $1 \text{km}$ cable with no repeaters. The signal speed in the cable is $2 \times 10^{8}\text{m/sec}$. The minimum frame size for this network should be: $10000 \text{bits}$ $10000 \text{bytes}$ $5000\text{ bits}$ $5000 \text{bytes}$
asked Nov 4, 2014 in Computer Networks Ishrat Jahan 4.1k views
16 votes
1 answer
22
In a schema with attributes $A, B, C, D$ and $E$ following set of functional dependencies are given $A \rightarrow B$ $A \rightarrow C$ $CD \rightarrow E$ $B \rightarrow D$ $E \rightarrow A$ Which of the following functional dependencies is NOT implied by the above set? $CD \rightarrow AC$ $BD \rightarrow CD$ $BC \rightarrow CD$ $AC \rightarrow BC$
asked Nov 4, 2014 in Databases Ishrat Jahan 3.5k views
37 votes
6 answers
23
In an inventory management system implemented at a trading corporation, there are several tables designed to hold all the information. Amongst these, the following two tables hold information on which items are supplied by which suppliers, and which warehouse keeps which items ... all suppliers who do not supply any item supply exactly one item supply one or more items supply two or more items
asked Nov 4, 2014 in Databases Ishrat Jahan 5.1k views
39 votes
4 answers
24
30 votes
1 answer
25
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 ... ; T1 running concurrently throughout Execute T3 followed by T2; T1 running concurrently throughout Execute T3 followed by T2 followed by T1
asked Nov 4, 2014 in Databases Ishrat Jahan 2.3k views
19 votes
2 answers
26
In a data flow diagram, the segment shown below is identified as having transaction flow characteristics, with $p_2$ identified as the transaction center A first level architectural design of this segment will result in a set of process modules with an associated invocation sequence. The most ... This module $T_c$ invokes $p_2.$ $p_2$ invokes $p_1,$ and then invokes $p_3,$ or $p_4,$ or $p_5$
asked Nov 4, 2014 in IS&Software Engineering Ishrat Jahan 2.3k views
2 votes
2 answers
27
Tb carry out white box testing of a program, its flow chart representation is obtained as shown in the figure below: For basis path based testing of this program, its cyclomatic complexity is 5 4 3 2
asked Nov 4, 2014 in IS&Software Engineering Ishrat Jahan 713 views
3 votes
1 answer
28
The availability of a complex software is 90%. Its Mean Time Between Failure (MTBF) is 200 days. Because of the critical nature of the usage, the organization deploying the software further enhanced it to obtain an availability of 95%. In the process, the Mean Time To Repair (MTTR) increased by 5 days. What is the MTBF of the enhanced software? 205 days 300 days 500 days 700 days
asked Nov 4, 2014 in IS&Software Engineering Ishrat Jahan 1.1k views
24 votes
1 answer
29
In a computer system, four files of size $11050$ bytes, $4990$ bytes, $5170$ bytes and $12640$ bytes need to be stored. For storing these files on disk, we can use either $100$ byte disk blocks or $200$ byte disk blocks (but can't mix block sizes). For each ... $35400$ and $35800$ bytes $35800$ and $35400$ bytes $35600$ and $35400$ bytes $35400$ and $35600$ bytes
asked Nov 4, 2014 in Operating System Ishrat Jahan 2.7k views
30 votes
3 answers
30
Two shared resources $R_1$ and $R_2$ are used by processes $P_1$ and $P_2$. Each process has a certain priority for accessing each resource. Let $T_{ij}$ denote the priority of $P_i$ for accessing $R_j$. A process $P_i$ can snatch a resource $R_k$ from process $P_j$ ... conditions ensures that $P_1$ and $P_2$ can never deadlock? (I) and (IV) (II) and (III) (I) and (II) None of the above
asked Nov 4, 2014 in Operating System Ishrat Jahan 3.5k views
...