Dark Mode

Questions by Vegeta

0 votes

2 answers

1

selfas
f(n) + O(f(n)) = Θ(f(n)) True or not? Explain please

asked in Algorithms Nov 17, 2018

567 views

0 votes

0 answers

2

Made easy
Option (a) Best fit (b) Next fit (c) First fit

asked in Operating System Oct 29, 2018

248 views

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

asked in Operating System Oct 22, 2018

897 views

1 vote

0 answers

4

asked in Operating System Oct 18, 2018

335 views

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

asked in Computer Networks Oct 15, 2018

741 views

0 votes

0 answers

6

self doubt
Every regular set has an LR(1) grammar. What does this line mean??

asked in Compiler Design Sep 19, 2018

227 views

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?

asked in Compiler Design Sep 16, 2018

594 views

0 votes

1 answer

8

ace booklet
whats ans of this qn and please explain

asked in Mathematical Logic Sep 13, 2018

974 views

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?

asked in Combinatory Aug 25, 2018

496 views

0 votes

2 answers

10

self doubt
What will be lower bound of {g}

asked in Set Theory & Algebra Aug 19, 2018

616 views

2 votes

1 answer

11

self doubt
Given a TM, M accepts 100 strings. Is it decidable, semi decidable or fully undecidable??

asked in Theory of Computation Jul 24, 2018

629 views

2 votes

2 answers

12

self doutbt
How to Construct Full Binary Tree from given preorder and postorder? Thank you.

asked in DS Jul 16, 2018

1.3k views

0 votes

2 answers

13

self doubt
Is it necessary that euler graph should always be simple graph?

asked in Graph Theory Jun 27, 2018

461 views

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))

asked in Mathematical Logic Jun 16, 2018

219 views

1 vote

1 answer

15

self doubt
dog(x) = x is a dog Int (x) = x is intelligent write in logic form No dogs are intelligent.

asked in Mathematical Logic Jun 14, 2018

420 views

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

asked in Mathematical Logic Jun 14, 2018

486 views