CS606 Solved Grand Quiz Spring 2021

Welcome to CS606 Grand Quizzes at VUExamGuide.com – your ultimate destination for 100% Correct Answers! If you are a CS606 student at VU, looking for a reliable study resource to excel in your quizzes and exams, you’ve come to the right place.

Our CS606 Grand Quizzes cover a comprehensive range of topics, meticulously prepared by our expert team to ensure accuracy and depth of understanding. With a focus on data warehousing and data mining, these quizzes will sharpen your knowledge and problem-solving skills in extracting valuable insights from vast datasets.

No more struggling with complex data analysis techniques or uncertain solutions! VUExamGuide.com empowers you to excel in CS606. Embrace the knowledge and skills you need to design efficient data warehouses and make informed decisions using data mining techniques.

Join us now and embark on a journey of academic excellence with CS606 Grand Quizzes. Prepare to shine and propel yourself towards a brighter future – start exploring VUExamGuide.com today!

CS606 SOLVED MCQs

The input specification file to flex consists of ——–section.

1. One
2. Two
3. Three
4. Four

Lexer and scanner are two different phases of compiler

1. True
2. False

In compiler linear analysis is also called.

1. Lexical analysis
2. Scanning
3. Both lexical analysis and Scanning
4. None of the given

Which of the following statement is not true

1. The language accepted  by finite automata are the language denoted by regular expression.
2. For every DFA there is regular expression denoting its language.
3. For a regular expression, there does exist NFA with L(r) any transit that accepts.
4. None of the given option

A àB C D

B àh B|episilon

C àC g|G|Ch|i

Dà A B |episilon

First of A is————–.

1. h, g,i
2. g
3. h
4. none of the given option.

Top down parsing expends a ———form the start symbol to the leaves.

1. Parse tree
2. Abstract syntax tree
3. Parse tree
4. All of the given

A top down parse  start with the ———-of the parse tree.

1. Root
2. Leaf
3. Middle
4. None of the given

Can a DFA simulate NFA ?

1. No
2. Yes
3. Sometimes
4.  depends on NFA

Bottom up parsing is also called ———-.

1. LR parsing
2. LT parsing
3. LS parsing
4. SS parsing

The ———-is optimized for hardware it is to run on.

1. C++ coding
2. C coding
3. Assembly code
4. None

Abstract syntax tree summarizes———– without the detail of derivation.

1. Theory
2. Grammatical structure
3. Data
4. None

LR parsing ———- a string to the start symbol by inverting production.

1. Reduces
2. Shifts
3. Adds
4. None of given

Alternative to backtrack in top down parser is————.

1. Context free grammar
2. Tree
3. Look ahead
4. None of given

Typical compilation means programs written in high-level language to low –level—————.

1. Object code
2. Byte code
3. Unicode
4. Both object and byte code

The ————-checks the stream of words and their parts of speech for grammatical correctness.

1. Parse
2. Scanner
3. Compiler
4. None of the given

A grammar must be———-before use for predictive parsing.

1. Right factored
2. Left factored
3. factored
4. none of the given

Parser does not distinguish between valid and invalid sequences of token.

1. True
2. False

 In compilation process hierarchical analysis is also called——.

1. Parsing
2. Syntax analysis
3. Both Parsing  and Syntax analysis
4. None of given

 The pair <role,word> is given the name—–

1. Word
2. Token
3. Syntax
4. None of the given

The back map intermediates(IR) into target

1. Object code
2. Machine code
3. Source code
4. Linker

————-is evaluated to yield a value.

1. Command
2. Expression
3. Declaration
4. Declaration and Command

Front end of a two pass compiler is consists of scanner.

1. True
2. False

The ———-returns a sequence of matching token at the output (or an error ) and it always returns the longest matching tokens .

1. Scanner
2. Lexer
3. Lexical analysis
4. All  of the given

 Parser takes token from scanner and tries to generate ———.

1. Binary search tree
2. Parse tree
3. Syntax trace
4. None of the given

 ——–avoid hardware stalls and interlock.

1. Register allocation
2. Instruction scheduling
3. Instruction selection
4. None of the given

The handle-finding mechanism is the key to efficient—————parsing.

1. Top-down
2. Bottom-up
3. Predictive
4. None of the given

The input specification file to flex consists of                  sections:

Three

Leaser and scanner are two different phases of compiler.

False

In compiler linear analysis is also called.

Both lexical analysis and scanning

Which of the following statements is NOT true?

For a regular expression r, there does not exist NFA with L(r) any transit that accept.

A –> B C D

B –> h B |episilon

C –> C g |g | C h | i

D –> A B | episilon

First of A is                   .

h, g, i

Top- down parsing expands a ______from the start symbol to the leaves.

All of the given

A top-down parser start with the______of the parse tree.

Root

Can a DFA simulate NFA?

YES

Bottom-up parsing is also called                .

LR parsing

The______is optimized for hardware it is to run on.

Assembly code

Abstract syntax tree summarizes _______ without the details of derivation.

Grammatical structure

LR parsing______a string to the start symbol by inverting productions.

Reduces

Alternative to backtrack in top-down parser is               .

Look ahead

Typical compilation means programs written in high-level languages to low-level              .

Object code

The________checks the stream of words (tokens) and their parts of speech for grammatical correctness.

Compiler

A grammar must be______before use for predictive parsing.

Left factored

Parser does not distinguish between valid and invalid sequences of tokens.

False

In compilation process Hierarchical analysis is also called

Syntax analysis

The pair <role, word> is given the name                 .

Token

The back end maps Intermediate Representation (IR) into target             .

Source code

     __________________ Is evaluated to yield a value.

Expression

Front-end of a two pass compiler is consists of Scanner.

True

The         returns a sequence of matching tokens at the output and it always return the longest matching token.

Lexical analyzer

Parser takes tokens from scanner and tries to generate             .

Parse tree

           Avoid hardware stalls and interlocks.

Instruction scheduling

The handle-finding mechanism is the key to efficient              parsing.

Bottom-up