Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gateit-2005
0
votes
0
answers
1
GATE CS/IT - (2005) Digital Logic. (Made Easy PYQ Book - 2019 book)
Which is the following expression is equivalent to $(A \oplus B) \oplus C$ ? $(A + B + C) (\bar{A} + \bar{B} + \bar{C})$ $(A + B + C) (\bar{A} + \bar{B} + C)$ $ABC + \bar{A} (B\oplus C) + \bar{B} (A \oplus C)$ None of these.
Which is the following expression is equivalent to $(A \oplus B) \oplus C$ ?$(A + B + C) (\bar{A} + \bar{B} + \bar{C})$ $(A + B + C) (\bar{A} + \bar{B} + C)$$ABC + \bar{A...
SumitBM
336
views
SumitBM
asked
Aug 21, 2023
Digital Logic
digital-logic
gatecse-2005
gateit-2005
digital-circuits
+
–
0
votes
0
answers
2
Doubt: gate2005 2015
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
https://gateoverflow.in/3784/gate2005-it-37https://gateoverflow.in/8159/gate2015-2-35 (the second answer of this question)both these follow different diagramatic represen...
TUSHAR_BHATT
578
views
TUSHAR_BHATT
asked
Jan 10, 2019
Theory of Computation
gatecse-2015-set2
gateit-2005
self-doubt
+
–
48
votes
7
answers
3
GATE IT 2005 | Question: 85b
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 ... $(t + 100)$ is : $>100$ but finite $\infty$ $3$ $>3$ and $\leq 100$
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...
Ishrat Jahan
14.7k
views
Ishrat Jahan
asked
Nov 3, 2014
Computer Networks
gateit-2005
computer-networks
routing
normal
+
–
23
votes
4
answers
4
GATE IT 2005 | Question: 85a
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, ...
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...
Ishrat Jahan
5.2k
views
Ishrat Jahan
asked
Nov 3, 2014
Computer Networks
gateit-2005
computer-networks
routing
normal
+
–
38
votes
4
answers
5
GATE IT 2005 | Question: 84b
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 ... $(!A[i][j] \ \left | \right | A[j][i])$ $(A[i][j] \ \left | \right | \ !A[j][i])$
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 grap...
Ishrat Jahan
7.4k
views
Ishrat Jahan
asked
Nov 3, 2014
Algorithms
gateit-2005
algorithms
graph-algorithms
normal
+
–
40
votes
1
answer
6
GATE IT 2005 | Question: 84a
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 ... $E_1:\ !A[i][j]$ and $E_2 : i = j$; $E_1 : A[i][j]$ and $E_2 : i = j + 1$;
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 grap...
Ishrat Jahan
9.2k
views
Ishrat Jahan
asked
Nov 3, 2014
Algorithms
gateit-2005
algorithms
graph-algorithms
normal
+
–
37
votes
4
answers
7
GATE IT 2005 | Question: 83b
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$
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, (,+,),*\}...
Ishrat Jahan
6.8k
views
Ishrat Jahan
asked
Nov 3, 2014
Compiler Design
gateit-2005
compiler-design
parsing
normal
+
–
36
votes
2
answers
8
GATE IT 2005 | Question: 83a
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 ... $id + (id* (id * id))$ $(id* (id * id)) + id$ $((id * id + id) * id)$
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, (,+,),*\...
Ishrat Jahan
6.4k
views
Ishrat Jahan
asked
Nov 3, 2014
Compiler Design
gateit-2005
compiler-design
grammar
parsing
easy
+
–
48
votes
4
answers
9
GATE IT 2005 | Question: 82b
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 ... outer loop, the reduction in number of block accesses required for reading the data will be $0$ $30400$ $38400$ $798400$
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 ...
Ishrat Jahan
16.2k
views
Ishrat Jahan
asked
Nov 3, 2014
Databases
gateit-2005
databases
normal
joins
+
–
51
votes
3
answers
10
GATE IT 2005 | Question: 82a
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 ... to be used in outer loop, the number of block accesses required for reading the data are $800000$ $40080$ $32020$ $100$
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 ...
Ishrat Jahan
8.6k
views
Ishrat Jahan
asked
Nov 3, 2014
Databases
gateit-2005
databases
normal
joins
+
–
69
votes
5
answers
11
GATE IT 2005 | Question: 81-b
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 ... starting from the sector $4$ of the outer-most track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$
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 $...
Ishrat Jahan
13.7k
views
Ishrat Jahan
asked
Nov 3, 2014
Operating System
gateit-2005
operating-system
disk
normal
+
–
45
votes
3
answers
12
GATE IT 2005 | Question: 81-a
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 ... . $80 \ \text{MB}$; II. $360 \ \text{MB}$ I. $360 \ \text{MB}$; II. $80 \ \text{MB}$
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 $...
Ishrat Jahan
11.9k
views
Ishrat Jahan
asked
Nov 3, 2014
Operating System
gateit-2005
operating-system
disk
normal
+
–
1
votes
3
answers
13
GATE IT 2005 | Question: 80
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> </ ... ; <!ELEMENT type EMPTY> <!ATTLIST type value (BROCHURE/FICTION/TECHNICAL)> <!ELEMENT accno (#PCDATA)>
Given below is an excerpt of an xml specification. <!DOCTYPE library SYSTEM "library.dtd" <Book <title GATE 2005 </title <type value = "BROCHURE"/ <accno>10237623786</acc...
Ishrat Jahan
1.4k
views
Ishrat Jahan
asked
Nov 3, 2014
Web Technologies
gateit-2005
web-technologies
xml
normal
+
–
27
votes
3
answers
14
GATE IT 2005 | Question: 79
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$
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 ...
Ishrat Jahan
6.9k
views
Ishrat Jahan
asked
Nov 3, 2014
Computer Networks
gateit-2005
computer-networks
network-security
normal
out-of-gate-syllabus
+
–
27
votes
3
answers
15
GATE IT 2005 | Question: 78
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$
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$...
Ishrat Jahan
19.3k
views
Ishrat Jahan
asked
Nov 3, 2014
Computer Networks
gateit-2005
computer-networks
crc-polynomial
normal
+
–
50
votes
4
answers
16
GATE IT 2005 | Question: 77
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 ... -addr.arpa domains Directly query a NS for $145.$in-addr.arpa and then a NS for $128.145.$in-addr.arpa domains
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...
Ishrat Jahan
10.0k
views
Ishrat Jahan
asked
Nov 3, 2014
Computer Networks
gateit-2005
computer-networks
normal
application-layer-protocols
+
–
41
votes
6
answers
17
GATE IT 2005 | Question: 76
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$ ... $204.204.204.128/255.255.255.128$ $204.204.204.64/255.255.255.192$ $204.204.204.0/255.255.255.192$
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 followi...
Ishrat Jahan
15.1k
views
Ishrat Jahan
asked
Nov 3, 2014
Computer Networks
gateit-2005
computer-networks
subnetting
normal
+
–
57
votes
4
answers
18
GATE IT 2005 | Question: 75
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}$ ... in the LAN so that the throughput of each station can be $2/3$ $\text{Mbps}$ is $3$ $5$ $10$ $20$
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 transmi...
Ishrat Jahan
14.0k
views
Ishrat Jahan
asked
Nov 3, 2014
Computer Networks
gateit-2005
computer-networks
mac-protocol
normal
+
–
37
votes
4
answers
19
GATE IT 2005 | Question: 74
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$ respectively. The probability that the packet will be received without ... $[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)$
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 ...
Ishrat Jahan
8.8k
views
Ishrat Jahan
asked
Nov 3, 2014
Computer Networks
gateit-2005
computer-networks
error-detection
probability
normal
+
–
69
votes
10
answers
20
GATE IT 2005 | Question: 73
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 ... LastByteAcked = $8192$. The current window size at the sender is: $2048$ bytes $4096$ bytes $6144$ bytes $8192$ bytes
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 ...
Ishrat Jahan
25.9k
views
Ishrat Jahan
asked
Nov 3, 2014
Computer Networks
gateit-2005
computer-networks
congestion-control
normal
+
–
22
votes
3
answers
21
GATE IT 2005 | Question: 72
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}$
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 fr...
Ishrat Jahan
11.5k
views
Ishrat Jahan
asked
Nov 3, 2014
Computer Networks
gateit-2005
computer-networks
stop-and-wait
normal
+
–
29
votes
2
answers
22
GATE IT 2005 | Question: 71
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}$
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 1...
Ishrat Jahan
14.1k
views
Ishrat Jahan
asked
Nov 3, 2014
Computer Networks
gateit-2005
computer-networks
congestion-control
csma-cd
normal
+
–
23
votes
1
answer
23
GATE IT 2005 | Question: 70
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$
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$...
Ishrat Jahan
9.4k
views
Ishrat Jahan
asked
Nov 3, 2014
Databases
gateit-2005
databases
database-normalization
normal
+
–
55
votes
7
answers
24
GATE IT 2005 | Question: 69
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 ... who do not supply any item supply exactly one item supply one or more items supply two or more items
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 ta...
Ishrat Jahan
14.1k
views
Ishrat Jahan
asked
Nov 3, 2014
Databases
gateit-2005
databases
sql
normal
+
–
54
votes
4
answers
25
GATE IT 2005 | Question: 68
A table 'student' with schema (roll, name, hostel, marks), and another table 'hobby' with schema (roll, hobbyname) contains records as shown below: ... between the number of rows output by the SQL statement and the number of tuples in $S'$ is $6$ $4$ $2$ $0$
A table 'student' with schema (roll, name, hostel, marks), and another table 'hobby' with schema (roll, hobbyname) contains records as shown below:$$\overset{\text{Table:...
Ishrat Jahan
10.6k
views
Ishrat Jahan
asked
Nov 3, 2014
Databases
gateit-2005
databases
sql
relational-algebra
normal
+
–
41
votes
1
answer
26
GATE IT 2005 | Question: 67
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, ... running concurrently throughout Execute T3 followed by T2; T1 running concurrently throughout Execute T3 followed by T2 followed by T1
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...
Ishrat Jahan
7.9k
views
Ishrat Jahan
asked
Nov 3, 2014
Databases
gateit-2005
databases
transaction-and-concurrency
normal
+
–
19
votes
2
answers
27
GATE IT 2005 | Question: 66
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 ... $T_c$ invokes $p_2.$ $p_2$ invokes $p_1,$ and then invokes $p_3,$ or $p_4,$ or $p_5$
In a data flow diagram, the segment shown below is identified as having transaction flow characteristics, with $p_2$ identified as the transaction centerA first level arc...
Ishrat Jahan
4.6k
views
Ishrat Jahan
asked
Nov 3, 2014
IS&Software Engineering
gateit-2005
data-flow-diagram
normal
non-gate
+
–
4
votes
2
answers
28
GATE IT 2005 | Question: 65
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$
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 cycl...
Ishrat Jahan
2.8k
views
Ishrat Jahan
asked
Nov 3, 2014
IS&Software Engineering
gateit-2005
is&software-engineering
cyclomatic-complexity
normal
+
–
3
votes
3
answers
29
GATE IT 2005 | Question: 64
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 ... (MTTR) increased by 5 days. What is the MTBF of the enhanced software? 205 days 300 days 500 days 700 days
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 t...
Ishrat Jahan
4.9k
views
Ishrat Jahan
asked
Nov 3, 2014
IS&Software Engineering
gateit-2005
is&software-engineering
software-testing
normal
+
–
30
votes
1
answer
30
GATE IT 2005 | Question: 63
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 ... blocks respectively? $35400$ and $35800$ bytes $35800$ and $35400$ bytes $35600$ and $35400$ bytes $35400$ and $35600$ bytes
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...
Ishrat Jahan
6.3k
views
Ishrat Jahan
asked
Nov 3, 2014
Operating System
gateit-2005
operating-system
disk
normal
+
–
Page:
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register