Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged directed-acyclic-graph
0
votes
0
answers
1
BARC 2024 CSE
Number of nodes in the DAG(Directed Acyclic Graph) representing (a+b)+c+(a+b)
Number of nodes in the DAG(Directed Acyclic Graph) representing (a+b)+c+(a+b)
Ayanava Dutta
80
views
Ayanava Dutta
asked
Mar 17
Compiler Design
normal
directed-acyclic-graph
compiler-design
+
–
0
votes
1
answer
2
GATE DS&AI 2024 | Question: 41
Consider the directed acyclic graph (DAG) below: Which of the following is/are valid vertex orderings that can be obtained from a topological sort of the DAG? $\text{P Q R S T U V}$ $\text{P R Q V SUT}$ $\text{P Q R S V U T}$ $\text{P R Q S V T U}$
Consider the directed acyclic graph (DAG) below:Which of the following is/are valid vertex orderings that can be obtained from a topological sort of the...
Arjun
665
views
Arjun
asked
Feb 16
Algorithms
gate-ds-ai-2024
algorithms
topological-sort
directed-acyclic-graph
+
–
0
votes
1
answer
3
UGC NET CSE | June 2008 | Part 2 | Question: 1
Which of the following does not define a tree? A tree is a connected acyclic graph. A tree is a connected graph with $n-1$ edges where ' $n$ ' is the number of vertices in the graph. A tree is an acyclic graph with $n-1$ edges where ' $n$ ' is the number of vertices in the graph. A tree is a graph with no cycles.
Which of the following does not define a tree?A tree is a connected acyclic graph.A tree is a connected graph with $n-1$ edges where ' $n$ ' is the number of vertices in ...
admin
82
views
admin
asked
Jan 6
Others
ugcnetcse-june2008-paper2
directed-acyclic-graph
tree
+
–
0
votes
1
answer
4
#selfdoubt
how many topological sort possible for above graph?directions like this question https://gateoverflow.in/39669/gate-cse-2016-set-1-question-11
how many topological sort possible for above graph?directions like this question https://gateoverflow.in/39669/gate-cse-2016-set-1-question-11
Dknights
421
views
Dknights
asked
Jan 30, 2023
Programming in C
programming
topological-sort
directed-acyclic-graph
+
–
0
votes
0
answers
5
TestBook TestSeries question to find number of paths in directed graph
Consider the following directed graph and assume the number of paths to reach to itself i.e. N(A) = 1. Number of paths from A to K are __
Consider the following directed graph and assume the number of paths to reach to itself i.e. N(A) = 1.Number of paths from A to K are __
Sahil_Lather
229
views
Sahil_Lather
asked
Jan 28, 2023
Algorithms
algorithms
directed-acyclic-graph
testbook-test-series
+
–
1
votes
2
answers
6
DRDO CSE 2022 Paper 2 | Question: 1
What is the minimum number of nodes required in a DAG (Directed Acyclic Graph) for the following block? \[ \begin{aligned} U=Z & =V+W \\ X=Y & =U+1 \\ A & =X+Y \end{aligned} \]
What is the minimum number of nodes required in a DAG (Directed Acyclic Graph) for the following block?\[\begin{aligned}U=Z & =V+W \\X=Y & =U+1 \\A & =X+Y\end{aligned}\]
admin
693
views
admin
asked
Dec 15, 2022
Algorithms
drdocse-2022-paper2
algorithms
graph-algorithm
directed-acyclic-graph
5-marks
descriptive
+
–
0
votes
0
answers
7
DAG ( compiler Design)
How Directed acyclic graph would be constructed for this instruction? b[j] = a ;
How Directed acyclic graph would be constructed for this instruction?b[j] = a ;
Ankita87077
574
views
Ankita87077
asked
Oct 28, 2021
Compiler Design
compiler-design
directed-acyclic-graph
+
–
15
votes
3
answers
8
GATE CSE 2021 Set 2 | Question: 55
In a directed acyclic graph with a source vertex $\textsf{s}$, the $\textit{quality-score}$ of a directed path is defined to be the product of the weights of the edges on the path. Further, for a vertex $v$ other than $\textsf{s}$, the quality ... $\textsf{s}$ is assumed to be $1$. The sum of the quality-scores of all vertices on the graph shown above is _______
In a directed acyclic graph with a source vertex $\textsf{s}$, the $\textit{quality-score}$ of a directed path is defined to be the product of the weights of the edges on...
Arjun
7.0k
views
Arjun
asked
Feb 18, 2021
Algorithms
gatecse-2021-set2
algorithms
graph-algorithm
directed-acyclic-graph
numerical-answers
2-marks
+
–
12
votes
4
answers
9
GATE CSE 2021 Set 1 | Question: 50
Consider the following $C$ code segment: a = b + c; e = a + 1; d = b + c; f = d + 1; g = e + f; In a compiler, this code segment is represented internally as a directed acyclic graph $\text{(DAG)}$. The number of nodes in the $\text{DAG}$ is _____________
Consider the following $C$ code segment:a = b + c; e = a + 1; d = b + c; f = d + 1; g = e + f;In a compiler, this code segment is represented internally as a directed acy...
Arjun
10.2k
views
Arjun
asked
Feb 18, 2021
Compiler Design
gatecse-2021-set1
compiler-design
code-optimization
directed-acyclic-graph
numerical-answers
2-marks
+
–
1
votes
1
answer
10
NIELIT Scientific Assistant A 2020 November: 53
Which of the following is not true for tree and graph? A tree is a graph A graph is a tree Tree can have a cycle Tree is a $\text{DAG}$
Which of the following is not true for tree and graph?A tree is a graphA graph is a treeTree can have a cycleTree is a $\text{DAG}$
gatecse
434
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
code-optimization
directed-acyclic-graph
+
–
0
votes
1
answer
11
NIELIT 2016 DEC Scientist B (CS) - Section B: 36
The graph that shows basic blocks and their successor relationship is called: DAG Control graph Flow graph Hamiltonian graph
The graph that shows basic blocks and their successor relationship is called:DAGControl graphFlow graphHamiltonian graph
admin
1.6k
views
admin
asked
Mar 31, 2020
Compiler Design
nielit2016dec-scientistb-cs
compiler-design
directed-acyclic-graph
+
–
0
votes
1
answer
12
Ullman (Compiler Design) Edition 2 Exercise 6.1 Question 2 (Page No. 363)
Construct the DAG and identify the value numbers for the subexpressions of the following expressions, assuming $+$ associates from the left. $a+b+(a+b)$ $a+b+a+b$ $a+a+((a+a+a+(a+a+a+a))$
Construct the DAG and identify the value numbers for the subexpressions of the following expressions, assuming $+$ associates from the left.$a+b+(a+b)$$a+b+a+b$$a+a+((a+a...
admin
4.7k
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
three-address-code
directed-acyclic-graph
descriptive
+
–
1
votes
2
answers
13
Ullman (Compiler Design) Edition 2 Exercise 6.1 Question 1 (Page No. 362)
Construct the DAG for the expression $((x + y)-((x + y)\ast(x -y))) + ((x+y)\ast(x-y))$
Construct the DAG for the expression$((x + y)-((x + y)\ast(x -y))) + ((x+y)\ast(x-y))$
admin
2.5k
views
admin
asked
Sep 7, 2019
Compiler Design
ullman
compiler-design
three-address-code
directed-acyclic-graph
descriptive
+
–
2
votes
1
answer
14
Difference between DAG and Multi-stage graph
I have trouble understanding the difference between DAG and Multi-stage graph. I know what each of them is But I think that a multi-stage graph is also a DAG. Are multi-stage graphs a special kind of DAG?
I have trouble understanding the difference between DAG and Multi-stage graph. I know what each of them isBut I think that a multi-stage graph is also a DAG. Are multi-st...
gmrishikumar
815
views
gmrishikumar
asked
Apr 28, 2019
Graph Theory
graph-theory
graph-algorithm
graph-connectivity
multi-stage-graph
directed-acyclic-graph
+
–
0
votes
0
answers
15
self doubt
A directed acyclic graph has no connected components. TRUE OR FALSE???
A directed acyclic graph has no connected components.TRUE OR FALSE???
Doraemon
251
views
Doraemon
asked
Mar 30, 2019
Programming in C
directed-acyclic-graph
+
–
0
votes
2
answers
16
Made Easy Test Series
b = b + c d = b + d b = b – d e = d + b The minimum number of nodes and edges present in the DAG representation of above basic block respectively are ? 4 and 5 5 and 4 6 and 6 6 and 7
b = b + cd = b + db = b – de = d + bThe minimum number of nodes and edges present in the DAG representation of above basic block respectively are ?4 and 55 and 46 and 6...
balraj_allam
2.2k
views
balraj_allam
asked
Jan 27, 2019
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
made-easy-test-series
+
–
0
votes
1
answer
17
me test
Consider the basic block given below: u=u+v v=v+w x=v-w y=v-x z=u+v The minimum number of nodes and edges present in the DAG representations of the above basic block respectively are:
Consider the basic block given below:u=u+vv=v+wx=v-wy=v-xz=u+vThe minimum number of nodes and edges present in the DAG representations of the above basic block respective...
newdreamz a1-z0
1.3k
views
newdreamz a1-z0
asked
Jan 12, 2019
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
numerical-answers
+
–
0
votes
0
answers
18
DAG Syllabus
Is DAG from compiler design is in the syllabus?
Is DAG from compiler design is in the syllabus?
Shamim Ahmed
1.1k
views
Shamim Ahmed
asked
Dec 26, 2018
Compiler Design
directed-acyclic-graph
compiler-design
+
–
0
votes
2
answers
19
Directed Acyclic Graph
Question.Construct the Dag for the following Assume that + is left associative? a)a+b+(a+b) b)a+b+a+b c)a+a+(a+a+a+(a+a+a+a)) Please give the Answer to these questions?????
Question.Construct the Dag for the following Assume that + is left associative?a)a+b+(a+b)b)a+b+a+bc)a+a+(a+a+a+(a+a+a+a))Please give the Answer to these questions?????
saumya mishra
9.4k
views
saumya mishra
asked
Jun 13, 2018
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
+
–
0
votes
0
answers
20
DAG Representation
How to solve Questions of DAG like :- https://gateoverflow.in/2068/gate2014-3-34 My Solution:- (Please Point out what i am doing wrong) and please also do tell the proper way to do such question
How to solve Questions of DAG like :- https://gateoverflow.in/2068/gate2014-3-34My Solution:- (Please Point out what i am doing wrong)and please also do tell the proper w...
Na462
1.6k
views
Na462
asked
Jun 8, 2018
Compiler Design
directed-acyclic-graph
+
–
2
votes
1
answer
21
DAG representation
Please answer this!
Please answer this!
Balaji Jegan
626
views
Balaji Jegan
asked
Jan 20, 2018
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
descriptive
test-series
+
–
6
votes
0
answers
22
DAG Representation
Consider C program given below main() { a=a+b; c=a*c; d=c-d; a=c/d; printf("%d",a); } What will the minimum number of nodes and edge present in the DAG representation of the output of above C program?
Consider C program given belowmain() { a=a+b; c=a*c; d=c-d; a=c/d; printf("%d",a); }What will the minimum number of nodes and edge present in the DAG representation of th...
srestha
1.1k
views
srestha
asked
Jan 4, 2018
Compiler Design
compiler-design
directed-acyclic-graph
+
–
–2
votes
1
answer
23
ace test series
eyeamgj
392
views
eyeamgj
asked
Jan 3, 2018
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
ace-test-series
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register