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

Recent activity by focus _GATE

6 answers
1
GATE2018-GA-1
"From where are they bringing their books? _______ bringing _______ books from ________" The words that best fill the blanks in the above sentence are $\text{Their, they're, there}$ $\text{They're, their, there}$ $\text{There, their, they're}$ $\text{They're, there,there}$
"From where are they bringing their books? _______ bringing _______ books from ________" The words that best fill the blanks in the above sentence are $\text{Their, they're, there}$ $\text{They're, their, there}$ $\text{There, their, they're}$ $\text{They're, there,there}$
answer edited Feb 4, 2018 in Verbal Ability 2.8k views
1 answer
3
GATE1988-2-vi
Define the value of $r$ in the following: $\sqrt (41)_{r} = (7)_{10}$
Define the value of $r$ in the following: $\sqrt (41)_{r} = (7)_{10}$
commented Feb 2, 2018 in Digital Logic 824 views
1 answer
4
regular expression
Consider the following regular expression (RE) RE = (a+b)*(a+b+ε)a Which of the following is equivalent to the above RE? a) (a* + b*)+ (aa + ba) b) (ε + a+b*)+ a c) (a + b)+ (a + b + ε)a d) None of these
Consider the following regular expression (RE) RE = (a+b)*(a+b+ε)a Which of the following is equivalent to the above RE? a) (a* + b*)+ (aa + ba) b) (ε + a+b*)+ a c) (a + b)+ (a + b + ε)a d) None of these
answer selected Jan 14, 2018 in Theory of Computation 136 views
1 answer
5
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???
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.? ------------------------------------------------------- ... I think 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???
answer selected Dec 26, 2017 in Theory of Computation 165 views
2 answers
6
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
answer selected Aug 8, 2017 in Mathematical Logic 787 views
2 answers
7
maximum value of n to be deadlock
A computer system has 6 tape drives, with n processes competing for them. Each process may need 3 tape drives. What is the maximum value of n for which the system is guaranteed to be deadlock? Justify your answer.
A computer system has 6 tape drives, with n processes competing for them. Each process may need 3 tape drives. What is the maximum value of n for which the system is guaranteed to be deadlock? Justify your answer.
answer selected Jul 15, 2017 in Operating System 768 views
1 answer
8
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
commented Jul 14, 2017 in Mathematical Logic 571 views
0 answers
9
probability
a lot consists of 12 good pencils, 6 with minor defects and 2 with major defects. A pencil is chosen at random. The probability that this pencil is not defective is?
a lot consists of 12 good pencils, 6 with minor defects and 2 with major defects. A pencil is chosen at random. The probability that this pencil is not defective is?
commented Jul 14, 2017 in Probability 312 views
1 answer
10
# Probability
What is the expected no. of heads that come up when fair coin is flipped five times?
What is the expected no. of heads that come up when fair coin is flipped five times?
answer selected Jul 14, 2017 in Mathematical Logic 69 views
1 answer
11
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
answer selected Jul 14, 2017 in Probability 311 views
1 answer
12
Ace Pregate Question
T(n) = T(n/4) + T(3n/4) + n if n>1 = 1 if n =1 T(n) = ??
T(n) = T(n/4) + T(3n/4) + n if n>1 = 1 if n =1 T(n) = ??
answer selected Jul 1, 2017 in Algorithms 156 views
0 answers
13
[COA] Cache Set associative mapping
Question 1:- Consider a 32-bit microprocessor that has an on-chip 16-KByte four-way set-associative cache. Assume that the cache has a line size of four 32-bit words. Draw a block diagram of this cache showing its organization and how the different ... of bits taken were 6 ? How can i identify whether we need to convert to byte addressable from word size or not?
Question 1:- Consider a 32-bit microprocessor that has an on-chip 16-KByte four-way set-associative cache. Assume that the cache has a line size of four 32-bit words. Draw a block diagram of this cache showing its organization and how the different address fields are used ... and number of bits taken were 6 ? How can i identify whether we need to convert to byte addressable from word size or not?
commented May 26, 2017 in CO and Architecture 500 views
1 answer
14
indexing
Consider file consists of 10,000 records. Block size 1024 bytes, record size 100 bytes. search key 9 bytes, pointer 7 byte. a) How many 1st level index blocks using dense indexing. b)How many 1st level index blocks using sparse indexing. please explain in detail diff bw sparse and dense.
Consider file consists of 10,000 records. Block size 1024 bytes, record size 100 bytes. search key 9 bytes, pointer 7 byte. a) How many 1st level index blocks using dense indexing. b)How many 1st level index blocks using sparse indexing. please explain in detail diff bw sparse and dense.
answer selected May 26, 2017 in Databases 747 views
3 answers
15
[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?
commented May 22, 2017 in CO and Architecture 673 views
1 answer
16
Dependency preserving decomposition
A relation R(ABCD) with FD set f = {AB ->CD , D -> A } and the decomposition d = { R1(ABC) , R2(AD) , R3(BCD) } Check whether the following decomposition is dependency preserving or not ?
A relation R(ABCD) with FD set f = {AB ->CD , D -> A } and the decomposition d = { R1(ABC) , R2(AD) , R3(BCD) } Check whether the following decomposition is dependency preserving or not ?
answer selected May 15, 2017 in Databases 180 views
1 answer
17
UGC net
The number of states in a minimal deterministic finite automaton corresponding to the language L = { an | n≥4 } is
The number of states in a minimal deterministic finite automaton corresponding to the language L = { an | n≥4 } is
answer selected May 15, 2017 in Theory of Computation 960 views
1 answer
18
computer architecture
A cache has a capacity of 16 kbits and a line length of 128 bytes.how many set does cache have if it is 8 way set associative? A)16 B)32 C)64 D)none of the above
A cache has a capacity of 16 kbits and a line length of 128 bytes.how many set does cache have if it is 8 way set associative? A)16 B)32 C)64 D)none of the above
answer selected May 15, 2017 in CO and Architecture 125 views
6 answers
19
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
3 answers
20
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)^*$
answer selected May 3, 2017 in Theory of Computation 2.1k views
2 answers
21
Signed_unsigned bits
How 11010 is -6 ? According to me it should be -10 . Please explain anyone.
How 11010 is -6 ? According to me it should be -10 . Please explain anyone.
answer selected Apr 29, 2017 in Digital Logic 202 views
2 answers
22
Aptitude
The number of positive numbers of not more than 10 digits formed using 0,1,2,3?
The number of positive numbers of not more than 10 digits formed using 0,1,2,3?
commented Apr 29, 2017 in Numerical Ability 146 views
1 answer
23
peter linz excercise
commented Apr 25, 2017 in Theory of Computation 142 views
1 answer
24
cil 2017
a. 2 b. 4 c. 1 d. 3
a. 2 b. 4 c. 1 d. 3
commented Apr 3, 2017 in Graph Theory 112 views
2 answers
25
UGCNET-Dec2015-III: 63
Consider the following three tables $R, S$ and $T.$ In this question, all the join operations are natural joins $(\bowtie )$. $(\pi )$ ... (a) (b) (c) (d)
Consider the following three tables $R, S$ and $T.$ In this question, all the join operations are natural joins $(\bowtie )$. $(\pi )$ ... (a) (b) (c) (d)
answer selected Mar 19, 2017 in Databases 2.1k views
6 answers
26
GATE2017-1-10
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$
commented Feb 15, 2017 in Theory of Computation 7.4k views
9 answers
27
GATE2017-1-6
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is $0$. $4$ and $15$ respectively. $3$ and $14$ respectively. $4$ and $14$ respectively. $3$ and $15$ respectively.
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is $0$. $4$ and $15$ respectively. $3$ and $14$ respectively. $4$ and $14$ respectively. $3$ and $15$ respectively.
answer selected Feb 15, 2017 in DS 5.2k views
6 answers
28
GATE2017-1-20
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
answer selected Feb 13, 2017 in DS 5.9k views
1 answer
29
SQL query
how is q1 right it only shows sid for students with rank less than everyone
how is q1 right it only shows sid for students with rank less than everyone
commented Feb 6, 2017 in Databases 1.2k views
1 answer
30
Probability
What is conditional probability that a family with 2 children has 2 boys, given they have atleast 1 boy? Why do we take total cases as 4 { GB, BB, BG, GG}? Shouldn't we consider GB AND BG same only.
What is conditional probability that a family with 2 children has 2 boys, given they have atleast 1 boy? Why do we take total cases as 4 { GB, BB, BG, GG}? Shouldn't we consider GB AND BG same only.
answer selected Feb 2, 2017 in Verbal Ability 73 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...