search
Log In

Recent questions tagged descriptive

0 votes
1 answer
1
State whether the following statements are True or False with reasons for your answer: A two pass assembler uses its machine opcode table in the first pass of assembly.
asked May 3 in Compiler Design gatecse 296 views
0 votes
1 answer
2
State whether the following statements are True or False with reasons for your answer A symbol declared as ‘external’ in an assembly language program is assigned an address outside the program by the assembler itself.
asked May 3 in Compiler Design gatecse 96 views
1 vote
5 answers
3
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.
asked May 3 in Databases gatecse 277 views
1 vote
2 answers
4
Consider the matrix $A=\begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix}$. Find $A^n,$ in terms of $n,$ for $n\geq2.$
asked Jan 29 in Linear Algebra soujanyareddy13 153 views
0 votes
1 answer
5
A multi-national conglomerate sells soap products for five different market segments, namely (i) Women, (ii) Men, (iii) Kids, (iv) Sports, and (v) Luxury. The sales of these five segments (in lakh number of packs) during $2012$ and $2017$ are shown in the ... than the sales of the Men segment in $2017$? During the period $2012-2017$, which segment experienced the minimum rate of increase in sales?
asked Jan 29 in Quantitative Aptitude soujanyareddy13 56 views
4 votes
1 answer
6
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 8, 2020 in Combinatory dd 543 views
0 votes
2 answers
9
Suppose that there are $n = 2^{k}$ teams in an elimination tournament, where there are $\frac{n}{2}$ games in the first round, with the $\frac{n}{2} = 2^{k-1}$ winners playing in the second round, and so on. Develop a recurrence relation for the number of rounds in the tournament.
asked May 10, 2020 in Combinatory Lakshman Patel RJIT 323 views
0 votes
1 answer
10
0 votes
1 answer
14
0 votes
1 answer
15
0 votes
1 answer
16
0 votes
0 answers
18
0 votes
0 answers
21
1 vote
0 answers
23
Prove Theorem $6:$Suppose that $\{a_{n}\}$ satisfies the liner nonhomogeneous recurrence relation $a_{n} = c_{1}a_{n-1} + c_{2}a_{n-2} + \dots + c_{k}a_{n-k} + F(n),$ where $c_{1}.c_{2},\dots,c_{k}$ ... is $m,$ there is a particular solution of the form $n^{m}(p_{t}n^{t} + p_{t-1}n^{t-1} + \dots + p_{1}n + p_{0})s^{n}.$
asked May 6, 2020 in Combinatory Lakshman Patel RJIT 104 views
0 votes
0 answers
24
Prove Theorem $4:$ 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 $t$ distinct roots $r_{1},r_{2},\dots,r_{t}$ with multiplicities $m_{1},m_{2},\dots,m_{t},$ ... $\alpha_{i,j}$ are constants for $1 \leq i \leq t\:\text{and}\: 0 \leq j \leq m_{i} - 1.$
asked May 6, 2020 in Combinatory Lakshman Patel RJIT 94 views
0 votes
0 answers
25
Solve the recurrence relation $T (n) = nT^{2}(n/2)$ with initial condition $T (1) = 6$ when $n = 2^{k}$ for some integer $k.$ [Hint: Let $n = 2^{k}$ and then make the substitution $a_{k} = \log T (2^{k})$ to obtain a linear nonhomogeneous recurrence relation.]
asked May 6, 2020 in Combinatory Lakshman Patel RJIT 84 views
2 votes
0 answers
26
It can be shown that Cn, the average number of comparisons made by the quick sort algorithm (described in preamble to question $50$ in exercise $5.4),$ when sorting $n$ ... $48$ to solve the recurrence relation in part $(A)$ to find an explicit formula for $C_{n}.$
asked May 6, 2020 in Combinatory Lakshman Patel RJIT 65 views
0 votes
0 answers
27
0 votes
0 answers
28
Some linear recurrence relations that do not have constant coefficients can be systematically solved. This is the case for recurrence relations of the form $f (n)a_{n} = g(n)a_{n-1} + h(n).$ Exercises $48-50$ ... relation to obtain $a_{n} = \dfrac{C +\displaystyle{} \sum_{i = 1}^{n}Q(i)h(i)}{g(n + 1)Q(n + 1)}$
asked May 6, 2020 in Combinatory Lakshman Patel RJIT 81 views
0 votes
0 answers
29
A new employee at an exciting new software company starts with a salary of $\$50,000$ and is promised that at the end of each year her salary will be double her salary of the previous year, with an extra increment of $\$10,000$ for each year she has been with the ... $n^{\text{th}}$ year of employment. Solve this recurrence relation to find her salary for her $n^{\text{th}}$ year of employment.
asked May 6, 2020 in Combinatory Lakshman Patel RJIT 69 views
0 votes
0 answers
30
Suppose that there are two goats on an island initially.The number of goats on the island doubles every year by natural reproduction, and some goats are either added or removed each year. Construct a recurrence relation for the number of goats on the island at the start of the ... $n^{\text{th}}$ year for each $n \geq 3.$
asked May 6, 2020 in Combinatory Lakshman Patel RJIT 94 views
...