Register
Filter

Recent activity by Angkit

3 answers
2
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 answers
3
How to calculate the average case time complexity in linear search for a successful and unsuccessful search ?
Successful Search we assume that the probability of searching or finding an element at each location is same , then if we have n elements so probability is $1/n$...Also w...
1 answer
6
doubt
Can anyone derive efficiency formula of CSMA/CD please?
Can anyone derive efficiency formula of CSMA/CD please?
1 answer
8
Doubt
Why there is need to convert IP address to Domain name ?
Why there is need to convert IP address to Domain name ?
0 answers
10
Kmap doubt
For converting or Using Kmap the expression needs to be in SOP form but in this Question : https://gateoverflow.in/8162/gate2015-2-37. In best chosen answer he didnt convert the expression in SOP and did it directly what is this Method can anybody explain please ?
For converting or Using Kmap the expression needs to be in SOP form but in this Question : https://gateoverflow.in/8162/gate2015-2-37. In best chosen answer he didnt c...
0 answers
11
Doubt
Why self dual functions are required?
Why self dual functions are required?
1 answer
12
IIT M MS Question
Since given increasing,so $N'(t)>0$ but what will be $N''(t)$ for the slow rate part?
Since given increasing,so $N'(t)>0$ but what will be $N''(t)$ for the slow rate part?
2 answers
13
Doubt
Suppose we are playing a game.You have to choose 1 out 3 doors.Behind 1 lucky door ,we have 1 million dollars.You picked 1 st door.But i opened the 3rd door and found nothing.Now,if i give you another chance ,will you change your choice? (Use probabiliy estimates to answer)
Suppose we are playing a game.You have to choose 1 out 3 doors.Behind 1 lucky door ,we have 1 million dollars.You picked 1 st door.But i opened the 3rd door and found not...
1 answer
15
IISc CDS(MTech -R)
There are 12 pair of shoes, what is the probability that atleast one complete pair of shoes are present if 4 shoes are selected at random?
There are 12 pair of shoes, what is the probability that atleast one complete pair of shoes are present if 4 shoes are selected at random?
2 answers
16
IISc CDS (MTech-R)
Number of distinct simple graphs possible, given 8 vertices and not considering self loops?
Number of distinct simple graphs possible, given 8 vertices and not considering self loops?
0 answers
17
TOC questions
L={a^n \ n>=0} M={b^n \ n>=0} L.M is a regular language and the DFA for this is going to be ending with b and epsilon and it will have two states Am I correct or not
L={a^n \ n>=0} M={b^n \ n>=0}L.M is a regular language and the DFA for this is going to be ending with b and epsilon and it will have two states Am I correct or not
2 answers
18
ISRO2018-26
The $FSM$ (Finite State Machine) machine pictured in the figure above Complements a given bit pattern Finds $2's$ complement of a given bit pattern Increments a given bit pattern by $1$ Changes the sign bit
The $FSM$ (Finite State Machine) machine pictured in the figure aboveComplements a given bit patternFinds $2's$ complement of a given bit patternIncrements a given bit pa...
0 answers
19
General Math
What is value of $\log _{2}10$? In general calculator $\ln _{2}10$ is giving 2.3.... But it should be 3. something right?
What is value of $\log _{2}10$?In general calculator $\ln _{2}10$ is giving 2.3....But it should be 3. somethingright?
5 answers
22
Finding Handles in a grammer
Total number of Handles for $(w=aa)$ in the following grammar ? $S\rightarrow DT$ $D\rightarrow aa$ $T\rightarrow \epsilon$
Total number of Handles for $(w=aa)$ in the following grammar ?$S\rightarrow DT$$D\rightarrow aa$$T\rightarrow \epsilon$
1 answer
26
Doubt
In Randomized Quick sort, Can we have partitioning algorithm that never gives worst case as $O(n^2)$ for every input?
In Randomized Quick sort, Can we have partitioning algorithm that never gives worst case as $O(n^2)$ for every input?
8 answers
28
GATE CSE 1998 | Question: 1.1
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is $\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}$
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is$\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}...