menu
search
Log In
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

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

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
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 556 views
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
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 769 views
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
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 305 views
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?
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 668 views
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
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 May 8, 2017 in DS 3.9k views
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?
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 the ... 22bits. 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 289 views
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
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 Jan 27, 2017 in CO and Architecture 64 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
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 110 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)* = ??
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 168 views
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
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 Jan 23, 2017 in Theory of Computation 443 views
0 votes
11
SUBNET MASK
answered Jan 21, 2017 in Computer Networks 114 views
0 votes
12
Self Doubt | XOR Expression
Is the above statement true ? $(A+B)\oplus C \equiv (A \oplus C) +(B\oplus C)$
Is the above statement true ? $(A+B)\oplus C \equiv (A \oplus C) +(B\oplus C)$
answered Jan 16, 2017 in Digital Logic 58 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)???
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 66 views
6 votes
14
UGCNET-June2016-III: 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)^*$
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 2.1k views
1 vote
15
testbook
answered Jan 11, 2017 in Databases 40 views
0 votes
16
made easy
answered Jan 11, 2017 in CO and Architecture 59 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?
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 402 views
0 votes
18
Cache memory
Is it compulsory that the block sizes of the main memory and the cache memory are always equal?
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 402 views
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_____$?$
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 202 views
0 votes
20
DOUBT
my answer is "B" but the answer is given "C"
my answer is "B" but the answer is given "C"
answered Jan 8, 2017 in Theory of Computation 753 views
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.
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 Jan 8, 2017 in Theory of Computation 535 views
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
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 115 views
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
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 Jan 8, 2017 in Theory of Computation 144 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.
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 120 views
2 votes
27
zeal coaching sheet
why {a^j b^k : k=j^2} is not a cfl?
why {a^j b^k : k=j^2} is not a cfl?
answered Jan 7, 2017 in Theory of Computation 62 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>
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 Jan 5, 2017 in CO and Architecture 121 views
2 votes
29
ace self dual
answered Jan 5, 2017 in Digital Logic 117 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...