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

20 votes
4 answers
602
GATE CSE 1998 | Question: 1.8
The number of functions from an $m$ element set to an $n$ element set is $m + n$ $m^n$ $n^m$ $m*n$
The number of functions from an $m$ element set to an $n$ element set is$m + n$$m^n$$n^m$$m*n$
User Avatar
19 votes
5 answers
603
GATE CSE 1998 | Question: 1.6
Suppose $A$ is a finite set with $n$ elements. The number of elements in the largest equivalence relation of A is $n$ $n^2$ $1$ $n+1$
Suppose $A$ is a finite set with $n$ elements. The number of elements in the largest equivalence relation of A is$n$$n^2$$1$$n+1$
User Avatar
39 votes
5 answers
604
GATE CSE 1998 | Question: 1.5
What is the converse of the following assertion? I stay only if you go I stay if you go If I stay then you go If you do not go then I do not stay If I do not stay then you go
What is the converse of the following assertion?I stay only if you goI stay if you goIf I stay then you goIf you do not go then I do not stayIf I do not stay then you go
User Avatar
12 votes
6 answers
605
GATE CSE 1998 | Question: 1.4
Consider the function $y=|x|$ in the interval $[-1, 1]$. In this interval, the function is continuous and differentiable continuous but not differentiable differentiable but not continuous neither continuous nor differentiable
Consider the function $y=|x|$ in the interval $[-1, 1]$. In this interval, the function iscontinuous and differentiablecontinuous but not differentiabledifferentiable but...
User Avatar
22 votes
3 answers
607
GATE CSE 1998 | Question: 1.2
Consider the following set of equations $x+2y=5$ $4x+8y=12$ $3x+6y+3z=15$ This set has unique solution has no solution has finite number of solutions has infinite number of solutions
Consider the following set of equations$x+2y=5$$4x+8y=12$$3x+6y+3z=15$This sethas unique solutionhas no solutionhas finite number of solutionshas infinite number of solut...
User Avatar
30 votes
8 answers
608
GATE CSE 1998 | Question: 1.1
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is $\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}$
A die is rolled three times. The probability that exactly one odd number turns up among the three outcomes is$\dfrac{1}{6}$ $\dfrac{3}{8}$ $\dfrac{1}{8}$ $\dfrac{1}{2}...
User Avatar
25 votes
5 answers
609
GATE CSE 2012 | Question: 30
What is the minimal form of the Karnaugh map shown below? Assume that $X$ denotes a don’t care term $\bar{b} \bar{d}$ $ \bar { b } \bar { d } + \bar{b} \bar{c} $ $ \bar{b} \bar{d} + {a} \bar{b} \bar{c} {d}$ $ \bar{b} \bar{d} + \bar{b} \bar{c} + \bar{c} \bar{d} $
What is the minimal form of the Karnaugh map shown below? Assume that $X$ denotes a don’t care term $\bar{b} \bar{d}$$ \bar { b } \bar { d } + \bar{b} \bar{c} $$ \bar{b...
User Avatar
24 votes
4 answers
610
GATE CSE 2012 | Question: 25
Given the language $L = \left\{ab, aa, baa\right\}$, which of the following strings are in $L^{*}$? $ abaabaaabaa$ $ aaaabaaaa$ $ baaaaabaaaab$ $ baaaaabaa$ $\text{1, 2 and 3}$ $\text{2, 3 and 4}$ $\text{1, 2 and 4}$ $\text{1, 3 and 4}$
Given the language $L = \left\{ab, aa, baa\right\}$, which of the following strings are in $L^{*}$?$ abaabaaabaa$$ aaaabaaaa$$ baaaaabaaaab$$ baaaaabaa$$\text{1, 2 and 3}...
User Avatar
34 votes
1 answer
611
GATE CSE 2012 | Question: 23
In the IPv4 addressing format, the number of networks allowed under Class $C$ addresses is: $2^{14}$ $2^{7}$ $2^{21}$ $2^{24}$
In the IPv4 addressing format, the number of networks allowed under Class $C$ addresses is:$2^{14}$$2^{7}$$2^{21}$$2^{24}$
User Avatar
29 votes
4 answers
612
GATE CSE 2012 | Question: 22
Which of the following transport layer protocols is used to support electronic mail? $\textsf{SMTP}$ $\textsf{IP}$ $\textsf{TCP}$ $\textsf{UDP}$
Which of the following transport layer protocols is used to support electronic mail?$\textsf{SMTP}$$\textsf{IP}$$\textsf{TCP}$$\textsf{UDP}$
User Avatar
41 votes
4 answers
613
GATE CSE 2012 | Question: 21
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and $+1$ are $0$ and $0.5$ $0$ and $1$ $0.5$ and $1$ $0.25$ and $0.75$
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and ...
User Avatar
17 votes
5 answers
616
GATE CSE 2013 | Question: 58
What will be the maximum sum of $44, 42, 40, \dots$ ? $502$ $504$ $506$ $500$
What will be the maximum sum of $44, 42, 40, \dots$ ?$502$$504$$506$$500$
User Avatar
53 votes
8 answers
618
GATE CSE 2013 | Question: 27
What is the logical translation of the following statement? "None of my friends are perfect." $∃x(F (x)∧ ¬P(x))$ $∃ x(¬ F (x)∧ P(x))$ $ ∃x(¬F (x)∧¬P(x))$ $ ¬∃ x(F (x)∧ P(x))$
What is the logical translation of the following statement?"None of my friends are perfect."$∃x(F (x)∧ ¬P(x))$$∃ x(¬ F (x)∧ P(x))$$ ∃x(¬F (x)∧¬P(x))$$ ¬�...
User Avatar
25 votes
2 answers
619
GATE CSE 2013 | Question: 25
Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even. P only Q only Both P and Q Neither P nor Q
Which of the following statements is/are TRUE for undirected graphs?P: Number of odd degree vertices is even.Q: Sum of degrees of all vertices is even. P only Q only Both...
User Avatar
31 votes
7 answers
620
GATE CSE 2013 | Question: 21
Which one of the following expressions does NOT represent exclusive NOR of $x$ and $y$? $xy + x′ y′$ $x\oplus y′$ $x′\oplus y$ $x′\oplus y′$
Which one of the following expressions does NOT represent exclusive NOR of $x$ and $y$?$xy + x′ y′$$x\oplus y′$$x′\oplus y$$x′\oplus y′$
User Avatar
39 votes
2 answers
622
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...
User Avatar
23 votes
6 answers
623
GATE CSE 1999 | Question: 2-18, ISRO2008-46
Raid configurations of the disks are used to provide Fault-tolerance High speed High data density (A) & (B)
Raid configurations of the disks are used to provideFault-tolerance High speedHigh data density(A) & (B)
User Avatar
22 votes
2 answers
624
GATE CSE 1999 | Question: 2.17
Zero has two representations in Sign-magnitude $2's$ complement $1's$ complement None of the above
Zero has two representations inSign-magnitude$2's$ complement$1's$ complementNone of the above
User Avatar
25 votes
1 answer
626
GATE CSE 1999 | Question: 1.24
Let $R = (A, B, C, D, E, F)$ be a relation scheme with the following dependencies $C \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B $. Which one of the following is a key for $R$? CD EC AE AC
Let $R = (A, B, C, D, E, F)$ be a relation scheme with the following dependencies $C \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B $. Which one of the...
User Avatar
38 votes
1 answer
627
GATE CSE 1999 | Question: 1.18, ISRO2016-53
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are $m+n$ and $0$ $mn$ and $0$ $m+n$ and $|m-n|$ $mn$ and $m+n$
Consider the join of a relation $R$ with a relation $S$. If $R$ has $m$ tuples and $S$ has $n$ tuples then the maximum and minimum sizes of the join respectively are$m+n$...
User Avatar
21 votes
6 answers
628
GATE CSE 1999 | Question: 1.17
Which of the following is the most powerful parsing method? LL (1) Canonical LR SLR LALR
Which of the following is the most powerful parsing method?LL (1)Canonical LRSLRLALR
User Avatar
26 votes
2 answers
629
GATE CSE 1999 | Question: 1.12
A sorting technique is called stable if it takes $O (n \log n)$ time it maintains the relative order of occurrence of non-distinct elements it uses divide and conquer paradigm it takes $O(n)$ space
A sorting technique is called stable ifit takes $O (n \log n)$ timeit maintains the relative order of occurrence of non-distinct elementsit uses divide and conquer paradi...
User Avatar
18 votes
2 answers
630
GATE CSE 1999 | Question: 1.9
Listed below are some operating system abstractions (in the left column) and the hardware components (in the right column) ... 4 (A) - 3 (B) - 2 (C) - 4 (D) - 1 (A) - 4 (B) - 1 (C) - 2 (D) - 3
Listed below are some operating system abstractions (in the left column) and the hardware components (in the right column)$$\small \begin{array}{cl|cl}\hline \text{(A)}& ...
User Avatar
Page: