Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
sakharam
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by sakharam
1
votes
1
Peter Linz, 3rd Ed, Chapter 1, Pg 15, Ques 19
if f(n) = O(n2) and g(n) = O(n3), then what is the complexity of f(n)*g(n) and f(n)/g(n) in big-o-notation?
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?
415
views
answered
Apr 18, 2020
Theory of Computation
theory-of-computation
asymptotic-notation
+
–
0
votes
2
Peter Linz Edition 4 Exercise 7.3 Question 4 (Page No. 200)
Is the language $L =$ {$a^nb^n : n ≥ 1$} $∪$ {$a$} deterministic?
Is the language $L =$ {$a^nb^n : n ≥ 1$} $∪$ {$a$} deterministic?
288
views
answered
Nov 6, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
+
–
0
votes
3
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.
For the language $L =$ {$a^nb^{2n} : n ≥ 0$}, show that $L^*$ is a deterministic context-free language.
280
views
answered
Nov 6, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
+
–
0
votes
4
Peter Linz Edition 4 Exercise 7.3 Question 15 (Page No. 200)
Show that every regular language is a deterministic context-free language.
Show that every regular language is a deterministic context-free language.
227
views
answered
Nov 6, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
+
–
0
votes
5
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.
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.
255
views
answered
Nov 6, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
context-free-grammar
+
–
0
votes
6
Peter Linz Edition 4 Exercise 7.4 Question 4 (Page No. 204)
Construct an LL grammar for the language L (a*ba) ∪ L (abbb*).
Construct an LL grammar for the language L (a*ba) ∪ L (abbb*).
267
views
answered
Nov 6, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-grammar
context-free-language
+
–
0
votes
7
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.
Is it possible in general to have two primary indices on the same relation for different search keys ? Explain your answer.
1.4k
views
answered
Sep 3, 2019
Databases
korth
databases
indexing
descriptive
+
–
0
votes
8
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.
Express the function $n^3/1000 -100n^2-100n+3$ in terms of $\Theta$ notation.
2.1k
views
answered
Aug 28, 2019
Algorithms
cormen
algorithms
time-complexity
descriptive
+
–
4
votes
9
Segmentation
In segmented paging, is the paging applied on segment table or on segments?
In segmented paging, is the paging applied on segment table or on segments?
1.1k
views
answered
Aug 15, 2019
Operating System
virtual-memory
segmentation
+
–
1
votes
10
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 families not taking $P_1$ is $0.48$, not taking $P_2$ is $0.58$, taking only $P_2$ is $0.30$. The probability that a randomly chosen family from the village takes only $P_1$ is $0.24$ $0.28$ $0.40$ can not be determined
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...
1.3k
views
answered
May 11, 2019
Probability
isi2018-mma
engineering-mathematics
probability
+
–
0
votes
11
best book for software engineering
Please let me know the best book for software engineering .....
Please let me know the best book for software engineering .....
379
views
answered
Sep 30, 2018
0
votes
12
K-MAP
359
views
answered
Sep 7, 2018
1
votes
13
ME test series.
How 14? I am not able to understand. Why not 30.
How 14? I am not able to understand. Why not 30.
534
views
answered
Sep 6, 2018
Graph Theory
graph-theory
+
–
0
votes
14
algorithms
223
views
answered
Sep 6, 2018
Algorithms
asymptotic-notation
test-series
+
–
4
votes
15
Testbook Test Series: Combinatory - Permutations And Combinations
Number of ways of arranging the word "TESTBOOK" such that E always comes between O's.
Number of ways of arranging the word "TESTBOOK" such that E always comes between O's.
496
views
answered
Sep 6, 2018
Combinatory
discrete-mathematics
combinatory
testbook-test-series
+
–
0
votes
16
gate 2018
https://gateoverflow.in/?qa=blob&qa_blobid=3125601105330416900
https://gateoverflow.in/?qa=blob&qa_blobid=3125601105330416900
242
views
answered
Sep 6, 2018
0
votes
17
Logic
457
views
answered
Sep 6, 2018
4
votes
18
Logic
619
views
answered
Sep 6, 2018
1
votes
19
Logic
189
views
answered
Sep 6, 2018
3
votes
20
SELF DOUBT
WHAT IS THE OUTPUT OF THE FOLLOWING CODE? printf("%d",printf("ABC")); IS IT ABC3
WHAT IS THE OUTPUT OF THE FOLLOWING CODE? printf("%d",printf("ABC"));IS IT ABC3
1.3k
views
answered
Sep 5, 2018
2
votes
21
RBRTestSeries
The value of z after the execution of the following program is void f(int x) { static int z; z=z+x; } int main() { int y=10; fork(); fork(); f(y); return 0; } Options are: a. 40 b. 30 c. 20 d. 10
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); ...
1.4k
views
answered
Sep 5, 2018
Operating System
fork-system-call
operating-system
test-series
+
–
1
votes
22
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, otherwise The order of this algorithm is a)n b)log n c)n^n d)n^2 explain !
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 !
489
views
answered
Sep 5, 2018
Algorithms
algorithms
asymptotic-notation
+
–
2
votes
23
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 .....
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 .....
592
views
answered
Sep 5, 2018
Theory of Computation
finite-automata
theory-of-computation
+
–
2
votes
24
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?
#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?
1.2k
views
answered
Sep 4, 2018
Programming in C
programming-in-c
programming
+
–
0
votes
25
Ace Test Series: Digital Logic - Multiplexer
plz explain am not able to solve this .
plz explain am not able to solve this .
404
views
answered
Sep 3, 2018
Digital Logic
ace-test-series
digital-logic
multiplexer
+
–
0
votes
26
Macros
tokens passed to macros are treated as int, float or string?
tokens passed to macros are treated as int, float or string?
327
views
answered
Sep 3, 2018
Programming in C
programming-in-c
+
–
1
votes
27
Made easy , divide and conquer
https://gateoverflow.in/?qa=blob&qa_blobid=11583750777176064728 Approach please
https://gateoverflow.in/?qa=blob&qa_blobid=11583750777176064728Approach please
648
views
answered
Sep 3, 2018
Algorithms
algorithms
divide-and-conquer
made-easy-test-series
+
–
2
votes
28
GeeksForGeeks
Find time complexity of below Program? A(n){ if(n<=1) return; else return $A(\sqrt{n})$ ; }
Find time complexity of below Program?A(n){if(n<=1) return;elsereturn $A(\sqrt{n})$ ;}
855
views
answered
Sep 3, 2018
Algorithms
time-complexity
recursion
geeksforgeeks-test-series
+
–
0
votes
29
Time complexity in algorithm
(logn)^k<=cn=logn<=c(n)^ 1/k how??
(logn)^k<=cn=logn<=c(n)^ 1/k how??
374
views
answered
Sep 2, 2018
Algorithms
asymptotic-notation
time-complexity
descriptive
+
–
0
votes
30
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 suppose to given to CPU so when we have done with given of process to CPU how we can say that the process are in RAM or Running state are in RAM...please reply it is actually funny question .
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...
1.2k
views
answered
Sep 1, 2018
Operating System
operating-system
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register