# Recent posts in Preparation Experience

1
Show that in a group of five people (where any two people are either friends or enemies), there are not necessarily three mutual friends or three mutual enemies.
2
All 3 test() are inside "PAR BEGIN, PAR END" so they execute concurrently..
3
@arjun sir why pi is taken as (ai + bi) , as it should be taken as (ai &oplus; bi)
4
I doubt the correctness of this solution, the diagram below; in Red Rectangle shows what this solution is suggesting, on the other hand the image in the Green Rectangle shows what is expected by the question. This solutions does not consider the fact that after $L_1$ on miss, the request is forwarded to $L_3$. How does this solution keeps that in perspective?
5

Hello fellow rankers, and future aspirants. Congratulations are in order for all the brilliant people whom i hope to meet soon, and also to the ones who weren’t fortunate enough to meet their own expectations this time around, but still have come out of this journey wiser and with renewed hope and determination for acing their next attempt.

I didn't plan on sharing my experience as there are already a lot of them out there which are a great read and frankly way more relatable to most people than what my experience is going to be.

Having said that, everyone is welcome in giving it a read and sharing their thoughts/comments/critiques, but do keep...

6
Consider a Processor with two Caches which it can access directly in parallel $L_1$(80% hit rate) and $L_2$(90% hit rate) with access times as 100ns and 200ns respectively. In case of miss in any of those it fetches the data from hard disk $L_3$(100% hit rate) which has a latency of 500ns. What is the average access time($T_{avg}$) of the organization?
7
i think it`s allowed under TWR (so, it will allow under MVTS ) the order is T1 > T2 > T3 the answer is A
8
All are DCFL?
9
Answer: D 3NF will be adequate for normal relational database design since 3NF tables are free of insertion, update, and deletion anomalies.
10
more details plzzz
11

Hi. My name is Tamal and I appeared for GATE CS twice in the years 2019 and 2020. I secured ranks of 1309 and 188 respectively and I am writing this blog to share my experience of the same. I primarily wanted to share this because during my preparatory phase of a year and a half I had highs and lows. Well, mostly lows than highs. And blogs that I used to read on this platform really helped me a lot. So I just wanted to do my bit for this wonderful community we’ve got going here. I also want to point out that it might be the case that my blog will only feel relatable to droppers and circuit branch students but hey, if you’re not amongst them, feel free to read it...

12
Answer should be (D) , An ICMP packet with a message type $3$ (Destination Unreachable) and a message code $3$ (Port Unreachable) lets you know that the machine you tried to reach is not listening on this port. When you nmap a machine on a port it's ... @ http://tools.ietf.org/html/rfc792 http://www.iana.org/assignments/icmp-parameters/icmp-parameters.xhtml http://www.faqs.org/rfcs/rfc792.html
13
both are true any function can be written in terms of minterms
14
but every time when i is incremented q is not incremented by loglogn.....for 1st iteration of i it is becoming loglog1..then for second loglog2..and so on till n....so finally it should be loglog1+loglog2+loglog3+..........+loglogn..
15
Actually it will be option C. The question written here has option C wrong. Actual option was c. {p,s}---> {s}
16
Arjun sir plz explain the (b) part,,i m not getting it.
17
Answer - B. Degree of generator polynomial is $3$ hence $3-bits$ are appended before performing division After performing division using $2$'$s$ complement arithmetic remainder is $011$ The remainder is appended to original data bits and we get $M' = 11001001\bf{011}$ from $M = 11001001.$ Courtesy, Anurag Pandey
18
can you convert this comment to an answer?
19
Can you provide explanation for Q.no 72 ??
20
C is Correct.