GATE CSE
D = 2
for i = 1 to n do
for j = i to n do
for k = j + 1 to n do
D = D * 3
A canonical set of items is given below
$$\eqalign{ & S \to L. > R \cr & Q \to R. \cr} $$On input symbol < the set has
[S1] The computational overhead in link state protocols is higher than in distance vector protocols.
[S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol.
[S3] After a topology change, a link state protocol will converge faster than a distance vector protocol.
(P) RSA
(Q) SHA-1
(R) DES
(S) MD5
int MyX(int *E, unsigned int size){
int Y = 0;
int Z;
int i,j,k;
for(i = 0; i < size; i++)
Y = Y + E[i];
for(i = 0; i < size; i++)
for(j = i; j < size; j++){
Z = 0;
for(k = i; k <= j; k++)
Z = Z + E[k];
if(Z > Y)
Y = X;
}
return Y;
}
The value returned by the function MyX is theS1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL.
S2: Given the table R(a,b,c) where a and b together form the primary key, the following is a valid table definition.
CREATE TABLE S (
a INTEGER,
d INTEGER,
e INTEGER,
PRIMARY KEY (d),
FOREIGN KEY (a) references R)
Which one of the following statements is CORRECT?
Given the following schema:
employees(emp-id, first-name, last-name, hire-date, dept-id, salary)
departments(dept-id, dept-name, manager-id, location-id)
You want to display the last names and hire dates of all latest hires in their respective departments in the location ID 1700. You issue the following query:SQL> SELECT last-name, hire-date
FROM employees WHERE (dept-id, hire-date) IN
(SELECT dept-id, MAX(hire-date)
FROM employees JOIN departments USING(dept-id)
WHERE location-id = 1700
GROUP BY dept-id);
What is the outcome?$$ \to \left\{ {I,J} \right\},\left\{ {E,H} \right\} \to \left\{ {K,L} \right\},\left\{ K \right\}$$
$$ \to \left\{ M \right\},\left\{ L \right\}$$
$$ \to \left. {\left\{ N \right\}} \right\}$$ on $$R.$$ What is the key for $$R?$$
$$S1:$$ Every table with two single-valued attributes is in $$1NF, 2NF, 3NF$$ and $$BCNF.$$
$$S2:$$ $$AB \to C,\,\,D \to E,\,\,E \to C$$ is a minimal cover for the set of functional dependencies $$AB \to C,$$ $$D \to E,\,\,AB \to E,\,\,E \to C.$$
Which one of the following is CORRECT?

The minimal sum-of-products form of the Boolean expression for the output $$F$$ of the multiplexer is
$${{312} \over {20}} = 13.1$$
$$F\left( {P,\,Q,\,R,\,S} \right) = PQ + \overline P QR + \overline P Q\overline R S.$$
The minimal sum-of-products form of $$F$$ is
3x + 2y = 1
4x + 7z = 1
x + y + z =3
x - 2y + 7z = 0
The number of solutions for this system is ______________________
$$f\left( \theta \right) = \left| {\matrix{ {\sin \,\theta } & {\cos \,\theta } & {\tan \,\theta } \cr {\sin \left( {{\pi \over 6}} \right)} & {\cos \left( {{\pi \over 6}} \right)} & {\tan \left( {{\pi \over 6}} \right)} \cr {\sin \left( {{\pi \over 3}} \right)} & {\cos \left( {{\pi \over 3}} \right)} & {\tan \left( {{\pi \over 3}} \right)} \cr } } \right|$$
Where $$\theta \in \left[ {{\pi \over 6},{\pi \over 3}} \right]$$ and $$f\left( \theta \right)$$ denote the derivative of $$f$$ with repect to $$\theta $$. Which of the following statements is/are TRUE?
$${\rm I})$$ There exists $$\theta \in \left[ {{\pi \over 6},{\pi \over 3}} \right]$$ such that $$f\left( \theta \right)$$ $$= 0$$.
$${\rm I}{\rm I})$$ There exists $$\theta \in \left[ {{\pi \over 6},{\pi \over 3}} \right]$$ such that $$f\left( \theta \right)$$ $$ \ne 0$$.
$$f$$"$$\left( x \right) + f\left( x \right) + t\,\cos \,x\,\, = \,\,0$$. The value of $$t$$ is ______ .
"Not all that glitters is gold"
Predicate glitters$$(x)$$ is true if $$x$$ glitters and
predicate gold$$(x)$$ is true if $$x$$ is gold.
Which one of the following logical formulae represents the above statement?

REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z
REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z
Process Name | Arrival Time | Execution Time |
---|---|---|
A | 0 | 6 |
B | 3 | 2 |
C | 5 | 4 |
D | 7 | 6 |
E | 10 | 3 |
Using the $$shortest$$ $$remaining$$ $$time$$ $$first$$ scheduling algorithm, the average process turnaround time (in $$msec$$) is _______.
#include < stdio.h >
main()
{
int i;
int *pi = &i;
scanf("%d", pi);
printf("%d\n", i + 5);
}
Which one of the following statements is TRUE?
$$1)$$ Waterfall model
$$2)$$ Evolutionary model
$$3)$$ Component-based software engineering
$$4)$$ Spiral development
$$a)$$ Specifications can be developed incrementally
$$b)$$ Requirements compromises are inevitable
$$c)$$ Explicit recognition of risk
$$d)$$ Inflexible partitioning of the project into

What is the set of reachable states for the input string $$0011?$$

