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
Recent activity 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
6
answers
1
GATE2018GA1
"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.5k
views
gate2018
verbalability
mostappropriateword
easy
2
answers
2
how many distinct 4digits integers one can make from the digits 1,3,3,7,7,8 ? Is there and method or we have to go by enumerating the possibilites ?
answer selected
Feb 3, 2018
in
Combinatory

1.2k
views
permutationandcombination
1
answer
3
GATE19882vi
Define the value of $r$ in the following: $\sqrt (41)_{r} = (7)_{10}$
commented
Feb 2, 2018
in
Digital Logic

574
views
gate1988
digitallogic
normal
numberrepresentation
numericalanswers
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
answer selected
Jan 14, 2018
in
Theory of Computation

98
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???
answer selected
Dec 26, 2017
in
Theory of Computation

141
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
answer selected
Aug 8, 2017
in
Mathematical Logic

424
views
probability
engineeringmathematics
discretemathematics
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.
answer selected
Jul 15, 2017
in
Operating System

550
views
graphtheory
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
commented
Jul 14, 2017
in
Mathematical Logic

311
views
probability
engineeringmathematics
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?
commented
Jul 14, 2017
in
Probability

257
views
probability
engineeringmathematics
eamcet
1
answer
10
# Probability
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

56
views
engineeringmathematics
probability
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
answer selected
Jul 14, 2017
in
Probability

241
views
discretemathematics
permutationandcombination
counting
1
answer
12
Ace Pregate Question
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

144
views
timecomplexity
algorithms
0
answers
13
[COA] Cache Set associative mapping
Question 1: Consider a 32bit microprocessor that has an onchip 16KByte fourway setassociative cache. Assume that the cache has a line size of four 32bit 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?
commented
May 26, 2017
in
CO and Architecture

366
views
coandarchitecture
cachememory
memoryinterfacing
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.
answer selected
May 26, 2017
in
Databases

490
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?
commented
May 22, 2017
in
CO and Architecture

529
views
coandarchitecture
cachememory
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 ?
answer selected
May 15, 2017
in
Databases

130
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
answer selected
May 15, 2017
in
Theory of Computation

731
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
answer selected
May 15, 2017
in
CO and Architecture

50
views
6
answers
19
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
3
answers
20
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)^*$
answer selected
May 3, 2017
in
Theory of Computation

1.6k
views
ugcnetjune2016iii
theoryofcomputation
regularexpressions
2
answers
21
Signed_unsigned bits
How 11010 is 6 ? According to me it should be 10 . Please explain anyone.
answer selected
Apr 29, 2017
in
Digital Logic

169
views
digitallogic
2
answers
22
Aptitude
The number of positive numbers of not more than 10 digits formed using 0,1,2,3?
commented
Apr 29, 2017
in
Numerical Ability

122
views
1
answer
23
peter linz excercise
commented
Apr 25, 2017
in
Theory of Computation

88
views
1
answer
24
cil 2017
a. 2 b. 4 c. 1 d. 3
commented
Apr 3, 2017
in
Graph Theory

79
views
cil2017
2
answers
25
UGCNETDec2015III63
Consider the following three tables R, S and T. In this question, all the join operations are natural joins ($\bowtie$). ($\pi$) is the projection operation of a relation: Possible answer tables for this question are also given as below: (a) (b) (c) (d)
answer selected
Mar 19, 2017
in
Databases

1.6k
views
ugcnetdec2015iii
databases
joins
5
answers
26
GATE2017110
Consider the following contextfree 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

5.3k
views
gate20171
theoryofcomputation
contextfreelanguages
normal
9
answers
27
GATE201716
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

4.1k
views
gate20171
datastructures
binarysearchtree
easy
6
answers
28
GATE2017120
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

4.5k
views
gate20171
datastructures
trees
numericalanswers
1
answer
29
SQL query
how is q1 right it only shows sid for students with rank less than everyone
commented
Feb 6, 2017
in
Databases

1k
views
databases
sql
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.
answer selected
Feb 2, 2017
in
Verbal Ability

59
views
1
answer
31
CFL Automata
A = {w t wr w, t ∈ {0, 1} and t=5} is this a CFL? My Analysis if t=5 were not mentioned it would have been a Regular language.But for the given question above,I could construct only NPDA.Thus the laguage I believe is not DCFL . Is this the correct answer?
answer selected
Feb 2, 2017
in
Theory of Computation

60
views
2
answers
32
Euler Path
Which of the following Graph has Euler Path but is not an Euler Graph? A. K1,1 B.K2,10 C.K2,11 D.K10,11.
commented
Feb 1, 2017
in
Graph Theory

430
views
graphtheory
eulergraph
eulerpath
2
answers
33
MadeEasy Subject Test: Databases  Transactions
S: R1(A), R3(D), W1(B), R2(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B) Number of serial schedules which are view equal to above S are __. Polygraph that I drew:
commented
Jan 31, 2017
in
Databases

447
views
databases
madeeasytestseries
transactions
2
answers
34
file system
In particular unix OS each data block is of size 1024 bytes each node has 10 direct data blocks and 2additional addresses one for single indirect block and one for double indirect block. Each block is addressed with 64 byte. The maximum possible size of file in the file system (in KB) is ? My answer:282 answer given 256.? anyone help.
commented
Jan 29, 2017
in
Operating System

334
views
operatingsystem
filesystem
inode
2
answers
35
UGCNETDEC2016III23
Given the following two languages: $L_1 = \{a^n b^n \mid n \geq 0, \: n \neq 100\}$ $L_2 = \{ w \in \{a, b, c\}^* \mid n_a(w) = n_b (w) = n_c(w) \}$ Which of the following options is correct? Both $L_1$ ... $L_1$ is context free language, $L_2$ is not context free language $L_1$ is not context free language, $L_2$ is context free language
commented
Jan 28, 2017
in
Others

1.7k
views
ugcnetdec2016iii
3
answers
36
MadeEasy Subject Test: Operating System  Process Schedule
asked
Jan 28, 2017
in
Operating System

118
views
madeeasytestseries
operatingsystem
processschedule
2
answers
37
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
answers
38
#Testbook 3 Qno.26
#plz check i think 2nd property hold in reverse way??
commented
Jan 27, 2017
in
Set Theory & Algebra

47
views
testseries
1
answer
39
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
3
answers
40
how many view equivalent serial schedules are possible
how many view equivalent serial schedules are possible for the given schedule s: w1(a) r2(a) w3(a) r4(a) w5(a) r6(a) a) 2 b) 3 c) 6 d) 8
commented
Jan 27, 2017
in
Databases

2.1k
views
transactions
50,737
questions
57,275
answers
198,154
comments
104,821
users