search
Log In

Recent posts in Preparation Advice

1
You should know the precedence rule. $\to$ has higher precedence than quantification.
posted Mar 31 in Preparation Advice Arathi Nair
reshown Apr 1 by Arathi Nair
1,246 views
2
For empty string as language, q0 as final states gives 16 DFAs. But when both q0 and q1 are final states we must ensure none of the transitions go to q1 from q0. This reduces the possible DFAs to $4$ as we have 2 choices for each {0, 1} transitions from q1 (either to q0 or to q1 itself). So, totally 16 + 4 = 20 DFAs.
posted Mar 29 in Preparation Advice Harshq 2,135 views
3
according to my understanding, there are only 4 pages in the main memory (which should be 0,1,2,3) and then each page is 16 bytes (so, 16*4=64 bytes) should be the total main memory size. then how come there are pages 4 and 5 and how could address generated be more than 64 (6 bits). there is seriously something wrong with my concept. please can anyone help.?
posted Mar 24 in Preparation Advice Sarvagya S Mamgain 597 views
4
$\lim_{x\rightarrow \frac{\pi}{2}}{( \sin x)}^{\tan x}$
posted Mar 23 in Preparation Advice Sarvagya S Mamgain 587 views
5
Cache memory size must include the size of tag memory also, though here it is almost negligible.
posted Mar 23 in Preparation Advice Sarvagya S Mamgain 459 views
7
In this question why there is 1 cache miss for the first 64 bytes of array ..Plz explain.....
posted Aug 23, 2020 in Preparation Advice ankitadey
edited Jan 27 by ankitadey
3,007 views
8
Yeah why not you have found a solution it cab be one of the option but always choose the best one
posted Aug 16, 2020 in Preparation Advice spsahu 1,718 views
9
hi I have already posted the same thing . Please have a look ! My question is different !
posted Aug 15, 2020 in Preparation Advice Shivangi bithel
retagged Aug 15, 2020 by Shivangi bithel
1,643 views
10

I am Nitish Gupta and I secured AIR-13 with a score of 950/1000 in GATE CS 2020. I am in the final year of my Graduation at CCET, Chandigarh and therefore this was my first attempt. I’d like to share the key points related to my preparation so that it can help future aspirants.

I joined a classroom course at a GATE Coaching GATEGURUS here in Chandigarh and most of the theory was covered by the classroom coaching. But doesn’t matter if you join a well-known coaching, online coaching or study using standard books, once you collect the theory from these sources, it all comes...

posted Apr 28, 2020 in Preparation Advice NitishD2 5,298 views
11
'exactly one' is a subset of 'atleast one'. Both are not equivalent.
posted Mar 16, 2020 in Preparation Advice Gate Fever 577 views
12

Those who want to prepare for coding rounds for various colleges/company interviews, please check out this link.

I find this link really helpful

https://www.geeksforgeeks.org/must-do-coding-questions-for-companies-like-amazon-microsoft-adobe/

posted Feb 29, 2020 in Preparation Advice Gate Fever
edited Feb 29, 2020 by anonymous
791 views
13
Link Utilization $=\dfrac{\text{Amount of data sent}}{\text{Max. amount of data that could be sent}}$ Let $x$ ... $L=40\times 64\ bits=40\times \dfrac{64}{8}\ bytes=40\times 8\ bytes=320\text{ bytes (answer)}$
posted Jul 9, 2019 in Preparation Advice Manu Thakur 2,561 views
14
(A) P-Home, Q-Power, R-Defense, S-Telecom, T-Finance : X (R wants either Home or Finance or no portfolio) (B) R-Home, S-Power, P-Defense, Q-Telecom, T-Finance: Valid (c) P-Home, Q-Power, T-Defense, S-Telecom, U-Finance: X (U does not want if S gets one of the five) (d) Q-Home, U-Power, T-Defense, R-Telecom, P-Finance: X( R wants either Home or Finance or no portfolio)
posted Jun 28, 2019 in Preparation Advice Arjun
edited Jun 28, 2019 by Arjun
3,007 views
15
The total number of nodes accessed including root will be 5. The order is, (9)-->(5)-->(5,7)-->(9,11)-->(13,15).
posted May 19, 2019 in Preparation Advice Anuj Mishra
edited May 22, 2019 by Anuj Mishra
4,636 views
16
Which one of the following is the recurrence equation for the worst case time complexity of the quick sort algorithm for sorting $n$ ( $\geq $ 2) numbers? In the recurrence equations given in the options below, $c$ is a constant. $T(n) = 2 T (n/2) + cn$ $T(n) = T ( n - 1) + T(1) + cn$ $T(n) = 2T ( n - 1) + cn$ $T(n) = T (n/2) + cn$
posted Apr 25, 2019 in Preparation Advice VIKAS PARA 514 views
17
3! * S(4, 3) = 3! * 6 = 36 https://gateoverflow.in/5596/no-of-surjective-functions http://www.math.uiuc.edu/~kostochk/math413/comb.pdf
posted Apr 17, 2019 in Preparation Advice I_am_winner 995 views
18
Correct Option: D $foo$ is printing the lowest digit. But the $printf$ inside it is after the recursive call. This forces the output to be in reverse order $2, 0, 4, 8$ The final value $sum$ printed will be $0$ as $C$ uses pass by value and hence the modified value inside $foo$ won't be visible inside $main$.
posted Apr 8, 2019 in Preparation Advice Akash Mishra
recategorized Apr 8, 2019 by Akash Mishra
1,050 views
19
Given 32 bits representation. So, the maximum precision can be 32 bits (In 32-bit IEEE representation, maximum precision is 24 bits but we take best case here). This means approximately 10 digits. A = 2.0 * 1030, C = 1.0 So, A + C should make the 31st digit to 1, which is surely outside the precision level ... + b; float x = a + b; printf("x = %0.25f\n",x); x = x + c; printf("x = %0.25f\n",x); }
posted Apr 6, 2019 in Preparation Advice Arjun
edited Apr 6, 2019 by Arjun
1,447 views
20
bcz in the question itsself given i.e conditional instructions evaluate in the 3rd stage , so there will be 2 stall cycle.
posted Mar 30, 2019 in Preparation Advice Arjun
edited Mar 30, 2019 by Arjun
2,275 views
...