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
Recent activity by focus _GATE
5
answers
1
GATE CSE 2018 | Question: 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}$
answer edited
in
Verbal Aptitude
Feb 4, 2018
4.2k
views
gatecse-2018
verbal-aptitude
most-appropriate-word
easy
1-mark
2
answers
2
how many distinct 4-digits 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
in
Combinatory
Feb 3, 2018
3.3k
views
combinatory
1
answer
3
GATE CSE 1988 | Question: 2-vi
Define the value of $r$ in the following: $\sqrt {(41)_{r}} = (7)_{10}$
commented
in
Digital Logic
Feb 2, 2018
1.7k
views
gate1988
digital-logic
normal
number-representation
descriptive
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
in
Theory of Computation
Jan 14, 2018
235
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
in
Theory of Computation
Dec 26, 2017
337
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
in
Mathematical Logic
Aug 8, 2017
2.0k
views
probability
engineering-mathematics
discrete-mathematics
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
in
Operating System
Jul 15, 2017
2.4k
views
graph-theory
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
in
Mathematical Logic
Jul 14, 2017
2.2k
views
probability
engineering-mathematics
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
in
Probability
Jul 14, 2017
443
views
probability
engineering-mathematics
eamcet
1
answer
10
# Probability
What is the expected no. of heads that come up when fair coin is flipped five times?
answer selected
in
Mathematical Logic
Jul 14, 2017
170
views
engineering-mathematics
probability
1
answer
11
counting
Number of words of 4 letters that can be formed with the letters of the word IITJEE is 42 256 102 142
answer selected
in
Probability
Jul 14, 2017
437
views
discrete-mathematics
combinatory
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
in
Algorithms
Jul 1, 2017
257
views
recurrence-relation
algorithms
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?
commented
in
CO and Architecture
May 26, 2017
810
views
co-and-architecture
cache-memory
memory-interfacing
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
in
Databases
May 26, 2017
1.2k
views
1
answer
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
in
CO and Architecture
May 22, 2017
1.7k
views
co-and-architecture
cache-memory
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
in
Databases
May 15, 2017
310
views
2
answers
17
UGC NET CSE | September 2013 | Part 2 | Question: 13
The number of states in a minimal deterministic finite automaton corresponding to the language $L=\{ a^n \mid n \geq 4 \}$ is 3 4 5 6
answer selected
in
Theory of Computation
May 15, 2017
3.2k
views
ugcnetsep2013ii
theory-of-computation
finite-automata
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
in
CO and Architecture
May 15, 2017
706
views
3
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
answered
in
DS
May 8, 2017
11.6k
views
isro2017
data-structures
infix-prefix
stack
3
answers
20
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)^*$
answer selected
in
Theory of Computation
May 3, 2017
3.3k
views
ugcnetcse-june2016-paper3
theory-of-computation
regular-expression
2
answers
21
Signed_unsigned bits
How 11010 is -6 ? According to me it should be -10 . Please explain anyone.
answer selected
in
Digital Logic
Apr 29, 2017
573
views
digital-logic
1
answer
22
Aptitude
The number of positive numbers of not more than 10 digits formed using 0,1,2,3?
commented
in
Quantitative Aptitude
Apr 29, 2017
248
views
1
answer
23
peter linz excercise
commented
in
Theory of Computation
Apr 25, 2017
223
views
5
answers
24
CIL17
commented
in
DS
Apr 3, 2017
1.5k
views
2
answers
25
UGC NET CSE | December 2015 | Part 3 | Question: 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)
answer selected
in
Databases
Mar 19, 2017
3.6k
views
ugcnetcse-dec2015-paper3
databases
joins
8
answers
26
GATE CSE 2017 Set 1 | Question: 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 \}$
commented
in
Theory of Computation
Feb 15, 2017
17.5k
views
gatecse-2017-set1
theory-of-computation
context-free-language
normal
9
answers
27
GATE CSE 2017 Set 1 | Question: 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.
answer selected
in
DS
Feb 15, 2017
14.2k
views
gatecse-2017-set1
data-structures
binary-search-tree
easy
7
answers
28
GATE CSE 2017 Set 1 | Question: 20
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
answer selected
in
DS
Feb 13, 2017
16.1k
views
gatecse-2017-set1
data-structures
tree
numerical-answers
1
answer
29
Test by Bikram | Mock GATE | Test 1 | Question: 46
Assume there are n transactions $T^{1}$., $T^{2}$., .... ,$T^{n}$. Every transaction Writes a value of variable $X$ and then it is read by its successive transaction, like, $T^{1}$ writes a value of $X$ that is read by $T^{2}$ ... of transaction rollbacks are required to recover the schedule is ? $0$ $\left ( n \right )$ $1$ $\left ( n-1 \right )$
commented
in
GATE
Feb 7, 2017
754
views
tbb-mockgate-1
transaction-and-concurrency
databases
1
answer
30
SQL query
how is q1 right it only shows sid for students with rank less than everyone
commented
in
Databases
Feb 6, 2017
1.9k
views
databases
sql
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
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.7k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Recommend test series??
pressman pdf/ geeksforgeeks
where to study software engineering for BARC
+1
1200/1000 = 1.2