5 votes
41
do we need to study chomsky and griebach normal forms in detail for the gate exam? are they useful for solving anything in an easier way?
6 votes
43
5 votes
44
In paging no. of entries in page table is same as no. of pages in LAS what does this mean? Does this mean the pages present at particular time in LAS only those pages sho...
6 votes
45
5 votes
46
when a process move from ready to suspend ready state i.e. form main memory to backing store. is it possible that process move to another processor for execution?
7 votes
47
Consider the following C program. What's the Output and does it depends on the compiler used to run this code?#include<stdio.h int main() { int i = 1; printf("%d %d %d\n"...
20 votes
50
Design a context free grammar for the language consisting of all strings over $\mathbf{\{a,b\}}$ that are not the form $\mathbf{ww}$ for any string $\mathbf{w}$
7 votes
51
16 votes
52
I/p - array of n element in which untill some postion all are integer and afterward all are star (*) O/p- find the postion of 1st star (*)Hint - if lenear search is possi...
10 votes
53
Find 1) Vertex connectivity 2) Edge connectivity 3) Is it a seperable graph ? If so then find the cut-vertex
6 votes
54
8 votes
55
how many solutions are there to equationx1+x2+x3 =11with conditions x1<= 1 ,x2<=2 ,x3<=3
4 votes
56
Which of the following event doesn't effect a process in the running time ?a) Interupt b) exit c) I/O event d)schedular dispatch
10 votes
57
A dice is rolled 6 times ,one ,two,three,four,five,and six appears on consecutive throws of dice ,how many ways are possible of having one before six?? plz explain clearl...
4 votes
58
What is the Worst Case Space Complexity of Quick Sort?
10 votes
60
Which of the following programming language(s) provides garbage collection automaticallyLispC++FortanC
6 votes
61
A primary key for an entity isa candidate keyany attributea unique attributea superkey
10 votes
62
What is the minimum number of states in string ${(ab)}^{*}$?How to approach this kind of problem?
4 votes
64
how many no of times the instruction sequence below will loop before coming out of loop?A1; MOV AL,00H INC AL JNZ A1
12 votes
65
A. [(00(0+1)* 11] + [11( 0 + 1)* 00]B. [(00+11) (0+1)+] + [( 0 + 1)+ (00+11)].C. [(00+11) (0+1)*] + [( 0 + 1)* (00+11)]D. (00+11) (0+1)* (00+11).
11 votes
68
A. regular grammar to context-free grammarB. nondeterministic FSA to deterministic FSAC. nondeterministic PDA to deterministic PDAD. nondeterministic TM to de...
6 votes
70
A. T(n) = $O( n Log n)$B. T(n) = $O({(logn)}^2)$C. T(n) = $O(n)$D. T(n) = $O(n^2)$