Recent posts tagged admissions

1
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$
2
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...
3
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) =...
4
{∅ } this can be treated as an empty BAG with one elements as ∅ means with cardinality one.??
5
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...
6
7
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 ...
8
$2(n-1)$ the spanning tree will traverse adjacent edges since they contain the least weight.
9
What is feedback on Y indicating...?Do we need to take into account...since it is a combinational circuit
10
answer - CThere are 2 decision points in this module1. while condition and2. if conditionhence cyclomatic complexity = number of decision points + 1 = 3
11
Only 1 node will be there . (20,25) only
12
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) ...
13
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...
14
How query 2 will not produce the correct result?I am getting the desired result from query 2.
To see more, click for the full list of questions or popular tags.