Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged kennethrosen
0
votes
0
answers
Kenneth Rosen Exercise 10.4 question 25 Graph Connectivity
asked
Apr 26
in
Graph Theory
by
ami_c05
(
5
points)

14
views
kennethrosen
discretemaths
graphtheory
0
votes
1
answer
Kenneth H Rosen
Show that $p<>q$ and ~p <>~q are logically equivalent.
asked
Mar 20
in
Mathematical Logic
by
ShivangiChauhan
(
17
points)

24
views
kennethrosen
discretemaths
+1
vote
1
answer
Kenneth H Rosen
Let p and q be propositions p: I bought a lottery ticket this week q: I won the milliondollar jackpot Express each of these propositions as English sentences (i) ~p (ii) p$\vee$q (iii) p$\rightarrow$q (iv) p$\wedge$q (v) p$\Leftrightarrow$q (vi) ~p$\rightarrow$~q (vii) ~p$\wedge$~q (viii) ~p$\vee$(p$\wedge$q)
asked
Mar 20
in
Mathematical Logic
by
ShivangiChauhan
(
17
points)

27
views
kennethrosen
discretemaths
0
votes
0
answers
Kenneth H rosen Chapter 6  "Counting" Section 6.4
asked
Jan 20
in
Combinatory
by
ykrishnay
(
7
points)

20
views
kennethrosen
discretemaths
combinatory
counting
0
votes
1
answer
Kenneth H Rosen
What is the meaning of all the four options? Please explain in detail.
asked
Nov 27, 2020
in
Mathematical Logic
by
Kindaichi
(
10
points)

40
views
kennethrosen
discretemaths
0
votes
1
answer
Kenneth h rosen 7th Edition chapter 2 section 2.5 "cardinality of sets"
asked
Nov 21, 2020
in
Set Theory & Algebra
by
ykrishnay
(
7
points)

30
views
kennethrosen
discretemaths
combinatory
0
votes
0
answers
Kenneth h rosen 7th Edition chapter 2 section 2.4 "Sequences and Summation"
asked
Nov 20, 2020
in
Set Theory & Algebra
by
ykrishnay
(
7
points)

25
views
kennethrosen
discretemaths
combinatory
+1
vote
1
answer
Kenneth Louden Compiler construction, 1997 chapter 4 exercise 4.7
asked
Nov 16, 2020
in
Compiler Design
by
Nivesh
(
9
points)

39
views
kennethrosen
0
votes
0
answers
Kenneth Rosen specific sections
Hi, I have been referring to Kenneth Rosen for Discrete Mathematics for GATE 2021 and since I have less time left, I would like to know which specific sections are to be read from the chapters in syllabus. I already know we have to go through ... or just some part of these chapters? If specific parts are to be completed can you please guide me with it? Thank you
asked
Oct 3, 2020
in
Mathematical Logic
by
motabhai
(
5
points)

31
views
kennethrosen
0
votes
0
answers
UGC NET 2016 as well as Discrete Maths Kenneth Rosen PAGE Pg 657 Q21
asked
Sep 15, 2020
in
Set Theory & Algebra
by
ijnuhb
(
747
points)

26
views
kennethrosen
combinatory
0
votes
2
answers
KENNETH ROSEN DISCRETE MATHEMATICS PAGE 432 Q11
How many ways are there to chose eight coins from piggy bank containing 100 identical pennies and 80 identical nickels.
asked
Sep 14, 2020
in
Combinatory
by
ijnuhb
(
747
points)

101
views
kennethrosen
combinatory
counting
discretemaths
0
votes
1
answer
Discrete Mathematics and Its Applications (7th Edition)  Kenneth Rosen
asked
Aug 19, 2020
in
Algorithms
by
sankalpmittal
(
41
points)

60
views
kennethrosen
algorithms
+1
vote
1
answer
K Rosen(7th ed). Chapter 6. Exercise 6.4. Q.17.
Question: Answer 1: Answer 2: I am not able to understand the solution.What’s happening here? Please help.
asked
Aug 13, 2020
in
Combinatory
by
RasMalai
(
27
points)

32
views
kennethrosen
combinatory
counting
discretemaths
0
votes
3
answers
RosenChapter 8, Ex 8.5,Question 24
Find the probability that when a fair coin is flipped five times tails comes up exactly three times, the first and last flips come up tails, or the second and fourth flips come up heads.
asked
Aug 7, 2020
in
Combinatory
by
KUSHAGRA गुप्ता
(
1.4k
points)

133
views
kennethrosen
discretemathematics
0
votes
0
answers
Recurrence relation  ROSEN
$1.\ a_{k}=3a_{k1}+4^{k1} a_{0}=1$ $2.\ a_{k}=4a_{k1}4_{k2}+k^2 a_{0}=2,a_{1}=5$
asked
Aug 6, 2020
in
Combinatory
by
KUSHAGRA गुप्ता
(
1.4k
points)

78
views
recurrencerelations
kennethrosen
discretemathematics
+1
vote
1
answer
Kenneth Rosen(7th ed). Chapter 6. Example 16.
Each user on a computer system has a password, which is six to eight characters long, where each character is an uppercase letter or a digit. Each password must contain at least one digit. How many possible passwords are there? Answer is given in book as : P^6 + P ... on for P^7 and P8. My question is why can't we calculate P^6 like 36^5 * C(6,1) * 10 ?
asked
Jul 29, 2020
in
Combinatory
by
RasMalai
(
27
points)

28
views
combinatory
counting
kennethrosen
0
votes
0
answers
Kenneth Rosen 7th edition chapter 1.5 Exercise 12
Let I(x)be the statement x has an Internet connection and C(x,y) be the statement x and y have chatted over the Internet, where the domain for the variables x and y consists of all students in your class. Use quantiﬁers ... to ask what will be the answer if statement means there are exactly two students who have not chatted with each other .
asked
May 27, 2020
in
Mathematical Logic
by
ayush.5
(
99
points)

22
views
kennethrosen
discretemaths
0
votes
0
answers
Kenneth Rosen 7th edition Chapter 9relations exercise 9.6
asked
Apr 19, 2020
in
Set Theory & Algebra
by
sriranjanivenkat99
(
5
points)

18
views
kennethrosen
relation
0
votes
0
answers
Propositional logicexercise 1.4question10
Let F (x,y) be the statement such as x can fool y .where the domain consists of all people in world . Express following statement using quantifiers i>Nancy can fool exactly 2 person I have expressed this as: ∃x ∃y(F(Nancy,x) ^ F(Nancy,y)^ (x!=y)∀z(((z!=x)^(z!=y ... F(x,x) ^ F(x,y) ^∀z( ((z!=y) ^ (z!=x)) <> !F(x,z)) Is this correct?Please verify
asked
Apr 9, 2020
in
Mathematical Logic
by
Doraemon
(
69
points)

8
views
propositionallogic
kennethrosen
0
votes
1
answer
#discrete mathematics #exponential generating function
asked
Apr 2, 2020
in
Combinatory
by
souren
(
9
points)

20
views
discretemaths
kennethrosen
0
votes
0
answers
Kenneth Rosen discrete mathematics seventh edition page 379 exercise 5.5 question 33
asked
Nov 25, 2019
in
Mathematical Logic
by
Ram Swaroop
(
381
points)

28
views
kennethrosen
discretemaths
counting
combinatory
0
votes
1
answer
GENERATING FUNCTION: Kenneth Rosen
Find the generating function of the sequence 2, 4, 10, 28, 82, ……
asked
Nov 18, 2019
in
Combinatory
by
Debapaul
(
541
points)

26
views
kennethrosen
0
votes
0
answers
Kenneth Rosen7th editionChapter 9:RelationsExercise:9.6
asked
Oct 10, 2019
in
Databases
by
KUSHAGRA गुप्ता
(
1.4k
points)

84
views
kennethrosen
relation
lattice
0
votes
1
answer
Doubt lower and upper bound hasse diagram Rosen book Discrete mathematics
asked
Sep 27, 2019
in
Mathematical Logic
by
shaktisingh
(
103
points)

85
views
discretemaths
kennethrosen
hassediagram
0
votes
1
answer
Kenneth Rosen 9.5 Exercise 15
Let R be the relation on the set of ordered pairs of positive integers such that ((a,b),(c,d)) ∈ R if and only if a+d = b+c. Show that R is an equivalence relation.
asked
Sep 11, 2019
in
Set Theory & Algebra
by
sohailkhan
(
5
points)

46
views
kennethrosen
discretemaths
equivalencerelation
0
votes
1
answer
kenneth rosen inference rules
Show that the premises It is not sunny this afternoon and it is colder than yesterday, We will go swimming only if it is sunny, If we do not go swimming, then we will take a canoe trip, and If we take a canoe trip, then we will ... >t . which is always true hence the argument is true But the conclusion is not true. Am I correct with the above statement??
asked
Aug 18, 2019
in
Mathematical Logic
by
Doraemon
(
69
points)

53
views
mathematicallogic
kennethrosen
discretemaths
0
votes
1
answer
self doubt kenneth rosen
"In the statement ∃x(x + y = 1), the variable x is bound by the existential quantification ∃x, but the variable y is free because it is not bound by a quantifier and no value is assigned to this variable. This illustrates that in the statement ∃x(x ... y is free becoz it is not bound by a quantifier. thats it!!,Why is no value is assigned to this variable. written?
asked
Aug 18, 2019
in
Mathematical Logic
by
Doraemon
(
69
points)

36
views
discretemaths
kennethrosen
propositionallogic
0
votes
0
answers
Kenneth Rosen ex 1.3 q 43
How $( \forall x (P(x) → Q(x) ) → (\forall x(P(x) → \forall (Q(x))$ is true ?
asked
Aug 17, 2019
in
Mathematical Logic
by
Winner
(
75
points)

20
views
kennethrosen
discretemaths
propositionallogic
0
votes
1
answer
Kenneth Rosen ex 1.3 q50
How $\forall x (P(x)) \vee \forall x (Q(x)) → \forall x (P(x) \vee Q(x))$. Why not biconditional?
asked
Aug 17, 2019
in
Mathematical Logic
by
Winner
(
75
points)

24
views
kennethrosen
propositionallogic
0
votes
1
answer
Kenneth Rosen Edition 7 Exercise 10.2 Question 44
Suppose that $d_{1}, d_{2}, ..., d_{n}$ is a graphic sequence. Show that there is a simple graph with vertices $v_{1}, v_{2}, …, v_{n}$ such that deg($v_{i}$) = $d_{i}$ for i = 1,2, …, n and $v_{1}$ is adjacent to $v_{2}, …, v_{d1 + 1}$.
asked
Aug 11, 2019
in
Graph Theory
by
dhruv_sachdev
(
5
points)

28
views
kennethrosen
graphtheory
0
votes
1
answer
Kenneth Rosen
6. Consider a graph where its vertices are representing as n bit signal. 2 vertices are only connected with each other if their bit positions only differs by exactly 1 bit (n >= 2). Then the degree sequence of G is ___________________________.
asked
Jul 13, 2019
in
Graph Theory
by
`JEET
(
187
points)

74
views
graphtheory
kennethrosen
rosen
0
votes
1
answer
Kenneth Rosen7th editionChapter 10/10.8
THE FOUR COLOR THEOREM: The chromatic number of a planar graph is no greater than four. Question #40 (10.8) : Show that every planar graph G can be colored using six or fewer colors. Question #41 (10.8) : Show that every planar graph G ... is already stated in the four color theorem that we don't require more than 4 colors in order to color a planar graph.
asked
Jul 11, 2019
in
Graph Theory
by
KUSHAGRA गुप्ता
(
1.4k
points)

48
views
kennethrosen
graphtheory
0
votes
1
answer
Doubt on Stars and Bars Counting ROSEN Chapter 7 Advanced Counting
asked
Jun 30, 2019
in
Combinatory
by
N
(
5
points)

58
views
combinatory
kennethrosen
counting
0
votes
0
answers
Kenneth Rosen Edition7 Chapter6 Example8
How many ways are there to distribute hands of 5 cards to each of four players from the standard deck of 52 cards? Why this question can not be solved using the category of COMBINATION WITH REPETITION? I was thinking four players as four boxes with each having 5 balls and 52 cards as 52 similar balls. Please someone clarify the mistake i am doing.
asked
Jun 29, 2019
in
Combinatory
by
KUSHAGRA गुप्ता
(
1.4k
points)

27
views
kennethrosen
combinatory
To see more, click for the
full list of questions
or
popular tags
.
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
9,270
questions
3,204
answers
14,751
comments
96,304
users