Register
Filter

Recent activity by aryavart

4 answers
2
GATE CSE 2020 | Question: 20
If there are $m$ input lines and $n$ output lines for a decoder that is used to uniquely address a byte addressable $1$ KB RAM, then the minimum value of $m+n$ is ________ .
If there are $m$ input lines and $n$ output lines for a decoder that is used to uniquely address a byte addressable $1$ KB RAM, then the minimum value of $m+n$ is _______...
9 answers
3
GATE CSE 2014 Set 3 | Question: 12
Consider the following rooted tree with the vertex labeled $P$ as the root: The order in which the nodes are visited during an in-order traversal of the tree is $SQPTRWUV$ $SQPTUWRV$ $SQPTWUVR$ $SQPTRUWV$
Consider the following rooted tree with the vertex labeled $P$ as the root:The order in which the nodes are visited during an in-order traversal of the tree is$SQPTRWUV$$...
1 answer
4
GATE Overflow Test Series | Programming | Test 1 | Question: 11
What will be the output of the following C program?(Assume IEEE -$754$ standard being Used) #include<stdio.h> int main() { float a = 8.0625; if(a == 8.0625) { printf("1"); } else { printf("0"); } }
What will be the output of the following C program?(Assume IEEE -$754$ standard being Used)#include<stdio.h int main() { float a = 8.0625; if(a == 8.0625) { printf("1"); ...
10 answers
8
GATE CSE 2017 Set 2 | Question: 11
Let $p, q, r$ ... $(\neg p \wedge r) \vee (r \rightarrow (p \wedge q))$
Let $p, q, r$ denote the statements ”It is raining”, “It is cold”, and “It is pleasant”, respectively. Then the statement “It is not raining and it is pleas...
1 answer
10
application of pigeonhole principle
During a month with 30 days, a baseball team plays at least one game a day, but no more than 45 games. Show that there must be a period of some number of consecutive days during which the team must play exactly 14 games
During a month with 30 days, a baseball team plays at least one game a day, but no more than 45 games. Show that there must be a period of some number of consecutive days...
3 answers
11
Show that for every integer n there is a multiple of n that has only 0s and 1s in its decimal expansion.
Let I take n=8 ,or 7. Can any one illustrate me this defination clearly .
9 answers
14
GATE IT 2008 | Question: 21
Which of the following first order formulae is logically valid? Here $\alpha(x)$ is a first order formula with $x$ as a free variable, and $\beta$ ... $[(\forall x, \alpha(x)) \rightarrow \beta] \rightarrow [\forall x, \alpha(x) \rightarrow \beta]$
Which of the following first order formulae is logically valid? Here $\alpha(x)$ is a first order formula with $x$ as a free variable, and $\beta$ is a first order formul...
8 answers
16
GATE CSE 2009 | Question: 24
The binary operation $\Box$ ... following is equivalent to $P \vee Q$? $\neg Q \Box \neg P$ $P\Box \neg Q$ $\neg P\Box Q$ $\neg P\Box \neg Q$
The binary operation $\Box$ is defined as follows$$\begin{array}{|c|c|c|} \hline \textbf{P} & \textbf{Q} & \textbf{P} \Box \textbf{Q}\\\hline \text{T} & \text{T}& \text{T...
5 answers
19
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$
6 answers
20
GATE CSE 1997 | Question: 6.3
The number of equivalence relations of the set $\{1,2,3,4\}$ is $15$ $16$ $24$ $4$
The number of equivalence relations of the set $\{1,2,3,4\}$ is$15$$16$$24$$4$
3 answers
23
GATE IT 2008 | Question: 24
The exponent of $11$ in the prime factorization of $300!$ is $27$ $28$ $29$ $30$
The exponent of $11$ in the prime factorization of $300!$ is$27$$28$$29$$30$
4 answers
24
GATE CSE 1989 | Question: 13c
Find the number of single valued functions from set $A$ to another set $B,$ given that the cardinalities of the sets $A$ and $B$ are $m$ and $n$ respectively.
Find the number of single valued functions from set $A$ to another set $B,$ given that the cardinalities of the sets $A$ and $B$ are $m$ and $n$ respectively.
2 answers
25
GATE CSE 2015 Set 1 | Question: 28
The binary operator $\neq$ ... about the binary operator $\neq$ ? Both commutative and associative Commutative but not associative Not commutative but associative Neither commutative nor associative
The binary operator $\neq$ is defined by the following truth table.$$\begin{array}{|l|l|l|} \hline \textbf{p} & \textbf{q}& \textbf{p} \neq \textbf{q}\\\hline \text{0} & ...
1 answer
26
UGC NET CSE | December 2019 | Part 2 | Question: 72
Which of the following are legal statements in $C$ programming language? int *P=&44; int *P=&r; int P=&a; int P=a; Choose the correct option: (i) and (ii) (ii) and (iii) (ii) and (iv) (i) and (iv)
Which of the following are legal statements in $C$ programming language?int *P=&44;int *P=&r;int P=&a;int P=a;Choose the correct option:(i) and (ii)(ii) and (iii)(ii) and...
2 answers
27
CN ARQ Protocol
True / False? Selective repeat ARQ requires more number of bits in sequence number as compared to Go Back n ARQ.
True / False?Selective repeat ARQ requires more number of bits in sequence number as compared to Go Back n ARQ.
5 answers
29
UGC NET CSE | January 2017 | Part 3 | Question: 2
Which of the following is incorrect for virtual memory? Large programs can be written More I/O is required More addressable memory available Faster and easy swapping of process
Which of the following is incorrect for virtual memory?Large programs can be writtenMore I/O is requiredMore addressable memory availableFaster and easy swapping of proce...