Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged descriptive
0
votes
0
answers
91
CMI2022-B: 7
Consider the following inventory problem. You are running a company that sells lorries. Predictions tell you the quantity of sales to expect over the next $n$ months. Let $d_{i}$ denote the number of sales expected in month $i$. We assume that sales happen on ... dynamic programming algorithm that computes $c_{1}(0)$. Your algorithm must run in time polynomial in $n$ and $\text{C}$.
Lakshman Patel RJIT
asked
in
Others
Jul 22
by
Lakshman Patel RJIT
31
views
cmi2022
descriptive
0
votes
0
answers
92
CMI2021-B: 4
For a language $\text{L}$ over an alphabet $\Sigma$, define $\text{SW(L)}:= \left \{ y \in \Sigma^{\ast} \mid \exists x \in \Sigma^{\ast}\; \text{s.t.}\; xyx \in \text{L} \right \}$ Prove that if $\text{L}$ is regular, $\text{SW(L)}$ is also regular.
Lakshman Patel RJIT
asked
in
Others
Jul 22
by
Lakshman Patel RJIT
31
views
cmi2021
descriptive
0
votes
1
answer
93
Compilation Techniques - Annotated Parse Tree
Given the following statement: 6 * (8-3) Make the Annotated Parse Tree based on the translation scheme below. S → B {A.i = B.val} A {S.val = A.s} A → - B {A1.i = A.i - B.val} A1 {A.s = A1.s} A → e {A.s = A.i} B → D {C.i = D.val} C {B.val = C.s} C → * ... = C.i * D.val} C1 {C.s = C1.s} C → e {C.s = C.i} D → ( S ) {D.val = S.val} D → num {D.val = num.val}
Frengky
asked
in
Compiler Design
Feb 11
by
Frengky
274
views
compiler-design
syntax-directed-translation
descriptive
0
votes
1
answer
94
In my mind
#include<stdio.h> Int main(void){ Int a=printf("%d",printf("%d %d",printf("GATE"),printf("OVERFLOW"))); printf("%d",a); return 0; } What is the reason for different output? Explain ideas.
SÀRÁTH_2003
asked
in
Programming
Jan 7
by
SÀRÁTH_2003
224
views
programming
programming-in-c
functions
descriptive
1
vote
1
answer
95
Test series Made easy
How to solve this ? Please help.
raja11sep
asked
in
Compiler Design
Dec 31, 2021
by
raja11sep
426
views
compiler-design
grammar
context-free-grammar
ll-parser
descriptive
made-easy-test-series
0
votes
1
answer
96
GATE CSE 1994 | Question: 17b
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.
gatecse
asked
in
Compiler Design
May 3, 2021
by
gatecse
1.2k
views
gate1994
compiler-design
normal
assembler
true-false
descriptive
4
votes
1
answer
97
GATE CSE 1994 | Question: 18b
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.
gatecse
asked
in
Compiler Design
May 3, 2021
by
gatecse
682
views
gate1994
compiler-design
normal
assembler
true-false
descriptive
4
votes
5
answers
98
GATE CSE 1994 | Question: 14b
For a $B^+$ - tree of order $d$ with $n$ leaf nodes, the number of nodes accessed during a search is $O(\_)$.
gatecse
asked
in
Databases
May 3, 2021
by
gatecse
1.6k
views
gate1994
databases
b-tree
normal
descriptive
1
vote
2
answers
99
CMI-2020-DataScience-B: 2
Consider the matrix $A=\begin{pmatrix} 0 & -1 \\ 1 & 0 \end{pmatrix}$. Find $A^n,$ in terms of $n,$ for $n\geq2.$
soujanyareddy13
asked
in
Linear Algebra
Jan 29, 2021
by
soujanyareddy13
378
views
cmi2020-datascience
linear-algebra
matrix
descriptive
0
votes
1
answer
100
CMI-2020-DataScience-B: 20
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$ ... sales of the Men segment in $2017$? During the period $2012-2017$, which segment experienced the minimum rate of increase in sales?
soujanyareddy13
asked
in
Quantitative Aptitude
Jan 29, 2021
by
soujanyareddy13
164
views
cmi2020-datascience
bar-graph
data-interpretation
descriptive
4
votes
1
answer
101
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.
dd
asked
in
Combinatory
Jun 8, 2020
by
dd
848
views
combinatory
summation
descriptive
0
votes
1
answer
102
Kenneth Rosen Edition 7 Exercise 8.3 Question 16 (Page No. 535)
Solve the recurrence relation for the number of rounds in the tournament described in question $14.$
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
825
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
103
Kenneth Rosen Edition 7 Exercise 8.3 Question 15 (Page No. 535)
How many rounds are in the elimination tournament described in question $14$ when there are $32$ teams?
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
335
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
2
answers
104
Kenneth Rosen Edition 7 Exercise 8.3 Question 14 (Page No. 535)
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.
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
981
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
105
Kenneth Rosen Edition 7 Exercise 8.3 Question 13 (Page No. 535)
Give a big-O estimate for the function $f$ given below if $f$ is an increasing function. $f (n) = 2f (n/3) + 4 \:\text{with}\: f (1) = 1.$
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
381
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
1
vote
2
answers
106
Kenneth Rosen Edition 7 Exercise 8.3 Question 12 (Page No. 535)
Find $f (n)$ when $n = 3k,$ where $f$ satisfies the recurrence relation $f (n) = 2f (n/3) + 4 \:\text{with}\: f (1) = 1.$
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
414
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
107
Kenneth Rosen Edition 7 Exercise 8.3 Question 11 (Page No. 535)
Give a big-O estimate for the function $f$ in question $10$ if $f$ is an increasing function.
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
235
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
108
Kenneth Rosen Edition 7 Exercise 8.3 Question 10 (Page No. 535)
Find $f (n)$ when $n = 2^{k},$ where $f$ satisfies the recurrence relation $f (n) = f (n/2) + 1 \:\text{with}\: f (1) = 1.$
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
218
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
109
Kenneth Rosen Edition 7 Exercise 8.3 Question 9 (Page No. 535)
Suppose that $f (n) = f (n/5) + 3n^{2}$ when $n$ is a positive integer divisible by $5, \:\text{and}\: f (1) = 4.$ Find $f (5)$ $f (125)$ $f (3125)$
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
223
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
110
Kenneth Rosen Edition 7 Exercise 8.3 Question 8 (Page No. 535)
Suppose that $f (n) = 2f (n/2) + 3$ when $n$ is an even positive integer, and $f (1) = 5.$ Find $f (2)$ $f (8)$ $f (64)$ $(1024)$
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
306
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
111
Kenneth Rosen Edition 7 Exercise 8.3 Question 7 (Page No. 535)
Suppose that $f (n) = f (n/3) + 1$ when $n$ is a positive integer divisible by $3,$ and $f (1) = 1.$ Find $f (3)$ $f (27)$ $f (729)$
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
233
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
112
Kenneth Rosen Edition 7 Exercise 8.3 Question 6 (Page No. 535)
How many operations are needed to multiply two $32 \times 32$ matrices using the algorithm referred to in Example $5?$
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
206
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
113
Kenneth Rosen Edition 7 Exercise 8.3 Question 5 (Page No. 535)
Determine a value for the constant C in Example $4$ and use it to estimate the number of bit operations needed to multiply two $64$-bit integers using the fast multiplication algorithm.
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
161
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
114
Kenneth Rosen Edition 7 Exercise 8.3 Question 4 (Page No. 535)
Express the fast multiplication algorithm in pseudocode.
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
201
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
115
Kenneth Rosen Edition 7 Exercise 8.3 Question 3 (Page No. 535)
Multiply $(1110)_{2} \:\text{and}\: (1010)_{2}$ using the fast multiplication algorithm.
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
248
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
116
Kenneth Rosen Edition 7 Exercise 8.3 Question 2 (Page No. 535)
How many comparisons are needed to locate the maximum and minimum elements in a sequence with $128$ elements using the algorithm in Example $2$?
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
233
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
1
answer
117
Kenneth Rosen Edition 7 Exercise 8.3 Question 1 (Page No. 535)
How many comparisons are needed for a binary search in a set of $64$ elements?
Lakshman Patel RJIT
asked
in
Combinatory
May 10, 2020
by
Lakshman Patel RJIT
264
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
1
vote
0
answers
118
Kenneth Rosen Edition 7 Exercise 8.2 Question 52 (Page No. 527)
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}$ ... solution of the form $n^{m}(p_{t}n^{t} + p_{t-1}n^{t-1} + \dots + p_{1}n + p_{0})s^{n}.$
Lakshman Patel RJIT
asked
in
Combinatory
May 6, 2020
by
Lakshman Patel RJIT
267
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
119
Kenneth Rosen Edition 7 Exercise 8.2 Question 51 (Page No. 527)
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}$ ... $\alpha_{i,j}$ are constants for $1 \leq i \leq t\:\text{and}\: 0 \leq j \leq m_{i} - 1.$
Lakshman Patel RJIT
asked
in
Combinatory
May 6, 2020
by
Lakshman Patel RJIT
214
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
0
votes
0
answers
120
Kenneth Rosen Edition 7 Exercise 8.2 Question 53 (Page No. 527)
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.]
Lakshman Patel RJIT
asked
in
Combinatory
May 6, 2020
by
Lakshman Patel RJIT
239
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relation
descriptive
Page:
« prev
1
2
3
4
5
6
7
8
9
...
88
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged descriptive
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...