MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -DAG representation for basic blocks. A DAG for basic block is a directed acyclic graph with the following labels on nodes: The leaves of graph are labeled by unique identifier and that identifier can be variable names or constants. Interior nodes of the graph is labeled by an operator symbol.

Detailed explanation-2: -The structure-preserving transformation on basic blocks includes: Dead Code Elimination. Common Subexpression Elimination. Renaming of Temporary variables.

Detailed explanation-3: -There are two type of basic block optimization. These are as follows: Structure-Preserving Transformations. Algebraic Transformations.

Detailed explanation-4: -DAGs are used to encode researchers’ a priori assumptions about the relationships between and among variables in causal structures. DAGs contain directed edges (arrows), linking nodes (variables), and their paths.