Gate has tricky questions rather than hard. In that state of mind, there are more chances to go wrong, not because of not remembering the formula but because of missing out some essential points.

Comment "Remember to ... " points to bring all such points under one post. For eg.

Remember to convert byte to bits in length on frame in Computer Network problems
posted in Others Feb 2, 2018
2,016 views
0
Like
0
Love
0
Haha
0
Wow
0
Angry
0
Sad

12 Comments

12 Comments

Like
Remember to convert bits-bytes while solving questions on cache size,page table size
Like
Remember to note down first B / B+ tree and then leaf / non-leaf node first. That will help deriving formula :)
Like
first order...for all and there exists one....check order,implication, equivalence....sufficient and necessary condition....unless condition.

algorithms...best case worse case....if asked to find most efficient algorithm for a problem..try all possible ways to get the least complexity.Recursions,always trace out ,check the values of variables which returning,if static or not,post,pre increment.Dry run code with keeping track of variables,there is no breakpoint here...:P

automata -- language and its power...union intersection....take atleast 2-3 examples if you forget a direct property.

databases -- normalizations...check candidate keys and partial,transitive or prime to prime dependencies..

digital -- checking prime,essential implicants...the diagram can become clumsy....
Like

Pipelining in COA and Pipelining in Computer Network Remember (packets frame...)

 

Like
Subnetting supernetting CIDR ! Zero address 1 address instructions CO, Aloha concepts, Planarity in Graphs... etc
Like
Remember to check if they are asking to find tag bits or tag memory size, in cache mapping problems
Like
Tag memory is tag bits * number of lines, right?
Like
Yes :)
Like
Depend upon the mapping
for direct, tag memory size  = number of lines * tag bits
for associative mapping, tag memory size  = number of lines * tag bits
for set associative, tag memory size = number of sets * number of lines in each set * tag bits
Like

ME 2018

Like
Nice. Thanks :)
Like
Thanks ...