Register
Filter

Answers by admin

1 votes
5
Identify the class of the language
$L=\left\{ w\in(a+b)^* \mid w \\ \text{ has at least as many occurrences of (bba)'s as (abb)'s}\right\}$     Identify the class of the language.
$L=\left\{ w\in(a+b)^* \mid w \\ \text{ has at least as many occurrences of (bba)'s as (abb)'s}\right\}$    Identify the class of the language.
1 votes
8
Modulus operator in C
How C will behave with negative operands with modulus  operator?
How C will behave with negative operands with modulus  operator?
0 votes
9
Why is the overhead in paging equal to average overhead caused by page size which is P/2, P is the size of Page ?
Why is the overhead in paging equal to average overhead caused by page size which is P/2, P is the size of Page ?
1 votes
11
No. of MUX, NAND and NOR
2 votes
12
ISRO2015-30
Semaphores are used to solve the problem of Race Condition Process Synchronization Mutual Exclusion None of the above I and II II and III All of the above None of the above
Semaphores are used to solve the problem ofRace ConditionProcess SynchronizationMutual ExclusionNone of the aboveI and IIII and IIIAll of the aboveNone of the above
0 votes
13
System call
main( ) { if (fork( ) == 0) { /* Child */ while (1) { for (i=0; i
main( ){ if (fork( ) == 0){ /* Child */while (1){ for (i=0; i
0 votes
14
GATE CSE 2001 | Question: 1.6
Given an arbitrary non-deterministic finite automaton (NFA) with $N$ states, the maximum number of states in an equivalent minimized DFA at least $N^2$ $2^N$ $2N$ $N!$
Given an arbitrary non-deterministic finite automaton (NFA) with $N$ states, the maximum number of states in an equivalent minimized DFA at least$N^2$$2^N$$2N$$N!$
6 votes
16
seek time
the seek time of a disk is 30ms.it rotates at the rate of 30 rotations/second.the capacity of each track is 300 words.the access time is (approximately) guys can any one solve this plzzzz...
the seek time of a disk is 30ms.it rotates at the rate of 30 rotations/second.the capacity of each track is 300 words.the access time is (approximately) guys can any one ...
1 votes
17
ISRO2008-7
Consider the grammar $S \rightarrow ABCc \mid bc$ $BA \rightarrow AB$ $Bb \rightarrow bb$ $Ab \rightarrow ab$ $Aa \rightarrow aa$ Which of the following sentences can be derived by this grammar? abc aab abcc abbc
Consider the grammar$S \rightarrow ABCc \mid bc$$BA \rightarrow AB$$Bb \rightarrow bb$$Ab \rightarrow ab$$Aa \rightarrow aa$Which of the following sentences can be derive...
0 votes
20
which of the following is not a necessary condition for deadlock?
which of the following is not a necessary condition for deadlock? a)Mutual exclusion b)Reentrancy c)Hold and Wait d)No pre-emption
which of the following is not a necessary condition for deadlock?a)Mutual exclusionb)Reentrancyc)Hold and Waitd)No pre-emption
2 votes
21
GATE CSE 2006 | Question: 09, ISRO2009-35
A CPU has $24$-$bit$ instructions. A program starts at address $300$ (in decimal). Which one of the following is a legal program counter (all values in decimal)? $400$ $500$ $600$ $700$
A CPU has $24$-$bit$ instructions. A program starts at address $300$ (in decimal). Which one of the following is a legal program counter (all values in decimal)?$400$$500...
0 votes
22
when we realize a 64x1 mux using 4x1 muxes we have levels?
options are:- A) 2 B)3 C)4 D)5 Please provide answer with explanation.
options are:-A) 2B)3C)4D)5Please provide answer with explanation.
0 votes
26
no of state in minimal finite automata that accept the string from alphabet {a,b,c}
no of state in minimal finite automata that accept the string from alphabet {a,b,c} where no of a is divisible by 2 or 3 and no of c is divisible by 6?? plzz explain!!!
no of state in minimal finite automata that accept the string from alphabet {a,b,c} where no of a is divisible by 2 or 3 and no of c is divisible by 6?? plzz explain!!!
0 votes
27
TIFR CSE 2010 | Part A | Question: 2
The hour hand and the minute hands of a clock meet at noon and again at mid-night. In between they meet $N$ times, where $N$ is.: $6$ $11$ $12$ $13$ None of the above
The hour hand and the minute hands of a clock meet at noon and again at mid-night. In between they meet $N$ times, where $N$ is.:$6$$11$$12$$13$None of the above
0 votes
29
Which of the following statement is correct regarding DFS?
Which of the following statement is correct regarding DFS? 1) All the vertices are pushed in the stack during DFS Traversal. 2) No vertex is pushed more than once in the stack during traversal.
Which of the following statement is correct regarding DFS? 1) All the vertices are pushed in the stack during DFS Traversal. 2) No vertex is pushed more than once in the ...
Page: