Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Vegeta
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Vegeta
0
votes
2
answers
1
selfas
f(n) + O(f(n)) = Θ(f(n)) True or not? Explain please
f(n) + O(f(n)) = Θ(f(n))True or not? Explain please
542
views
asked
Nov 17, 2018
Algorithms
algorithms
asymptotic-notation
+
–
0
votes
0
answers
2
Made easy
Option (a) Best fit (b) Next fit (c) First fit
Option (a) Best fit (b) Next fit (c) First fit
240
views
asked
Oct 29, 2018
Operating System
operating-system
memory-management
+
–
0
votes
3
answers
3
self doubt in OS(galvin)
All safe states are deadlock free. But we can go to deadlock with some combination of sequence? So if the question is, from the safe state can we enter deadlock? Ans should be YES. please give your thought
All safe states are deadlock free. But we can go to deadlock with some combination of sequence? So if the question is, from the safe state can we enter deadlock? Ans shou...
864
views
asked
Oct 22, 2018
Operating System
operating-system
deadlock-prevention-avoidance-detection
safe
+
–
1
votes
0
answers
4
doubt
323
views
asked
Oct 18, 2018
Operating System
memory-management
+
–
0
votes
1
answer
5
self doubt
CRC can detect any odd number of errors. CRC can detect all burst errors of less than the degree of the polynomial. Please explain and if possible give proof
CRC can detect any odd number of errors.CRC can detect all burst errors of less than the degree of the polynomial.Please explain and if possible give proof
739
views
asked
Oct 15, 2018
Computer Networks
crc-polynomial
computer-networks
error-detection
+
–
0
votes
0
answers
6
self doubt
Every regular set has an LR(1) grammar. What does this line mean??
Every regular set has an LR(1) grammar.What does this line mean??
218
views
asked
Sep 19, 2018
Compiler Design
compiler-design
parsing
grammar
+
–
0
votes
0
answers
7
Self doubt
What is relation between CGF, Regular grammar, CSG, LL(1), LL(k), LR(0), SLR(1), LALR(1), CLR(1). What is the meaning of expressive power? I know that LR(0)<SLR(1)<LALR(1)<CLR(1), what is the meaning of this?
What is relation between CGF, Regular grammar, CSG, LL(1), LL(k), LR(0), SLR(1), LALR(1), CLR(1).What is the meaning of expressive power? I know thatLR(0)<SLR(1)<LALR(1)<...
587
views
asked
Sep 16, 2018
Compiler Design
compiler-design
parsing
ll-parser
+
–
0
votes
1
answer
8
ace booklet
whats ans of this qn and please explain
whats ans of this qn and please explain
927
views
asked
Sep 13, 2018
Mathematical Logic
ace-booklet
engineering-mathematics
discrete-mathematics
propositional-logic
+
–
0
votes
1
answer
9
basic doubt
In how many ways can 10 similar roses be distributed among 3 girls? In how many ways can 10 different roses be distributed among 3 girls?
In how many ways can 10 similar roses be distributed among 3 girls?In how many ways can 10 different roses be distributed among 3 girls?
469
views
asked
Aug 25, 2018
Combinatory
combinatory
combinational-circuit
+
–
0
votes
2
answers
10
self doubt
What will be lower bound of {g}
What will be lower bound of {g}
590
views
asked
Aug 19, 2018
Set Theory & Algebra
lattice
discrete-mathematics
engineering-mathematics
+
–
2
votes
1
answer
11
self doubt
Given a TM, M accepts 100 strings. Is it decidable, semi decidable or fully undecidable??
Given a TM, M accepts 100 strings. Is it decidable, semi decidable or fully undecidable??
610
views
asked
Jul 24, 2018
Theory of Computation
decidability
theory-of-computation
turing-machine
+
–
2
votes
2
answers
12
self doutbt
How to Construct Full Binary Tree from given preorder and postorder? Thank you.
How to Construct Full Binary Tree from given preorder and postorder?Thank you.
1.3k
views
asked
Jul 16, 2018
DS
binary-tree
binary-search-tree
tree-traversal
+
–
0
votes
2
answers
13
self doubt
Is it necessary that euler graph should always be simple graph?
Is it necessary that euler graph should always be simple graph?
448
views
asked
Jun 27, 2018
Graph Theory
discrete-mathematics
graph-theory
+
–
0
votes
2
answers
14
self doubt
What is the English of both statement ∀x((x!=0)→∃y(xy=100)) ∀x∃y((x!=0)→(xy=100))
What is the English of both statement∀x((x!=0)→∃y(xy=100))∀x∃y((x!=0)→(xy=100))
213
views
asked
Jun 16, 2018
1
votes
1
answer
15
self doubt
dog(x) = x is a dog Int (x) = x is intelligent write in logic form No dogs are intelligent.
dog(x) = x is a dogInt (x) = x is intelligentwrite in logic formNo dogs are intelligent.
415
views
asked
Jun 14, 2018
Mathematical Logic
propositional-logic
first-order-logic
logical-reasoning
+
–
0
votes
2
answers
16
IIT M video questions
P(x,y,z), xy=z, Universe is interger; write in logic form If xy=x for all y, then x =0. Thank you
P(x,y,z), xy=z, Universe is interger;write in logic formIf xy=x for all y, then x =0.Thank you
452
views
asked
Jun 14, 2018
Mathematical Logic
propositional-logic
first-order-logic
logical-reasoning
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register