The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged combinatory
Webpage for Combinatory:
+2
votes
1
answer
1
Counting number of pairs whose sum is less than k
How many pairs $(x,y)$ such that $x+y <= k$, where x y and k are integers and $x,y>=0, k > 0$. Solve by summation rules. Solve by combinatorial argument.
asked
Jun 9
in
Combinatory
by
dd

206
views
combinatory
summation
descriptive
0
votes
0
answers
2
Kenneth Rosen Edition 7th Exercise 6.6 Question 16 (Page No. 439)
The remaining exercises in this section develop another algorithm for generating the permutations of $\{1, 2, 3,\dots,n\}.$ This algorithm is based on Cantor expansions of integers. Every nonnegative integer less than $n!$ ... between Cantor expansions and permutations as described in the preamble to question $14.$ $3$ $89$ $111$
asked
May 2
in
Combinatory
by
Lakshman Patel RJIT

20
views
kennethrosen
discretemathematics
counting
combinatory
descriptive
0
votes
0
answers
3
Kenneth Rosen Edition 7th Exercise 6.6 Question 17 (Page No. 438)
The remaining exercises in this section develop another algorithm for generating the permutations of $\{1, 2, 3,\dots,n\}.$ ... permutations of a set of n elements based on the correspondence described in the preamble to question $14.$
asked
May 2
in
Combinatory
by
Lakshman Patel RJIT

9
views
kennethrosen
discretemathematics
counting
combinatory
descriptive
0
votes
0
answers
4
Kenneth Rosen Edition 7th Exercise 6.6 Question 15 (Page No. 438)
Show that the correspondence described in the preamble is a bijection between the set of permutations of $\{1, 2, 3,\dots,n\}$ and the nonnegative integers less than $n!.$
asked
May 2
in
Combinatory
by
Lakshman Patel RJIT

7
views
kennethrosen
discretemathematics
counting
combinatory
descriptive
0
votes
0
answers
5
Kenneth Rosen Edition 7th Exercise 6.6 Question 14 (Page No. 438)
The remaining exercises in this section develop another algorithm for generating the permutations of $\{1, 2, 3,\dots,n\}.$ This algorithm is based on Cantor expansions of integers. Every nonnegative integer less than $n!$ has a unique ... $a_{1}, a_{2},\dots,a_{n−1}$ that correspond to these permutations. $246531$ $12345$ $654321$
asked
May 2
in
Combinatory
by
Lakshman Patel RJIT

10
views
kennethrosen
discretemathematics
counting
combinatory
descriptive
0
votes
1
answer
6
Kenneth Rosen Edition 7th Exercise 6.6 Question 13 (Page No. 438)
List all $3$permutations of $\{1, 2, 3, 4, 5\}.$
asked
May 2
in
Combinatory
by
Lakshman Patel RJIT

15
views
kennethrosen
discretemathematics
counting
combinatory
descriptive
0
votes
1
answer
7
Kenneth Rosen Edition 7th Exercise 6.6 Question 12 (Page No. 438)
Develop an algorithm for generating the $r$permutations of a set of $n$ elements.
asked
May 2
in
Combinatory
by
Lakshman Patel RJIT

9
views
kennethrosen
discretemathematics
counting
combinatory
descriptive
0
votes
0
answers
8
Kenneth Rosen Edition 7th Exercise 6.6 Question 11 (Page No. 438)
Show that Algorithm $3$ produces the next larger $r$combination in lexicographic order after a given $r$combination.
asked
May 2
in
Combinatory
by
Lakshman Patel RJIT

8
views
kennethrosen
discretemathematics
counting
combinatory
descriptive
0
votes
0
answers
9
Kenneth Rosen Edition 7th Exercise 6.6 Question 10 (Page No. 438)
Show that Algorithm $1$ produces the next larger permutation in lexicographic order.
asked
May 2
in
Combinatory
by
Lakshman Patel RJIT

7
views
kennethrosen
discretemathematics
counting
combinatory
descriptive
0
votes
0
answers
10
Kenneth Rosen Edition 7th Exercise 6.6 Question 9 (Page No. 438)
Use Algorithm $3$ to list all the $3$combinations of $\{1, 2, 3, 4, 5\}.$
asked
May 2
in
Combinatory
by
Lakshman Patel RJIT

8
views
kennethrosen
discretemathematics
counting
combinatory
descriptive
Page:
1
2
3
4
5
6
...
28
next »
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
IISc CDS Interview Experience, 2020
IITD MS CSE (Systems) Experience
IIT Bombay M.Tech. (RA)  Interview Experience
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.5k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(23)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent questions tagged combinatory
Recent Blog Comments
Yeah, Now it's on.
Can you check now?
Even I filled NIELIT form which had similar...
Today's test will be late  either midnight or...
on what time will be today's test?
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,375
questions
60,554
answers
201,952
comments
95,375
users