# Recent posts in Announcements

1
Ans is c Large memory overhead would there.To reduce it use multi level paging will be used.
2
False : Consider $E: \{1,2,3,4\}$, $F:\{3,4,5,6\}$ $f(E) = \{5,6,7,8\}$ $f(F)=\{7,8,11,6\}$ $f(E \cap F) = \{7,8\}$ where as, $f(E) \cap f(F) = \{6,7,8\}$ Becomes TRUE only when $f$ ... $f(E \cap F) \subseteq f(E) \cap f(F)$ $\subseteq$ becomes $=$ only when $f$ is one-one - when the mappings are unique for each element.
3
yeah arjun sir ... &empty; is subset for all sets..
4

## BITS HD 2021 FORMS ARE OUT.

BITS HD 2021 Exam fee details Last Date 29/05/2021 BITS HD Online Test 26th & 27th June 2021

For more visit here: Important Dates

Admission can take either gate mode or non-gate mode or you can apply in both modes. Apply for both computer...
5
He got M=&Sigma;* as an example to show that it L$\bigcap$M can be CFL but not regular . L$\bigcap$M will always be CFL but may or may not be regular.
6
remember this as a standard formula .as it always give answer as 0
7
It just means the main memory has space for 4 pages. And 64 will be the physical address bits not virtual address bits.
8

Hello EveryOne...!! We would like to use your comments as a Testimonial to help future GATE Aspirants, that they can benefit from preparing with GATE. Please add a Testimonial under the Testimonials category and the 2021 subcategory.

https://gateoverflow.in/blog/new

9
My question: Should we include dirty bit and vaild-invalid bit in this calculation ? Please comment
10
8 million = 8*2^10*2^10 =2^23 So address is 23 bits. Word offset its = 6 (2*6=64) No of bits to identify a Block= 8(2^8 = 256) No of bits to indentify tag= 23-6-8=9 1) Additional memory for tag=(256*9)/8= 288 bytes 2) Total size of the cache =Cache size +Tag memory + Dirty bit memory +Valid bit memory =256*64 +(256*9)/8 + 256/8 + 256/8
11

Duolingo: Quick, Easy, and Free Way to Learn A Language.

No test centers. No appointments. You can take the Duolingo English Test online.

This English test has similar sections like IELTS. The four sections on the basis of which a candidate’s proficiency is tested are

Listening

Writing

Speaking

Accepted by many universities across the globe.

These days many are opting for Duolingo English...

12
SIR ACCORDING TO UR WIKIPEDIA its answer should be inner join because in question it is mentioned that we r selecting table1.column & table2.column so only same column produced two times in inner join and in equi join only same column produced only one times sir plzzz clear my doubts
13
i got your point ...but answer is none of these :p :) thank you!
14
In each tree we have k-1 edges for k vertices. So, for t trees with total n vertices (all trees are disconnected in a forest) we would have n-t edges.
15
answer of of 4.12 is c) 10 as in DVR the routers rely completely on their neighbour Routers .So N2 , N4 will send their distance vector to N3 and N3 will find out that in order to reach N1 the option I have are: 1) infinity (from N1)+ 2(N1 N2 distance ) =infinity 2)8 (from N4 )+ 2 (N4 N3 distance)= 10 N3 will choose the minimum of two which is 10.
16
Thank you sir .
17
ohk arjun sir
18
P q p<->q p&rarr;&not;q T T T F T F F T F T F T F F T T Can you please explain how p<->q does not imply p&rarr;&not;q is false?
19

There have been a lot of queries about GO book for GATE which was last made for GATE 2019. It'll be made for GATE 2021 and here is the expected schedule.

March 20: Pre-booking starts May 20: Book starts shipping for those who preordered June 1: Softcopy will be made available at http://book.gateoverflow.in -- same as the hardcopy June 5: Book will be available from Amazon

Compared to the previous book, new one will have

Questions from...
20
To identify a Binarytree uniquely minimun pre order + in order or post order + in order is needed . with only pre order , or only in order ,or only post order or pre order + post order we may can form more than one Binary tree .