Recent posts tagged admissions

Let $A, B$ be sets. Let $\bar{A}$ denote the complement of set $A$ (with respect to some fixed universe), and $( A - B)$ denote the set of elements in $A$ which are not i...

A marine biologist wanted to estimate the number of fish in a large lake. He threw a net and found $30$ fish in the net. He marked all these fish and released them into t...

Cylinder capacity = 8*64*1 Kb = 512 kBSeek time = 8msRotational latency = 1/2*revolution time = 60/3600*2 = 8.3 msMB means we need 10 cylinder, so 9 times tack to track a...

RAW dependency are those in which one instruction tries to read before its write operation and also they are occured only in adjacent instruction:1.ADD R1 , R2, R2; ADD R...

Loads of thanks for figuring out my mistake sir, you are right.I messed it up. I am no way right when I am saying b>=a implies f is a surjection. So we can not just play ...

Hey,I have 69.1 % in B.Tech , will I be eligible to apply for IIT Delhi on basis of GATE score? I saw the website and it says 75% or 8.5 GPA.

ohhh i was wrong basically wht i read was just a small example of spin lock . the exact definition is here .a spinlock is a lock which causes a thread trying to acquire i...

NO.Priority Inversion Problem :Lets Consider one example: Tasks:High Priority (H) Medium Priority (M)Low Priority (L)and a lock X, may be semaphore_lock(X).(lock is requi...

can give a informal proof to remember. the set of all string of a language is countable where as the set of all languages is uncountable because we can put all the string...

Yes, you are right, I am sorry,I did not cared that we can only use one time.

an element z ∊ N is called an identity for f, if f (a, z) = a = f(z, a), for all a ∊ N$x^1 = x$ but $1^x=1$

i think the answer is c . The option is definitely going to rule out by the point that we do paging to reduce or totally remove internal fragmentation. that why we keep p...

A [3] = *(*(A+2) + 3)Now, A is declared as int *A[10]- Array of pointers to int which is const pointer to pointer to int. So, *A is pointer to int.A+2 = A + size of(*A) =...

{∅ } this can be treated as an empty BAG with one elements as ∅ means with cardinality one.??

The baud rate is the rate at which information is transferred in a communication channel.Serial ports use two-level (binary) signaling, so the data rate in bits per secon...

so , answer should be (a) , (b) and (c) are TRUE .

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 ...

$2(n-1)$ the spanning tree will traverse adjacent edges since they contain the least weight.

What is feedback on Y indicating...?Do we need to take into account...since it is a combinational circuit

answer - CThere are 2 decision points in this module1. while condition and2. if conditionhence cyclomatic complexity = number of decision points + 1 = 3

Only 1 node will be there . (20,25) only

There is no limit on a large value being considered. f(n)= n^0.0000001 = n^(10^-7)g(n)=lg n(base 2)n= 10^8 f(n)= 1.000001842 , g(n)=26.565Now, I take n = 10^(10^8)f(n) ...

The function terminates for all powers of $2$ (which is infinite), hence (i) is false and (ii) is TRUE.Let $n = 5. $Now, recursive calls will go like $5 - 14 - 7 - 20 - 1...

How query 2 will not produce the correct result?I am getting the desired result from query 2.

Collection is in BCNF because Title, Author is a super key.