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
1
answer
1
gate dummy question
there was a question of apti inwhich teachers represented as traingles educationries as circle what is the answer of that ques ?
there was a question of apti inwhich teachers represented as traingles educationries as circle what is the answer of that ques ?
1.2k
views
asked
Feb 3, 2019
0
votes
1
answer
2
Gate 19
The expenditure ______ as follows ...… Break down or breaks down
The expenditure ______ as follows ...…Break down or breaks down
2.5k
views
asked
Feb 3, 2019
0
votes
0
answers
3
MADE EASY CBT2
Consider a binary tree where for every node ⏐P - Q⏐ ≤ 2. P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for h > 0. The minimum number of nodes present in such binary ... NEED THAT NODE AT RIGHT SUBTREE DIDNT GET THAT ( 3RD NODE AT 2ND LEVEL WHY IS THAT THERE I THINK WITHOUT IT WE ARE SATISYING CONDITIONS
Consider a binary tree where for every node ⏐P – Q⏐ ≤ 2. P represents number of nodes in left sub tree for node S and Q represents the number of nodes in right su...
228
views
asked
Jan 23, 2019
0
votes
1
answer
4
MADE EASY CBT-2
THEY GIVE OPTIONS ARE 0 1 2 3 WHAT I DO WAS I PUT P=8,Q=4,R=2 AND X=16 AND THEN GET RESULT ACCORDING TO THAT AND MY RESULT WAS CLOSE TO 1 BUT THEY ARE GIVING ANSWER 0 BY SOME THEOREM WHICH I DONT KNOW CORRECT OR NOT anyones result 0 plzz prove that
THEY GIVE OPTIONS ARE 0123WHAT I DO WAS I PUT P=8,Q=4,R=2 AND X=16 AND THEN GET RESULT ACCORDING TO THAT AND MY RESULT WAS CLOSE TO 1 BUT THEY ARE GIVING ANSWER 0 BY SOM...
627
views
asked
Jan 23, 2019
0
votes
0
answers
5
SELF DOUBT
The number of totally ordered sets compatible to the given POSET are_________ IS IT TOPOLOGICAL SORT POSSIBLE OR TOTAL CHAINS POSSIBLE IN DIAGRAM
The number of totally ordered sets compatible to the given POSET are_________IS IT TOPOLOGICAL SORT POSSIBLE OR TOTAL CHAINS POSSIBLE IN DIAGRAM
246
views
asked
Jan 14, 2019
0
votes
0
answers
6
self doubt
what are comparison based algo properties ? there was a question dont remember much which they take random program and then there are options like 1) comparison based 2) stable 3) both 4 ) none of above that program is inplace for sure .... but altast ... based properties are not satisfied.... ( i know without question little difficult but i dont remember where i saw that question )
what are comparison based algo properties ?there was a question dont remember much which they take random program and then there are options like 1) comparison based 2) s...
366
views
asked
Jan 14, 2019
0
votes
0
answers
7
ME TEST SERIES DOUBT
A CPU Manufacturer company has two designs p1 and p2 for a synchronous pipeline processor. P1 has 5 pipeline stages with execution times of 3 ns, 4 ns, 3 ns, 2 ns, 4 ns while the design P2 has 6pipeline stage with 3 ns each (execution time). The time that can be saved by P2 over P1 for executing 1000 Instructions is _____________ ns. iam getting answer 997 but they give 1001
A CPU Manufacturer company has two designs p1 and p2 for a synchronous pipeline processor.P1 has 5 pipeline stages with execution times of 3 ns, 4 ns, 3 ns, 2 ns, 4 ns wh...
336
views
asked
Jan 11, 2019
CO and Architecture
co-and-architecture
pipelining
+
–
1
votes
0
answers
8
SELF DOUBT
Two CSMA/CD stations are each trying to transmit large files of multiple frames. After each frame is sent, they contend for the channel using the binary exponential back-off algorithm. The probability that the contention ends in round 3 is _____ (up to 3 decimal points)
Two CSMA/CD stations are each trying to transmit large files of multiple frames. After each frame is sent, they contend for the channel using the binary exponential back-...
624
views
asked
Jan 11, 2019
0
votes
0
answers
9
verbal ability
The question consists of five statements followed by options consisting of three statements put together in a specific order. Choose the option which indicates a valid argument, that is, where the third statement is a conclusion drawn from the preceding two statements. ... are sour. All sour things are tasteless. Some grapes are not tasteless. No grape is tasteless. cea bdc cbd eac
The question consists of five statements followed by options consisting of three statements put together in a specific order. Choose the option which indicates a valid ar...
396
views
asked
Jan 11, 2019
0
votes
0
answers
10
regarding networking syllabus
i am confused about networking syllabus .i studied this subject during may june i think but after that i didnt revise this subject that much means i revise subject half one or two times during these months but later half never . topics i done means revise ... now then in exam maybe i will not able to answer those questions ( just in loop right now in mind) .
i am confused about networking syllabus …….i studied this subject during may june i think but after that i didnt revise this subject that much means i revise subje...
245
views
asked
Jan 10, 2019
0
votes
0
answers
11
self doubt
Consider the string “GATE2000”, the number of non-trivial substrings of given string are i am constatly confused in these types of substrings questions please specify some resource or plzz derive how to solve these questions
Consider the string “GATE2000”, the number of non-trivial substrings of given string arei am constatly confused in these types of substrings questions please specify ...
748
views
asked
Jan 5, 2019
0
votes
1
answer
12
SELF DOUBT
Output will be- int main() { int a =0,b=1,c=3: *((a)?&b:&a)=a ? b : c; printf("%d %d%d ", a,b,c); } O/P AT LAST ?
Output will be-int main(){ int a =0,b=1,c=3:*((a)?&b:&a)=a ? b : c;printf("%d %d%d ", a,b,c);}O/P AT LAST ?
482
views
asked
Jan 3, 2019
0
votes
0
answers
13
SELF DOUBT
PLEASE ANYONE REFER ANY VIDEO OF DATA HAZARDS OR SOME NOTES SOME LINK ...NOT GETTING ENOUGH EXPLANATION OF DATA HAZARD HERE . IF SOMEONE KNOWS THE CONCEPT THEN Consider the following Instruction sequence I1: ADD R1,R2,R1 I2: LW R2,0(R1) I3: LW ... 4 (D) 1 then plss explain this question solution step by step otherwise give the link ? and cases like with pipelining without pipelining
PLEASE ANYONE REFER ANY VIDEO OF DATA HAZARDS OR SOME NOTES SOME LINK……………...NOT GETTING ENOUGH EXPLANATION OF DATA HAZARD HERE .IF SOMEONE KNOWS THE CONCEPT T...
2.0k
views
asked
Dec 31, 2018
CO and Architecture
co-and-architecture
data-hazards
+
–
0
votes
0
answers
14
SELF DOUBT ---
is there any difference between definitions of reducible and mapping reducible in decidability of toc ??? if any plzz explain
is there any difference between definitions of reducible and mapping reducible in decidability of toc ??? if any plzz explain
323
views
asked
Dec 31, 2018
0
votes
1
answer
15
SELF DOUBT_ RICE THEOREM
L = {<M1, M2>M1 and M2 are two TMs, and ε ∈ L(M1) \ L(M2) }. is it RECURSIVE OR RECURSIVE ENUMERABLE OR NOT EVEN RECURSIVE ENUM.
L = {<M1, M2>M1 and M2 are two TMs, and ε ∈ L(M1) \ L(M2) }.is it RECURSIVE OR RECURSIVE ENUMERABLE OR NOT EVEN RECURSIVE ENUM.
884
views
asked
Dec 29, 2018
Theory of Computation
rice-theorem
recursive-and-recursively-enumerable-languages
+
–
0
votes
1
answer
16
SELF_DOUBT
i have a line in my notes-------- IN Order to switch from User mode to Kernel mode during execution . we just have to change one Bit at hardware level.. I am not remembering concept plzz help
i have a line in my notes IN Order to switch from User mode to Kernel mode during execution . we just have to change one Bit at hardware level.. I am not remember...
339
views
asked
Dec 23, 2018
1
votes
1
answer
17
SELF DOUBT
L= { $a^n$b^n$ , n<10000 } it is regular language as still states are finite means we have create around 20000 states but still states are finite so it is regular . AM I GOING IN RIGHT DIRECTION ?????
L= { $a^n$$b^n$ , n<10000 }it is regular language as still states are finite means we have create around 20000 states but still states are finite so it is regular .AM I ...
240
views
asked
Dec 13, 2018
0
votes
0
answers
18
MADE EASY TEST SERIES
A memory page, which contained a variable which is used more than an average number of times any other variable is used, is removed from memory. This hints the use of: Least Recently Used policy First In First Out policy Most Recently Used policy Most ... frequnetly says that whichever most no . of times that is out but answer provided 2nd plzz correct me if i am wrong
A memory page, which contained a variable which is used more than an average number of times any other variable is used, is removed from memory. This hints the use of:Lea...
162
views
asked
Dec 5, 2018
0
votes
1
answer
19
multiple granuality
IS MULTIPLE GRANUALITY IN SYLLABUS ?? Multiple Granularity I already go through this link . but in test series they are asking questions again and again .if yes then please share some notes ……
IS MULTIPLE GRANUALITY IN SYLLABUS ??Multiple Granularity I already go through this link . but in test series they are asking questions again and again.if yes then pl...
232
views
asked
Dec 3, 2018
1
votes
0
answers
20
self doubt
Which of the following are the disadvantages of machine instruction approach to enforce mutual exclusion I) Busy waiting II) Starvation III) Deadlock all only 1 and 2 only 2and 3 only 1 and 3
Which of the following are the disadvantages of machine instruction approach to enforce mutual exclusionI) Busy waitingII) StarvationIII) Deadlockallonly 1 and 2only 2and...
1.7k
views
asked
Nov 28, 2018
Page:
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register