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. Frontend

b. Start

c. Backend

2 / 30

Category: CS606-mid

a. h, g, i

b. h

c. g

d. None of the given

3 / 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,1}

b. {0,1,2}

c. {0,1,2,3}

d. {0}

4 / 30

Category: CS606-mid

Compilers are sometimes classified as.

a. Single pass

b. All of the given

c. Load and go

d. Multi pass

5 / 30

Category: CS606-mid

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

a. output

b. input and output

c. none

d. input

6 / 30

Category: CS606-mid

Lexical Analyzer generator ________________ is written in Java.

a. Jlex

b. Complex

c. None of given

d. Flex

7 / 30

Category: CS606-mid

AST summarizes the grammatical structure with the details of derivations.

a. False

b. True

8 / 30

Category: CS606-mid

____________avoid hardware stalls and interlocks.

a. None of given

b. Instruction selection

c. Register allocation

d. Instruction scheduling

9 / 30

Category: CS606-mid

Front end of two pass compiler takes_________________ as input

a. None of the Given

b. Machine Code

c. Source code

d. Intermediate Representation

10 / 30

Category: CS606-mid

In a transition table cells of the table contain the ________ state.

a. Next state

b. Previous state

c. None of the given

d. Reject state

11 / 30

Category: CS606-mid

Parser takes tokens from scanner and tries to generate _______________

a. Binary Search tree

b. None of the given

c. Parse tree

d. Syntax trace

12 / 30

Category: CS606-mid

Optimal registers allocation is an NP-hard problem

a. True

b. False

13 / 30

Category: CS606-mid

Which of the statement is true about Regular Languages?

a. Regular Languages are the most popular for specifying tokens.

b. Regular Languages are easy to understand

c. Regular Languages are based on simple and useful theory

d. All of the given

14 / 30

Category: CS606-mid

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

a. Backward

b. Decent

c. Ascent

d. Forward

15 / 30

Category: CS606-mid

_____________is evaluated to yield a value.

a. Declaration and Command

b. Expression

c. Command

d. Declaration

16 / 30

Category: CS606-mid

convert the reloadable machine code into absolute machine code by linking library and reloadable object files.

a. Preprocessor

b. Assembler

c. Compiler

d. Loader/link-editor

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

Left factoring of a grammar is done to save the parser from back tracking.

a. True

b. False

19 / 30

Category: CS606-mid

Lexer and scanner are two different phases of compiler

a. True

b. False

20 / 30

Category: CS606-mid

In Back End module of compiler, optimal register allocation uses_______________

a. O(log n)

b. N P-Complete

c. None of the given

d. O(n log n)

21 / 30

Category: CS606-mid

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

a. Forward

b. Ascent

c. Decent

d. Backward

22 / 30

Category: CS606-mid

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

a. Link list

b. None

c. Array

d. Stack

23 / 30

Category: CS606-mid

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

a. False

b. True

24 / 30

Category: CS606-mid

In predictive parsing table the rows are ____________________ .

a. None of the given

b. Terminals

c. Both non-terminal and terminals

d. Non-terminals

25 / 30

Category: CS606-mid

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

a. Memory

b. Registers

c. Hard disk

d. Secondary storage

26 / 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

27 / 30

Category: CS606-mid

NFA is easy to implement as compared to DFA

a. True

b. False

28 / 30

Category: CS606-mid

Functions of Lexical analyzer are?

a. Removing white space

b. Removing constants, identifiers and keywords

c. All of the given

d. Removing comments

29 / 30

Category: CS606-mid

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

a. False

b. True

30 / 30

Category: CS606-mid

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

a. False

b. True

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