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
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Recent questions in Discrete Mathematics
2
votes
1
answer
5361
UGC NET CSE | June 2013 | Part 2 | Question: 5
Cyclometric complexity of a flow graph G with n vertices and e edges is V(G) = e+n-2 V(G) = e-n+2 V(G) = e+n+2 V(G) = e-n-2
go_editor
asked
in
Graph Theory
Jul 13, 2016
by
go_editor
748
views
ugcnetcse-june2013-paper2
graph-theory
2
votes
2
answers
5362
UGC NET CSE | December 2012 | Part 3 | Question: 75
Let $\theta(x, y, z)$ be the statement x+y=z and let there be two quantification given as $\forall x \forall y \exists z \theta (x,y,z)$ $\exists z \forall x \forall y \theta (x,y,z)$ where x, y, z are real numbers, then which ... is correct? I is true and II is true I is true and II is false I is false and II is true I is false and II is false
go_editor
asked
in
Discrete Mathematics
Jul 13, 2016
by
go_editor
2.2k
views
ugcnetcse-dec2012-paper3
discrete-mathematics
propositional-logic
2
votes
3
answers
5363
UGC NET CSE | December 2012 | Part 3 | Question: 58
Skolmization is the process of bringing all the quantifiers in the beginning of a formula in FDL removing all the universal quantifiers removing all the extential quantifiers all of the above
go_editor
asked
in
Discrete Mathematics
Jul 13, 2016
by
go_editor
3.3k
views
ugcnetcse-dec2012-paper3
engineering-mathematics
discrete-mathematics
first-order-logic
5
votes
2
answers
5364
UGC NET CSE | December 2012 | Part 3 | Question: 46
Two graphs A and B are shown below: Which one of the following statements is true? Both A and B are planar Neither A nor B is planar A is planar and B is not B is planar and A is not
go_editor
asked
in
Graph Theory
Jul 13, 2016
by
go_editor
2.2k
views
ugcnetcse-dec2012-paper3
graph-theory
graph-planarity
1
vote
1
answer
5365
UGC NET CSE | June 2014 | Part 3 | Question: 65
Given the following statements : $S_{1}$ : The subgraph-isomorphism problem takes two graphs $G_{1}$ and $G_{2}$ and asks whether $G_{1}$ is a subgraph of $G_{2}$ . $S_{2}$ : The set-partition problem takes as input a set $S$ of numbers and asks whether ... is $P$ problem and $S_{2}$ is $P$ problem. $S_{1}$ is $P$ problem and $S_{2}$ is $NP$ problem.
makhdoom ghaya
asked
in
Graph Theory
Jul 12, 2016
by
makhdoom ghaya
1.2k
views
ugcnetjune2014iii
graph-theory
0
votes
2
answers
5366
UGC NET CSE | December 2012 | Part 3 | Question: 34
The power set of AUB, where A={2, 3, 5, 7} and B={2, 5, 8, 9}is 256 64 16 4
go_editor
asked
in
Discrete Mathematics
Jul 12, 2016
by
go_editor
3.9k
views
ugcnetcse-dec2012-paper3
engineering-mathematics
discrete-mathematics
set-theory
0
votes
2
answers
5367
UGC NET CSE | December 2012 | Part 3 | Question: 29
$58$ lamps are to be connected to a single electric outlet by using an extension board each of which has four outlets. The number of extension boards needed to connect all the light is $28$ $29$ $20$ $19$
go_editor
asked
in
Combinatory
Jul 12, 2016
by
go_editor
3.7k
views
ugcnetcse-dec2012-paper3
combinatory
1
vote
1
answer
5368
UGC NET CSE | December 2012 | Part 3 | Question: 21
How many solutions do the following equations have? $x_1 + x_2 + x_3 =11$ where $x_1 \geq 1, x_2 \geq 2, x_3 \geq 3$ $C(7, 11)$ $C(11, 3)$ $C(14, 11)$ $C(7, 5)$
go_editor
asked
in
Discrete Mathematics
Jul 12, 2016
by
go_editor
1.0k
views
ugcnetcse-dec2012-paper3
discrete-mathematics
combinatory
0
votes
1
answer
5369
UGC NET CSE | December 2012 | Part 3 | Question: 20
The number of ways to distribute n distinguishable objects into k distinguishable boxes, so that $n_i$ objects are placed into box $i$, $i=1, 2, \dots k$ equals which of the following? $\frac{n!}{n_1!+n_2!+ \dots + n_k!}$ ... $\frac{ n_1! n_2! \dots n_k!}{n_1! - n_2! - n_3! \dots - n_k!}$
go_editor
asked
in
Combinatory
Jul 12, 2016
by
go_editor
1.4k
views
ugcnetcse-dec2012-paper3
discrete-mathematics
combinatory
3
votes
1
answer
5370
UGC NET CSE | December 2012 | Part 3 | Question: 19
Identify the following activation function: $\Phi (V) = Z +\frac{1}{1+ exp(-x*V+Y)}$, Z, X, Y are parameters. Step function Ramp function Sigmoid function Gaussian function
go_editor
asked
in
Discrete Mathematics
Jul 12, 2016
by
go_editor
3.8k
views
ugcnetcse-dec2012-paper3
discrete-mathematics
functions
0
votes
3
answers
5371
if the proposition all thieves are poor is false
If the propostion 'All thieves are poor' is false, which of the following propositions can be claimed certainly to be true? Some thieves are poor Some thieves are not poor No thief is poor No poor person is a thief
Sanjay Sharma
asked
in
Mathematical Logic
Jul 12, 2016
by
Sanjay Sharma
2.7k
views
propositional-logic
0
votes
2
answers
5372
logics
confused between (a) and (c).
Amit puri
asked
in
Mathematical Logic
Jul 11, 2016
by
Amit puri
502
views
2
votes
2
answers
5373
UGC NET CSE | June 2016 | Part 3 | Question: 70
Consider the statement "Either $-2 \leq x \leq -1 \text{ or } 1 \leq x \leq 2$" The negation of this statement is x<-2 or 2<x or -1<x<1 x<-2 or 2<x -1<x<1 x $\leq$ -2 or 2 $\leq$ x or -1<x<1
Sanjay Sharma
asked
in
Discrete Mathematics
Jul 11, 2016
by
Sanjay Sharma
2.7k
views
ugcnetcse-june2016-paper3
linear-programming
2
votes
1
answer
5374
if R1 and R2 are reflexive relations on set A, then is R1 intersection R2 irreflexive?
if R1 and R2 are reflexive relations on set A, then is R1 intersection R2 irreflexive?
kirankochhar
asked
in
Set Theory & Algebra
Jul 11, 2016
by
kirankochhar
7.3k
views
set-theory&algebra
relations
4
votes
1
answer
5375
UGC NET CSE | June 2016 | Part 2 | Question: 3
Suppose that $R_1$ and $R_2$ are reflecive relations on a set A. Which of the following statements is correct? $R_1 \cap R_2$ is reflexive and $R_1 \cup R_2$ is irreflexive $R_1 \cap R_2$ is irreflexive and $R_1 \cup R_2$ is reflexive Both $R_1 \cap R_2$ and $R_1 \cup R_2$ are reflexive Both $R_1 \cap R_2$ and $R_1 \cup R_2$ are irreflexive
Sanjay Sharma
asked
in
Set Theory & Algebra
Jul 11, 2016
by
Sanjay Sharma
2.6k
views
ugcnetcse-june2016-paper2
discrete-mathematics
relations
1
vote
1
answer
5376
UGC NET CSE | December 2012 | Part 2 | Question: 33
Consider the tree given below: Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree: d & h c & k g, b, c, h, i, m c & h
go_editor
asked
in
Graph Theory
Jul 11, 2016
by
go_editor
4.6k
views
ugcnetcse-dec2012-paper2
graph-theory
tree
graph-connectivity
3
votes
3
answers
5377
Reflexive ,symmetric relation
How many relations are reflexive or symmetric on set of n element?
Anjali_aspirant
asked
in
Combinatory
Jul 10, 2016
by
Anjali_aspirant
10.6k
views
relations
0
votes
1
answer
5378
Dearrangement
Please explain the dearrangement concept with example
Anjali_aspirant
asked
in
Combinatory
Jul 10, 2016
by
Anjali_aspirant
510
views
combinatory
0
votes
3
answers
5379
UGC NET CSE | June 2014 | Part 3 | Question: 32
________ predicate calculus allows quantified variables to refer to objects in the domain of discourse and not to predicates or functions. Zero-order First-order Second-order High-order
makhdoom ghaya
asked
in
Mathematical Logic
Jul 9, 2016
by
makhdoom ghaya
3.4k
views
ugcnetjune2014iii
discrete-mathematics
mathematical-logic
1
vote
1
answer
5380
UGC NET CSE | December 2012 | Part 2 | Question: 10
The number of bit strings of length eight that will either start with a 1 bit and end with two bits 00 shall be 32 64 128 160
go_editor
asked
in
Combinatory
Jul 8, 2016
by
go_editor
1.5k
views
ugcnetcse-dec2012-paper2
combinatory
recurrence-relation
Page:
« prev
1
...
264
265
266
267
268
269
270
271
272
273
274
...
355
next »
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)
Discrete Mathematics
(7.1k)
Mathematical Logic
(2.5k)
Set Theory & Algebra
(1.9k)
Combinatory
(1.6k)
Graph Theory
(1.1k)
Probability
(1.4k)
Linear Algebra
(1.1k)
Calculus
(792)
Optimization
(0)
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 questions in Discrete Mathematics
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:...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Aptitude Overflow