Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User aryavart
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
commented
in
Theory of Computation
Sep 26, 2021
12.4k
views
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 ________ .
commented
in
Digital Logic
Aug 19, 2021
6.3k
views
gatecse-2020
numerical-answers
digital-logic
decoder
1-mark
7
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$
commented
in
DS
Aug 5, 2021
12.3k
views
gatecse-2014-set3
data-structures
tree
easy
9
answers
4
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$
commented
in
Programming
Jul 20, 2021
18.4k
views
gatecse-2019
programming-in-c
programming
2-marks
5
answers
5
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°$?
commented
in
Digital Logic
Jul 18, 2021
14.3k
views
gatecse-2006
digital-logic
normal
circuit-output
9
answers
6
GATE CSE 2017 Set 2 | Question: 11
Let $p, q, r$ ... $(\neg p \wedge r) \vee (r \rightarrow (p \wedge q))$
answered
in
Mathematical Logic
Jul 15, 2021
8.9k
views
gatecse-2017-set2
mathematical-logic
propositional-logic
2
answers
7
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 20
The number of possible binary trees with $4$ nodes is $12$ $13$ $14$ $15$
answered
in
DS
Jul 14, 2021
540
views
nielit2017oct-assistanta-it
data-structures
binary-tree
1
answer
8
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
commented
in
Combinatory
Jul 13, 2021
9.5k
views
combinatory
counting
pigeonhole-principle
3
answers
9
Show that for every integer n there is a multiple of n that has only 0s and 1s in its decimal expansion.
commented
in
Mathematical Logic
Jul 13, 2021
5.0k
views
pigeonhole-principle
9
answers
10
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]$
commented
in
Mathematical Logic
Jul 10, 2021
10.8k
views
gateit-2008
first-order-logic
normal
9
answers
11
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$
commented
in
Mathematical Logic
Jul 10, 2021
11.4k
views
gatecse-2002
mathematical-logic
normal
propositional-logic
6
answers
12
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$
commented
in
Mathematical Logic
Jul 10, 2021
5.7k
views
gatecse-2009
mathematical-logic
easy
propositional-logic
7
answers
13
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$
commented
in
Mathematical Logic
Jul 9, 2021
7.9k
views
gateit-2004
mathematical-logic
normal
propositional-logic
4
answers
14
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
commented
in
Set Theory & Algebra
Jul 9, 2021
4.3k
views
gate1999
set-theory&algebra
normal
relations
multiple-selects
3
answers
15
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$
commented
in
Set Theory & Algebra
Jul 9, 2021
7.7k
views
gate1998
set-theory&algebra
relations
easy
5
answers
16
GATE CSE 1997 | Question: 6.3
The number of equivalence relations of the set $\{1,2,3,4\}$ is $15$ $16$ $24$ $4$
commented
in
Set Theory & Algebra
Jul 9, 2021
17.6k
views
gate1997
set-theory&algebra
relations
normal
0
answers
17
Zeal Test Series 2019: Set Theory & Algebra - Functions
I think only d) is correct
comment edited
in
Set Theory & Algebra
Jul 8, 2021
439
views
set-theory&algebra
functions
discrete-mathematics
zeal
zeal2019
7
answers
18
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
commented
in
Set Theory & Algebra
Jul 8, 2021
11.3k
views
gatecse-2014-set2
set-theory&algebra
normal
set-theory
3
answers
19
GATE IT 2008 | Question: 24
The exponent of $11$ in the prime factorization of $300!$ is $27$ $28$ $29$ $30$
commented
in
Set Theory & Algebra
Jul 6, 2021
6.1k
views
gateit-2008
set-theory&algebra
normal
number-theory
4
answers
20
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.
commented
in
Set Theory & Algebra
Jul 5, 2021
2.0k
views
gate1989
descriptive
functions
set-theory&algebra
2
answers
21
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
commented
in
Set Theory & Algebra
Jul 5, 2021
4.6k
views
gatecse-2015-set1
set-theory&algebra
easy
binary-operation
1
answer
22
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: (a) and (b) (b) and (c) (b) and (d) (a) and (d)
answered
in
Others
Jun 24, 2021
146
views
ugcnetcse-dec2019-paper2
2
answers
23
CN ARQ Protocol
True / False? Selective repeat ARQ requires more number of bits in sequence number as compared to Go Back n ARQ.
commented
in
Computer Networks
May 18, 2021
1.3k
views
computer-networks
go-back-n
sliding-window
1
answer
24
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.
commented
in
Set Theory & Algebra
May 11, 2021
1.4k
views
relations
set-theory&algebra
discrete-mathematics
5
answers
25
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
commented
in
Operating System
May 6, 2021
799
views
ugcnetcse-jan2017-paper3
operating-system
virtual-memory
6
answers
26
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
commented
in
Operating System
May 5, 2021
20.6k
views
gatecse-2006
operating-system
virtual-memory
normal
ugcnetcse-june2012-paper3
4
answers
27
GATE CSE 2019 | Question: 42
The index node (inode) of a Unix -like file system has $12$ direct, one single-indirect and one double-indirect pointers. The disk block size is $4$ kB, and the disk block address is $32$-bits long. The maximum possible file size is (rounded off to $1$ decimal place) ____ GB
commented
in
Operating System
Apr 4, 2021
17.7k
views
gatecse-2019
numerical-answers
operating-system
file-system
2-marks
5
answers
28
GATE CSE 2009 | Question: 52
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s \rangle$, where $c$ is the cylinder number, $h$ is the surface number and $s$ is the sector ... $\langle 0, 16, 30 \rangle$ $\langle 0, 16, 31 \rangle$ $\langle 0, 17, 31 \rangle$
commented
in
Operating System
Apr 4, 2021
7.7k
views
gatecse-2009
operating-system
disk
normal
2
answers
29
GATE CSE 2019 | Question: 55
Consider the following relations $P(X,Y,Z), Q(X,Y,T)$ and $R(Y,V)$ ... Answer: ________
commented
in
Databases
Jan 4, 2021
10.3k
views
gatecse-2019
numerical-answers
databases
relational-algebra
2-marks
2
answers
30
Design and Analysis of Algorithm
Which of the following statements is not true? 1.For every fixed strategy to choose a pivot for quicksort, we can construct a worst case input that requires time O(n2). 2.If we randomly choose a pivot element each time, quicksort will ... would have worst case complexity O(n log n). 4.Quicksort and merge sort are both examples of divide and conquer algorithms.
answered
in
Algorithms
Jan 3, 2021
4.5k
views
algorithm-design
sorting
time-complexity
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent Blog Comments
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....