Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gateit-2006
74
votes
10
answers
1
GATE IT 2006 | Question: 85
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored in ascending order of these primary keys as given in the tables. No indexing is available in the database. ... key, then $n$ lies in the range: $36 - 40$ $44 - 48$ $60 - 64$ $100 - 104$
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored ...
Ishrat Jahan
22.2k
views
Ishrat Jahan
asked
Nov 1, 2014
Databases
gateit-2006
databases
sql
normal
+
–
22
votes
4
answers
2
GATE IT 2006 | Question: 84
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored in ascending order of these primary keys as given in the tables. No indexing ... = C.cid and C.colour = 'green' ) Karthikeyan, Boris Sachin, Salman Karthikeyan, Boris, Sachin Schumacher, Senna
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored ...
Ishrat Jahan
4.2k
views
Ishrat Jahan
asked
Nov 1, 2014
Databases
gateit-2006
databases
sql
normal
+
–
2
votes
2
answers
3
GATE IT 2006 | Question: 83
A software project has four phases P1, P2, P3 and P4. Of these phases, P1 Is the first one and needs to be completed before any other phase can commence. Phases P2 and P3 can be executed in parallel. Phase P4 cannot commence until both P2 and P3 ... be spent on crashing so that ALL paths are critical are, respectively. 100 and 1000 100 and 1200 150 and 1200 200 and 2000
A software project has four phases P1, P2, P3 and P4. Of these phases, P1 Is the first one and needs to be completed before any other phase can commence. Phases P2 and P3...
Ishrat Jahan
1.7k
views
Ishrat Jahan
asked
Nov 1, 2014
IS&Software Engineering
gateit-2006
is&software-engineering
project-cost
normal
non-gate
+
–
2
votes
2
answers
4
GATE IT 2006 | Question: 82
A software project has four phases P1, P2, P3 and P4. Of these phases, P1 Is the first one and needs to be completed before any other phase can commence. Phases P2 and P3 can be executed in parallel. Phase P4 cannot commence until both P2 and P3 are completed. The ... slack of P2 are, respectively, P1-P2-P4, 1 day P1-P3-P4, 1 day P1-P3-P4, 2 days P1-P2-P4, 2 days
A software project has four phases P1, P2, P3 and P4. Of these phases, P1 Is the first one and needs to be completed before any other phase can commence. Phases P2 and P3...
Ishrat Jahan
1.4k
views
Ishrat Jahan
asked
Nov 1, 2014
IS&Software Engineering
gateit-2006
is&software-engineering
normal
non-gate
+
–
41
votes
4
answers
5
GATE IT 2006 | Question: 81
Let $L$ be a regular language. Consider the constructions on $L$ below: $\text{repeat} (L) = \{ww \mid w \in L\}$ $\text{prefix} (L) = \{u \mid \exists v : uv \in L\}$ $\text{suffix} (L) = \{v \mid \exists u: uv \in L\}$ ... is best suited to support your answer above? $(a + b)^*$ $\{\epsilon, a, ab, bab\}$ $(ab)^*$ $\{a^nb^n \mid n \geq 0\}$
Let $L$ be a regular language. Consider the constructions on $L$ below:$\text{repeat} (L) = \{ww \mid w \in L\}$$\text{prefix} (L) = \{u \mid \exists v : uv \in L\}$$\tex...
Ishrat Jahan
11.1k
views
Ishrat Jahan
asked
Nov 1, 2014
Theory of Computation
gateit-2006
theory-of-computation
normal
regular-language
+
–
31
votes
2
answers
6
GATE IT 2006 | Question: 80
Let $L$ be a regular language. Consider the constructions on $L$ below: repeat $(L) = \{ww \mid w \in L\}$ prefix $(L) = \{u \mid ∃v : uv \in L\}$ suffix $(L) = \{v \mid ∃u : uv \in L\}$ half $(L) = \{u \mid ∃v : | v | = | u | \text{ and } uv \in L\}$ Which of the constructions could lead to a non-regular language? Both I and IV Only I Only IV Both II and III
Let $L$ be a regular language. Consider the constructions on $L$ below:repeat $(L) = \{ww \mid w \in L\}$prefix $(L) = \{u \mid ∃v : uv \in L\}$suffix $(L) = \{v \mid...
Ishrat Jahan
9.3k
views
Ishrat Jahan
asked
Nov 1, 2014
Theory of Computation
gateit-2006
theory-of-computation
normal
regular-language
+
–
45
votes
5
answers
7
GATE IT 2006 | Question: 79
A pipelined processor uses a 4-stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The arithmetic operations as well as the load and store operations are carried out in the EX ... is used. The number of clock cycles required to complete the sequence of instructions is $10$ $12$ $14$ $16$
A pipelined processor uses a 4-stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The...
Ishrat Jahan
17.2k
views
Ishrat Jahan
asked
Nov 1, 2014
CO and Architecture
gateit-2006
co-and-architecture
pipelining
normal
+
–
46
votes
2
answers
8
GATE IT 2006 | Question: 78
A pipelined processor uses a $4-$stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The arithmetic operations as well as the load and store operations are carried out in the EX stage. The sequence of ... sequence of instructions are, respectively, $2, 2, 4$ $3, 2, 3$ $4, 2, 2$ $3, 3, 2$
A pipelined processor uses a $4-$stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). T...
Ishrat Jahan
15.3k
views
Ishrat Jahan
asked
Nov 1, 2014
CO and Architecture
gateit-2006
co-and-architecture
pipelining
normal
+
–
1
votes
1
answer
9
GATE IT 2006 | Question: 77
$x + y/2 = 9$ $3x + y = 10$ What can be said about the Gauss-Siedel iterative method for solving the above set of linear equations? it will converge It will diverse It will neither converge nor diverse It is not applicable
$x + y/2 = 9$$3x + y = 10$What can be said about the Gauss-Siedel iterative method for solving the above set of linear equations?it will convergeIt will diverseIt will...
Ishrat Jahan
1.6k
views
Ishrat Jahan
asked
Nov 1, 2014
Linear Algebra
gateit-2006
linear-algebra
normal
numerical-methods
non-gate
+
–
1
votes
1
answer
10
GATE IT 2006 | Question: 76
x + y/2 = 9 3x + y = 10 The value of the Frobenius norm for the above system of equations is $0.5$ $0.75$ $1.5$ $2.0$
x + y/2 = 93x + y = 10The value of the Frobenius norm for the above system of equations is$0.5$$0.75$$1.5$$2.0$
Ishrat Jahan
1.5k
views
Ishrat Jahan
asked
Nov 1, 2014
Linear Algebra
gateit-2006
linear-algebra
normal
numerical-methods
non-gate
+
–
0
votes
2
answers
11
GATE IT 2006 | Question: 75
void swap(float* A1, float* A2) { float temp; if (*A1 = = *A2) return; temp = *A1; *A1 = *A2; *A2 = temp; return; } The program effort for the above module using Halstead's method is 315 330 393 403
void swap(float* A1, float* A2) { float temp; if (*A1 = = *A2) return; temp = *A1; *A1 = *A2; *A2 = temp; return; }The program effort for the above module using Halstead'...
Ishrat Jahan
1.1k
views
Ishrat Jahan
asked
Nov 1, 2014
Others
gateit-2006
is&software-engineering
halsteads-method
normal
non-gate
+
–
0
votes
1
answer
12
GATE IT 2006 | Question: 74
void swap(float* A1, float* A2) { float temp; if (*A1 = = *A2) return; temp = *A1; *A1 = *A2; *A2 = temp; return; } The program volume for the above module using Halstead's method is 60 63 66 69
void swap(float* A1, float* A2) { float temp; if (*A1 = = *A2) return; temp = *A1; *A1 = *A2; *A2 = temp; return; }The program volume for the above module using Halstead'...
Ishrat Jahan
1.3k
views
Ishrat Jahan
asked
Nov 1, 2014
IS&Software Engineering
gateit-2006
is&software-engineering
code-complexity
halsteads-method
normal
non-gate
+
–
44
votes
3
answers
13
GATE IT 2006 | Question: 73
An array $X$ of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. If the root node is at level $0$, the level of element $X[i]$, $i \neq 0$, is $\left \lfloor \log _2 i \right \rfloor$ ... $\left \lfloor \log _2 (i+1) \right \rfloor$ $\left \lceil \log _2 i \right \rceil$
An array $X$ of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. If the root node is at level $0$, the le...
Ishrat Jahan
8.9k
views
Ishrat Jahan
asked
Nov 1, 2014
DS
gateit-2006
data-structures
binary-tree
normal
+
–
37
votes
3
answers
14
GATE IT 2006 | Question: 72
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. If only the root node does not satisfy the heap property, the algorithm to convert the complete binary tree into a heap has the best asymptotic time complexity of $O (n)$ $O (\log n)$ $O (n \log n)$ $O (n \log \log n)$
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. If only the root node does not satisfy...
Ishrat Jahan
7.4k
views
Ishrat Jahan
asked
Nov 1, 2014
DS
gateit-2006
data-structures
binary-heap
easy
+
–
44
votes
5
answers
15
GATE IT 2006 | Question: 71
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. The index of the parent of element $X[i], i \neq 0$, is? $\left \lfloor \dfrac i 2 \right \rfloor$ $\left \lceil \dfrac{i-1}{2} \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil$ $\left \lceil \dfrac i 2 \right \rceil - 1$
An array $X$ of $n$ distinct integers is interpreted as a complete binary tree. The index of the first element of the array is $0$. The index of the parent of element $X[...
Ishrat Jahan
13.5k
views
Ishrat Jahan
asked
Nov 1, 2014
DS
gateit-2006
data-structures
binary-tree
normal
+
–
53
votes
5
answers
16
GATE IT 2006 | Question: 70
A subnetted Class $B$ network has the following broadcast address: $144.16.95.255$ Its subnet mask is necessarily $255.255.224.0$ is necessarily $255.255.240.0$ is necessarily $255.255.248.0$ could be any one of $255.255.224.0$, $255.255.240.0$,$255.255.248.0$
A subnetted Class $B$ network has the following broadcast address: $144.16.95.255$Its subnet maskis necessarily $255.255.224.0$is necessarily $255.255.240.0$is necessaril...
Ishrat Jahan
11.6k
views
Ishrat Jahan
asked
Nov 1, 2014
Computer Networks
gateit-2006
computer-networks
subnetting
normal
+
–
41
votes
9
answers
17
GATE IT 2006 | Question: 69
A program on machine $X$ attempts to open a $UDP$ connection to port $5376$ on a machine $Y$, and a $TCP$ connection to port $8632$ on machine $Z$. However, there are no applications listening at the corresponding ports on $Y$ and $Z$. An $ICMP$ Port Unreachable error will be generated by $Y$ but not $Z$ $Z$ but not $Y$ Neither $Y$ nor $Z$ Both $Y$ and $Z$
A program on machine $X$ attempts to open a $UDP$ connection to port $5376$ on a machine $Y$, and a $TCP$ connection to port $8632$ on machine $Z$. However, there are no ...
Ishrat Jahan
14.0k
views
Ishrat Jahan
asked
Nov 1, 2014
Computer Networks
gateit-2006
computer-networks
tcp
udp
normal
+
–
43
votes
8
answers
18
GATE IT 2006 | Question: 68
On a wireless link, the probability of packet error is $0.2$. A stop-and-wait protocol is used to transfer data across the link. The channel condition is assumed to be independent of transmission to transmission. What is the average number of transmission attempts required to transfer $100$ packets? $100$ $125$ $150$ $200$
On a wireless link, the probability of packet error is $0.2$. A stop-and-wait protocol is used to transfer data across the link. The channel condition is assumed to be in...
Ishrat Jahan
13.2k
views
Ishrat Jahan
asked
Nov 1, 2014
Computer Networks
gateit-2006
computer-networks
sliding-window
stop-and-wait
normal
+
–
49
votes
7
answers
19
GATE IT 2006 | Question: 67
A link of capacity $100$ $\text{Mbps}$ is carrying traffic from a number of sources. Each source generates an on-off traffic stream; when the source is on, the rate of traffic is $10$ $\text{Mbps}$, and when the source is off, the rate of traffic is zero. The duty cycle, which ... $\text{and}$ $30$ $12$ $\text{and}$ $25$ $5$ $\text{and}$ $33$ $15$ $\text{and}$ $22$
A link of capacity $100$ $\text{Mbps}$ is carrying traffic from a number of sources. Each source generates an on-off traffic stream; when the source is on, the rate of tr...
Ishrat Jahan
11.1k
views
Ishrat Jahan
asked
Nov 1, 2014
Computer Networks
gateit-2006
computer-networks
network-flow
normal
+
–
71
votes
7
answers
20
GATE IT 2006 | Question: 66
A router has two full-duplex Ethernet interfaces each operating at $100$ $\text{Mb/s}$. Ethernet frames are at least $84$ $\text{bytes}$ long (including the Preamble and the Inter-Packet-Gap). The maximum packet processing time at the router for wirespeed forwarding to be possible is (in microseconds) $0.01$ $3.36$ $6.72$ $8$
A router has two full-duplex Ethernet interfaces each operating at $100$ $\text{Mb/s}$. Ethernet frames are at least $84$ $\text{bytes}$ long (including the Preamble and ...
Ishrat Jahan
21.1k
views
Ishrat Jahan
asked
Nov 1, 2014
Computer Networks
gateit-2006
computer-networks
lan-technologies
ethernet
normal
+
–
35
votes
6
answers
21
GATE IT 2006 | Question: 65
In the $\text{4B/5B}$ encoding scheme, every $4$ bits of data are encoded in a $5$-bit codeword. It is required that the codewords have at most $1$ leading and at most $1$ trailing zero. How many are such codewords possible? $14$ $16$ $18$ $20$
In the $\text{4B/5B}$ encoding scheme, every $4$ bits of data are encoded in a $5$-bit codeword. It is required that the codewords have at most $1$ leading and at most $1...
Ishrat Jahan
10.0k
views
Ishrat Jahan
asked
Nov 1, 2014
Computer Networks
gateit-2006
computer-networks
encoding
combinatory
normal
out-of-gate-syllabus
+
–
60
votes
5
answers
22
GATE IT 2006 | Question: 64
Suppose that it takes $1$ unit of time to transmit a packet (of fixed size) on a communication link. The link layer uses a window flow control protocol with a window size of $N$ packets. Each packet causes an ack or a nak to be generated by the receiver, and ack/nak transmission times are ... $1- \dfrac{ N}{i}$ $\dfrac{i}{(N + i)}$ $1$ $1 - e^{\left(\frac{i}{N}\right)}$
Suppose that it takes $1$ unit of time to transmit a packet (of fixed size) on a communication link. The link layer uses a window flow control protocol with a window size...
Ishrat Jahan
12.8k
views
Ishrat Jahan
asked
Nov 1, 2014
Computer Networks
gateit-2006
computer-networks
sliding-window
normal
+
–
35
votes
7
answers
23
GATE IT 2006 | Question: 63, ISRO2015-57
A router uses the following routing table: \begin{array}{|l|l|l|} \hline \textbf {Destination} & \textbf { Mask} & \textbf{Interface} \\\hline \text {144.16.0.0} & \text{255.255.0.0} & \text{eth$0$} \\\hline\text { ... address $144.16.68.117$ arrives at the router. On which interface will it be forwarded? eth$0$ eth$1$ eth$2$ eth$3$
A router uses the following routing table:\begin{array}{|l|l|l|} \hline \textbf {Destination} & \textbf { Mask} & \textbf{Interface} \\\hline \text {144.16.0.0} & \text...
Ishrat Jahan
37.6k
views
Ishrat Jahan
asked
Nov 1, 2014
Computer Networks
gateit-2006
computer-networks
subnetting
normal
isro2015
+
–
0
votes
0
answers
24
GATE IT 2006 | Question: 62
Consider the following XML DTD describing course information in a university: <!ELEMENT Univ (Course+, Prof+)> <!ELEMENT Course (Title, Eval*)> <!ATTLIST Course Number ID #REQUIRED Instructor IDREF #IMPLIED> ... course evaluations above the university average The course with the lowest evaluation Courses with all evaluations above the university average
Consider the following XML DTD describing course information in a university: <!ELEMENT Univ (Course+, Prof+) <!ELEMENT Course (Title, Eval*) <!ATTLIST Course Number ID #...
Ishrat Jahan
693
views
Ishrat Jahan
asked
Nov 1, 2014
Web Technologies
gateit-2006
xquery
non-gate
+
–
31
votes
3
answers
25
GATE IT 2006 | Question: 61
In a database file structure, the search key field is $9$ $bytes$ long, the block size is $512$ $bytes$, a record pointer is $7$ $bytes$ and a block pointer is $6$ $bytes$. The largest possible order of a non-leaf node in a$ B+$ tree implementing this file structure is $23$ $24$ $34$ $44$
In a database file structure, the search key field is $9$ $bytes$ long, the block size is $512$ $bytes$, a record pointer is $7$ $bytes$ and a block pointer is $6$ $bytes...
Ishrat Jahan
6.8k
views
Ishrat Jahan
asked
Nov 1, 2014
Databases
gateit-2006
databases
b-tree
normal
+
–
22
votes
2
answers
26
GATE IT 2006 | Question: 60
Consider a relation R with five attributes $V, W, X, Y,$ and $Z.$ The following functional dependencies hold: $VY→ W, WX → Z,$ and $ZY → V.$ Which of the following is a candidate key for $R?$ $VXZ$ $VXY$ $VWXY$ $VWXYZ$
Consider a relation R with five attributes $V, W, X, Y,$ and $Z.$ The following functional dependencies hold:$VY→ W, WX → Z,$ and $ZY → V.$Which of the following is...
Ishrat Jahan
6.3k
views
Ishrat Jahan
asked
Nov 1, 2014
Databases
gateit-2006
databases
database-normalization
normal
+
–
1
votes
1
answer
27
GATE IT 2006 | Question: 59
Consider the following structure chart diagram. The boxes have function names embedded in them, while the variables are indicated along the arcs. Given below are a set of statements relevant to the above diagram. F3 and F6 can be in the same module. F4 and F6 ... a control variable. Which combination of these statements is TRUE? III and IV I and IV II and IV I, II and IV
Consider the following structure chart diagram. The boxes have function names embedded in them, while the variables are indicated along the arcs.Given below are a set of ...
Ishrat Jahan
952
views
Ishrat Jahan
asked
Nov 1, 2014
IS&Software Engineering
gateit-2006
is&software-engineering
normal
non-gate
+
–
4
votes
2
answers
28
GATE IT 2006 | Question: 58
A software program consists of two modules M1 and M2 that can fail independently, but never simultaneously. The program is considered to have failed if any of these modules fails. Both the modules are 'repairable' and so the program starts working again as soon as the repair ... ((R1R2)/(T1R1 + T2R2)) ((T1T2)/(T1T2 + T1R1 + T2R2)) ((T1T2)/(T1T2 + T1R2 + T2R1))
A software program consists of two modules M1 and M2 that can fail independently, but never simultaneously. The program is considered to have failed if any of these modul...
Ishrat Jahan
1.4k
views
Ishrat Jahan
asked
Nov 1, 2014
IS&Software Engineering
gateit-2006
normal
software-reliability
+
–
27
votes
2
answers
29
GATE IT 2006 | Question: 57
The wait and signal operations of a monitor are implemented using semaphores as follows. In the following, $x$ is a condition variable, mutex is a semaphore initialized to $1$, $x$_sem is a semaphore initialized to $0$, $x$_count is the number of processes waiting on semaphore $x$_sem, ... $V(next), P(x\_sem)$ $P(next), V(x\_sem)$ $P(x\_sem), V(x\_sem)$
The wait and signal operations of a monitor are implemented using semaphores as follows. In the following,$x$ is a condition variable,mutex is a semaphore initialized to ...
Ishrat Jahan
6.4k
views
Ishrat Jahan
asked
Nov 1, 2014
Operating System
gateit-2006
operating-system
process-synchronization
semaphore
normal
+
–
68
votes
6
answers
30
GATE IT 2006 | Question: 56
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ ... $\text{S < P < T}$ $\text{S < T < P}$ $\text{T < S < P}$
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ and the number of segments are given below.$$\small \begin{array}{|c|c|c|}\h...
Ishrat Jahan
28.7k
views
Ishrat Jahan
asked
Nov 1, 2014
Operating System
gateit-2006
operating-system
memory-management
difficult
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register