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 adarsh_1997
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by adarsh_1997
6
votes
1
GATE CSE 2013 | Question: 33
Consider the DFA $A$ given below. Which of the following are FALSE? Complement of $L(A)$ is context-free. $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
in
Theory of Computation
Aug 16, 2019
16.2k
views
gatecse-2013
theory-of-computation
finite-automata
normal
2
votes
2
GATE CSE 1996 | Question: 2.13, ISRO2016-28
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above
answered
in
Algorithms
Jul 31, 2019
31.4k
views
gate1996
algorithms
easy
isro2016
searching
2
votes
3
GATE CSE 2012 | Question: 12
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
in
Theory of Computation
Jul 2, 2019
19.1k
views
gatecse-2012
finite-automata
easy
theory-of-computation
0
votes
4
Reflexive Relation
Can anyone help …. where I am wrong…??
answered
in
Set Theory & Algebra
Jan 7, 2019
702
views
discrete-mathematics
relations
made-easy-test-series
1
vote
5
DIgital MUX GFG TEST
answered
in
Digital Logic
Jan 7, 2019
647
views
digital-logic
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
in
Theory of Computation
Dec 27, 2018
578
views
theory-of-computation
finite-automata
minimal-state-automata
1
vote
7
Testbook Test Series: Programming & DS - Programming In C
Please someone explain me properly
answered
in
Programming in C
Dec 26, 2018
556
views
testbook-test-series
programming
programming-in-c
1
vote
8
MadeEasy Test Series: Operating System - Memory Management
answered
in
Operating System
Dec 26, 2018
931
views
made-easy-test-series
operating-system
memory-management
paging
5
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 look-a-heads are present for the item X → >Y and Z → .id in the initial state _____________. Please explain your answer.
answered
in
Compiler Design
Dec 24, 2018
2.2k
views
compiler-design
parsing
made-easy-test-series
1
vote
10
Limit
Please try to answer without using any standard result as i cant remember them.
answered
in
Calculus
Nov 13, 2018
269
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
in
Algorithms
Nov 10, 2018
12.4k
views
algorithms
greedy-algorithm
algorithm-design
job-scheduling
1
vote
12
please explain also..
answered
in
Algorithms
Nov 10, 2018
383
views
algorithms
kruskals-algorithm
5
votes
13
find out the no. of spanning tree possible
How many spanning trees are possible from the graph given below? $24$ $34$ $44$ $54$
answered
in
Algorithms
Nov 9, 2018
4.7k
views
spanning-tree
graph-algorithms
numerical-answers
7
votes
14
Self doubt Spanning tree
How many numbers of spanning tree are possible?
answered
in
Algorithms
Nov 9, 2018
1.1k
views
algorithms
minimum-spanning-tree
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
in
Theory of Computation
Nov 6, 2018
3.0k
views
theory-of-computation
minimal-state-automata
regular-expression
finite-automata
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
in
Algorithms
Nov 5, 2018
2.0k
views
algorithms
dynamic-programming
made-easy-test-series
longest-common-subsequence
1
vote
17
GateForum
Can anyone please explain
answered
in
Algorithms
Nov 4, 2018
571
views
algorithms
radix-sort
test-series
1
vote
18
made easy test series
answered
in
Algorithms
Nov 4, 2018
712
views
made-easy-test-series
matrix-chain-ordering
dynamic-programming
numerical-answers
2
votes
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
in
Operating System
Nov 4, 2018
510
views
deadlock-prevention-avoidance-detection
operating-system
0
votes
20
number of conflict schedules
https://gateoverflow.in/178786/transaction can anyone confirm this question answer i am getting 90
answered
in
Databases
Nov 2, 2018
577
views
transaction-and-concurrency
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
in
Compiler Design
Oct 31, 2018
2.9k
views
compiler-design
static-single-assignment
intermediate-code
1
vote
22
#MADE NOTE
F={AB$\rightarrow$C,A$\rightarrow$C} G={A$\rightarrow$C} FIND EQUVALIANT ARE NOT?
answered
in
Databases
Oct 31, 2018
360
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. (n-1)
answered
in
Theory of Computation
Oct 31, 2018
604
views
gateforum-test-series
theory-of-computation
finite-automata
0
votes
24
#CD Doubt
#CD compute first and follow for S->SS+\SS*\a
answered
in
Compiler Design
Oct 28, 2018
444
views
compiler-design
grammar
parsing
first-and-follow
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
in
Operating System
Oct 27, 2018
230
views
semaphore
1
vote
26
Gilbert Strang
$\int \frac{x^3}{\sqrt{1+x^2}}.dx$
answered
in
Calculus
Oct 24, 2018
485
views
integration
calculus
engineering-mathematics
definite-integral
0
votes
27
Self Doubt
A relation R is in 2NF if every non-prime 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
in
Databases
Oct 24, 2018
431
views
databases
database-normalization
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
in
Databases
Oct 23, 2018
857
views
1
vote
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
in
Databases
Oct 22, 2018
470
views
databases
b-tree
made-easy-test-series
Page:
1
2
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...