0 votes
1
For $a,b\epsilon Real$ define $aRb$ iff $a^{2}+b^{2}>2$.Is it Reflexive, Symmetric or Transitive?
0 votes
2
Hello anyone can help me to find big O for this algorithm please.... f=1;x=3;for (int i = 1; i <= n; i*=2) for (int j = 1; j <= i * i; j++) if (i % j == 0) ...
1 votes
5
n/100= Ω(n)Is this True or False explain
1 votes
6
Q.1 int A(int n){if(n==2) return 1;else{for(int j=1;j<=n;j++)printf(" * ");return(A(√n));}} Time complexity
0 votes
7
FIND THE TIME COMPLEXITYint i=1,j; for(;i <= n;i + +) { for(j = i; j <= nlogn; j∗= 2) { sum++; } }
0 votes
8
Find the complexity of the following function when called with some integer n:void foo(n) { int i,j,k,x=0; for (i=1 ; i <= n ; i++) for (j=1 ; j <= i * i ; j++) for ( k ...
0 votes
9
How can we apply Masters theorem to these equations : T(n) = 16*T(n/4) + n!and T(n) = 4*T(n/2) + cnPlease explain the process.
0 votes
10
0 votes
13
A Block contain 32 IP addresses. which of the following can be first address of the block ? and why?a. 201.55.16.16b. 201.55.16.8c. 201.55.16.160d. 201.55.16.24
2 votes
15
2 votes
16
Consider the following scenario during insertion sort when the array looks like the following:{25,75,95,125,80,5,10}The number of comparisons that it will further take fo...
0 votes
18
1 votes
19
0 votes
20
In TCP checksum is mandatory but in UDP checksum is optional. Why ?
0 votes
21
1 votes
22
Which of the Algorithm gives long average waiting time?(a) SJF (b) Round Robbin (c) FCFS (d) All of the above
0 votes
23
Answer is 4/14 or 4/13??
0 votes
26
Why 2nd statement false
0 votes
27
1 votes
28
which of the require the executing code to be in kernel mode.A)Performing a semaphore 'P' operation.B)Making a system callC)Disabling interrupt.D)Both b and c
0 votes
29