Register

These questions are basic level ones and can be answered in less than a minute if you have seen the topic.

Recent questions tagged easy

30 votes
5 answers
785
GATE CSE 2000 | Question: 2.24
Given the following relation instance. ... $YZ \rightarrow X$ and $Y \rightarrow Z$ $YZ \rightarrow X$ and $X \rightarrow Z$ $XZ \rightarrow Y$ and $Y \rightarrow X$
Given the following relation instance.$$\begin{array}{|l|l|}\hline \text{X} & \text{Y} & \text{Z} \\\hline \text{1} & \text{4} & \text{2} \\ \text{1} & \text{5} & \te...
User Avatar
29 votes
2 answers
787
GATE CSE 2000 | Question: 2.20
The value of $j$ at the end of the execution of the following C program: int incr (int i) { static int count = 0; count = count + i; return (count); } main () { int i, j; for (i = 0; i <= 4; i++) j = incr (i); } is: $10$ $4$ $6$ $7$
The value of $j$ at the end of the execution of the following C program:int incr (int i) { static int count = 0; count = count + i; return (count); } main () { int i, j; ...
User Avatar
60 votes
6 answers
790
GATE CSE 2000 | Question: 2.6
Let $P(S)$ denotes the power set of set $S.$ Which of the following is always true? $P(P(S)) = P(S)$ $P(S) ∩ P(P(S)) = \{ Ø \}$ $P(S) ∩ S = P(S)$ $S ∉ P(S)$
Let $P(S)$ denotes the power set of set $S.$ Which of the following is always true?$P(P(S)) = P(S)$$P(S) ∩ P(P(S)) = \{ Ø \}$$P(S) ∩ S = P(S)$$S ∉ P(S)$
User Avatar
41 votes
6 answers
793
GATE CSE 2000 | Question: 1.20, ISRO2008-47
Which of the following need not necessarily be saved on a context switch between processes? General purpose registers Translation look-aside buffer Program counter All of the above
Which of the following need not necessarily be saved on a context switch between processes?General purpose registersTranslation look-aside bufferProgram counterAll of the...
User Avatar
41 votes
7 answers
794
GATE CSE 2000 | Question: 1.18, ISRO2015-25
The number of tokens in the following C statement is printf("i=%d, &i=%x", i, &i); $3$ $26$ $10$ $21$
The number of tokens in the following C statement isprintf("i=%d, &i=%x", i, &i);$3$$26$$10$$21$
User Avatar
43 votes
9 answers
796
GATE CSE 2000 | Question: 1.16
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable
Aliasing in the context of programming languages refers tomultiple variables having the same memory locationmultiple variables having the same valuemultiple variables hav...
User Avatar
33 votes
8 answers
798
GATE CSE 2000 | Question: 1.14
Consider the following nested representation of binary trees: $(X \ Y \ Z)$ indicates $Y$ and $Z$ are the left and right subtrees, respectively, of node $X$. Note that $Y$ and $Z$ may be $NULL$ ... $(1 \ (2 \ 3 \ 4) \ (5 \ 6 \ 7))$ $(1 \ (2 \ 3 \ NULL) \ (4 \ 5))$
Consider the following nested representation of binary trees: $(X \ Y \ Z)$ indicates $Y$ and $Z$ are the left and right subtrees, respectively, of node $X$. Note that $Y...
User Avatar
52 votes
3 answers
800
GATE CSE 2000 | Question: 1.12
The most appropriate matching for the following pairs ... $X - 3 \ \ Y - 2 \ \ Z - 1$ $X - 3 \ \ Y - 1 \ \ Z - 2$
The most appropriate matching for the following pairs$$\begin{array}{|ll|ll|}\hline X: & \text{m = malloc(5); m = NULL;} & 1: & \text{using dangling pointers} \\\hline Y...
User Avatar
35 votes
4 answers
803
GATE CSE 2000 | Question: 1.8
Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a non-pipelined but identical CPU, we can say that T1 ≤ T2 T1 ≥ T2 T1 < T2 T1 and T2 plus the time taken for one instruction fetch cycle
Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a non-pipelined but identical CPU, we can say thatT1 ≤ T2T1 ≥ T2T1 < T2T...
User Avatar
1 votes
1 answer
804
GATE CSE 2000 | Question: 1.7
To put the 8085 microprocessor in the wait state lower the HOLD input lower the READY input raise the HOLD input raise the READY input
To put the 8085 microprocessor in the wait statelower the HOLD inputlower the READY inputraise the HOLD inputraise the READY input
User Avatar
39 votes
4 answers
805
GATE CSE 2000 | Question: 1.6
The number $43$ in $2's$ complement representation is $01010101$ $11010101$ $00101011$ $10101011$
The number $43$ in $2's$ complement representation is$01010101$$11010101$$00101011$$10101011$
User Avatar
40 votes
4 answers
806
GATE CSE 2000 | Question: 1.5
Let $L$ denote the languages generated by the grammar $S \to 0S0 \mid 00$. Which of the following is TRUE? $L = 0^+$ $L$ is regular but not $0^+$ $L$ is context free but not regular $L$ is not context free
Let $L$ denote the languages generated by the grammar $S \to 0S0 \mid 00$.Which of the following is TRUE?$L = 0^+$$L$ is regular but not $0^+$$L$ is context free but not ...
User Avatar
28 votes
5 answers
807
GATE CSE 2000 | Question: 1.4
Let $S$ and $T$ be languages over $\Sigma=\{a,b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$, respectively. Which of the following is true? $S \subset T$ $T \subset S$ $S = T$ $S \cap T = \phi$
Let $S$ and $T$ be languages over $\Sigma=\{a,b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$, respectively. Which of the following is true?$S \subs...
User Avatar
26 votes
7 answers
808
GATE CSE 2000 | Question: 1.3
The determinant of the matrix $\begin{bmatrix}2 &0 &0 &0 \\ 8& 1& 7& 2\\ 2& 0&2 &0 \\ 9&0 & 6 & 1 \end{bmatrix}$ $4$ $0$ $15$ $20$
The determinant of the matrix $$\begin{bmatrix}2 &0 &0 &0 \\ 8& 1& 7& 2\\ 2& 0&2 &0 \\ 9&0 & 6 & 1 \end{bmatrix}$$$4$$0$$15$$20$
User Avatar
56 votes
8 answers
809
GATE CSE 2000 | Question: 1.2
An $n \times n$ array $v$ is defined as follows: $v\left[i,j\right] = i - j$ for all $i, j, i \leq n, 1 \leq j \leq n$ The sum of the elements of the array $v$ is $0$ $n-1$ $n^2 - 3n +2$ $n^2 \frac{\left(n+1\right)}{2}$
An $n \times n$ array $v$ is defined as follows:$v\left[i,j\right] = i - j$ for all $i, j, i \leq n, 1 \leq j \leq n$The sum of the elements of the array $v$ is$0$$n-1$$n...
User Avatar
39 votes
6 answers
810
GATE CSE 2000 | Question: 1.1
The minimum number of cards to be dealt from an arbitrarily shuffled deck of $52$ cards to guarantee that three cards are from same suit is $3$ $8$ $9$ $12$
The minimum number of cards to be dealt from an arbitrarily shuffled deck of $52$ cards to guarantee that three cards are from same suit is$3$$8$$9$$12$
User Avatar
Page: