Register
Filter

Answers by Habibkhan

4 votes
363
C Output
Why is it so? What is the concept behind it?
Why is it so? What is the concept behind it?
3 votes
364
Ace test series
Which of the following scheduling algorithms can cause indefinite blocking of a process? a>FIFO b>SRTF c>Round Robin d>Priority scheduling According to me answer should be B and D.Am I correct??
Which of the following scheduling algorithms can cause indefinite blocking of a process?a>FIFOb>SRTFc>Round Robin d>Priority scheduling According to me answer should be B...
5 votes
365
L1={an bm│m≠n and m≠2n}
L1={an bm│m≠n and m≠2n} above language is DCFL,NDCFL or CSL?
L1={an bm│m≠n and m≠2n}above language is DCFL,NDCFL or CSL?
1 votes
366
ROM-no. of OR Gates
1 votes
368
Given a push down automaton M with one state, whether L (M) = ∑* is
Given a push down automaton M with one state, whether L (M) = ∑* is Decidable Undecidable Semi – decidable Would have been decidable if halting problem was decidable
Given a push down automaton M with one state, whether L (M) = ∑* is Decidable Undecidable Semi – decidable Would have been decidable if halting problem was decida...
4 votes
369
L= {<TM> | TM halts on every input}
$L=\left \{ <TM> | TM\ halts\ on\ every\ input\ \right \}$ is above language Recursively enumerable or non recursively enumerable??
$L=\left \{ <TM | TM\ halts\ on\ every\ input\ \right \}$is above language Recursively enumerable or non recursively enumerable??
6 votes
370
Computer Network
Which of the following are true? (i) In Asynchronous serial transfer extra bits are also treated as part of data (ii) In synchronous serial transfer synchronous bits are treated as part of data
Which of the following are true?(i) In Asynchronous serial transfer extra bits are also treated as part of data(ii) In synchronous serial transfer synchronous bits are tr...
6 votes
371
MadeEasy Test Series: Linear Algebra - Eigen Value
can we use some identity to find value of ab+by+ya???without finding its eigen values and then multiplying..earlier i have read it somewhere but i forget it.
can we use some identity to find value of ab+by+ya???without finding its eigen values and then multiplying..earlier i have read it somewhere but i forget it.
5 votes
372
decidability
a context-free grammar is ambiguous is undecidable But for a given context-free language if we can make more than one parse tree then it means that it is ambiguous..So how it is undecidable??
a context-free grammar is ambiguous is undecidableBut for a given context-free language if we can make more than one parse tree then it means that it is ambiguous..So how...
5 votes
373
regular languages closure properties
What is difference between Kleene closure and infinite union in context of regular languages?
What is difference between Kleene closure and infinite union in context of regular languages?
9 votes
374
Gate 2014
Qus 1 Qus2
Qus 1Qus2
2 votes
375
decidability
intersection of two recursive lang is recursive is this problem decidable or not?
intersection of two recursive lang is recursive is this problem decidable or not?
1 votes
376
ME-OS
i got 44 as answer. givne answer is 48 they took PTE to be 3 Bytes correct answer is?
i got 44 as answer. givne answer is 48they took PTE to be 3 Bytescorrect answer is?
2 votes
378
solve CNN
11 votes
379
no of comparisons
What are the number of comparisons in merge sort? m+n or m+n-1...
What are the number of comparisons in merge sort?m+n or m+n-1...
9 votes
380
A computer has 64 bit instruction and 12 bit address.....how many 1-address instruction is possible?
A computer has 64 bit instruction and 12 bit address.If there are 250 3-address instruction and 525 2-address instruction,how many 1-address instruction is possible?
2 votes
381
Memory refrences
8 votes
383
matrix
If A3x3 is a matrix with |A| = 2. What is the determinant of Adj (Adj (Adj A))?
If A3x3 is a matrix with |A| = 2. What is the determinant of Adj (Adj (Adj A))?
3 votes
384
Let f(n)= Ω(n), g(n)= O(n) and h(n)= Ѳ(n).
Let $f(n)= &Omega;(n), g(n)= O(n)$ and $h(n)= &#1138;(n)$. Then $[f(n). g(n)] + h(n)$ is: &Omega; (n) O (n) &#1138; (n) None of these
Let $f(n)= &Omega;(n), g(n)= O(n)$ and $h(n)= &#1138;(n)$. Then $[f(n). g(n)] + h(n)$ is:&Omega; (n)O (n)&#1138; (n)None of these
Page: