Questions by focus _GATE

0 votes

2 answers

1

Aptitude
The number of positive numbers of not more than 10 digits formed using 0,1,2,3?

asked Apr 29, 2017 in Numerical Ability | 122 views

+2 votes

3 answers

2

MadeEasy Subject Test: Operating System - Process Schedule

asked Jan 28, 2017 in Operating System | 116 views

0 votes

0 answers

3

dbms ..
just expalin about view serilizable

asked Jan 26, 2017 in Databases | 47 views

0 votes

1 answer

4

toc - doubt
how (i) is true???

asked Jan 25, 2017 in Theory of Computation | 106 views

0 votes

2 answers

5

testbook
payload value should be divided by here they take 505 it should be 504 so it become 504/8=63??

asked Jan 25, 2017 in Programming | 50 views

0 votes

1 answer

6

testbook compiler

asked Jan 25, 2017 in Compiler Design | 227 views

+1 vote

1 answer

7

testbook
no of strings upto length 3 on alphabet ∑={a,b,c,d} are (including string of zero length )??

asked Jan 24, 2017 in Combinatory | 95 views

0 votes

0 answers

8

cn MTU
my doubt when packet get fragmented from first router than reassembly should take place or each individual packet have to be fragment again in the second router MTU??

asked Jan 23, 2017 in Computer Networks | 110 views

+1 vote

2 answers

9

Testbook Test Series: Compiler Design - Parsing

asked Jan 23, 2017 in Compiler Design | 275 views

+3 votes

2 answers

10

Testbook Test Series: Digital Logic - Xor
Q,R,S are true for sure but how p is true ???

asked Jan 18, 2017 in Digital Logic | 222 views

0 votes

0 answers

11

testbook
it is asking after 24th clock pulse but not "AT" 24th clock pulse wt should be correct answer plzz explain ??

asked Jan 18, 2017 in Digital Logic | 57 views

0 votes

1 answer

12

testbook
is it correct >>??

asked Jan 18, 2017 in Programming | 68 views

0 votes

0 answers

13

testboook
i take m=4 and n=3? and after doing recursive calls i get 10 answer so how D) option will be correct ??

asked Jan 18, 2017 in Programming | 86 views

0 votes

0 answers

14

testbook
what will be differnece if we use c)option and d) option explain ??

asked Jan 13, 2017 in DS | 65 views

0 votes

1 answer

15

testbook

asked Jan 11, 2017 in Theory of Computation | 99 views

+3 votes

3 answers

16

Testbook Test Series: Programming & DS - Graphs

asked Jan 11, 2017 in Programming | 135 views

0 votes

1 answer

17

testbook

asked Jan 11, 2017 in Compiler Design | 74 views

0 votes

0 answers

18

testbook

asked Jan 11, 2017 in Compiler Design | 49 views

0 votes

0 answers

19

testbook

asked Jan 11, 2017 in Compiler Design | 49 views

+2 votes

0 answers

20

toc check
is it equal?? $(a^{+}b^{+})^*$= $(a^{+}b)^*(ab^{+})^*$

asked Jan 10, 2017 in Theory of Computation | 105 views

0 votes

0 answers

21

compiler
the need of heap allocation at runtime is a) to support dynamic data structure b)to support dynamic scoping c) to support recursion d) all of the above explain?

asked Jan 10, 2017 in Compiler Design | 45 views

+2 votes

2 answers

22

toc cfl or not ?
L={ ai bj ck | i,j,k>=0, i<j<k} CFL OR NOT CFL ??

asked Jan 10, 2017 in Theory of Computation | 153 views

+1 vote

0 answers

23

regular lang
let l denote the language denoted by the grammer s--> 00T T-->11S/11 l=(0|1) l is regular but not (0|1) l is CFL but not regular l is not CFL

asked Jan 4, 2017 in Compiler Design | 71 views

0 votes

1 answer

24

time complexity
What is the time complexibilty of the following code?Assume "statement" takes O(1) time. int x=0; int A(n) { statement; if (n==1) { return 1; } else { x += 4 A(n/2) + n2; return x; } }

asked Jan 3, 2017 in Algorithms | 116 views

0 votes

0 answers

25

toc explain
D is dfa is L(D) recursive enumerable?? (decidable/undecidable)

asked Dec 28, 2016 in Theory of Computation | 94 views

+1 vote

1 answer

26

dbms b tree
Suppose the search key of a B tree is V=8 byte long, the disk block size is B=512 bytes, a record(data) pointer is P=6 bytes and a block pointer is l=5 bytes. Calculate the order of the B tree and also is each node of B tree is 69 percent full. Find the average number of keys per node of the above B tree. 1. 29,17 2. 27,17 3. 28,18 4. 27,18 my answer is d) option is it plzz check

asked Dec 26, 2016 in Databases | 478 views

+1 vote

1 answer

27

dbms sql
Which of the following query will give name of the employee who is earning maximum salary? 1. Select name from emp where sal=(Select max(sal) from emp); 2. Select name from emp where sal>=all(Select max(sal) from emp); 3. Both a and b are correct queries 4. Both a and b are incorrect queries

asked Dec 26, 2016 in Databases | 112 views

0 votes

1 answer

28

re and rec
Consider a language L for which there exists a Turing machine that, when presented with any finite input string w over the alphabet, halts and accepts if ω ? L, and halts and rejects otherwise. Which one of the following statements is/are TRUE? 1. L ... but not recursively enumerable. 2. L is recursively enumerable but not recursive. 3. L is recursively enumerable. 4. None of the above

asked Dec 22, 2016 in Theory of Computation | 247 views

0 votes

2 answers

29

toc grammer
Consider two grammars G1 and G2 that describe the languages L(G1) and L(G2) respectively over some common alphabet Σ, and let f denote the empty language. The problem Is L(G1) ∩ L(G2) = f ? is decidable for which of the following cases? I. Both G1 and G2 ... . II. Both G1 and G2 are context free grammars. III. G1 is a regular grammar and G2 is a context free grammar, or vice-versa.

asked Dec 22, 2016 in Theory of Computation | 102 views

+1 vote

1 answer

30

toc dfa
Minimum Number of states required by a DFA to accept the String (a+b) * a(a+b)(a+b) ?

asked Dec 22, 2016 in Theory of Computation | 57 views