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 tusharp
0
votes
0
answers
1
#Last month preparation advice
Is it OK to be nervous during this period? Didn’t posted anything other than question on GO. But today I am feeling very low because of anxiety. Same happened with me in 2018 despite of good preparation. Some motivation is welcomed. :)
Is it OK to be nervous during this period?Didn’t posted anything other than question on GO. But today I am feeling very low because of anxiety. Same happened with me in...
322
views
asked
Jan 9, 2019
Others
gate-preparation
+
–
0
votes
1
answer
2
Kenneth Rosen Edition 7 Exercise 7.1 Question 14 (Page No. 451)
What is the probability that a five-card poker hand contains two pairs (that is, two of each of two different kinds and a fifth card of a third kind)?
What is the probability that a five-card poker hand contains two pairs (that is, two of each of two different kinds and a fifth card of a third kind)?
455
views
asked
Jan 4, 2019
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
probability
+
–
0
votes
0
answers
3
IEEE floating point representation
Can someone please help in highlighted part. Thanks
Can someone please help in highlighted part. Thanks
879
views
asked
Dec 3, 2018
Digital Logic
floating-point-representation
ieee-representation
+
–
0
votes
0
answers
4
Rosen
Show that in a group of 10 people (where any two people are either friends or enemies), there are either three mutual friends or four mutual enemies, and there are either three mutual enemies or four mutual friends.
Show that in a group of 10 people (where any two people are either friends or enemies), there are either three mutual friends or four mutual enemies, and there are either...
202
views
asked
Nov 20, 2018
Combinatory
kenneth-rosen-pigeonhole-principle
+
–
0
votes
2
answers
5
Rosen
How many partial functions are there from a set with m elements to a set with n elements, where m and n are positive integers? My try : Partial functions are the ones which are undefined for some elements of domain. Now we will have to find cases like at least one element of ... on. from total possible functions from m to n if we do total - (all are mapped) it will be 0. How to approach it?
How many partial functions are there from a set with m elements to a set with n elements, where m and n are positive integers?My try : Partial functions are the ones whic...
1.7k
views
asked
Nov 18, 2018
1
votes
0
answers
6
Rosen
How many positive integers less than 1,000,000 have the sum of their digits equal to 19? Doubt 1: I understood till C(24,5). Now while subtracting unfavorable cases, for the sum not to exceed 19 one or more digits cannot exceed 9 coz 10+10= >19. ... It is same as selecting 9 balls from 6 boxes with repetition allowed. Then how it is unfavorable according to solution given? plz correct me.
How many positive integers less than 1,000,000 have thesum of their digits equal to 19?Doubt 1: I understood till C(24,5). Now while subtracting unfavorable cases, for th...
950
views
asked
Nov 7, 2018
0
votes
0
answers
7
#self doubt
How packet is forwarded in same network? Suppose there is sender A and receiver B. Data will come from AL->TL->NL->DLL->PL of A, then A using its subnet mask and IP of B will check the NID of B according to A. If NID matches then A ... will TTL field will be decremented at B as it hits the NL? https://gateoverflow.in/1983/gate2014-2-25 want the concept for this question.
How packet is forwarded in same network?Suppose there is sender A and receiver B. Data will come from AL->TL->NL->DLL->PL of A, then A using its subnet mask and IP of B ...
218
views
asked
Oct 16, 2018
Computer Networks
computer-networks-ttl
+
–
0
votes
0
answers
8
Self Doubt
How a query in tuple relational calculus written using quantifiers can be written in relational algebra? I came across an example where I have to print employee ID only if he is working on all projects controlled by dept 5. "For all" can easily be done using quantifiers but how to keep track of an emp ID when we are checking for all prj of dep 5 for particular emp ID?
How a query in tuple relational calculus written using quantifiers can be written in relational algebra?I came across an example where I have to print employee ID only if...
160
views
asked
Sep 29, 2018
2
votes
0
answers
9
Addressing modes
Instructions are stored in memory. When they are to be executed they are brought into instruction register. Now it is divided as Mode, opcode, operand (log (memory size) is divided in three parts) . In direct addressing, operand represent the effective ... required to address a memory then how such a big instruction is stored in memory whose operand itself has those many bits?
Instructions are stored in memory. When they are to be executed they are brought into instruction register. Now it is divided as Mode, opcode, operand (log (memory size) ...
610
views
asked
Aug 15, 2018
CO and Architecture
addressing-modes
co-and-architecture
+
–
0
votes
1
answer
10
Kenneth Rosen Edition 6th Exercise 7.4 Example 7 (Page No. 493)
I am not getting the (2n-1) factor. n^2 is for matrix mul and multiplication is being done (n-1) times. so n^2(n-1) is understood. But what is (2n-1)??
I am not getting the (2n-1) factor. n^2 is for matrix mul and multiplication is being done (n-1) times. so n^2(n-1) is understood. But what is (2n-1)??
464
views
asked
Jul 14, 2018
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
relations
+
–
0
votes
1
answer
11
self doubt
If Mr.M is guilty, then no witness is lying unless he is afraid. X: Mr M is guilty Y: No witness is lying Z: he is afraid translation: (X ^ ~Z) -> Y. Is this correct? If yes please explain the implication in these answers https://gateoverflow.in/20939/tifr2012-a-2. Thank you.
If Mr.M is guilty, then no witness is lying unless he is afraid. X: Mr M is guiltyY: No witness is lyingZ: he is afraidtranslation: (X ^ ~Z) - Y. Is this correct? If yes ...
276
views
asked
Jul 12, 2018
Mathematical Logic
discrete-mathematics
first-order-logic
+
–
0
votes
2
answers
12
Self doubt
Which is appropriate for the statement and why?
Which is appropriate for the statement and why?
461
views
asked
Jul 11, 2018
Mathematical Logic
discrete-mathematics
first-order-logic
+
–
1
votes
1
answer
13
Kenneth Rosen Edition 6th Exercise 5.6 Example 5 (Page No. 385)
I am not getting this condition. Can someone please explain that condition with that example.
I am not getting this condition. Can someone please explain that condition with that example.
1.8k
views
asked
Jul 5, 2018
Combinatory
discrete-mathematics
kenneth-rosen
counting
+
–
0
votes
0
answers
14
Rosen- Pigeonhole principle
Not getting highlighted part how ceil N/K will be greater or equal to r?
Not getting highlighted part how ceil N/K will be greater or equal to r?
281
views
asked
Jul 4, 2018
Combinatory
pigeonhole-principle
+
–
1
votes
1
answer
15
Rosen (Nested Quantifiers)
If we think about nested quantifiers as nested loops ∀x((F (x) ∧ P(x)) → ∃yM(x, y)) for this then when we are iterating for outer loop x and we find the LHS to be true then only iterate in internal loop of y whether she is ... (x, y) } } We are making unnecessary comparisons here. So how could we move that existential quantifier in beginning? What is null quantification?
If we think about nested quantifiers as nested loops ∀x((F (x) ∧ P(x)) → ∃yM(x, y)) for this then when we are iterating for outer loop x and we find the LHS to b...
1.3k
views
asked
Jun 25, 2018
0
votes
0
answers
16
Cormen
Bucket Sort: Didn't get how the complexity is O(n^2) from cormen. 1. As we take n as input, it might be the case that many numbers maps to same bucket. So n(per bucket one)*n/k(list in same bucket if distributed uniformly) = n^2. 2. Worst case all elements can map to ... maintaining linked list, adding all these node will take time = 1+2+3+4.....+n=n(n-1)/2= O(n^2). Plz correct me.
Bucket Sort:Didn't get how the complexity is O(n^2) from cormen.1. As we take n as input, it might be the case that many numbers maps to same bucket. So n(per bucket one)...
294
views
asked
May 3, 2018
2
votes
3
answers
17
SR protocol
Suppose there are 0,1,2,3 packets in Sender window(win size =4). As both sender and receiver has same window size, out of order delivery of packets are allowed. If suppose 0,1,2,3 are sent and 0 is lost and 1,2,3 are accepted. Then after retransmission complete window will slide by N for new data or when 0 is retransmitted other 3 slots will be filled with new data??
Suppose there are 0,1,2,3 packets in Sender window(win size =4). As both sender and receiver has same window size, out of order delivery of packets are allowed. If suppos...
1.4k
views
asked
Mar 17, 2018
Computer Networks
computer-networks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
