The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by focus _GATE
User focus _GATE
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User focus _GATE
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+2
votes
1
Probability
A fair coin is tossed till a head appears for the first time .The probability that the number of required tosses is odd. A) 1/3 B) 1/2 C)2/3 D)3/4
answered
Jul 14, 2017
in
Mathematical Logic

311
views
probability
engineeringmathematics
+2
votes
2
Probability
A box contains 4 red balls and 6 black balls .Three balls are selected randomly from the box one after another without replacement .The probability that the selected set contains one red ball and two black ball is A)1/20 B) 1/12 C) 3/10 D)1/2
answered
Jul 14, 2017
in
Mathematical Logic

424
views
probability
engineeringmathematics
discretemathematics
+3
votes
3
counting
Number of words of 4 letters that can be formed with the letters of the word IITJEE is a) 42 b) 82 c)102 d) 142
answered
May 20, 2017
in
Probability

241
views
discretemathematics
permutationandcombination
counting
+4
votes
4
[CO] Memory Organization
3 level memory has the following specifications: Level AccessTime/Word Block Size in words Hit Ratio 1 20 ns  .7 2 100 ns 2 .9 3 200 ns 4 1 If the referenced block is not in L1,then transfer from L2 to L1,If not in L2,then transfer from L3 to L2 to L1.How long will it take to access a block?
answered
May 20, 2017
in
CO and Architecture

529
views
coandarchitecture
cachememory
+5
votes
5
ISRO201769
Choose the equivalent prefix form of the following expression (a+(bc))*((de)/(f+gh)) *+abc/de+fgh *+abc/de+fgh *+abc/ed+fgh *+abc/de+fgh
answered
May 8, 2017
in
DS

3.3k
views
isro2017
datastructures
infixpostfix
stack
0
votes
6
PTE paging
consider a paging system with 48bit virtual address space.Each address defers to a byte in memory.suppose the size of page is 16KB and the main memory size is 16GB.The minimum size of page table with each entry need 2 protection bits is _____ (in GB) now what should be ... . should i round it to 3bytes and make answer as 48GB or shuld i keep it as it is and write the answer as 44GB?
answered
Jan 28, 2017
in
Operating System

238
views
operatingsystem
paging
0
votes
7
addressing format
Consider a hypothetical system which has 32 bit instructions and 8 bit addresses. If there are 90 2address instructions and 200 one address instructions, then how many zero address instructions can be formulated? A) 216 – 90 × 28 B) ( 216 – 90 × 28 – 200) × 28 C) ((216 – 90) × 28 – 200) × 28 D) (216 – 90) × 28 – 200 × 28
answered
Jan 27, 2017
in
CO and Architecture

50
views
+1
vote
8
Cryptography
total number of keys saved for a set of 10 individuals to be able to communicate with each other using public key compared to of secret key crypto systems are
answered
Jan 25, 2017
in
CO and Architecture

93
views
+1
vote
9
Gate Practice
L1 = {a^nb^nC^n  n>=0} L2 = {a^nb^mc^k  k=m+n , n,m>=0} L1.(L2)* = ??
answered
Jan 23, 2017
in
Theory of Computation

140
views
theoryofcomputation
+2
votes
10
Whether languages regular or not
L1 ={ a^pb^q  p+q>=10^6} L2= { a^mb^n  mn>=10^6} i m not getting this can someone help me with this
answered
Jan 23, 2017
in
Theory of Computation

368
views
theoryofcomputation
regularlanguages
0
votes
11
SUBNET MASK
answered
Jan 21, 2017
in
Computer Networks

88
views
0
votes
12
Self Doubt  XOR Expression
Is the above statement true ? $(A+B)\oplus C \equiv (A \oplus C) +(B\oplus C)$
answered
Jan 16, 2017
in
Digital Logic

49
views
+1
vote
13
self doubt
we know jhonson counter does mod(2N) counting and ring does mod(N) counting with N no. of FF's then can some one tell about ripple counter.....is it mod(2^N)???
answered
Jan 16, 2017
in
Digital Logic

54
views
+6
votes
14
UGCNETJune2016III23
The regular expression for the complement of the language $L=\{a^nb^m \mid n \geq 4, m \leq 3\}$ is: $(\lambda +a+aa+aaa)b^*+a^*bbbb^*+(a+b)^*ba(a+b)^*$ $(\lambda +a+aa+aaa)b^*+a^*bbbbb^*+(a+b)^*ab(a+b)^*$ $(\lambda +a+aa+aaa)+a^*bbbbb^*+(a+b)^*ab(a+b)^*$ $(\lambda +a+aa+aaa)b^*+a^*bbbbb^*+(a+b)^*ba(a+b)^*$
answered
Jan 16, 2017
in
Theory of Computation

1.6k
views
ugcnetjune2016iii
theoryofcomputation
regularexpressions
+1
vote
15
testbook
answered
Jan 11, 2017
in
Databases

34
views
0
votes
16
made easy
answered
Jan 11, 2017
in
CO and Architecture

49
views
0
votes
17
NCFL,CFL,PDA
L1={wlwR∣w∈{a,b}∗,l∈{a,b} } which type of language is this DCFL or NDCFL? (note that l∈{a,b} not {a,b}*) I feel its NDCFL can you also tell how PDA will look like?
answered
Jan 10, 2017
in
Theory of Computation

207
views
0
votes
18
Cache memory
Is it compulsory that the block sizes of the main memory and the cache memory are always equal?
answered
Jan 10, 2017
in
CO and Architecture

328
views
cachememory
coandarchitecture
memoryinterfacing
+5
votes
19
Virtual Gate Test Series: Databases  Indexing
Consider a relation company with $3000$ records are of fixed length, with record size $50$ bytes are stored in block of size $512$ bytes $\text{(unspanned).}$ If a secondary index is built on the key field of size $10$ bytes and a block pointer of size $5$ bytes, the number of first level index blocks are_____$?$
answered
Jan 9, 2017
in
Databases

182
views
databases
indexing
virtualgatetestseries
0
votes
20
DOUBT
my answer is "B" but the answer is given "C"
answered
Jan 8, 2017
in
Theory of Computation

721
views
theoryofcomputation
+1
vote
21
MadeEasy Subject Test: Theory of Computation  Identify Class Language
answered
Jan 8, 2017
in
Theory of Computation

85
views
madeeasytestseries
theoryofcomputation
identifyclasslanguage
0
votes
22
MadeEasy Subject Test: Operating System  Page Replacement
Why S1 is false??
answered
Jan 8, 2017
in
Operating System

69
views
madeeasytestseries
operatingsystem
pagereplacement
0
votes
23
doubt
If L is Turingrecognizable. Then (a) L and ̅L must be decidable. (b) L must be decidable but ̅ L need not be. (c) Either L is decidable or ̅ L is not Turing recognizable. (d) None of above.
answered
Jan 8, 2017
in
Theory of Computation

357
views
theoryofcomputation
0
votes
24
doubt
L ⊆ Ʃ*, Ʃ = {a, b} Which of the following is True? (a) L = {x  x has equal a’s and b’s} is regular (b) L = {a^n b^n  n ≥ 1} is regular (c) L = {x  x has more a’s than b’s} is regular (d) L = { a^m b^n, m,n ≥ 1} is regular
answered
Jan 8, 2017
in
Theory of Computation

93
views
theoryofcomputation
0
votes
25
Language Problem
If L={ambn  m,n≥1 & gcd(m,n)=1}, then L is Context sensitive Language Contextfree Language Regular Language None of the above
answered
Jan 8, 2017
in
Theory of Computation

101
views
+1
vote
26
CSL or Not
L1 = {a^p / p is prime} is CSL or not? please give reason for that too and procedure too.
answered
Jan 7, 2017
in
Theory of Computation

93
views
+2
votes
27
zeal coaching sheet
why {a^j b^k : k=j^2} is not a cfl?
answered
Jan 7, 2017
in
Theory of Computation

49
views
+1
vote
28
Made Easy Test Series cache Memory
consider a 32 bit microprocessor which has 32K byte which is 4way set associative cache.Block size of cache is 2 32bit words.The set number to which wprd from memory location FAFEEBE1 wrapped ___. I'm confused about 2 32bit words as block size .Answer given was based on <Tag,Set,Word> =<19,9,4>
answered
Jan 5, 2017
in
CO and Architecture

97
views
+2
votes
29
ace self dual
answered
Jan 5, 2017
in
Digital Logic

98
views
+3
votes
30
Regular languages
Which of the following is/are true? 1) every RL is DCFL. 2) R  L is always CSL but need not be CFL. ( R is regular language and L is CFL ) Here in second statement what does they actually mean by " need not be ".
answered
Jan 5, 2017
in
Theory of Computation

73
views
+1
vote
31
IP ADDRESSING
answered
Jan 4, 2017
in
Computer Networks

72
views
+4
votes
32
REGULAR LANGUAGES
L={WX$W^{R}$ / W,X$\epsilon (a+b)^{*}$.} L={XW$W^{R}$ / W,X$\epsilon (a+b)^{*}$.} l={W$W^{R}$X /W,X $\epsilon (a+b)^{*}$.} which of the above are REGULAR LANGUAGES.?  ... all are regular I)w=$\epsilon$ then w^r=$\epsilon$ and x=$(a+b)^{*}$ // it accept complete language so it is regular. same as for remaining problems also.am i ryt???
answered
Jan 4, 2017
in
Theory of Computation

141
views
+2
votes
33
Zeal Coaching sheet
The content of a 4 bit shift register is initially 1101. It is shifted to left 6 times with serial input being 101101. What is content of register at the end ?
answered
Jan 4, 2017
in
Digital Logic

708
views
+2
votes
34
RA division
answered
Jan 4, 2017
in
Databases

156
views
databases
0
votes
35
Doubt
Whether a given regular grammar is ambiguous is decidable ?
answered
Jan 3, 2017
in
Theory of Computation

40
views
+1
vote
36
ACETEST TOC
answered
Jan 2, 2017
in
Theory of Computation

78
views
+1
vote
37
layers in TCP/IP model
How many layers are in the TCP/IP model a) 4 layers b) 5 layers c) 6 layers d) 7 layers ans is 4 or 5 pl confirm
answered
Jan 1, 2017
in
Computer Networks

101
views
+3
votes
38
techtud
A 4way setassociative cache memory unit with a capacity of 16 KB is built using a block size of 8 words. The word length is 32 bits. The size of the physical address space is 4 GB. The number of bits for the TAG field is
answered
Jan 1, 2017
in
CO and Architecture

87
views
Page:
1
2
3
4
5
6
...
8
next »
50,737
questions
57,275
answers
198,154
comments
104,817
users