Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Hot questions in Engineering Mathematics
1
votes
0
answers
2521
NIELIT 2016 MAR Scientist B - Section B: 8
If $\Delta f(x)= f(x+h)-f(x)$, then a constant $k,\Delta k$ $1$ $0$ $f(k)-f(0)$ $f(x+k)-f(x)$
If $\Delta f(x)= f(x+h)-f(x)$, then a constant $k,\Delta k$$1$$0$$f(k)-f(0)$$f(x+k)-f(x)$
admin
456
views
admin
asked
Mar 31, 2020
Set Theory & Algebra
nielit2016mar-scientistb
discrete-mathematics
set-theory&algebra
functions
+
–
2
votes
2
answers
2522
coin
A fair coin is tossed n times .find probability of difference between head and tails is n-3
A fair coin is tossed n times .find probability of difference between head and tails is n-3
Pooja Palod
4.2k
views
Pooja Palod
asked
Dec 16, 2015
Probability
probability
easy
+
–
0
votes
0
answers
2523
Kenneth Rosen Edition 7 Exercise 8.1 Question 57 (Page No. 512)
Dynamic programming can be used to develop an algorithm for solving the matrix-chain multiplication problem introduced in Section $3.3.$ This is the problem of determining how the product $A_{1}A_{2} \dots A_{n}$ can be computed ... algorithm from part $(D)$ has $O(n^{3})$ worst-case complexity in terms of multiplications of integers.
Dynamic programming can be used to develop an algorithm for solving the matrix-chain multiplication problem introduced in Section $3.3.$ This is the problem of determinin...
admin
258
views
admin
asked
May 3, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
descriptive
+
–
0
votes
0
answers
2524
Kenneth Rosen Edition 7 Exercise 6.1 Question 59 (Page No. 398)
Suppose that at some future time every telephone in the world is assigned a number that contains a country code $1$ to $3$ digits long, that is, of the form X, XX, or XXX, followed by a $10$-digit ... How many different telephone numbers would be available worldwide under this numbering plan?
Suppose that at some future time every telephone in the world is assigned a number that contains a country code $1$ to $3$ digits long, that is, of the form X, XX, or XXX...
admin
538
views
admin
asked
Apr 28, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
descriptive
+
–
0
votes
0
answers
2525
Kenneth Rosen Edition 7 Exercise 8.1 Question 27 (Page No. 512)
Find a recurrence relation for the number of ways to lay out a walkway with slate tiles if the tiles are red, green, or gray, so that no two red tiles are adjacent and tiles of the same color are considered indistinguishable. What are the ... $(A)?$ How many ways are there to lay out a path of seven tiles as described in part $(A)?$
Find a recurrence relation for the number of ways to lay out a walkway with slate tiles if the tiles are red, green, or gray, so that no two red tiles are adjacent and ti...
admin
215
views
admin
asked
May 2, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
descriptive
+
–
0
votes
1
answer
2526
Kenneth Rosen Edition 7 Exercise 6.4 Question 6 (Page No. 421)
What is the coefficient of $x^{7}\:\text{in}\: (1 + x)^{11}?$
What is the coefficient of $x^{7}\:\text{in}\: (1 + x)^{11}?$
admin
340
views
admin
asked
Apr 29, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
binomial-theorem
descriptive
+
–
0
votes
0
answers
2527
Kenneth Rosen Edition 7 Exercise 8.2 Question 5 (Page No. 524)
How many different messages can be transmitted in $n$ microseconds using the two signals described in question $19$ in Section $8.1?$
How many different messages can be transmitted in $n$ microseconds using the two signals described in question $19$ in Section $8.1?$
admin
285
views
admin
asked
May 3, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
+
–
0
votes
0
answers
2528
Kenneth Rosen Edition 7 Exercise 8.2 Question 42 (Page No. 526)
Show that if $a_{n} = a_{n-1} + a_{n-2}, a_{0} = s\:\text{and}\: a_{1} = t,$ where $s$ and $t$ are constants, then $a_{n} = sf_{n-1} + tf_{n}$ for all positive integers $n.$
Show that if $a_{n} = a_{n-1} + a_{n-2}, a_{0} = s\:\text{and}\: a_{1} = t,$ where $s$ and $t$ are constants, then $a_{n} = sf_{n-1} + tf_{n}$ for all positive integers $...
admin
171
views
admin
asked
May 6, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
+
–
0
votes
0
answers
2529
Kenneth Rosen Edition 7 Exercise 6.6 Question 7 (Page No. 438)
Use Algorithm $1$ to generate the $24$ permutations of the first four positive integers in lexicographic order.
Use Algorithm $1$ to generate the $24$ permutations of the first four positive integers in lexicographic order.
admin
275
views
admin
asked
May 1, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
combinatory
descriptive
+
–
0
votes
0
answers
2530
Kenneth Rosen Edition 7 Exercise 6.1 Question 26 (Page No. 397)
How many strings of four decimal digits do not contain the same digit twice? end with an even digit? have exactly three digits that are $9s?$
How many strings of four decimal digitsdo not contain the same digit twice?end with an even digit?have exactly three digits that are $9s?$
admin
693
views
admin
asked
Apr 28, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
descriptive
+
–
0
votes
0
answers
2531
Kenneth Rosen Edition 7 Exercise 6.1 Question 70 (Page No. 398)
Use the product rule to show that there are $2^{2^{n}}$ different truth tables for propositions in $n$ variables.
Use the product rule to show that there are $2^{2^{n}}$ different truth tables for propositions in $n$ variables.
admin
367
views
admin
asked
Apr 29, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
descriptive
+
–
0
votes
0
answers
2532
Kenneth Rosen Edition 7 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.
Show that Algorithm $3$ produces the next larger $r$-combination in lexicographic order after a given $r$-combination.
admin
229
views
admin
asked
May 1, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
combinatory
descriptive
+
–
0
votes
0
answers
2533
Kenneth Rosen Edition 7 Exercise 8.2 Question 11 (Page No. 525)
The Lucas numbers satisfy the recurrence relation $L_{n} = L_{n−1} + L_{n−2},$ and the initial conditions $L_{0} = 2$ and $L_{1} = 1.$ Show that $L_{n} = f_{n−1} + f_{n+1}\: \text{for}\: n = 2, 3,\dots,$ where fn is the $n^{\text{th}}$ Fibonacci number. Find an explicit formula for the Lucas numbers.
The Lucas numbers satisfy the recurrence relation $L_{n} = L_{n−1} + L_{n−2},$ and the initial conditions $L_{0} = 2$ and $L_{1} = 1.$ Show that $L_{n} = f_{n−1} + ...
admin
245
views
admin
asked
May 3, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
+
–
0
votes
0
answers
2534
Kenneth Rosen Edition 7 Exercise 8.1 Question 19 (Page No. 511)
Messages are transmitted over a communications channel using two signals. The transmittal of one signal requires $1$ microsecond, and the transmittal of the other signal requires $2$ microseconds. Find a recurrence relation ... initial conditions? How many different messages can be sent in $10$ microseconds using these two signals?
Messages are transmitted over a communications channel using two signals. The transmittal of one signal requires $1$ microsecond, and the transmittal of the other signal ...
admin
240
views
admin
asked
May 2, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
descriptive
+
–
0
votes
0
answers
2535
Kenneth Rosen Edition 7 Exercise 8.2 Question 16 (Page No. 525)
Prove Theorem $3:$ Let $c_{1},c_{2},\dots,c_{k}$ be real numbers. Suppose that the characteristic equation $r^{k}-c_{1}r^{k-1}-\dots - c_{k} = 0$ has $k$ distinct roots $r_{1},r_{2},\dots r_{k}.$ Then a sequence $\{a_{n}\}$ ... $n = 0,1,2,\dots,$ where $\alpha_{1},\alpha_{2},\dots,\alpha_{k}$ are constants.
Prove Theorem $3:$Let $c_{1},c_{2},\dots,c_{k}$ be real numbers. Suppose that the characteristic equation $$r^{k}-c_{1}r^{k-1}-\dots – c_{k} = 0$$has $k$ distinct roots...
admin
232
views
admin
asked
May 3, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
+
–
0
votes
0
answers
2536
Kenneth Rosen Edition 7 Exercise 8.1 Question 9 (Page No. 511)
Find a recurrence relation for the number of bit strings of length n that do not contain three consecutive $0s.$ What are the initial conditions? How many bit strings of length seven do not contain three consecutive $0s?$
Find a recurrence relation for the number of bit strings of length n that do not contain three consecutive $0s.$ What are the initial conditions?How many bit strings of l...
admin
218
views
admin
asked
May 1, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
descriptive
+
–
0
votes
0
answers
2537
Kenneth Rosen Edition 7 Exercise 8.1 Question 4 (Page No. 510)
A country uses as currency coins with values of $1$ peso, $2$ pesos, $5$ pesos, and $10$ pesos and bills with values of $5$ pesos, $10$ pesos, $20$ pesos, $50$ pesos, and $100$ pesos. Find a recurrence relation for the number of ways to pay a bill of $n$ pesos if the order in which the coins and bills are paid matters.
A country uses as currency coins with values of $1$ peso, $2$ pesos, $5$ pesos, and $10$ pesos and bills with values of $5$ pesos, $10$ pesos, $20$ pesos, $50$ pesos, and...
admin
278
views
admin
asked
May 1, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
descriptive
+
–
0
votes
1
answer
2538
Kenneth Rosen Edition 7 Exercise 6.4 Question 7 (Page No. 421)
What is the coefficient of $x^{9}\:\text{in}\: (2 − x)^{19}?$
What is the coefficient of $x^{9}\:\text{in}\: (2 − x)^{19}?$
admin
320
views
admin
asked
Apr 29, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
binomial-theorem
descriptive
+
–
0
votes
0
answers
2539
Kenneth Rosen Edition 7 Exercise 6.2 Question 39 (Page No. 406)
Find the least number of cables required to connect $100$ computers to $20$ printers to guarantee that $2$ every subset of $20 $computers can directly access $20$ different printers. (Here, the assumptions about cables and computers are the same as in Example $9.$) Justify your answer.
Find the least number of cables required to connect $100$ computers to $20$ printers to guarantee that $2$ every subset of $20 $computers can directly access $20$ differe...
admin
369
views
admin
asked
Apr 29, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
pigeonhole-principle
descriptive
+
–
0
votes
1
answer
2540
Kenneth Rosen Edition 7 Exercise 6.3 Question 7 (Page No. 413)
Find the number of $5$-permutations of a set with nine elements.
Find the number of $5$-permutations of a set with nine elements.
admin
380
views
admin
asked
Apr 29, 2020
Combinatory
kenneth-rosen
discrete-mathematics
counting
combinatory
descriptive
+
–
Page:
« prev
1
...
122
123
124
125
126
127
128
129
130
131
132
...
526
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register