Register
Filter

Questions by srestha

0 votes
0 answers
284
DMA Controller
DMA is mainly used to control faster processor activity. Then how processor time slows down by a DMA activity?
DMA is mainly used to control faster processor activity.Then how processor time slows down by a DMA activity?
0 votes
1 answer
285
Binary Tree
Can a binary tree or BST can be constructed with dynamic programming? Can it be constructed through greedy method? Plz give some algorithm and explain
Can a binary tree or BST can be constructed with dynamic programming? Can it be constructed through greedy method?Plz give some algorithm and explain
0 votes
2 answers
286
BFS Traversal
How through a BFS we can find graph is connected or disconnected? Plz give some example and explain
How through a BFS we can find graph is connected or disconnected? Plz give some example and explain
1 votes
2 answers
288
Stack
What is difference between $pop\left ( \right )$,$empty Stack\left ( \right )$,$delete Stack\left ( \right )$? Can all be performed in $O\left ( 1 \right )$ time?
What is difference between $pop\left ( \right )$,$empty Stack\left ( \right )$,$delete Stack\left ( \right )$?Can all be performed in $O\left ( 1 \right )$ time?
0 votes
0 answers
289
Asymptotic Complexity
$T\left ( n,c \right )=\Theta \left ( n \right )$ for $c\leq 2$ $T\left ( c,n \right )=\Theta \left ( n \right )$ for $c\leq 2$ $T\left ( n,n \right )=\Theta \left ( n \right )+T\left ( n,\frac{n}{2} \right )$ How to find complexity for this recurrence relation?
$T\left ( n,c \right )=\Theta \left ( n \right )$ for $c\leq 2$$T\left ( c,n \right )=\Theta \left ( n \right )$ for $c\leq 2$$T\left ( n,n \right )=\Theta \left ( n \rig...
4 votes
2 answers
290
DCFL or Not
$\left \{ a^{m+n}b^{m+n}c^{n}|m,n\geq 1 \right \}$ $\left \{ a^{m+n}b^{m+n}c^{k} |m,n,k\geq 1\right \}$ $\left \{ a^{m+n}b^{m+k}c^{n+k} |m,n,k\geq 1\right \}$ Which one DCFL, CFL or CSL?
$\left \{ a^{m+n}b^{m+n}c^{n}|m,n\geq 1 \right \}$$\left \{ a^{m+n}b^{m+n}c^{k} |m,n,k\geq 1\right \}$$\left \{ a^{m+n}b^{m+k}c^{n+k} |m,n,k\geq 1\right \}$Which one DCFL...
1 votes
1 answer
291
SR conflict in LALR(1)
$A→ b.a , \left \{ b \right \}$ $B→ b.,\left \{ a \right \}$ It is a SR conflict in LALR(1). Now how reduce state operated on $a$ for non terminal $B$(and not $b$) ?
$A→ b.a , \left \{ b \right \}$ $B→ b.,\left \{ a \right \}$It is a SR conflict in LALR(1). Now how reduce state operated on $a$ for non terminal $B$(and not $b$) ?...
0 votes
0 answers
292
Fibonacci number
How "a fibonacci algorithm runs in polynomial time in n but the optimal running time is exponential in n."? Is it possible to running same algorithm in both polynomial and exponential time?
How "a fibonacci algorithm runs in polynomial time in n but the optimal running time is exponential in n."?Is it possible to running same algorithm in both polynomial and...
0 votes
1 answer
294
L-Value Error
#include <stdio.h> int make_it(int *x,int *y, int *z){ *x *= *y+*z; *y=*x<<1; *z=*x+*y; } int main(void) { int a=5, b=10; printf("%d%d",a,b); make_it(&b,&a,&(a+b)); printf("%d%d",a,b); return 0; } Why this code is giving lvalue error?
#include <stdio.h int make_it(int *x,int *y, int *z){ *x *= *y+*z; *y=*x<<1; *z=*x+*y; } int main(void) { int a=5, b=10; printf("%d%d",a,b); make_it(&b,&a,&(a+b)); printf...
0 votes
1 answer
296
Branch Instruction
What is meaning of offset in Branch instruction? Is this offset same as conditional instruction offset? What is meaning of offset in virtual address? Where is actual difference between these two?
What is meaning of offset in Branch instruction? Is this offset same as conditional instruction offset?What is meaning of offset in virtual address? Where is actual diffe...
1 votes
2 answers
298
Distributive Lattice
Is below diagram is distributive lattice?
Is below diagram is distributive lattice?
Page: