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 Soumya29
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Soumya29
9
votes
61
GATE CSE 1987 | Question: 10d
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
answered
in
Theory of Computation
Oct 2, 2017
5.4k
views
gate1987
theory-of-computation
regular-expression
descriptive
40
votes
62
TIFR CSE 2010 | Part B | Question: 21
For $x \in \{0,1\}$, let $\lnot x$ denote the negation of $x$, that is $\lnot \, x = \begin{cases}1 & \mbox{iff } x = 0\\ 0 & \mbox{iff } x = 1\end{cases}$. If $x \in \{0,1\}^n$, then $\lnot \, x$ denotes the component wise negation of $x$; that ... $g(x) = f(x) \land f(\lnot x)$ $g(x) = f(x) \lor f(\lnot x)$ $g(x) = \lnot f(\lnot x)$ None of the above.
answered
in
Digital Logic
Sep 5, 2017
3.4k
views
tifr2010
digital-logic
boolean-algebra
15
votes
63
TIFR CSE 2010 | Part B | Question: 28
Consider the concurrent program: x: 1; cobegin x:= x + 3 || x := x + x + 2 coend Reading and writing of variables is atomic, but the evaluation of an expression is not atomic. The set of possible values of variable $x$ at the end of the execution of the program is: $\{4\}$ $\{8\}$ $\{4, 7, 10\}$ $\{4, 7, 8, 10\}$ $\{4, 7, 8\}$
answered
in
Operating System
Aug 23, 2017
3.8k
views
tifr2010
process-synchronization
1
vote
64
Set Theory Doubt
Want to verify let set $\left | A \right |=n$ and $\left | B \right |=m$ Then $max(m,n)\leq \left | A\cup B \right |\leq (m+n)$ $0\leq \left | A\cap B \right |\leq min(m,n)$ $0\leq \left | A- B \right |\leq \left | n \right |$ ... $\bigoplus$ is symmetric difference $0\leq \left | \overline{A} \right |\leq U$ here $\overline{A}$ is compliment of A and U is universal Set
answered
in
Set Theory & Algebra
Jul 25, 2017
503
views
discrete-mathematics
set-theory&algebra
set-theory
34
votes
65
GATE CSE 1998 | Question: 2.14
Let $A$ be a two dimensional array declared as follows: A: array [1 …. 10] [1 ….. 15] of integer; Assuming that each integer takes one memory location, the array is stored in row-major order and the first element of the array is stored at location $100$, what is the address of the element $A[i][j]$? $15i+j+84$ $15j+i+84$ $10i+j+89$ $10j+i+89$
answered
in
DS
Jul 25, 2017
29.6k
views
gate1998
data-structures
array
easy
23
votes
66
GATE CSE 2016 Set 1 | Question: 35
What will be the output of the following $C$ program? void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n-1); printf ("%d",d); } void main(){ count (3); } $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4 \ 4 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2 \ 2 \ 2$ $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2$
answered
in
Programming in C
Jul 21, 2017
15.4k
views
gatecse-2016-set1
programming-in-c
recursion
normal
24
votes
67
GATE IT 2004 | Question: 60
Choose the correct option to fill the $?1$ and $?2$ so that the program prints an input string in reverse order. Assume that the input string is terminated by a new line character. #include <stdio.h> void wrt_it (void); int main (void) { printf("Enter Text"); ... $putchar(c);$ $?1$ is $(c = getchar()) ! =$ '\n' $?2$ is $putchar(c);$
answered
in
Programming in C
Jul 18, 2017
5.7k
views
gateit-2004
programming
programming-in-c
normal
9
votes
68
GATE CSE 1998 | Question: 10b
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m < n$ and $R^m = R^n$.
answered
in
Set Theory & Algebra
Jul 15, 2017
4.2k
views
gate1998
descriptive
set-theory&algebra
relations
9
votes
69
CMI2011-A-07
Let $G=(V, E)$ be a graph. Define $\overline{G}$ to be $(V, \overline{E})$, where for all $u, \: v \: \in V \: , (u, v) \in \overline{E}$ if and only if $(u, v) \notin E$. Then which of the following is true? $\overline{G}$ is always ... $G$ is not connected. At least one of $G$ and $\overline{G}$ connected. $G$ is not connected or $\overline{G}$ is not connected
answered
in
Graph Theory
Jul 5, 2017
1.8k
views
cmi2011
graph-theory
graph-connectivity
34
votes
70
ISI 2004 MIII
In how many ways can three person, each throwing a single die once, make a score of $11$ $22$ $27$ $24$ $38$
answered
in
Combinatory
Jul 2, 2017
2.8k
views
combinatory
isi2004
15
votes
71
CMI2010-A-02
We need to choose a team of $11$ from a pool of $15$ players and also select a captain. The number of different ways this can be done is $ \begin{pmatrix} 15 \\ 11 \end{pmatrix}$ $11$ . $ \begin{pmatrix} 15 \\ 11 \end{pmatrix}$ $15 . 14 . 13 . 12 . 11 .10 . 9 . 8 . 7 . 6 . 5$ $(15 . 14 . 13 . 12 . 11 .10 . 9 . 8 . 7 . 6 . 5) . 11$
answered
in
Combinatory
Jul 1, 2017
2.3k
views
cmi2010
combinatory
normal
discrete-mathematics
91
votes
72
GATE IT 2005 | Question: 33
Let $A$ be a set with $n$ elements. Let $C$ be a collection of distinct subsets of $A$ such that for any two subsets $S_1$ and $S_2$ in $C$, either $S_1 \subset S_2$ or $S_2\subset S_1$. What is the maximum cardinality of $C?$ $n$ $n+1$ $2^{n-1} + 1$ $n!$
answered
in
Set Theory & Algebra
Jun 26, 2017
11.8k
views
gateit-2005
set-theory&algebra
normal
set-theory
98
votes
73
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
answered
in
Set Theory & Algebra
Jun 26, 2017
15.8k
views
gatecse-2014-set2
set-theory&algebra
normal
set-theory
32
votes
74
GATE CSE 2003 | Question: 38
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows: ... $(x, y)$ that satisfy the equations) is $0$ $1$ $2$ $3$
answered
in
Set Theory & Algebra
Jun 23, 2017
7.0k
views
gatecse-2003
set-theory&algebra
normal
binary-operation
3
votes
75
ISRO2017-22
Which one of the following Boolean expressions is NOT a tautology? $((a \rightarrow b) \wedge (b \rightarrow c)) \rightarrow (a \rightarrow c)$ $(a \leftrightarrow c) \rightarrow (\sim b\rightarrow (a\wedge c))$ $(a\wedge b \wedge c)\rightarrow (c \vee a)$ $a\rightarrow (b\rightarrow a)$
answered
in
Mathematical Logic
Jun 6, 2017
7.3k
views
isro2017
mathematical-logic
propositional-logic
2
votes
76
Kenneth Rosen Edition 6th Exercise 1.1 Example 14 (Page No. 12)
Express the specification “The automated reply cannot be sent when the file system is full” using logical connectives.
answered
in
Mathematical Logic
Jun 5, 2017
1.5k
views
discrete-mathematics
mathematical-logic
kenneth-rosen
123
votes
77
GATE CSE 2010 | Question: 30
Suppose the predicate $F(x, y, t)$ is used to represent the statement that person $x$ can fool person $y$ at time $t$. Which one of the statements below expresses best the meaning of the formula, $\qquad∀x∃y∃t(¬F(x,y,t))$ Everyone can ... time No one can fool everyone all the time Everyone cannot fool some person all the time No one can fool some person at some time
answered
in
Mathematical Logic
Jun 5, 2017
70.0k
views
gatecse-2010
mathematical-logic
easy
first-order-logic
24
votes
78
GATE CSE 2009 | Question: 26
Consider the following well-formed formulae: $\neg \forall x(P(x))$ $\neg \exists x(P(x))$ $\neg \exists x(\neg P(x))$ $\exists x(\neg P(x))$ Which of the above are equivalent? $\text{I}$ and $\text{III}$ $\text{I}$ and $\text{IV}$ $\text{II}$ and $\text{III}$ $\text{II}$ and $\text{IV}$
answered
in
Mathematical Logic
Jun 5, 2017
5.5k
views
gatecse-2009
mathematical-logic
normal
first-order-logic
35
votes
79
GATE CSE 2014 Set 1 | Question: 1
Consider the statement "Not all that glitters is gold Predicate glitters$(x)$ is true if $x$ glitters and predicate gold$(x)$ is true if $x$ ... $\exists x: \text{glitters}(x)\wedge \neg \text{gold}(x)$
answered
in
Mathematical Logic
Jun 5, 2017
6.6k
views
gatecse-2014-set1
mathematical-logic
first-order-logic
37
votes
80
GATE CSE 2008 | Question: 31
$P$ and $Q$ are two propositions. Which of the following logical expressions are equivalent? $P ∨ \neg Q$ $\neg(\neg P ∧ Q)$ $(P ∧ Q) ∨ (P ∧ \neg Q) ∨ (\neg P ∧ \neg Q)$ $(P ∧ Q) ∨ (P ∧ \neg Q) ∨ (\neg P ∧ Q)$ Only I and II Only I, II and III Only I, II and IV All of I, II, III and IV
answered
in
Mathematical Logic
Jun 4, 2017
8.4k
views
gatecse-2008
normal
mathematical-logic
propositional-logic
1
vote
81
GATE CSE 2014 Set 3 | Question: 53
The CORRECT formula for the sentence, "not all Rainy days are Cold" is $\forall d (\text{Rainy}(d) \wedge \text{~Cold}(d))$ $\forall d ( \text{~Rainy}(d) \to \text{Cold}(d))$ $\exists d(\text{~Rainy}(d) \to \text{Cold}(d))$ $\exists d(\text{Rainy}(d) \wedge \text{~Cold}(d))$
answered
in
Mathematical Logic
Jun 2, 2017
7.8k
views
gatecse-2014-set3
mathematical-logic
easy
first-order-logic
Page:
« prev
1
2
3
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...