The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by adarsh_1997
User adarsh_1997
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User adarsh_1997
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+3
votes
1
GATE201333
Consider the DFA $A$ given below. Which of the following are FALSE? Complement of $L(A)$ is contextfree. $L(A) = L((11^*0+0)(0 + 1)^*0^*1^*) $ For the language accepted by $A, A$ is the minimal DFA. $A$ accepts all strings over $\{0, 1\}$ of length at least $2$. 1 and 3 only 2 and 4 only 2 and 3 only 3 and 4 only
answered
Aug 17, 2019
in
Theory of Computation

5k
views
gate2013
theoryofcomputation
finiteautomata
normal
0
votes
2
GATE19962.13, ISRO201628
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n1}{2}$ $\frac{n+1}{2}$ None of the above
answered
Jul 31, 2019
in
Algorithms

11k
views
gate1996
algorithms
easy
isro2016
searching
+2
votes
3
GATE201212
What is the complement of the language accepted by the NFA shown below? Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string. $\phi$ $\{\epsilon\}$ $a^*$ $\{a , \epsilon\}$
answered
Jul 2, 2019
in
Theory of Computation

6.2k
views
gate2012
finiteautomata
easy
theoryofcomputation
0
votes
4
Reflexive Relation
Can anyone help …. where I am wrong…??
answered
Jan 8, 2019
in
Mathematical Logic

112
views
relations
settheory&algebra
discretemathematics
+1
vote
5
DIgital MUX GFG TEST
answered
Jan 7, 2019
in
Digital Logic

151
views
digitallogic
multiplexer
+1
vote
6
Self doubt TOC DFA
Construct a minimal DFA which accepts set of all strings over {a,b}, such that $1)$Second symbol from $RHS$ should be $‘a’$ $2)$Third symbol from $RHS$ should be $‘a’$
answered
Dec 27, 2018
in
Theory of Computation

88
views
theoryofcomputation
finiteautomata
minimalstateautomata
+1
vote
7
Testbook Test Series: Programming & DS  Programming In C
Please someone explain me properly
answered
Dec 27, 2018
in
Programming

139
views
testbooktestseries
programming
programminginc
+1
vote
8
MadeEasy Test Series: Operating System  Memory Management
answered
Dec 27, 2018
in
Operating System

272
views
madeeasytestseries
operatingsystem
memorymanagement
paging
+3
votes
9
Compiler Design #Made_Easy_Test_Series
Let G be any grammar with the following productions: X → X + Y  Y Y → Y * Z  Z Z → (X) Z → id If LR(!) parser is used to parse the above grammar, then total how many lookaheads are present for the item X → >Y and Z → .id in the initial state _____________. Please explain your answer.
answered
Dec 24, 2018
in
Compiler Design

236
views
compilerdesign
parsing
+1
vote
10
Limit
Please try to answer without using any standard result as i cant remember them.
answered
Nov 14, 2018
in
Calculus

48
views
0
votes
11
Job Sequencing Problem (Greedy Algorithm)
If job $J=(J_{1},J_{2},J_{3},J_{4})$ are given their processing time $T_{i}=(1,1,2,3)$ and deadline are $D_{i}=(3,4,2,3)$ maximum how many job can be done$?$ $A)1$ $B)2$ $C)3$ $D)All$
answered
Nov 11, 2018
in
Algorithms

1k
views
algorithms
greedyalgorithm
deadlines
+1
vote
12
please explain also..
answered
Nov 10, 2018
in
Algorithms

95
views
algorithms
kruskalsalgorithm
+4
votes
13
find out the no. of spanning tree possible
answered
Nov 9, 2018
in
Algorithms

2.4k
views
+6
votes
14
Self doubt Spanning tree
How many numbers of spanning tree are possible?
answered
Nov 9, 2018
in
Algorithms

309
views
algorithms
mst
minimumspanningtrees
+3
votes
15
What is the minimal DFA for this language (11+111)*, for Σ={0,1}.
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
answered
Nov 6, 2018
in
Theory of Computation

468
views
theoryofcomputation
minimalstateautomata
regularexpressions
finiteautomata
nfadfa
+1
vote
16
MadeEasy Test Series: Algorithms  Dynamic Programming
Consider two strings A = “abbaccda” and B = “abcaa” consider "x"be length of the longest common subsequence between A and B and “y” be the number of distinct such longest common subsequences between A and B. Then 10x+ 2y is ________.
answered
Nov 5, 2018
in
Algorithms

302
views
algorithms
dynamicprogramming
madeeasytestseries
+1
vote
17
GateForum
Can anyone please explain
answered
Nov 5, 2018
in
Algorithms

72
views
algorithms
radixsort
+1
vote
18
made easy test series
answered
Nov 4, 2018
in
Algorithms

99
views
+1
vote
19
Deadlock
If the total number of resources available is 6 and each process requires 3 instances of a resource to complete execution. Then what is the number of processes that can exist in this system without causing a deadlock?
answered
Nov 4, 2018
in
Operating System

86
views
deadlock
operatingsystem
0
votes
20
number of conflict schedules
https://gateoverflow.in/178786/transaction can anyone confirm this question answer i am getting 90
answered
Nov 3, 2018
in
Databases

116
views
transactionandconcurrency
+5
votes
21
Static Single Assignment form
Consider the following code generation: a=b+c; c=a+x; d=b+c; b=a+x; The minimum no. of total variables required to convert the above code to static single assignment form is______
answered
Nov 1, 2018
in
Compiler Design

554
views
compilerdesign
staticsingleassignment
intermediatecode
+1
vote
22
#MADE NOTE
F={AB$\rightarrow$C,A$\rightarrow$C} G={A$\rightarrow$C} FIND EQUVALIANT ARE NOT?
answered
Nov 1, 2018
in
Databases

84
views
+1
vote
23
Gateforum Test Series: Theory of Computation  Finite Automata
If NFA contains n states, then the equivalent minimized DFA in best case will contain how many states? A. 0 B. n C. 1 D. (n1)
answered
Oct 31, 2018
in
Theory of Computation

109
views
gateforumtestseries
theoryofcomputation
finiteautomata
0
votes
24
#CD Doubt
#CD compute first and follow for S>SS+\SS*\a
answered
Oct 28, 2018
in
Compiler Design

49
views
+1
vote
25
Self Doubt
How to decide in which question process will run completely and where preemption needs to be taken while solving semaphore questions? Is there any predefined method?
answered
Oct 27, 2018
in
Operating System

32
views
semaphores
+1
vote
26
Gilbert Strang
$\int \frac{x^3}{\sqrt{1+x^2}}.dx$
answered
Oct 25, 2018
in
Calculus

139
views
integration
calculus
engineeringmathematics
definiteintegrals
0
votes
27
Self Doubt
A relation R is in 2NF if every nonprime attribute of R is fully functionally dependent on every key of R true or false R(A,B,C) F {A>B,B>C} Here key = A R is in 2NF So is C is fully functional dependent on every key here ?. It is not dependent on key infact ?
answered
Oct 24, 2018
in
Databases

101
views
databases
databasenormalization
+1
vote
28
Minimization of ER diagram
What is the minimum no tables required if relationship between two strong entity has total participation at one end with mapping as 1:1 ? I see solution in many questions as 1 table required but I think it should be 2 tables as until ... participation is at both ends of relationship we cannot combine into 1 table. Please suggest whether my understanding is correct or not?
answered
Oct 23, 2018
in
Databases

189
views
0
votes
29
MadeEasy Test Series: Databases  B Tree
The following key values are inserted into B+ tree in which the order of internal nodes is 4 and that of the leaf node is 5 in the sequence given below. The order of internal node is maximum number of keys in each node and the order of leaf node is ... 5 pointer then till 5 element we can insert in one leaf. So answer should be 5+ 19+23 = 47. AM i Right?
answered
Oct 22, 2018
in
Databases

135
views
databases
btree
madeeasytestseries
Page:
1
2
next »
52,375
questions
60,572
answers
201,977
comments
95,388
users