CS606 Midterm Past Paper

You have come here while searching for CS606 midterm past papers. But before going to download the CS606 midterm past paper. I have a better option for you. That is, that you can attempt the online quiz of CS606.

Practice Quiz from CS606 Midterm Past Paper

This quiz will evaluate your preparation for the CS606 midterm examination and it is based on the past papers of CS606. The purpose of this quiz is to evaluate your performance in this subject. If you can pass this quiz, then there is a great chance that you can secure good marks in your exams.

0 votes, 0 avg

Your Time starts now

Times Up

Created on January 20, 2022 By

faisal_faisi

CS606

CS606 Midterm Past Papers Practice Quiz

Welcome to CS606 Midterm Online Practice Quiz.

You can check your preparation of CS606 for your Exams here.

Questions Will be different every time you will attempt.

1 / 30

Category: CS606-mid

________________ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.

a. Start

b. Backend

c. Frontend

2 / 30

Category: CS606-mid

________________ algorithm is used in DFA minimization

a. James’s

b. None of given

c. Robert’s

d. Hopcroft’s

3 / 30

Category: CS606-mid

We can get an LL(1) grammar by ________________

a. Removing left recurrence

b. Removing left recurrence and Applying left factoring

c. Applying left factoring

d. None of the given

4 / 30

Category: CS606-mid

In DFA minimization we construct one _______________ for each group of states from the initial DFA

a. NFA

b. PDA

c. None of given

d. State

5 / 30

Category: CS606-mid

AST summarizes the grammatical structure with the details of derivations.

a. True

b. False

6 / 30

Category: CS606-mid

One of the core tasks of compiler is to generate fast and compact executable code

a. True

b. False

7 / 30

Category: CS606-mid

In multi pass compiler during the first pass it gathers information about ___________________

a. Declaration

b. Bindings

c. Static information

d. None of the given **

8 / 30

Category: CS606-mid

Parser takes tokens from scanner and tries to generate _______________

a. Syntax trace

b. None of the given

c. Binary Search tree

d. Parse tree

9 / 30

Category: CS606-mid

Lexical Analyzer generator ________________ is written in Java.

a. None of given

b. Flex

c. Jlex

d. Complex

10 / 30

Category: CS606-mid

Optimal registers allocation is an NP-hard problem

a. True

b. False

11 / 30

Category: CS606-mid

We can get an LL(1) grammar by ________________

a. Applying left factoring

b. None of the given

c. Removing left recurrence and Applying left factoring

d. Removing left recurrence

12 / 30

Category: CS606-mid

Lexical Analyzer generator ________________ is written in Java.

a. Jlex

b. Flex

c. Complex

d. None of the given

13 / 30

Category: CS606-mid

Responsibility of ______________ is to produce fast and compact code

a. None of given

b. Register allocation

c. Instruction scheduling

d. Instruction selection

14 / 30

Category: CS606-mid

The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.

a. {0}

b. {0,1,2,3}

c. {0,1}

d. {0,1,2}

15 / 30

Category: CS606-mid

Alternative of the backtrack in parser is Look ahead symbol in _______________ .

a. output

b. none

c. input and output

d. input

16 / 30

Category: CS606-mid

Lexer and scanner are two different phases of compiler

a. True

b. False

17 / 30

Category: CS606-mid

For each language to make LL(1) grammar, we take two steps, 1st is removing left recurrence and 2nd is applying fin sequence.

a. False

b. True

18 / 30

Category: CS606-mid

In predictive parsing table the rows are ____________________ .

a. Non-terminals

b. Terminals

c. None of the given

d. Both non-terminal and terminals

19 / 30

Category: CS606-mid

In LL1() parsing algorithm _________ contains a sequence of grammar symbols.

a. Stack

b. Array

c. Link list

d. None

20 / 30

Category: CS606-mid

LL(1) parsing is called non-predictive parsing.

a. False

b. True

21 / 30

Category: CS606-mid

a. h, g, $

b. g, h, i, $

c. g, h, $

d. h, i, $

22 / 30

Category: CS606-mid

Can a DFA simulate NFA?

a. Yes

b. Sometimes

c. No

d. Depend upon nfa

23 / 30

Category: CS606-mid

In Three-pass compiler _____________ is used for code improvement or optimization

a. Middle End

b. Front End

c. Back End

d. Both Front end and Back end

24 / 30

Category: CS606-mid

Recursive ______________ parsing is done for LL(1) grammar.

a. Decent

b. Forward

c. Ascent

d. Backward

25 / 30

Category: CS606-mid

Recursive ____________ parsing is done for LL(1) grammar.

a. Forward

b. Ascent

c. Decent

d. Backward

26 / 30

Category: CS606-mid

One of the core tasks of compiler is to generate fast and compact executable code.

a. True

b. False

27 / 30

Category: CS606-mid

Intermediate Representation (IR) stores the value of its operand in

a. Hard disk

b. Secondary storage

c. Registers

d. Memory

28 / 30

Category: CS606-mid

a. None of the given

b. h, g, i

c. g

d. h

29 / 30

Category: CS606-mid

Flex is an automated tool that is used to get the minimized DFA (scanner).

a. False

b. True

30 / 30

Category: CS606-mid

_____________is evaluated to yield a value.

a. Declaration

b. Command

c. Expression

d. Declaration and Command

Your score is

The average score is 23%

Exit

Note before downloading CS606 midterm past paper

One thing to note dear fellows that you must don’t rely on these papers only. They can be a source of help but not an ultimate solution. If you want to get good marks in your exams you are advised to go through all of your handouts and must watch all of the video lectures.

Golden rules for good marks in VU Exams.

As per my experience, I have developed some golden rules for getting good marks in Virtual University Exams based on experience. I got 3.96 CGPA by following these rules.So here they are:

Never miss your Quiz, Assignment, or GDB.
Always try to do your Assignment on your own.
Try your best to finish your video lectures 10 days before exams.
Try your best to read your handouts twice before exams.
Read forward attempt backward.
Never schedule more than one paper on the same day.
Your most difficult paper should have a gap of 1 or more days.
Toughest paper must be scheduled first.
Read questions forward and attempt backward.
Don’t waste your time during a paper on illegal activities.

You can also download the Latest VU Handouts

To download the CS606 midterm past paper click here.

CS606 Midterm Past Paper online Practice Quiz

CS606 Midterm Past Paper

Practice Quiz from CS606 Midterm Past Paper

Note before downloading CS606 midterm past paper

Golden rules for good marks in VU Exams.

As per my experience, I have developed some golden rules for getting good marks in Virtual University Exams based on experience. I got 3.96 CGPA by following these rules.So here they are:

Leave a Comment Cancel Reply