Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User focus _GATE
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by focus _GATE
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
in
Mathematical Logic
Jul 14, 2017
2.2k
views
probability
engineering-mathematics
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
in
Mathematical Logic
Jul 14, 2017
2.0k
views
probability
engineering-mathematics
discrete-mathematics
3
votes
3
counting
Number of words of 4 letters that can be formed with the letters of the word IITJEE is 42 256 102 142
answered
in
Probability
May 20, 2017
436
views
discrete-mathematics
combinatory
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
in
CO and Architecture
May 20, 2017
1.7k
views
co-and-architecture
cache-memory
5
votes
5
ISRO2017-69
Choose the equivalent prefix form of the following expression (a+(b-c))*((d-e)/(f+g-h)) *+a-bc/-de-+fgh *+a-bc-/de-+fgh *+a-bc/-ed-+fgh *+ab-c/-de-+fgh
answered
in
DS
May 8, 2017
11.5k
views
isro2017
data-structures
infix-prefix
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
in
Operating System
Jan 28, 2017
610
views
operating-system
paging
0
votes
7
addressing format
Consider a hypothetical system which has 32 bit instructions and 8 bit addresses. If there are 90 2-address 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
in
CO and Architecture
Jan 27, 2017
273
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
in
CO and Architecture
Jan 25, 2017
191
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
in
Theory of Computation
Jan 23, 2017
314
views
theory-of-computation
identify-class-language
2
votes
10
Whether languages regular or not
L1 ={ a^pb^q | p+q>=10^6} L2= { a^mb^n | m-n>=10^6} i m not getting this can someone help me with this
answered
in
Theory of Computation
Jan 23, 2017
876
views
theory-of-computation
regular-language
0
votes
11
SUBNET MASK
answered
in
Computer Networks
Jan 21, 2017
203
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
in
Digital Logic
Jan 16, 2017
161
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
in
Digital Logic
Jan 16, 2017
158
views
6
votes
14
UGC NET CSE | June 2016 | Part 3 | Question: 23
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
in
Theory of Computation
Jan 16, 2017
3.3k
views
ugcnetcse-june2016-paper3
theory-of-computation
regular-expression
1
vote
15
testbook
answered
in
Databases
Jan 11, 2017
118
views
0
votes
16
made easy
answered
in
CO and Architecture
Jan 11, 2017
147
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
in
Theory of Computation
Jan 10, 2017
1.1k
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
in
CO and Architecture
Jan 10, 2017
746
views
cache-memory
co-and-architecture
memory-interfacing
6
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
in
Databases
Jan 9, 2017
499
views
databases
indexing
virtual-gate-test-series
0
votes
20
DOUBT
my answer is "B" but the answer is given "C"
answered
in
Theory of Computation
Jan 8, 2017
1.0k
views
theory-of-computation
1
vote
21
MadeEasy Subject Test: Theory of Computation - Identify Class Language
answered
in
Theory of Computation
Jan 8, 2017
280
views
made-easy-test-series
theory-of-computation
identify-class-language
0
votes
22
MadeEasy Subject Test: Operating System - Page Replacement
Why S1 is false??
answered
in
Operating System
Jan 8, 2017
313
views
made-easy-test-series
operating-system
page-replacement
0
votes
23
doubt
If L is Turing-recognizable. 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
in
Theory of Computation
Jan 8, 2017
2.3k
views
theory-of-computation
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
in
Theory of Computation
Jan 8, 2017
242
views
theory-of-computation
0
votes
25
Language Problem
If L={ambn | m,n≥1 & gcd(m,n)=1}, then L is Context sensitive Language Context-free Language Regular Language None of the above
answered
in
Theory of Computation
Jan 8, 2017
290
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
in
Theory of Computation
Jan 7, 2017
353
views
2
votes
27
zeal coaching sheet
why {a^j b^k : k=j^2} is not a cfl?
answered
in
Theory of Computation
Jan 7, 2017
156
views
1
vote
28
Made Easy Test Series cache Memory
consider a 32 bit microprocessor which has 32K byte which is 4-way set associative cache.Block size of cache is 2 32-bit words.The set number to which wprd from memory location FAFEEBE1 wrapped ___. I'm confused about 2 32-bit words as block size .Answer given was based on <Tag,Set,Word> =<19,9,4>
answered
in
CO and Architecture
Jan 5, 2017
405
views
2
votes
29
ace self dual
answered
in
Digital Logic
Jan 5, 2017
367
views
Page:
1
2
3
4
5
6
...
10
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
This was very nice blog man!!😂😂
@abhi_3_0_12 bro revise now, Gate is on upcoming...
I want to buy the test series today but I want to...
@mahendrapatel The more you give those (some...
@ChatGPT bhai muze vo test bhi dena tha...