Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by mysticPrince
10
answers
1
GATE CSE 2016 Set 1 | Question: 27
Consider the recurrence relation $a_1 =8 , a_n =6n^2 +2n+a_{n-1}$. Let $a_{99}=K\times 10^4$. The value of $K$ is __________.
Consider the recurrence relation $a_1 =8 , a_n =6n^2 +2n+a_{n-1}$. Let $a_{99}=K\times 10^4$. The value of $K$ is __________.
29.3k
views
commented
Mar 12, 2016
Combinatory
gatecse-2016-set1
combinatory
recurrence-relation
normal
numerical-answers
+
–
1
answer
2
eigen values
The linear operation $L(x)$ is defined by the cross product $L(x)= b \times x$, where $b=\left[0 1 0\right]^{T}$ and $x=\left[x_{1} x_{2} x_{3}\right]^{T}$ are three dimensional vectors. The $3 \times 3$ matrix $M$ ... $M$ are $0, +1, -1$ $1, -1, 1$ $i, -i, 1$ $i, -i, 0$
The linear operation $L(x)$ is defined by the cross product $L(x)= b \times x$, where $b=\left[0 1 0\right]^{T}$ and $x=\left[x_{1} x_{2} x_{3}\right]^{T}$ are three dime...
2.1k
views
commented
Feb 5, 2016
Linear Algebra
linear-algebra
eigen-value
engineering-mathematics
+
–
5
answers
3
GATE IT 2005 | Question: 51
Let $T(n)$ be a function defined by the recurrence $T(n) = 2T(n/2) + \sqrt n$ for $n \geq 2$ and $T(1) = 1$ Which of the following statements is TRUE? $T(n) = \Theta(\log n)$ $T(n) = \Theta(\sqrt n)$ $T(n) = \Theta(n)$ $T(n) = \Theta(n \log n)$
Let $T(n)$ be a function defined by the recurrence$T(n) = 2T(n/2) + \sqrt n$ for $n \geq 2$ and$T(1) = 1$Which of the following statements is TRUE?$T(n) = \Theta(\log n)$...
9.4k
views
commented
Jan 28, 2016
Algorithms
gateit-2005
algorithms
recurrence-relation
easy
+
–
12
answers
4
GATE CSE 2006 | Question: 44
Station $A$ uses $32\; \text{byte}$ packets to transmit messages to Station $B$ using a sliding window protocol. The round trip delay between A and $B$ is $80\; \text{milliseconds}$ and the bottleneck bandwidth on the path between $A$ and $B$ is $128\; \text{kbps}$ . What is the optimal window size that $A$ should use? $20$ $40$ $160$ $320$
Station $A$ uses $32\; \text{byte}$ packets to transmit messages to Station $B$ using a sliding window protocol. The round trip delay between A and $B$ is $80\; \text{mil...
26.9k
views
commented
Jan 28, 2016
Computer Networks
gatecse-2006
computer-networks
sliding-window
normal
+
–
7
answers
5
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 ...
22.2k
views
commented
Jan 27, 2016
Computer Networks
gateit-2006
computer-networks
lan-technologies
ethernet
normal
+
–
3
answers
6
GATE IT 2006 | Question: 40
The memory locations $1000,1001$ and $1020$ have data values $18,1$ and $16$ ... value $20$ Memory location $1020$ has value $20$ Memory location $1021$ has value $20$ Memory location $1001$ has value $20$
The memory locations $1000,1001$ and $1020$ have data values $18,1$ and $16$ respectively before the following program is executed.$$\begin{array}{ll} \text{MOVI} & \text...
17.2k
views
commented
Jan 27, 2016
CO and Architecture
gateit-2006
co-and-architecture
addressing-modes
normal
+
–
8
answers
7
GATE IT 2007 | Question: 80
Let $P_{1},P_{2},\ldots,P_{n}$ be $n$ points in the $xy-$plane such that no three of them are collinear. For every pair of points $P_{i}$ and $P_{j}$, let $L_{ij}$ be the line passing through them. Let $L_{ab}$ be the line ... or the smallest $y$-coordinate among all the points The difference between $x$-coordinates $P_{a}$ and $P_{b}$ is minimum None of the above
Let $P_{1},P_{2},\ldots,P_{n}$ be $n$ points in the $xy-$plane such that no three of them are collinear. For every pair of points $P_{i}$ and $P_{j}$, let $L_{ij}$ be the...
5.3k
views
commented
Jan 26, 2016
Linear Algebra
gateit-2007
cartesian-coordinates
+
–
8
answers
8
GATE IT 2007 | Question: 63
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a message to the root of the tree. The root then sends the message back down to router $j$ ... mean number of hops per message, assuming all possible router pairs are equally likely is $3$ $4.26$ $4.53$ $5.26$
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a mess...
18.9k
views
comment edited
Jan 25, 2016
Computer Networks
gateit-2007
computer-networks
routing
binary-tree
normal
+
–
8
answers
9
GATE IT 2008 | Question: 84
Host $X$ has IP address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to another host $Y$ with IP address $192.168.1.80$. Router $R1$ has IP addresses $192.168.1.135$ and $192.168.1.110$. $R2$ ... $1$ $2$ $3$ $6$
Host $X$ has IP address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to another host $Y$ with IP address $192.168.1.80$. Router $R1$ has IP address...
11.9k
views
commented
Jan 24, 2016
Computer Networks
gateit-2008
computer-networks
subnetting
normal
+
–
4
answers
10
GATE IT 2008 | Question: 40
A non pipelined single cycle processor operating at $100\;\text{MHz}$ is converted into a synchronous pipelined processor with five stages requiring $2.5\;\text{nsec}, 1.5\;\text{nsec}, 2\;\text{nsec}, 1.5\;\text{nsec}$ and $2.5\;\text{nsec}$, respectively ... $4.5$ $4.0$ $3.33$ $3.0$
A non pipelined single cycle processor operating at $100\;\text{MHz}$ is converted into a synchronous pipelined processor with five stages requiring $2.5\;\text{nsec}, ...
13.7k
views
commented
Jan 23, 2016
CO and Architecture
gateit-2008
co-and-architecture
pipelining
normal
+
–
3
answers
11
GATE IT 2008 | Question: 25
In how many ways can $b$ blue balls and $r$ red balls be distributed in $n$ distinct boxes? $\frac{(n+b-1)!\,(n+r-1)!}{(n-1)!\,b!\,(n-1)!\,r!}$ $\frac{(n+(b+r)-1)!}{(n-1)!\,(n-1)!\,(b+r)!}$ $\frac{n!}{b!\,r!}$ $\frac{(n + (b + r) - 1)!} {n!\,(b + r - 1)}$
In how many ways can $b$ blue balls and $r$ red balls be distributed in $n$ distinct boxes?$\frac{(n+b-1)!\,(n+r-1)!}{(n-1)!\,b!\,(n-1)!\,r!}$$\frac{(n+(b+r)-1)!}{(n-1)!\...
8.4k
views
commented
Jan 22, 2016
Combinatory
gateit-2008
combinatory
normal
+
–
5
answers
12
GATE IT 2008 | Question: 23
What is the probability that in a randomly chosen group of $r$ people at least three people have the same birthday? $1-\dfrac{365-364 \dots (365-r+1)}{365^{r}}$ ... $\dfrac{365 \cdot 364 \dots (365-r+1)}{365^{r}}$
What is the probability that in a randomly chosen group of $r$ people at least three people have the same birthday?$1-\dfrac{365-364 \dots (365-r+1)}{365^{r}}$$\dfrac{365...
8.7k
views
commented
Jan 22, 2016
Probability
gateit-2008
probability
normal
+
–
2
answers
13
TIFR CSE 2014 | Part A | Question: 19
Consider the following random function of $x$ $F(x) = 1 + Ux + Vx^{2} \bmod 5$, where $U$ and $V$ are independent random variables uniformly distributed over $\left\{0, 1, 2, 3, 4\right\}$. Which of the following is FALSE? $F(1)$ ... $F(1), F(2), F(3)$ are independent and identically distributed random variables. All of the above. None of the above.
Consider the following random function of $x$$F(x) = 1 + Ux + Vx^{2} \bmod 5$,where $U$ and $V$ are independent random variables uniformly distributed over $\left\{0, 1, ...
1.5k
views
commented
Jan 20, 2016
Probability
tifr2014
probability
random-variable
+
–
1
answer
14
How to Calculate Square Root In GATE Online Calculator ?
563
views
answered
Jan 16, 2016
5
answers
15
TIFR CSE 2015 | Part A | Question: 6
Ram has a fair coin, i.e., a toss of the coin results in either head or tail and each event happens with probability exactly half $(1/2)$. He repeatedly tosses the coin until he gets heads in two consecutive tosses. The expected number of coin tosses that Ram does is. $2$ $4$ $6$ $8$ None of the above
Ram has a fair coin, i.e., a toss of the coin results in either head or tail and each event happens with probability exactly half $(1/2)$. He repeatedly tosses the coin u...
5.1k
views
commented
Jan 4, 2016
Probability
tifr2015
expectation
+
–
1
answer
16
Test Series Qs Compiler Design LR(0)
Consider the following grammar. S $\rightarrow$ (S)S | ∊ How many conflicts occur in LR (0) parser for the above grammar?
Consider the following grammar. S $\rightarrow$ (S)S | ∊How many conflicts occur in LR (0) parser for the above grammar?
892
views
asked
Jan 3, 2016
Compiler Design
compiler-design
lr-parser
+
–
3
answers
17
DMA transfer rate
An 8-bit DMA device is operating is cycle stealing mode (single transfer mode). Each DMA cycle is of 6 clock states and DMA clock is 2MHz. Intermediate CPU machine cycle takes 2 microsecond, determine the DMA data transfer rate.
An 8-bit DMA device is operating is cycle stealing mode (single transfer mode). Each DMA cycle is of 6 clock states and DMA clock is 2MHz. Intermediate CPU machine cycle ...
5.3k
views
answered
Dec 30, 2015
CO and Architecture
co-and-architecture
dma
+
–
4
answers
18
GATE CSE 1999 | Question: 1.20
Booth's coding in $8$ bits for the decimal number $-57$ is: $0-100+1000$ $0-100+100-1$ $0-1+100-10+1$ $00-10+100-1$
Booth's coding in $8$ bits for the decimal number $-57$ is:$0-100+1000$$0-100+100-1$$0-1+100-10+1$$00-10+100-1$
13.3k
views
commented
Dec 27, 2015
Digital Logic
gate1999
digital-logic
number-representation
booths-algorithm
normal
+
–
3
answers
19
Test Series Question on Second Chance page Replacement
Demand paging uses a second chance page replacement policy (clock). It uses one use bit to give every page one more chance in FIFO replacement. Whenever a page is referenced its use bit set to 0. Whenever it is need to replace by other page for ... 0, 1, 2, 0, 3, 0, 4, 2, 3 The number of page faults occur using clock algorithm are ___________.
Demand paging uses a second chance page replacement policy (clock). It uses one use bit to give every page one more chance in FIFO replacement. Whenever a page is referen...
2.8k
views
commented
Dec 17, 2015
Operating System
page-replacement
operating-system
+
–
2
answers
20
Test Series QS - Algorithms
When searching for the key value 50 in a binary search tree, node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number of different orders passing in which these keys values can occur on the search path from the root to node containing the value 50 are ________.
When searching for the key value 50 in a binary search tree, node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number of d...
515
views
commented
Dec 8, 2015
DS
data-structures
binary-search-tree
numerical-answers
made-easy-test-series
+
–
8
answers
21
GATE CSE 2014 Set 2 | Question: 50
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum element in the symmetric difference of the two sets is in $U$. Consider the ... $S1$ is true and $S2$ is false $S2$ is true and $S1$ is false Neither $S1$ nor $S2$ is true
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum ...
15.8k
views
answered
Apr 27, 2015
Set Theory & Algebra
gatecse-2014-set2
set-theory&algebra
normal
set-theory
+
–
19
answers
22
GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An avera...
63.7k
views
commented
Sep 5, 2014
CO and Architecture
gatecse-2004
co-and-architecture
virtual-memory
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register