Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Deepanshu
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Deepanshu
0
votes
0
answers
21
self doubt
Given the following table of data what are the minimum expected no.of comparisons required for an Optimal i 0 1 2 3 4 Pi 3/16 3/16 1/16 1/16 Qi 2/16 3/16 1/16 1/16 1/16 BST that can be constructed with the given data P(I) PROBABILITY OF ACCESSING INTERNAL NODE Q(i) PROBABILITY OF ACCESSING EXTERNAL NODE i am not getting the meaning of question ???????
Given the following table of data what are the minimum expected no.of comparisons required for an Optimali01234Pi 3/163/161/161/16Qi2/163/161/161/161/16BST that can be co...
122
views
asked
Nov 16, 2018
0
votes
0
answers
22
time complex
are these in syllabus of gate time complexity of ripple carrry adder and carry look ahead adder? if they are then plzz derive in simple way .....
are these in syllabus of gatetime complexity of ripple carrry adder and carry look ahead adder? if they are thenplzz derive in simple way .....
150
views
asked
Nov 15, 2018
0
votes
0
answers
23
SELF DOUBT _ RICE THEOREM
L1 = { <M> | M is a TM and | L (M) <=1 } L2= { <M> | M is a TM and | L (M) >=1 } NOW QUESTION IS WHICH ARE RECURSIVE ENUMERABLE AND WHICH ARE NOT ???? I JUST READ BASICS OF rice theorem DONT PRACTICE MUCH QUESTIONS ON THIS I ... = 0...... and REL_yes as string length >= 1 . REL_YES is a proper subset of REL _NO . so we can say that it is also non re
L1 = { <M | M is a TM and | L (M) <=1 }L2= { <M | M is a TM and | L (M) >=1 }NOW QUESTION IS WHICH ARE RECURSIVE ENUMERABLE AND WHICH ARE NOT ????I JUST READ BASICS OF ...
417
views
asked
Nov 14, 2018
Theory of Computation
rice-theorem
theory-of-computation
rice
+
–
0
votes
0
answers
24
SELF DOUBT
TIFR2011-A-6 IN THIS QUESTION WE GET ANSWER 6 BY THIS METHOD . SIMPLE AND STRAIGHT OKK WHEN I APPLY THIS METHOD HERE Expectated no of coin toss THEN I GET X= 1/2 (X +1 ) + 1/4 (X+2 ) (HH CASE) + 1/2 (4 ) Which makes X=6 but answer is 4 .where am i wrong
TIFR2011-A-6 IN THIS QUESTION WE GET ANSWER 6 BY THIS METHOD . SIMPLE AND STRAIGHTOKK WHEN I APPLY THIS METHOD HERE Expectated no of coin toss THEN I GET X= 1/2 (X +1 ) ...
291
views
asked
Nov 10, 2018
0
votes
0
answers
25
SELF DOUBT
10% of all phone calls you receive is spam. Your phone calls spam filter is 90% reliable: that is, 90% of the phone calls it marks as spam are indeed spam and 90% of spam phone calls are correctly labelled as spam. If you see a phone calls marked spam by your filter, what is the probability that it really is spam?
10% of all phone calls you receive is spam. Your phone calls spam filter is 90% reliable: that is, 90% of the phone calls it marks as spam are indeed spam and 90% of spa...
205
views
asked
Nov 9, 2018
0
votes
0
answers
26
self doubt
what will be the number of even permutations of n objects? i already go through this linkhttp://mathworld.wolfram.com/EvenPermutation.html didnt get much
what will be the number of even permutations of n objects?i already go through this linkhttp://mathworld.wolfram.com/EvenPermutation.html didnt get much
229
views
asked
Nov 8, 2018
0
votes
0
answers
27
SELF DOUBT
IF A=4.0 * 10 ^30 and B = - 4.0 * 10 ^30 AND c = 1.0 executed on a computer where floating point numbers are represented with 32 bits then after these steps or sequence whatever u call i.e. 1) Y:= A + C 2) Y:= Y + B what is the value of Y ??
IF A=4.0 * 10 ^30 and B = - 4.0 * 10 ^30 AND c = 1.0executed on a computer where floating point numbers are represented with 32 bitsthen after these steps or se...
162
views
asked
Nov 8, 2018
0
votes
0
answers
28
SELF DOUBT
i got floating-point number representation in which 0-23 MANTISSA 24-31 EXPONENT The exponent is in 2′s complement representation and the mantissa is in the sign-magnitude representation. The range of the magnitude of the normalized numbers in this representation is 0 to 1 0.5to 1 2 ^−23 to 0.5 0.5to (1−2 ^−23 )
i got floating-point number representationin which 0-23 MANTISSA24-31 EXPONENT The exponent is in 2′s complement representation and the mantissa is in the sign-magnitud...
337
views
asked
Nov 8, 2018
1
votes
0
answers
29
self doubt
there is a property implies in propositional logic i.e. ---> suppose p : he is honest , q : he is greedy ( anything u make according to u ) now p ---> q can be represented as 1) if p then q 2) if p,q 3) a sufficent condition for q is p 4) q ... . SO ANOTHER WAYS TO WRITE P-------> Q IF U HAVE ANY MORE THEN PLZZZ COMMENT AND PLZZZ ALSO TELL HOW R U IDENTIFYING THESE P AND Q
there is a property implies in propositional logic i.e. ->suppose p : he is honest , q : he is greedy ( anything u make according to u )now p - q can be represented as...
235
views
asked
Nov 5, 2018
0
votes
0
answers
30
SELF DOUBT
PLEASE explain what is operand forwarding and how we are going to implement this in stages during execution of the instruction ??? and also when to use it in according to question property and not when to use it ? pls check these questions of same concept also ... this phenomena . i am not getting it if someone got the link of operand forwarding from where should i hv done this plzz add
PLEASE explain what is operand forwarding and how we are going to implement this in stages during execution of the instruction ???and also when to use it in according to...
277
views
asked
Nov 3, 2018
CO and Architecture
co-and-architecture
pipelining
operand-forwarding
self-doubt
+
–
1
votes
1
answer
31
self doubt
Difference between both synchronous and asynchronous I/O on the based of ISR . Means when they are going to invoked during i/o completion ( i.e. before, after ?????? )
Difference between both synchronous and asynchronous I/O on the based of ISR . Means when they are going to invoked during i/o completion ( i.e. before, after ?????? )
302
views
asked
Nov 3, 2018
CO and Architecture
co-and-architecture
input-output
self-doubt
+
–
0
votes
0
answers
32
SELF DOUBT
S1 S2 S3 S4 I1: 1 2 1 2 I2: 2 1 2 1 I3: 1 1 2 1 I4: 2 1 2 1 Consider a pipeline processor with 4 stages S1 to S4. We want to execute the following loop for (i = 1; i < = 10; i++) {I1, I2, I3, I4} The output of I1 for i = 2 will be available after 11 ns 12ns 13 ns 28 ns
S1S2S3S4I1:1212I2:2121I3:1121I4:2121 Consider a pipeline processor with 4 stages S1 to S4. We want to execute the following loopfor (i = 1; i < = 10; i++) {I1, I2, I3, I4...
632
views
asked
Nov 2, 2018
CO and Architecture
co-and-architecture
pipelining
self-doubt
+
–
0
votes
1
answer
33
SELF DOUBT
hows STAR graph bipitrate ??? please help with example . i am doing this by 2 coloring method but not getting any point.
hows STAR graph bipitrate ???please help with example . i am doing this by 2 coloring method but not getting any point.
332
views
asked
Oct 31, 2018
Mathematical Logic
discrete-mathematics
+
–
0
votes
0
answers
34
SELF DOUBT
lots of doubt in standard walk , trail , path definitions . some approach questions with different definitions others different approach . what is the standard definition for them
lots of doubt in standard walk , trail , path definitions . some approach questions with different definitions others different approach .what is the standard definition ...
311
views
asked
Oct 31, 2018
0
votes
0
answers
35
SELF DOUBT
https://gateoverflow.in/449/gate2008-38 I AM NOT GETTING THAT WHY OPTION B IS NOT CORRECT FROM ANY EXPLANATION... PLZZ HELP..
https://gateoverflow.in/449/gate2008-38 I AM NOT GETTING THAT WHY OPTION B IS NOT CORRECT FROM ANY EXPLANATION...PLZZ HELP..
117
views
asked
Oct 30, 2018
CO and Architecture
co-and-architecture
self-doubt
+
–
0
votes
0
answers
36
self doubt
RISC HAS MORE REGISTER THAN CISC . I KNOW THIS STATEMENT IS TRUE BUT I AM NOT GETTING ENOUGH RESOURCE FOR THIS POINT VALIDATION . AS CISC HAS MORE THAN RISC IN EVERYTHING LIKE ADDRESSING MODES , INSTRUCTIONS AND MANY OTHER THINGS so at times i also ... in cisc due to having not good explanation .so please someone help me with this question with any example or any other thing
RISC HAS MORE REGISTER THAN CISC . I KNOW THIS STATEMENT IS TRUE BUT I AM NOT GETTING ENOUGH RESOURCE FOR THIS POINT VALIDATION .AS CISC HAS MORE THAN RISC IN EVERYTHIN...
225
views
asked
Oct 30, 2018
CO and Architecture
co-and-architecture
risc
cisc
self-doubt
+
–
0
votes
0
answers
37
self doubt
what is the principle of inclusion in cache . pleasse explain in simple terms
what is the principle of inclusion in cache . pleasse explain in simple terms
258
views
asked
Oct 15, 2018
CO and Architecture
co-and-architecture
cache-memory
inclusion
self-doubt
+
–
0
votes
0
answers
38
SELF DOUBT
https://gateoverflow.in/1693/gate1998-2-20 PLEASE SOMEONE HELP ME WITH THIS QUESTION ... NOT GETTING THE MEANING OF IT
https://gateoverflow.in/1693/gate1998-2-20PLEASE SOMEONE HELP ME WITH THIS QUESTION ... NOT GETTING THE MEANING OF IT
170
views
asked
Oct 11, 2018
0
votes
1
answer
39
SELF DOUBT
Suppose the domain set of an attribute consists of signed 3 digit numbers. What is the percentage of reduction in storage space of this attribute if it is stored as an integer rather than in character form? PLEASE EXPLAIN WHAT THIS QUESTION MEANS AND SOLUTION
Suppose the domain set of an attribute consists of signed 3 digit numbers. What is the percentage of reduction in storage space of this attribute if it is stored as an in...
214
views
asked
Oct 11, 2018
0
votes
0
answers
40
SELF DOUBT
Suppose a file F of size 16KB is shared by 100 processes, each process read the entire F 10 timessequentially, disk uses linked allocation policy to store both Inode and data of the file with block size512byte in FAT and Block Pointer takes 4bytes. The number of disk block access related to access thefile F in executing all the 100 processes is . PLEASE HELP WITH THE CONCEPT
Suppose a file F of size 16KB is shared by 100 processes, each process read the entire F 10 timessequentially, disk uses linked allocation policy to store both Inode and ...
123
views
asked
Oct 5, 2018
Page:
« prev
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register