Register
Filter

Answers by Nishant Arora

0 votes
1
Doubt
L = { an bm cp dq , n != m or p != q } Is it inherently ambiguous or not????
L = { an bm cp dq , n != m or p != q }Is it inherently ambiguous or not????
0 votes
2
Probability Distribution
In cartesian co-ordinate system,along the x axis two points p and q are selected uniformly at random in $\left [ 0,L \right ]$ where L > 0. What is the probability of $\text{distance(p,q)} \leq \frac{L}{4}$.
In cartesian co-ordinate system,along the x axis two points p and q are selected uniformly at random in $\left [ 0,L \right ]$ where L 0.What is the probability of $\tex...
2 votes
3
DM
$P\left ( x,y \right )\Rightarrow x+y=10$ State true/false 1.$\exists x\, \forall y \, \, P\left ( x,y \right )$. 2.$\forall y\, \exists x\, \, P\left ( x,y \right )$ if im wrong plz correct me.......
$P\left ( x,y \right )\Rightarrow x+y=10$State true/false1.$\exists x\, \forall y \, \, P\left ( x,y \right )$.2.$\forall y\, \exists x\, \, P\left ( x,y \right )$if im w...
8 votes
4
Expectated no of coin toss
An unbiased coin is tossed repeatedly and outcomes are recorded. What is the expected no of toss to get HT ( one head and one tail consecutively) ?
An unbiased coin is tossed repeatedly and outcomes are recorded. What is the expected no of toss to get HT ( one head and one tail consecutively) ?
1 votes
11
Is tightest upper bound equivalent to best case complexity
In gate 2003 cse question, i read that tightest upper bound of selection sort is O(n), which occurs only when ( n-1) swaps. My doubt is " tightest upper bound " is kuust another name of best case complexity?
In gate 2003 cse question, i read that tightest upper bound of selection sort is O(n), which occurs only when ( n-1) swaps. My doubt is " tightest upper bound " is kuust ...
9 votes
12
ISRO2011-48
The hamming distance between the octets of $\textsf{0xAA}$ and $\textsf{0x55}$ is $7$ $5$ $8$ $6$
The hamming distance between the octets of $\textsf{0xAA}$ and $\textsf{0x55}$ is$7$$5$$8$$6$
2 votes
13
ISRO2011-26
The in-order traversal of a tree resulted in FBGADCE. Then the pre-order traversal of that tree would result in FGBDECA ABFGCDE BFGCDEA AFGBDEC
The in-order traversal of a tree resulted in FBGADCE. Then the pre-order traversal of that tree would result inFGBDECAABFGCDEBFGCDEAAFGBDEC
0 votes
14
Aptitude
An article was sold at a discount of 15% and there was a profit of 20%. If the gained was 6 rupees less than the discount offered, what was the selling price of the article ?
An article was sold at a discount of 15% and there was a profit of 20%. If the gained was 6 rupees less than the discount offered, what was the selling price of the arti...
4 votes
17
Sum of simple series
What is the summation of this series ? $1 \times \frac{1}{2}$ + $2 \times \frac{1}{4}$ +$3 \times \frac{1}{8}$ + .....
What is the summation of this series ?$1 \times \frac{1}{2}$ + $2 \times \frac{1}{4}$ +$3 \times \frac{1}{8}$ + .....
0 votes
18
maxima minima
maxima minima of 2^(sinx)/2^(cosx)
maxima minima of 2^(sinx)/2^(cosx)
1 votes
20
Minimim RTT for the link
suppose a 128kbps point to point link is setup between earth and Rover on Mars.The distance from earth to Mars is approximately 55Gm,data travel over the link at the speed of light.What is the minimum RTT for the link?
suppose a 128kbps point to point link is setup between earth and Rover on Mars.The distance from earth to Mars is approximately 55Gm,data travel over the link at the spee...
2 votes
21
Find bandwidth.
Consider a point to point link 50Kms in length.At what bandwidth would propagation delay(at the speed of light) equal to transmit delay for 100 byte packets ? What about 512 byte packets?
Consider a point to point link 50Kms in length.At what bandwidth would propagation delay(at the speed of light) equal to transmit delay for 100 byte packets ? What about ...
14 votes
22
ISRO2008-39
Consider the following Assembly language program MVIA 30 H ACI 30 H XRA A POP H After the execution of the above program, the contents of the accumulator will be $\textsf{30 H}$ $\textsf{60 H}$ $\textsf{00 H}$ contents of stack
Consider the following Assembly language programMVIA30 HACI30 HXRAAPOPHAfter the execution of the above program, the contents of the accumulator will be$\textsf{30 H}$$\t...
0 votes
23
ISRO2008-58
Checkpointing a job allows it to be completed successfully allows it to continue executing later prepares it for finishing occurs only when there is an error in it
Checkpointing a joballows it to be completed successfullyallows it to continue executing laterprepares it for finishingoccurs only when there is an error in it
0 votes
24
ISRO2008-64
Which of the following need not necessarily be saved on a Context Switch between processes? General purpose registers Translation look-aside buffer Program counter Stack pointer
Which of the following need not necessarily be saved on a Context Switch between processes?General purpose registersTranslation look-aside bufferProgram counterStack poin...
8 votes
25
ISRO2008-59
A public key encryption system allows anyone to decode the transmissions allows only the correct sender to decode the data allows only the correct receiver to decode the data does not encode the data before transmitting it
A public key encryption systemallows anyone to decode the transmissionsallows only the correct sender to decode the dataallows only the correct receiver to decode the dat...
8 votes
26
ISRO2008-63
Fork is the creation of a new job the dispatching of a task increasing the priority of a task the creation of a new process
Fork isthe creation of a new jobthe dispatching of a taskincreasing the priority of a taskthe creation of a new process
9 votes
27
ISRO-2013-38
In the Ethernet, which field is actually added at the physical layer and is not part of the frame. Preamble CRC Address Location
In the Ethernet, which field is actually added at the physical layer and is not part of the frame.PreambleCRCAddressLocation
0 votes
28
Peterson Davie 3.33
What aspect of $IP$ addresses makes it necessary to have one address per network interface, rather than just one per host? In light of your answer, why does $IP$ tolerate point-to-point interfaces that have nonunique addresses or no addresses?
What aspect of $IP$ addresses makes it necessary to have one address per network interface, rather than just one per host? In light of your answer, why does $IP$ tolerate...
0 votes
29
Peterson Davie 3.34
Why does the Offset field in the $IP$ header measure the offset in $8$-byte units? (Hint: Recall that the Offset field is $13$ bits long.)
Why does the Offset field in the $IP$ header measure the offset in $8$-byte units? (Hint: Recall that the Offset field is $13$ bits long.)
Page: