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
Questions by Angkit
0
votes
1
answer
1
doubt
Can anyone derive efficiency formula of CSMA/CD please?
Can anyone derive efficiency formula of CSMA/CD please?
409
views
asked
Jun 9, 2018
Computer Networks
computer-networks
+
–
0
votes
1
answer
2
Doubt
In RTT(round trip time),why do we need to calculate the transmission time? bcz-"round-trip delay time (RTD) or round-trip time (RTT) is the length of time it takes for a signal to be sent plus the length of time it takes for an ... This time delay therefore consists of the propagation times between the two points of a signal." REf: https://gateoverflow.in/43470/gate2009-58
In RTT(round trip time),why do we need to calculate the transmission time? bcz-"round-trip delay time (RTD) or round-trip time (RTT) is the length of time it takes for a ...
392
views
asked
Jun 9, 2018
Computer Networks
computer-networks
+
–
0
votes
1
answer
3
Doubt
Why there is need to convert IP address to Domain name ?
Why there is need to convert IP address to Domain name ?
183
views
asked
Jun 1, 2018
0
votes
0
answers
4
Doubt
Why self dual functions are required?
Why self dual functions are required?
179
views
asked
May 10, 2018
Digital Logic
digital-logic
+
–
1
votes
2
answers
5
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...
627
views
asked
May 6, 2018
Probability
probability
+
–
0
votes
1
answer
6
Doubt
Let $S$ be a sorted array of n integers. Let $T(n)$ denote the time taken for the most efficient algorithm to determined all elements with sum less than $10000$ in $S$. Which of the following statement is true? $T(n)$ is $O(1)$ $n \leq T(n)\leq nlog_2n$ $nlog_2n\leq T(n)<n^2$ $T(n)=(n^2)$ $\text{None of these}$.
Let $S$ be a sorted array of n integers. Let $T(n)$ denote the time taken for the most efficient algorithm to determined all elements with sum less than $10000$ in $S$. W...
434
views
asked
Mar 29, 2018
Algorithms
algorithms
recurrence-relation
+
–
1
votes
1
answer
7
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?
563
views
asked
Mar 29, 2018
Algorithms
algorithms
quick-sort
+
–
0
votes
0
answers
8
doubt
Does KEY for an instance makes sense?What is the benefit of it?
Does KEY for an instance makes sense?What is the benefit of it?
268
views
asked
Mar 9, 2018
Databases
databases
+
–
0
votes
1
answer
9
Doubt
What is encoding in Finite State machine?
What is encoding in Finite State machine?
298
views
asked
Feb 10, 2018
Theory of Computation
theory-of-computation
+
–
1
votes
2
answers
10
Doubt
What is identity for regular expressions ?
What is identity for regular expressions ?
405
views
asked
Feb 10, 2018
Theory of Computation
regular-expression
+
–
1
votes
1
answer
11
#DOUbt
(please draw small diagram for this question) An N-bit carry lookahead adder, where N is a multiple of 4, employs ICs 74181 (4 bit ALU) and 74182 ( 4 bit carry lookahead generator). The minimum addition time using the best architecture for this adder is .........?
(please draw small diagram for this question)An N-bit carry lookahead adder, where N is a multiple of 4, employs ICs 74181 (4 bit ALU) and 74182 ( 4 bit carry lookahead g...
333
views
asked
Oct 16, 2017
1
votes
1
answer
12
DOUBT
Draw / implement XOR using 2 level AND-OR logic .
Draw / implement XOR using 2 level AND-OR logic .
418
views
asked
Oct 16, 2017
Digital Logic
digital-logic
+
–
1
votes
0
answers
13
#doubt
Q1. How many Binary Tree possible with n nodes ? Q2. How many Ordered Binary Tree possible with n nodes ? Q3. How may BinarySearch Tree possible with n nodes ?
Q1. How many Binary Tree possible with n nodes ?Q2. How many Ordered Binary Tree possible with n nodes ?Q3. How may BinarySearch Tree possible with n nodes ?
260
views
asked
Oct 11, 2017
1
votes
0
answers
14
#doubt
why does a processor may require to transfer data from small register to bigger size register? I mean instead of using 1 register ,why do we use more than 1 register to save the same data?
why does a processor may require to transfer data from small register to bigger size register?I mean instead of using 1 register ,why do we use more than 1 register to sa...
246
views
asked
Oct 11, 2017
2
votes
1
answer
15
# doubt
361
views
asked
Oct 7, 2017
Combinatory
discrete-mathematics
+
–
0
votes
1
answer
16
doubt
C intersection P(C) != phir ?why? (phi is subset of every set)???
C intersection P(C) != phir ?why?(phi is subset of every set)???
329
views
asked
Oct 3, 2017
Mathematical Logic
discrete-mathematics
+
–
0
votes
0
answers
17
gate previous
The given explaination is almost fine.It will be more helpful to me if someone give other example for this question (specially option d) https://gateoverflow.in/3783/gate2005-it-36
The given explaination is almost fine.It will be more helpful to me ifsomeone give other example for this question (specially option d)https://gateoverflow.in/3783/gate20...
155
views
asked
Oct 1, 2017
Mathematical Logic
discrete-mathematics
+
–
1
votes
1
answer
18
GATE PREV
∃x(p(x)∧q(x))⟹(∃xp(x)∧∃xq(x)) a)It is false because ∃ is not distributive over ∧ b) If we say LHS is false ,then then entire statement is true. WHICH ONE I CHOOSE ?
∃x(p(x)∧q(x))⟹(∃xp(x)∧∃xq(x))a)It is false because ∃ is not distributive over ∧b) If we say LHS is false ,then then entire statement is true.WHICH ONE I C...
297
views
asked
Oct 1, 2017
Mathematical Logic
discrete-mathematics
+
–
0
votes
0
answers
19
prev gate
The complement of a cycle on 25 vertices.is Eulerian ? Please explain. REF : https://gateoverflow.in/1221/gate2007-23
The complement of a cycle on 25 vertices.is Eulerian ? Please explain.REF : https://gateoverflow.in/1221/gate2007-23
234
views
asked
Sep 29, 2017
1
votes
1
answer
20
Doubt
Can anyone please tell me how to prepare, ALU, DATA PATH AND CONTROL UNIT ?
Can anyone please tell me how to prepare, ALU, DATA PATH AND CONTROL UNIT ?
177
views
asked
Jul 9, 2017
Others
co-and-architecture
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register