Register
Filter

Answers by sakharam

449
views
1 votes
Peter Linz, 3rd Ed, Chapter 1, Pg 15, Ques 19
if f(n) = O(n2) and g(n) = O(n3), thenwhat is the complexity of f(n)*g(n) and f(n)/g(n) in big-o-notation?
314
views
0 votes
Peter Linz Edition 4 Exercise 7.3 Question 4 (Page No. 200)
Is the language $L =$ {$a^nb^n : n ≥ 1$} $∪$ {$a$} deterministic?
335
views
0 votes
Peter Linz Edition 4 Exercise 7.3 Question 6 (Page No. 200)
For the language $L =$ {$a^nb^{2n} : n ≥ 0$}, show that $L^*$ is a deterministic context-free language.
246
views
0 votes
Peter Linz Edition 4 Exercise 7.3 Question 15 (Page No. 200)
Show that every regular language is a deterministic context-free language.
284
views
0 votes
Peter Linz Edition 4 Exercise 7.4 Question 2 (Page No. 204)
Show that the grammar for L = {$w : n_a (w) = n_b (w)$} which is, $S\rightarrow SS,S\rightarrow \lambda,S\rightarrow aSb,S\rightarrow bSa$ is not an LL grammar.
289
views
0 votes
Peter Linz Edition 4 Exercise 7.4 Question 4 (Page No. 204)
Construct an LL grammar for the language L (a*ba) ∪ L (abbb*).
1.5k
views
0 votes
DBMS Korth Edition 4 Exercise 12 Question 4 (Page No. 489)
Is it possible in general to have two primary indices on the same relation for different search keys ? Explain your answer.
2.1k
views
0 votes
Cormen Edition 3 Exercise 2.2 Question 1 (Page No. 29)
Express the function $n^3/1000 -100n^2-100n+3$ in terms of $\Theta$ notation.
1.1k
views
4 votes
Segmentation
In segmented paging, is the paging applied on segment table or on segments?
1.4k
views
1 votes
ISI2018-MMA-16
Consider a large village, where only two newspapers $P_1$ and $P_2$ are available to the families. It is known that the proportion of familiesnot taking $P_1$ is $0.48$,n...
398
views
0 votes
best book for software engineering
Please let me know the best book for software engineering .....
393
views
0 votes
K-MAP
592
views
1 votes
ME test series.
How 14? I am not able to understand. Why not 30.
246
views
0 votes
algorithms
568
views
4 votes
Testbook Test Series: Combinatory - Permutations And Combinations
Number of ways of arranging the word "TESTBOOK" such that E always comes between O's.
267
views
0 votes
gate 2018
https://gateoverflow.in/?qa=blob&qa_blobid=3125601105330416900
492
views
0 votes
Logic
659
views
4 votes
Logic
206
views
1 votes
Logic
1.4k
views
3 votes
SELF DOUBT
WHAT IS THE OUTPUT OF THE FOLLOWING CODE? printf("%d",printf("ABC"));IS IT ABC3
1.6k
views
2 votes
RBRTestSeries
The value of z after the execution of the following program isvoid f(int x){ static int z; z=z+x;}int main(){ int y=10; fork(); fork(); f(y); ...
510
views
1 votes
alagorithms analysis
The running time of an algorithm is given by T(n)=T(n-1)+T(n-2)-T(n-3), ifn>3 =n, otherwiseThe order of this algorithm isa)nb)log nc)n^nd)n^2 explain !
623
views
2 votes
Finite automata
The number of DFA with four states that can be constructed over alphabet {a,b} with designated initial state are 2^n then value of n is .....
1.3k
views
2 votes
Computer programming
#include <stdio.h struct p { unsigned int x : 1; unsigned int y : 1; };int main() { struct p p; p.x = 1; p.y = 2; printf("%d\n", p.y); } Why output is 0?
448
views
0 votes
Ace Test Series: Digital Logic - Multiplexer
plz explain am not able to solve this .
362
views
0 votes
Macros
tokens passed to macros are treated as int, float or string?
693
views
1 votes
Made easy , divide and conquer
https://gateoverflow.in/?qa=blob&qa_blobid=11583750777176064728Approach please
923
views
2 votes
GeeksForGeeks
Find time complexity of below Program?A(n){if(n<=1) return;elsereturn $A(\sqrt{n})$ ;}
420
views
0 votes
Time complexity in algorithm
(logn)^k<=cn=logn<=c(n)^ 1/k how??
1.3k
views
0 votes
Doubt about OS
i have one doubt ...we know that ready , running and block waiting are lies inside main memory but it saying that when the process are in running state then process are s...
Page: