Register
Filter

Recent activity by Kaurbaljit

1 answer
2
ISI2014-DCG-44
The function $f(x)=\sin x(1+ \cos x)$ which is defined for all real values of $x$ has a maximum at $x= \pi /3$ has a maximum at $x= \pi$ has a minimum at $x= \pi /3$ has neither a maximum nor a minimum at $x=\pi/3$
The function $f(x)=\sin x(1+ \cos x)$ which is defined for all real values of $x$has a maximum at $x= \pi /3$has a maximum at $x= \pi$has a minimum at $x= \pi /3$has neit...
1 answer
3
ISI2014-DCG-47
The value of the definite integral $\int_0^{\pi} \mid \frac{1}{2} + \cos x \mid dx$ is $\frac{\pi}{6} + \sqrt{3}$ $\frac{\pi}{6} - \sqrt{3}$ $0$ $\frac{1}{2}$
The value of the definite integral $\int_0^{\pi} \mid \frac{1}{2} + \cos x \mid dx$ is$\frac{\pi}{6} + \sqrt{3}$$\frac{\pi}{6} - \sqrt{3}$$0$$\frac{1}{2}$
4 answers
5
GATE CSE 1993 | Question: 6.8
The details of an interrupt cycle are shown in figure. Given that an interrupt input arrives every $1$ msec, what is the percentage of the total time that the CPU devotes for the main program execution.
The details of an interrupt cycle are shown in figure.Given that an interrupt input arrives every $1$ msec, what is the percentage of the total time that the CPU devote...
5 answers
6
GATE CSE 1998 | Question: 18
For a set-associative Cache organization, the parameters are as follows: ... $1 \leq m \leq l$. Give the value of the hit ratio for $l = 1$.
For a set-associative Cache organization, the parameters are as follows:$$\begin{array}{|c|l|} \hline \text {$t _c$} & \text{Cache Access Time }\\\hline \text{$t _m$} &...
8 answers
9
GATE CSE 1997 | Question: 6.4
Which one of the following regular expressions over $\{0,1\}$ denotes the set of all strings not containing $\text{100}$ as substring? $0^*(1+0)^*$ $0^*1010^*$ $0^*1^*01^*$ $0^*(10+1)^*$
Which one of the following regular expressions over $\{0,1\}$ denotes the set of all strings not containing $\text{100}$ as substring?$0^*(1+0)^*$$0^*1010^*$$0^*1^*01^*$$...
2 answers
12
GATE CSE 1999 | Question: 2.25
Which of the following is/are correct? An SQL query automatically eliminates duplicates An SQL query will not work if there are no indexes on the relations SQL permits attribute names to be repeated in the same relation None of the above
Which of the following is/are correct?An SQL query automatically eliminates duplicatesAn SQL query will not work if there are no indexes on the relationsSQL permits attri...
6 answers
13
GATE CSE 2014 Set 2 | Question: 30
Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are $3$ ... $s(S)$ is more than $0.5$. join selection factor between $r(R)$ and $s(S)$ is less than $0.5$.
Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are $3$ buffers each of size equal to disk block size, out of w...
0 answers
22
matchings in bipartite graph
1 answer
23
#ER_diagrams #self_doubt
If A,B and C have 30,50,70 tuples respectively.Then maximum no of triples possible of entities <A,B,C> that could be in the relation R?
If A,B and C have 30,50,70 tuples respectively.Then maximum no of triples possible of entities <A,B,C that could be in the relation R?
2 answers
24
Flip Flop Conversion
A new two input Flip Flop is designed as shown. Table shows the characteristic table of AB flip flop.The Combination Logic is :- A. B. C. D.
A new two input Flip Flop is designed as shown. Table shows the characteristic table of AB flip flop.The Combination Logic is :- A. B. C. D.
1 answer
25
Number of States in TOC
Number of $2$ state DFA with designated initial state can be constructed over alphabet $\sum_{.}^{.}=\left \{ 0,1 \right \}$ and that accept empty language $\Phi$ is_______________
Number of $2$ state DFA with designated initial state can be constructed over alphabet $\sum_{.}^{.}=\left \{ 0,1 \right \}$ and that accept empty language $\Phi$ is____...
1 answer
27
Madeeasy workbook
Q-21
Q-21
4 answers
28
GATE CSE 1989 | Question: 12a
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted into the $B^+$ tree. Obtain the modified $B^+$ tree after insertion.
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted...