Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by aryavart
4
answers
1
GATE IT 2005 | Question: 37
Consider the non-deterministic finite automaton (NFA) shown in the figure. State $X$ is the starting state of the automaton. Let the language accepted by the NFA with $Y$ as the only accepting state be $L1$. Similarly, let the language accepted by the NFA with $Z$ as ... statements about $L1$ and $L2$ is TRUE? $L1 = L2$ $L1 \subset L2$ $L2 \subset L1$ None of the above
Consider the non-deterministic finite automaton (NFA) shown in the figure.State $X$ is the starting state of the automaton. Let the language accepted by the NFA with $Y$ ...
16.3k
views
commented
Sep 26, 2021
Theory of Computation
gateit-2005
theory-of-computation
finite-automata
normal
+
–
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.7k
views
commented
Aug 19, 2021
Digital Logic
gatecse-2020
numerical-answers
digital-logic
decoder
1-mark
+
–
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$$...
16.5k
views
commented
Aug 5, 2021
DS
gatecse-2014-set3
data-structures
tree
easy
+
–
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"); ...
562
views
commented
Aug 1, 2021
Programming in C
go2025-programming-1
numerical-answers
pointers
+
–
1
answer
5
GATE Overflow Test Series | Programming | Test 1 | Question: 12
Consider the following C program fragment: double a = getMyDouble(); float b, c; b = getMyFloat(); c = a + b; If the assembly instruction corresponding to the addition is "ADD R0, R1" where R0 is having the value corresponding to the variable b, the minimum required size in bytes of the register R0 is _____ bytes.
Consider the following C program fragment:double a = getMyDouble(); float b, c; b = getMyFloat(); c = a + b;If the assembly instruction corresponding to the addition is "...
546
views
commented
Aug 1, 2021
Programming in C
go2025-programming-1
numerical-answers
data-types
+
–
9
answers
6
GATE CSE 2019 | Question: 27
Consider the following C program: #include <stdio.h> int r() { static int num=7; return num--; } int main() { for (r();r();r()) printf(“%d”,r()); return 0; } Which one of the following values will be displayed on execution of the programs? $41$ $52$ $63$ $630$
Consider the following C program:#include <stdio.h int r() { static int num=7; return num ; } int main() { for (r();r();r()) printf(“%d”,r()); return 0; }Which one of...
27.3k
views
commented
Jul 20, 2021
Programming in C
gatecse-2019
programming-in-c
programming
2-marks
+
–
5
answers
7
GATE CSE 2006 | Question: 8
You are given a free running clock with a duty cycle of $50\%$ and a digital waveform $f$ which changes only at the negative edge of the clock. Which one of the following circuits (using clocked D flip-flops) will delay the phase of $f$ by $180°$?
You are given a free running clock with a duty cycle of $50\%$ and a digital waveform $f$ which changes only at the negative edge of the clock. Which one of the following...
18.6k
views
commented
Jul 18, 2021
Digital Logic
gatecse-2006
digital-logic
normal
circuit-output
+
–
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...
12.2k
views
answered
Jul 15, 2021
Mathematical Logic
gatecse-2017-set2
mathematical-logic
propositional-logic
+
–
2
answers
9
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 20
The number of possible binary trees with $4$ nodes is $12$ $13$ $14$ $15$
The number of possible binary trees with $4$ nodes is$12$$13$$14$$15$
1.0k
views
answered
Jul 14, 2021
DS
nielit2017oct-assistanta-it
data-structures
binary-tree
+
–
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...
13.4k
views
commented
Jul 13, 2021
Combinatory
combinatory
counting
pigeonhole-principle
+
–
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 .
7.7k
views
commented
Jul 13, 2021
Mathematical Logic
pigeonhole-principle
+
–
2
answers
12
GATE Overflow Test Series | Discrete Mathematics | Test 1 | Question: 15
Consider the following relations defined on set $I$: $R_1:\{(x,y) \mid xy \geq 1 \}$ $R_2:\{(x,y) \mid x \equiv y(\mod 7) \}$ $R_3: \{(x,y) \mid x \neq y \}$ where $I$ is set of all non- ... $R_3$ are not reflexive while $R_2$ is reflexive. $R_1,$ $R_2$ and $R_3$ are all reflexive. None of these relations is reflexive
Consider the following relations defined on set $I$:$R_1:\{(x,y) \mid xy \geq 1 \}$$R_2:\{(x,y) \mid x \equiv y(\mod 7) \}$$R_3: \{(x,y) \mid x \neq y \}$where $I$ is set...
472
views
comment edited
Jul 13, 2021
Set Theory & Algebra
go2025-dm-1
relations
+
–
2
answers
13
GATE Overflow Test Series | Discrete Mathematics | Test 1 | Question: 8
Which of the following is a valid partition for $N,$ where $N$ is the set of natural numbers? (Mark all the appropriate choices) $\{x \in N \mid x \geq 100 \} \cup \{x \in N \mid x \leq 100\}$ ... $\{x \in N \mid x \geq 101 \} \cup \{x \in N \mid x < 100 \}$
Which of the following is a valid partition for $N,$ where $N$ is the set of natural numbers? (Mark all the appropriate choices)$\{x \in N \mid x \geq 100 \} \cup \{x \in...
297
views
commented
Jul 13, 2021
Set Theory & Algebra
go2025-dm-1
relations
normal
multiple-selects
+
–
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...
15.1k
views
commented
Jul 10, 2021
Mathematical Logic
gateit-2008
first-order-logic
normal
+
–
10
answers
15
GATE CSE 2002 | Question: 1.8
"If $X$ then $Y$ unless $Z$" is represented by which of the following formulas in propositional logic? ("$\neg$" is negation, "$\land$" is conjunction, and "$\rightarrow$" is implication) $(X\land \neg Z) \rightarrow Y$ $(X \land Y) \rightarrow \neg Z$ $X \rightarrow(Y\land \neg Z)$ $(X \rightarrow Y)\land \neg Z$
"If $X$ then $Y$ unless $Z$" is represented by which of the following formulas in propositional logic? ("$\neg$" is negation, "$\land$" is conjunction, and "$\rightarrow$...
14.8k
views
commented
Jul 10, 2021
Mathematical Logic
gatecse-2002
mathematical-logic
normal
propositional-logic
+
–
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...
8.6k
views
commented
Jul 10, 2021
Mathematical Logic
gatecse-2009
mathematical-logic
easy
propositional-logic
+
–
9
answers
17
GATE IT 2004 | Question: 31
Let $p, q, r$ and $s$ be four primitive statements. Consider the following arguments: $P: [(¬p\vee q) ∧ (r → s) ∧ (p \vee r)] → (¬s → q)$ $Q: [(¬p ∧q) ∧ [q → (p → r)]] → ¬r$ $R: [[(q ∧ r) → p] ∧ (¬q \vee p)] → r$ $S: [p ∧ (p → r) ∧ (q \vee ¬ r)] → q$ Which of the above arguments are valid? $P$ and $Q$ only $P$ and $R$ only $P$ and $S$ only $P, Q, R$ and $S$
Let $p, q, r$ and $s$ be four primitive statements. Consider the following arguments:$P: [(¬p\vee q) ∧ (r → s) ∧ (p \vee r)] → (¬s → q)$$Q: [(¬p ∧q) �...
11.8k
views
commented
Jul 9, 2021
Mathematical Logic
gateit-2004
mathematical-logic
normal
propositional-logic
+
–
4
answers
18
GATE CSE 1999 | Question: 2.3
Let $L$ be a set with a relation $R$ which is transitive, anti-symmetric and reflexive and for any two elements $a, b \in L$, let the least upper bound $lub (a, b)$ and the greatest lower bound $glb (a, b)$ exist. Which of the following is/are true? $L$ is a poset $L$ is a Boolean algebra $L$ is a lattice None of the above
Let $L$ be a set with a relation $R$ which is transitive, anti-symmetric and reflexive and for any two elements $a, b \in L$, let the least upper bound $lub (a, b)$ and ...
5.6k
views
commented
Jul 9, 2021
Set Theory & Algebra
gate1999
set-theory&algebra
normal
relations
multiple-selects
+
–
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$
9.4k
views
commented
Jul 9, 2021
Set Theory & Algebra
gate1998
set-theory&algebra
relations
easy
+
–
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$
21.3k
views
commented
Jul 9, 2021
Set Theory & Algebra
gate1997
set-theory&algebra
relations
normal
+
–
0
answers
21
Zeal Test Series 2019: Set Theory & Algebra - Functions
I think only d) is correct
I think only d) is correct
796
views
comment edited
Jul 8, 2021
Set Theory & Algebra
set-theory&algebra
functions
discrete-mathematics
zeal
zeal2019
+
–
8
answers
22
GATE CSE 2014 Set 2 | Question: 50
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum element in the symmetric difference of the two sets is in $U$. Consider the ... $S1$ is true and $S2$ is false $S2$ is true and $S1$ is false Neither $S1$ nor $S2$ is true
Consider the following relation on subsets of the set $S$ of integers between $1$ and $2014$. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum ...
15.8k
views
commented
Jul 8, 2021
Set Theory & Algebra
gatecse-2014-set2
set-theory&algebra
normal
set-theory
+
–
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$
8.1k
views
commented
Jul 6, 2021
Set Theory & Algebra
gateit-2008
set-theory&algebra
normal
number-theory
+
–
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.8k
views
commented
Jul 5, 2021
Set Theory & Algebra
gate1989
descriptive
functions
set-theory&algebra
+
–
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} & ...
6.4k
views
commented
Jul 5, 2021
Set Theory & Algebra
gatecse-2015-set1
set-theory&algebra
easy
binary-operation
+
–
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...
346
views
answered
Jun 24, 2021
Others
ugcnetcse-dec2019-paper2
+
–
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.
1.6k
views
commented
May 18, 2021
Computer Networks
computer-networks
go-back-n
sliding-window
+
–
1
answer
28
Number of Anti-Symmetric Relations
Number of possible Anti-Symmetric relations possible on a set of Size 5 whose size is maximum? My Work: Whose Size is maximum means, we should take all reflexive pairs. Okay, now we are left with $\frac{n(n-1)}{2}$ off-diagonal pairs. We can have 3 ... must be $3^{\binom{5}{2}}$ But the answer was given to be 1024. Please guide me to the correct thought process.
Number of possible Anti-Symmetric relations possible on a set of Size 5 whose size is maximum? My Work:Whose Size is maximum means, we should take all reflexive pairs.Oka...
2.7k
views
commented
May 11, 2021
Set Theory & Algebra
relations
set-theory&algebra
discrete-mathematics
+
–
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...
1.8k
views
commented
May 6, 2021
Operating System
ugcnetcse-jan2017-paper3
operating-system
virtual-memory
+
–
6
answers
30
GATE CSE 2006 | Question: 63, UGCNET-June2012-III: 45
A computer system supports $32$-bit virtual addresses as well as $32$-bit physical addresses. Since the virtual address space is of the same size as the physical address space, the operating system designers decide to ... more efficient now Hardware support for memory management is no longer needed CPU scheduling can be made more efficient now
A computer system supports $32$-bit virtual addresses as well as $32$-bit physical addresses. Since the virtual address space is of the same size as the physical address ...
26.1k
views
commented
May 5, 2021
Operating System
gatecse-2006
operating-system
virtual-memory
normal
ugcnetcse-june2012-paper3
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register