Search results for recurrence+relations / GATE Overflow for GATE CSE

1 votes

2 answers

1

Recurrence Relation Self-Doubt
What will be solution of recurrence relation if roots are like this: r1=-2, r2=2, r3=-2, r4=2 is this the case of repetitive roots?

What will be solution of recurrence relation if roots are like this: r1=-2, r2=2, r3=-2, r4=2is this the case of repetitive roots?

aditi19

870 views

aditi19 asked May 14, 2019

0 votes

2 answers

2

Recurrence Relation
Let $T(n) = T(n-1) + \frac{1}{n} , T(1) = 1 ;$ then $T(n) = ? $ $O(n^{2})$ $O(logn)$ $O(nlogn)$ $O(n^{2}logn)$

Let $T(n) = T(n-1) + \frac{1}{n} , T(1) = 1 ;$ then $T(n) = ? $$O(n^{2})$$O(logn)$$O(nlogn)$$O(n^{2}logn)$

Lakshman Bhaiya

1.5k views

Lakshman Bhaiya asked Oct 5, 2018

0 votes

0 answers

3

Recurrence relation
Let $a_{n}$ be the number of $n$-bit strings that do NOT contain two consecutive $1's.$ Which one of the following is the recurrence relation for $a_{n}?$ $a_{n}=a_{n-1}+2a_{n-2}$ $a_{n}=a_{n-1}+a_{n-2}$ $a_{n}=2a_{n-1}+a_{n-2}$ $a_{n}=2a_{n-1}+2a_{n-2}$

Let $a_{n}$ be the number of $n$-bit strings that do NOT contain two consecutive $1's.$ Which one of the following is the recurrence relation for $a_{n}?$$a_{n}=a_{n-1}+2...

Lakshman Bhaiya

476 views

Lakshman Bhaiya asked Oct 24, 2018

0 votes

1 answer

4

Kenneth Rosen Edition 6th Exercise 6.1 Example 8 (Page No. 400)
Find a recurrence relation for Cn the number of ways to parenthesize the product of n+1 numbers , x0*x1*x2.......*xn , to specify the order of multiplication. For example C3 = 5 because there are five ways to parenthesize x0*x1*x2*.....*xn to determine the order of multiplication.

Find a recurrence relation for Cn the number of ways to parenthesize the product of n+1 numbers , x0*x1*x2.......*xn , to specify the order of multiplication. For exampl...

Abhinavg

1.3k views

Abhinavg asked Mar 31, 2018

0 votes

2 answers

5

Kenneth Rosen Edition 6th Exercise 8.1 Question 6 (Page No. 510)
Find a recurrence relation for the number of strictly increasing sequences of positive integers that have 1 as their first term and n as their last term, where n is a positive integer. That is, sequences a1,a2,a3,a4....ak where a1 = 1, ak = n, and aj < aj+1 for j = 1,2,3,...k-1

Find a recurrence relation for the number of strictly increasing sequences of positive integers that have 1 as their first term and n as their last term, where n is a pos...

dd

1.9k views

dd asked Jun 8, 2016

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