Register
Filter

Recent activity by sarbesh

0 answers
1
programming
int x = 0, i; for (i = 0; i < 10, i++) if (i%2 && x++) x += 2; value of x after execution ?
int x = 0, i;for (i = 0; i < 10, i++)if (i%2 && x++)x += 2; value of x after execution ?
2 answers
2
Programmming
int main(){ int a =5; printf("%d %d %d %d %d ",a++,a--,++a,--a,a); } Output is "4 5 5 5 5". How????
int main(){int a =5;printf("%d %d %d %d %d ",a++,a ,++a, a,a);}Output is "4 5 5 5 5". How????
3 answers
3
Binary tree
Every full binary tree is also a complete binary tree true false
Every full binary tree is also a complete binary treetruefalse
1 answer
4
NULL * 0 = 0 or NULL
1) NULL * 0 = 0 or NULL ? 2) CAN UNIQUE KEY CONTAIN MULTIPLE NULL VALUES
1) NULL * 0 = 0 or NULL ? 2) CAN UNIQUE KEY CONTAIN MULTIPLE NULL VALUES
1 answer
5
Normalisation
It is said that if a relation is in bcnf then it is also in 3nf. Then why a lossless and non-dependency preserving decomposition qualifies to be in bcnf but not in 3nf. I am not getting it. Please clear my concept.
It is said that if a relation is in bcnf then it is also in 3nf. Then why a lossless and non-dependency preserving decomposition qualifies to be in bcnf but not in 3nf. I...
1 answer
6
Tell One protocol of contention free Category?
How do Contention free protocols differ from Contention oriented protocols ? Tell about one protocol of contention free category ?
How do Contention free protocols differ from Contention oriented protocols ? Tell about one protocol of contention free category ?
1 answer
7
Self Doubt
What is the meaning of processing time at source and destination? Under processing time what task happens?
What is the meaning of processing time at source and destination? Under processing time what task happens?
2 answers
8
CN by Andrew S. Tanenbaum
goals of computer networks
goals of computer networks
1 answer
9
GATE CSE 1987 | Question: 1-xxiv
The simplex method is so named because It is simple. It is based on the theory of algebraic complexes. The simple pendulum works on this method. No one thought of a better name.
The simplex method is so named because It is simple.It is based on the theory of algebraic complexes.The simple pendulum works on this method.No one thought of a better n...
4 answers
10
GATE CSE 1987 | Question: 10a
Solve the recurrence equations: $T(n) = T(n - 1)+ n$ $T(1) = 1$
Solve the recurrence equations:$T(n) = T(n - 1)+ n$$T(1) = 1$
1 answer
12
ISRO2014-19
The number of bit strings of length $8$ that will either start with $1$ or end with $00$ is? $32$ $128$ $160$ $192$
The number of bit strings of length $8$ that will either start with $1$ or end with $00$ is?$32$ $128$ $160$ $192$
1 answer
13
ISRO2014-7
What does a pixel mask mean? string containing only $1\text{'s}$ string containing only $0\text{'s}$ string containing two $0\text{'s}$ string containing $1\text{'s}$ and $0\text{’s}$
What does a pixel mask mean?string containing only $1\text{'s}$string containing only $0\text{'s}$string containing two $0\text{'s}$string containing $1\text{'s}$ and $0\...
1 answer
15
ISRO-2013-53
A CPU scheduling algorithm determines an order for the execution of its scheduled processes. Given 'n' processes to be scheduled on one processor, how many possible different schedules are there? $n$ $n^{2}$ $n!$ $2^{n}$
A CPU scheduling algorithm determines an order for the execution of its scheduled processes. Given 'n' processes to be scheduled on one processor, how many possible diffe...
1 answer
18
ISRO2011-77
In a system using single processor, a new process arrives at the rate of six processes per minute and each such process requires seven seconds of service time. What is the CPU utilization? 70% 30% 60% 64%
In a system using single processor, a new process arrives at the rate of six processes per minute and each such process requires seven seconds of service time. What is th...
2 answers
19
ISRO2009-62
If $\text{A, B, C}$ are any three matrices, then $\text{A}'+\text{B}'+\text{C}' $ is equal to a null matrix $\text{A + B + C}$ $\text{(A + B + C)}'$ $\text{-(A + B + C})$
If $\text{A, B, C}$ are any three matrices, then $\text{A}'+\text{B}'+\text{C}' $ is equal toa null matrix$\text{A + B + C}$$\text{(A + B + C)}'$$\text{-(A + B + C})$
3 answers
20
ISRO2007-15
Consider the following pseudo-code x:=1; i:=1; while (x <= 1000) begin x:=2^x; i:=i+1; end; What is the value of i at the end of the pseudo-code? 4 5 6 7
Consider the following pseudo-codex:=1; i:=1; while (x <= 1000) begin x:=2^x; i:=i+1; end;What is the value of i at the end of the pseudo-code?4567
3 answers
22
ISRO2007-23
Study the following program //precondition: x>=0 public void demo(int x) { System.out.print(x % 10); if (x % 10 != 0) { demo(x/10); } System.out.print(x%10); } Which of the following is printed as a result of the call demo $(1234)$? $1441$ $3443$ $12344321$ $43211234$
Study the following program//precondition: x>=0 public void demo(int x) { System.out.print(x % 10); if (x % 10 != 0) { demo(x/10); } System.out.print(x%10); }Which of the...
2 answers
23
ISRO2008-12
In the given network of AND and OR gates $f$ can be written as $\text{X}_0\text{X}_1\text{X}_2 \dots \text{X}_n + \text{X}_1\text{X}_2 \dots \text{X}_n + \text{X}_2\text{X}_3 \dots \text{X}_n + \dots + \text{X}_n$ ...
In the given network of AND and OR gates $f$ can be written as$\text{X}_0\text{X}_1\text{X}_2 \dots \text{X}_n + \text{X}_1\text{X}_2 \dots \text{X}_n + \text{X}_2\text{X...