# Questions by Deepanshu

1
there was a question of apti inwhich teachers represented as traingles educationries as circle what is the answer of that ques ?
2
The expenditure ______ as follows ...… Break down or breaks down
3
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 tree of ... THEY 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
4
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
5
The number of totally ordered sets compatible to the given POSET are_________ IS IT TOPOLOGICAL SORT POSSIBLE OR TOTAL CHAINS POSSIBLE IN DIAGRAM
6
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 in ... comparison based properties are not satisfied.... ( i know without question little difficult but i dont remember where i saw that question )
7
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
1 vote
8
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)
9
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. Grapes ... grapes are sour. All sour things are tasteless. Some grapes are not tasteless. No grape is tasteless. cea bdc cbd eac
10
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 ---ip addressing , ... i done them now then in exam maybe i will not able to answer those questions ( just in loop right now in mind) .
11
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
12
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 ?
13
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 R1,4( ... (C) 4 (D) 1 then plss explain this question solution step by step otherwise give the link ? and cases like with pipelining without pipelining
14
is there any difference between definitions of reducible and mapping reducible in decidability of toc ??? if any plzz explain
15
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.
16
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
1 vote
17
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 ?????