Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged gate2005it
0
votes
0
answers
GATE2005IT Qstn no 53
In the expression count[b[j++]]−− two post operations are present ,In which order will they be evaluated? [Ignore any array out of bound errors and count is an array of integers]
asked
Oct 26
in
Programming
by
deCiFer598
(
5
points)

20
views
gate2005it
selfdoubt
0
votes
0
answers
GATE2005IT73 Video Solution
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
asked
Apr 18
in
Computer Networks
by
admin
(
197
points)

8
views
gate2005it
computernetworks
congestioncontrol
normal
videosolution
0
votes
0
answers
GATE2005IT41 Video Solution
Given below is a program which when executed spawns two concurrent processes : semaphore $X : = 0 ;$ /* Process now forks into concurrent processes $P1$ & $P2$ */ $\begin{array}{ll}\hline \text{$P1$} & \text{$ ... (II) are true. (I) is true but (II) is false. (II) is true but (I) is false Both (I) and (II) are false
asked
Apr 18
in
Operating System
by
admin
(
197
points)

2
views
gate2005it
operatingsystem
processsynchronization
normal
videosolution
0
votes
0
answers
GATE2005IT23, ISRO201767 Video Solution
A BTree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are $5$ $4$ $3$ $2$
asked
Apr 18
in
Databases
by
admin
(
197
points)

3
views
gate2005it
databases
btree
normal
isro2017
videosolution
0
votes
0
answers
GATE2005IT43 Video Solution
Which of the following input sequences will always generate a $1$ at the output $z$ ...
asked
Apr 18
in
Digital Logic
by
admin
(
197
points)

9
views
gate2005it
digitallogic
circuitoutput
normal
videosolution
0
votes
0
answers
GATE2005IT32 Video Solution
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is $3$ $4$ $5$ $6$
asked
Apr 18
in
Probability
by
admin
(
197
points)

5
views
gate2005it
probability
binomialdistribution
expectation
normal
videosolution
0
votes
0
answers
GATE2005IT75 Video Solution
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$
asked
Apr 18
in
Computer Networks
by
admin
(
197
points)

5
views
gate2005it
computernetworks
macprotocol
normal
videosolution
0
votes
0
answers
GATE2005IT85b Video Solution
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, ... at time $(t + 100)$ is : $>100$ but finite $\infty$ $3$ $>3$ and $\leq 100$
asked
Apr 18
in
Computer Networks
by
admin
(
197
points)

8
views
gate2005it
computernetworks
routing
normal
videosolution
0
votes
0
answers
GATE2005IT36 Video Solution
Let $P(x)$ and $Q(x)$ ...
asked
Apr 18
in
Mathematical Logic
by
admin
(
197
points)

4
views
gate2005it
mathematicallogic
firstorderlogic
normal
videosolution
0
votes
0
answers
GATE2005IT14 Video Solution
In a depthfirst traversal of a graph $G$ with $n$ vertices, $k$ edges are marked as tree edges. The number of connected components in $G$ is $k$ $k+1$ $nk1$ $nk$
asked
Apr 18
in
Algorithms
by
admin
(
197
points)

5
views
gate2005it
algorithms
graphalgorithms
normal
videosolution
0
votes
0
answers
GATE2005IT13 Video Solution
A function $f$ defined on stacks of integers satisfies the following properties. $f(∅) = 0$ and $f (push (S, i)) = max (f(S), 0) + i$ for all stacks $S$ and integers $i$. If a stack $S$ contains the integers $2, 3, 2, 1, 2$ in order from bottom to top, what is $f(S)$? $6$ $4$ $3$ $2$
asked
Apr 18
in
DS
by
admin
(
197
points)

6
views
gate2005it
datastructures
stack
normal
videosolution
0
votes
0
answers
GATE2005IT52 Video Solution
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE? There exists a cutset in $G$ having ... $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.
asked
Apr 18
in
Algorithms
by
admin
(
197
points)

3
views
gate2005it
algorithms
spanningtree
normal
videosolution
0
votes
0
answers
GATE2005IT82b Video Solution
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$
asked
Apr 18
in
Databases
by
admin
(
197
points)

5
views
gate2005it
databases
normal
joins
videosolution
0
votes
0
answers
GATE2005IT50 Video Solution
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most $2$. If the height of the tree is $h > 0$, then the minimum number of nodes in the tree is $2^{h1}$ $2^{h1} + 1$ $2^h  1$ $2^h$
asked
Apr 18
in
DS
by
admin
(
197
points)

3
views
gate2005it
datastructures
binarytree
normal
videosolution
0
votes
0
answers
GATE2005IT76 Video Solution
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$
asked
Apr 18
in
Computer Networks
by
admin
(
197
points)

14
views
gate2005it
computernetworks
subnetting
normal
videosolution
0
votes
0
answers
GATE2005IT81b Video Solution
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 outermost track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$
asked
Apr 18
in
Operating System
by
admin
(
197
points)

2
views
gate2005it
operatingsystem
disks
normal
videosolution
0
votes
0
answers
GATE2005IT81a Video Solution
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}$
asked
Apr 18
in
Operating System
by
admin
(
197
points)

6
views
gate2005it
operatingsystem
disks
normal
videosolution
0
votes
0
answers
GATE2005IT37 Video Solution
Consider the nondeterministic finite automaton (NFA) shown in the figure. State $X$ is the starting state of the automaton. Let the language accepted by the NFA with $Y$ as the only accepting state be $L1$. Similarly, let the language accepted by the NFA with $Z$ ... statements about $L1$ and $L2$ is TRUE? $L1 = L2$ $L1 \subset L2$ $L2 \subset L1$ None of the above
asked
Apr 18
in
Theory of Computation
by
admin
(
197
points)

6
views
gate2005it
theoryofcomputation
finiteautomata
normal
videosolution
0
votes
0
answers
GATE2005IT42 Video Solution
Two concurrent processes $P1$ and $P2$ use four shared resources $R1, R2, R3$ and $R4$, as shown below. $\begin{array}{ll}\hline \textbf{P1} & \textbf{P2} \\ \text{Compute: } & \text{Compute;} \\ \text{Use $ ... binary semaphores are used to enforce the above scheduling constraints, what is the minimum number of binary semaphores needed? $1$ $2$ $3$ $4$
asked
Apr 18
in
Operating System
by
admin
(
197
points)

7
views
gate2005it
operatingsystem
processsynchronization
normal
videosolution
0
votes
0
answers
GATE2005IT69 Video Solution
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
asked
Apr 18
in
Databases
by
admin
(
197
points)

10
views
gate2005it
databases
sql
normal
videosolution
0
votes
0
answers
GATE2005IT53 Video Solution
The following$ C$ function takes two ASCII strings and determines whether one is an anagram of the other. An anagram of a string s is a string obtained by permuting the letters in s. int anagram (char *a, char *b) { int count [128], j; for (j = 0; j < 128; j++) count[j] = 0; j ... $A : count [a[j]]++ \ and \ B : count[b[j++]]$
asked
Apr 18
in
Programming
by
admin
(
197
points)

10
views
gate2005it
programming
normal
programminginc
videosolution
0
votes
0
answers
GATE2005IT38 Video Solution
Let $P$ be a nondeterministic pushdown automaton (NPDA) with exactly one state, $q$, and exactly one symbol, $Z$, in its stack alphabet. State $q$ is both the starting as well as the accepting state of the PDA. The stack is initialized with one $Z$ before the start of ... $L(P)$ and $N(P)$ are necessarily $Σ^*$. Neither $L(P)$ nor $N(P)$ are necessarily $Σ^*$
asked
Apr 18
in
Theory of Computation
by
admin
(
197
points)

12
views
gate2005it
theoryofcomputation
pushdownautomata
normal
videosolution
0
votes
0
answers
GATE2005IT33 Video Solution
Let $A$ be a set with $n$ elements. Let $C$ be a collection of distinct subsets of $A$ such that for any two subsets $S_1$ and $S_2$ in $C$, either $S_1 \subset S_2$ or $S_2\subset S_1$. What is the maximum cardinality of C? $n$ $n+1$ $2^{n1} + 1$ $n!$
asked
Apr 18
in
Set Theory & Algebra
by
admin
(
197
points)

3
views
gate2005it
settheory&algebra
normal
sets
videosolution
0
votes
0
answers
GATE2005IT68 Video Solution
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$
asked
Apr 18
in
Databases
by
admin
(
197
points)

8
views
gate2005it
databases
sql
relationalalgebra
normal
videosolution
0
votes
0
answers
GATE2005IT26 Video Solution
Traceroute reports a possible route that is taken by packets moving from some host $A$ to some other host $B$. Which of the following options represents the technique used by traceroute to identify these hosts: By progressively querying routers about the next ... the ascending order of their hop distance from $A$ By locally computing the shortest path from $A$ to $B$
asked
Apr 18
in
Computer Networks
by
admin
(
197
points)

13
views
gate2005it
computernetworks
icmp
applicationlayerprotocols
normal
videosolution
0
votes
0
answers
GATE2005IT72 Video Solution
A channel has a bit rate of $4$ $kbps$ and oneway 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
Apr 18
in
Computer Networks
by
admin
(
197
points)

4
views
gate2005it
computernetworks
networkflow
stopandwait
normal
videosolution
0
votes
0
answers
GATE2005IT12 Video Solution
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n  p$ $n  p + 1$
asked
Apr 18
in
DS
by
admin
(
197
points)

4
views
gate2005it
datastructures
normal
binarysearchtree
videosolution
0
votes
0
answers
GATE2005IT40 Video Solution
A language $L$ satisfies the Pumping Lemma for regular languages, and also the Pumping Lemma for contextfree languages. Which of the following statements about $L$ is TRUE? $L$ is necessarily a regular language. $L$ is necessarily a contextfree language, but not necessarily a regular language. $L$ is necessarily a nonregular language. None of the above
asked
Apr 18
in
Theory of Computation
by
admin
(
197
points)

7
views
gate2005it
theoryofcomputation
pumpinglemma
easy
videosolution
0
votes
0
answers
GATE2005IT84a Video Solution
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$;
asked
Apr 18
in
Algorithms
by
admin
(
197
points)

4
views
gate2005it
algorithms
graphalgorithms
normal
videosolution
0
votes
0
answers
GATE2005IT56 Video Solution
Let $G$ be a directed graph whose vertex set is the set of numbers from $1$ to $100$. There is an edge from a vertex $i$ to a vertex $j$ iff either $j = i + 1$ or $j = 3i$. The minimum number of edges in a path in $G$ from vertex $1$ to vertex $100$ is $4$ $7$ $23$ $99$
asked
Apr 18
in
Graph Theory
by
admin
(
197
points)

5
views
gate2005it
graphtheory
graphconnectivity
normal
videosolution
0
votes
0
answers
GATE2005IT61 Video Solution
Consider a $2$way set associative cache memory with $4$ sets and total $8$ cache blocks $(07)$ and a main memory with $128$ blocks $(0127)$. What memory blocks will be present in the cache after the following sequence of memory block references if LRU policy is used for cache block replacement. ... $9$ $16$ $55$ $0$ $5$ $7$ $9$ $16$ $55$ $3$ $5$ $7$ $9$ $16$ $55$
asked
Apr 18
in
CO & Architecture
by
admin
(
197
points)

5
views
gate2005it
coandarchitecture
cachememory
normal
videosolution
0
votes
0
answers
GATE2005IT27 Video Solution
Which of the following statements is TRUE about CSMA/CD: IEEE $802.11$ wireless LAN runs CSMA/CD protocol Ethernet is not based on CSMA/CD protocol CSMA/CD is not suitable for a high propagation delay network like satellite network There is no contention in a CSMA/CD network
asked
Apr 18
in
Computer Networks
by
admin
(
197
points)

4
views
gate2005it
computernetworks
congestioncontrol
csmacd
normal
videosolution
0
votes
0
answers
GATE2005IT77 Video Solution
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" ... 145.inaddr.arpa domains Directly query a NS for 145.inaddr.arpa and then a NS for 128.145.inaddr.arpa domains
asked
Apr 18
in
Computer Networks
by
admin
(
197
points)

26
views
gate2005it
computernetworks
normal
dns
videosolution
0
votes
0
answers
GATE2005IT9 Video Solution
A dynamic RAM has a memory cycle time of $64$ $\text{nsec}$. It has to be refreshed $100$ times per msec and each refresh takes $100$ $\text{nsec}$ . What percentage of the memory cycle time is used for refreshing? $10$ $6.4$ $1$ $0.64$
asked
Apr 18
in
Digital Logic
by
admin
(
197
points)

16
views
gate2005it
digitallogic
memoryinterfacing
normal
videosolution
0
votes
0
answers
GATE2005IT19, UGCNETJune2012III57 Video Solution
asked
Apr 18
in
Operating System
by
admin
(
197
points)

6
views
gate2005it
operatingsystem
osprotection
normal
ugcnetjune2012iii
videosolution
0
votes
0
answers
GATE2005IT55 Video Solution
A binary search tree contains the numbers $1, 2, 3, 4, 5, 6, 7, 8.$ When the tree is traversed in preorder and the values in each node printed out, the sequence of values obtained is $5, 3, 1, 2, 4, 6, 8, 7.$ ... $1, 2, 3, 4, 8, 7, 6, 5$ $2, 1, 4, 3, 6, 7, 8, 5$ $2, 1, 4, 3, 7, 8, 6, 5$
asked
Apr 18
in
DS
by
admin
(
197
points)

3
views
gate2005it
datastructures
binarysearchtree
normal
videosolution
0
votes
0
answers
GATE2005IT28 Video Solution
Which of the following statements is FALSE regarding a bridge? Bridge is a layer $2$ device Bridge reduces collision domain Bridge is used to connect two or more LAN segments Bridge reduces broadcast domain
asked
Apr 18
in
Computer Networks
by
admin
(
197
points)

5
views
gate2005it
computernetworks
lantechnologies
normal
videosolution
0
votes
0
answers
GATE2005IT71 Video Solution
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
Apr 18
in
Computer Networks
by
admin
(
197
points)

5
views
gate2005it
computernetworks
congestioncontrol
csmacd
normal
videosolution
0
votes
0
answers
GATE2005IT39 Video Solution
Consider the regular grammar: $S \rightarrow Xa \mid Ya$ $X \rightarrow Za$ $Z \rightarrow Sa \mid \epsilon$ $Y \rightarrow Wa$ $W \rightarrow Sa$ where $S$ is the starting symbol, the set of terminals is $\{a\}$ and the set of nonterminals is ... automaton (DFA) to recognize the same language. What is the minimum number of states required for the DFA? $2$ $3$ $4$ $5$
asked
Apr 18
in
Theory of Computation
by
admin
(
197
points)

9
views
gate2005it
theoryofcomputation
finiteautomata
normal
videosolution
0
votes
1
answer
GATE2005IT49 Video Solution
An instruction set of a processor has $125$ signals which can be divided into $5$ groups of mutually exclusive signals as follows: Group $1$ $:$ $20$ signals, Group $2$ $:$ $70$ signals, Group $3$ $:$ $2$ signals, Group $4$ ... . How many bits of the control words can be saved by using vertical microprogramming over horizontal microprogramming? $0$ $103$ $22$ $55$
asked
Apr 18
in
CO & Architecture
by
admin
(
197
points)

21
views
gate2005it
coandarchitecture
microprogramming
normal
videosolution
Page:
1
2
3
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
Recent Blog Comments
Thanks, Can you tell me till when this might get...
8,647
questions
2,855
answers
13,739
comments
95,564
users