Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for discrete-mathematics
32
votes
14
answers
1
GATE CSE 2019 | Question: 12
Let $G$ be an undirected complete graph on $n$ vertices, where $n > 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to $n!$ $(n-1)!$ $1$ $\frac{(n-1)!}{2}$
Let $G$ be an undirected complete graph on $n$ vertices, where $n 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to$n!$$(n-1)!$$1$$\frac{(n-1)!}{2}...
Arjun
21.0k
views
Arjun
asked
Feb 7, 2019
Graph Theory
gatecse-2019
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
1-mark
+
–
0
votes
3
answers
2
NIELIT 2017 July Scientist B (IT) - Section B: 2
Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph? In adjacency list representation, space is saved for sparse graphs. Deleting a vertex in adjacency list ... Adding a vertex in adjacency list representation is easier than adjacency matrix representation. All of the option.
Which of the following is an advantage of adjacency list representation over adjacency matrix representation of a graph?In adjacency list representation, space is saved f...
admin
17.7k
views
admin
asked
Mar 30, 2020
Graph Theory
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
+
–
40
votes
6
answers
3
GATE CSE 2019 | Question: 38
Let $G$ be any connected, weighted, undirected graph. $G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight. $G$ has a unique minimum spanning tree, if, for every cut of $G$, there is a unique minimum-weight edge crossing the cut. Which of the following statements is/are TRUE? I only II only Both I and II Neither I nor II
Let $G$ be any connected, weighted, undirected graph.$G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight.$G$ has a unique minimum spanning...
Arjun
20.3k
views
Arjun
asked
Feb 7, 2019
Graph Theory
gatecse-2019
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
2-marks
+
–
66
votes
10
answers
4
GATE CSE 2019 | Question: 35
Consider the first order predicate formula $\varphi$: $\forall x [ ( \forall z \: z | x \Rightarrow (( z=x) \vee (z=1))) \rightarrow \exists w ( w > x) \wedge (\forall z \: z | w \Rightarrow ((w=z) \vee (z=1)))]$ Here $a \mid b$ denotes ... of all integers Which of the above sets satisfy $\varphi$? $S_1$ and $S_2$ $S_1$ and $S_3$ $S_2$ and $S_3$ $S_1, S_2$ and $S_3$
Consider the first order predicate formula $\varphi$:$\forall x [ ( \forall z \: z | x \Rightarrow (( z=x) \vee (z=1))) \rightarrow \exists w ( w x) \wedge (\forall z \:...
Arjun
19.8k
views
Arjun
asked
Feb 7, 2019
Mathematical Logic
gatecse-2019
engineering-mathematics
discrete-mathematics
mathematical-logic
first-order-logic
2-marks
+
–
0
votes
2
answers
5
Discrete Mathematics and Its Applications by Kenneth H. Rosen
From where can i get full solution of Discrete Mathematics and Its Applications by Kenneth H. Rosen ?
From where can i get full solution of Discrete Mathematics and Its Applications by Kenneth H. Rosen ?
kaleen bhaiya
17.5k
views
kaleen bhaiya
asked
Jan 23, 2022
Mathematical Logic
discrete-mathematics
kenneth-rosen
+
–
37
votes
9
answers
6
GATE CSE 2019 | Question: 10
Let $G$ be an arbitrary group. Consider the following relations on $G$: $R_1: \forall a , b \in G, \: a R_1 b \text{ if and only if } \exists g \in G \text{ such that } a = g^{-1}bg$ ... $R_1$ and $R_2$ $R_1$ only $R_2$ only Neither $R_1$ nor $R_2$
Let $G$ be an arbitrary group. Consider the following relations on $G$:$R_1: \forall a , b \in G, \: a R_1 b \text{ if and only if } \exists g \in G \text{ such that } a ...
Arjun
17.2k
views
Arjun
asked
Feb 7, 2019
Set Theory & Algebra
gatecse-2019
engineering-mathematics
discrete-mathematics
set-theory&algebra
group-theory
1-mark
+
–
36
votes
5
answers
7
GATE CSE 2007 | Question: 85
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move to either $(i + 1, j)$ or $(i,j + 1)$. Suppose that the robot is not allowed to traverse the ... $^{20}\mathrm{C}_{10} - ^{8}\mathrm{C}_{4}\times ^{11}\mathrm{C}_{5}$
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move...
go_editor
9.3k
views
go_editor
asked
Apr 23, 2016
Combinatory
gatecse-2007
combinatory
normal
discrete-mathematics
+
–
0
votes
2
answers
8
Kenneth Rosen Edition 7 Exercise 6.3 Question 26 (Page No. 414)
Thirteen people on a softball team show up for a game. How many ways are there to choose $10$ players to take the field? How many ways are there to assign the $10$ positions by selecting players from the $13$ people who show ... ways are there to choose $10$ players to take the field if at least one of these players must be a woman?
Thirteen people on a softball team show up for a game.How many ways are there to choose $10$ players to take the field?How many ways are there to assign the $10$ position...
admin
4.4k
views
admin
asked
Apr 29, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
combinatory
descriptive
+
–
0
votes
0
answers
9
#discrete
Çșȇ ʛấẗẻ
60
views
Çșȇ ʛấẗẻ
asked
Feb 24
Mathematical Logic
discrete-mathematics
kenneth-rosen
+
–
0
votes
1
answer
10
Permutation and combination
Çșȇ ʛấẗẻ
120
views
Çșȇ ʛấẗẻ
asked
Feb 15
Mathematical Logic
combinatory
engineering-mathematics
discrete-mathematics
+
–
0
votes
4
answers
11
Computer Science - UGC NET 2021 [ Question ID = 2353 ]
How many ways are there to assign 5 different jobs to 4 different employees if every employee is assigned at least 1 job ? 1024 625 240 20
How many ways are there to assign 5 different jobs to 4 different employees if every employee is assigned at least 1 job ?1024 625 240 20
rajeshposts
678
views
rajeshposts
asked
Sep 17, 2023
Combinatory
discrete-mathematics
permutation-combination
engineering-mathematics
+
–
1
votes
1
answer
12
#self doubt
In the above figure, how many topological sorts are possible, I tried the following method, if we include 5 _ _ _ _ _ for 5 space 5c3 for (2,3,1) then 2 position is 4,0 so a total of 10 if we do like 4 5 _ _ _ _ then only ... GFG the total possible sorts are 13 can someone why this difference is coming ? https://www.geeksforgeeks.org/all-topological-sorts-of-a-directed-acyclic-graph/
In the above figure, how many topological sorts are possible,I tried the following method,if we include 5 _ _ _ _ _ for 5 space 5c3 for (2,3,1) then 2 position is 4,0 so ...
Dknights
129
views
Dknights
asked
Jan 31
Graph Theory
discrete-mathematics
+
–
0
votes
1
answer
13
#self doubt
Can someone please explain the following case of combination I means identical D means different DOIB with boxes being empty and non empty As in this question the given value in question itself i am not able to interpret. https://gateoverflow.in/420251/go-classes-test-series-2024-mock-gate-test-12-question-17
Can someone please explain the following case of combinationI means identicalD means different DOIB with boxes being empty and non emptyAs in this question the given valu...
Dknights
191
views
Dknights
asked
Jan 28
Combinatory
discrete-mathematics
+
–
0
votes
0
answers
14
#self doubt
Can someone please verify it ? isn't should be 8. https://www.toppr.com/ask/question/the-cardinality-of-the-power-set-of-left-phi-left-phiright-left-phi-left/ Let S={ϕ,{ϕ},{ϕ,{ϕ}}} P(s)= Power Set of set S P(s)={ϕ,{ϕ},{ϕ,{ϕ}},{ϕ,{ϕ,{ϕ}}},{{ϕ},{ϕ,{ϕ}}},{ϕ,{ϕ},{ϕ,{ϕ}}}} n(P(s))=6.
Can someone please verify it ? isn't should be 8. https://www.toppr.com/ask/question/the-cardinality-of-the-power-set-of-left-phi-left-phiright-left-phi-left/Let S={ϕ,{�...
Dknights
111
views
Dknights
asked
Feb 6
Set Theory & Algebra
discrete-mathematics
+
–
0
votes
1
answer
15
Made easy mock test questions from Functions
Can you explain the procedure and if possible can you share some links to any youtube playlist from where I can study this particular subject(Functions).
Can you explain the procedure and if possible can you share some links to any youtube playlist from where I can study this particular subject(Functions).
Rohit Chakraborty
143
views
Rohit Chakraborty
asked
Jan 15
Set Theory & Algebra
test-series
functions
discrete-mathematics
gate-preparation
made-easy-test-series
+
–
0
votes
2
answers
16
ISRO 2024
Which of the following are true? In a graph G with ‘n’ vertices and ‘e’ edges, sum of degrees of vertices = 2*e. Eccentricity of a connected graph can never be equal to radius of the graph Girth of a graph is the shortest cycle of the graph Graph with equal degree for all vertices is multigraph (i), (ii), (iii) (ii), (iii), (iv) (i), (iii), (iv) None of the above
Which of the following are true?In a graph G with ‘n’ vertices and ‘e’ edges, sum of degrees of vertices = 2*e.Eccentricity of a connected graph...
Ramayya
406
views
Ramayya
asked
Jan 7
Graph Theory
isro-2024
discrete-mathematics
graph-theory
+
–
0
votes
1
answer
17
ISRO 2024
Maximum number of Simple graphs possible with $n$ vertices $2^{n(n-1)/2}$ $2^{(n-1)/2}$ $2^{n(n+1)/2}$ $2^{n(n+1)}$
Maximum number of Simple graphs possible with $n$ vertices$2^{n(n-1)/2}$$2^{(n-1)/2}$$2^{n(n+1)/2}$$2^{n(n+1)}$
Ramayya
173
views
Ramayya
asked
Jan 7
Graph Theory
isro-2024
graph-theory
discrete-mathematics
+
–
1
votes
0
answers
18
Made Easy: Counting number of subgraphs of the given graph. How should I approach this question?
tishhaagrawal
497
views
tishhaagrawal
asked
Dec 16, 2023
Graph Theory
gate-preparation
test-series
made-easy-test-series
self-doubt
counting
graph-theory
discrete-mathematics
graph-connectivity
+
–
0
votes
1
answer
19
GATE 2023 | Maths | Sample Ques for CS-IT
Let \(G\) be an abelian group and \(\Phi: G \rightarrow (\mathbb{Z}, +)\) be a surjective group homomorphism. Let \(1 = \Phi(a)\) for some \(a \in G\). Consider the following statements: \(P\): For every \(g \in G\), there exists an \(n \in \ ... following statements is/are correct? (A) \(P\) is TRUE (B) \(P\) is FALSE (C) \(Q\) is TRUE (D) \(Q\) is FALSE
Let \(G\) be an abelian group and \(\Phi: G \rightarrow (\mathbb{Z}, +)\) be a surjective group homomorphism. Let \(1 = \Phi(a)\) for some \(a \in G\).Consider the follow...
rajveer43
65
views
rajveer43
asked
Jan 10
Set Theory & Algebra
set-theory
discrete-mathematics
+
–
0
votes
1
answer
20
MADE EASY TEST SERIES
Pls solve it
Pls solve it
Dadu
167
views
Dadu
asked
Jan 2
Set Theory & Algebra
discrete-mathematics
made-easy-test-series
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register