Log In

Recent posts in Others

Hello sir How can we find the middle for given string ? here they mentioned Even length palindrome according to that we find middle Is this correct ?
posted Mar 24 in Others hitchh1ker
edited Mar 24 by hitchh1ker

Hello Everyone,

Gate result is out,  Please log in onto the appsgate website and check your result and let’s discuss here, what is the possibility about the colleges and arjun sir please update the college predictor app with the new gate result

posted Mar 19 in Others shgarg 1,061 views
answer is A) 5.56E+004 8.12e+268 e Scientific notation (mantissa/exponent), lowercase E Scientific notation (mantissa/exponent), uppercase
posted Mar 7 in Others gatecse
closed Mar 8 by gatecse
Thank you sir...and as the signals are getting lost their corresponding iterations will be missed out in Process Y. Am I correct?
posted Feb 18 in Others shgarg
edited Feb 18 by shgarg
Delay for generating C is 1 AND + 1 OR = 1.2 + 1.2 = 2.4 ms y 1 and here ??? shd 2 and 3 * delay for carry this 3 due to 4 bit binary adder ryt ???
posted Feb 16 in Others himanshu19 5,683 views
Yes , context switch takes less time . threads are smaller and so the contain of the thread is also small . so the swapping during context switch take less time , its not the main reason though ( partial reason :P ) . the main reason i think when context switch ... program context switch occurs without any help taken from OS (means mode change does`nt required ) , it is done by the program . peace
posted Dec 13, 2020 in Others Shiva Sagar Rao 3,991 views
0 means lowest vertex in the Hasse diagram (f in this case). 1 means highest vertex in the Hasse diagram (a in this case).
posted Nov 2, 2020 in Others ijnuhb
edited Dec 8, 2020 by ijnuhb
@arjun sir is fully correct now I am going to discuss about why frame transmission time must be >= 2 * prop. Time In csma/cd the sender doesn't holds a copy after it has sent a frame so the sender sends a frame now if a collision is detected it resends after ... If the sender is still transmitting then only it can resend it else not. That's reason why frame transmission time must be > 2 prop. Time
posted Sep 1, 2020 in Others Navneet Singh Tomar
edited Apr 26 by Navneet Singh Tomar
why option "b" is stupid?
posted Jun 25, 2020 in Others yagneshmb
edited Jun 25, 2020 by yagneshmb
Not reflexive - $(4,4)$ not present. Not irreflexive - $(1, 1)$ is present. Not symmetric - $(2, 1)$ is present but not $(1, 2)$. Not antisymmetric - $(2, 3)$ and $(3, 2)$ are present. Not Asymmetric - asymmetry requires both antisymmetry and irreflexivity. It is transitive. So, the correct option is $B$. transitive.
posted May 7, 2020 in Others Arjun
edited May 9, 2020 by Arjun
A[2] is a second element of array A or third element of A in C ...
posted Mar 30, 2020 in Others TheDaniel 1,550 views
Answer is (c) Xb must be 1 because both P(S) and V(S) operations perform Pb(Xb) first. So if Xb= 0 then all the processes performing these operations will be blocked. Yb must be 0. otherwise two processes can be in critical section at the same time, when s=1 and Yb=1 . So Yb must not be 1.
posted Mar 18, 2020 in Others mehul vaidya 666 views
sir normally instructions are sequential (untill unless branch) thats why m taking instructions as example. same concept for accessing sequential data i.e. array access.. Eements of an array are neighbors in memory, and are likely to be referenced one after the other.
posted Mar 18, 2020 in Others mehul vaidya 864 views
p will depart at t = 11
posted Mar 16, 2020 in Others Hira Thakur
edited Nov 18, 2020 by Hira Thakur
record size = 64B no of records = 16k total size of records = 64*16k no of block to store records = 64*16k/512 = 2k key size = 14B Address size = 2B no of block for 1st level index = no of keys *key size / block size = 2k * (14+2)/ 512 = 64 block no block for second level index = 64*16/512 = 2 no ofof block for 3rd level index = 2*16/512 = 1 block total 3 level indexing.
posted Mar 15, 2020 in Others parabol 898 views
When window scaling happens, a 14 bit shift count is used in TCP header. sir why 14 bit only ?? any reason or just an assumption ??
posted Mar 14, 2020 in Others Dee
edited Mar 14, 2020 by Dee
Consider the relation R(ABCD) with FD's set F={ AB->CD,C->.A,D->B} which of the following is false ? 1.C->A is a partial Dependency 2.C->A is a transitive Dependency 3.D->B IS A Partial dependency 4. All of these
posted Feb 24, 2020 in Others Hira Thakur
edited Apr 15, 2020 by Hira Thakur
Answer: B For correction:$\left\lfloor \dfrac{(\text{Hamming Distance} - 1)}{2}\right\rfloor$ $=\big\lfloor1.5\big\rfloor=1\text{ bit error}$. For detection:$\text{ Hamming Distance - 1 = 3 bit error}$.
posted Feb 14, 2020 in Others mkagenius 1,142 views
Okay sir :) yes i read that in morris manno (R compliment ) compliment is 10^n - number where n is no digit in number (Integer part ) And suppose if i want to find diminished compliement (R-1 )then it is 10^n- 10^-m- number where n is no of digit in integer part m is the number of digit in fractional part
posted Feb 13, 2020 in Others Hira Thakur 1,348 views