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

In predictive parsing table the rows are ____________________ .

a. Terminals

b. Both non-terminal and terminals

c. None of the given

d. Non-terminals

2 / 30

Category: CS606-mid

We can get an LL(1) grammar by ________________

a. None of the given

b. Applying left factoring

c. Removing left recurrence

d. Removing left recurrence and Applying left factoring

3 / 30

Category: CS606-mid

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

a. Next state

b. None of the given

c. Reject state

d. Previous state

4 / 30

Category: CS606-mid

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

a. Loader/link-editor

b. Preprocessor

c. Assembler

d. Compiler

5 / 30

Category: CS606-mid

AST summarizes the grammatical structure with the details of derivations.

a. True

b. False

6 / 30

Category: CS606-mid

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

a. None

b. Stack

c. Link list

d. Array

7 / 30

Category: CS606-mid

LR parsers can handle ________________ grammars

a. file-recursive

b. Start-recursive

c. End-recursive

d. Left-recursive

8 / 30

Category: CS606-mid

____________avoid hardware stalls and interlocks.

a. None of given

b. Register allocation

c. Instruction selection

d. Instruction scheduling

9 / 30

Category: CS606-mid

_____________is evaluated to yield a value.

a. Command

b. Declaration and Command

c. Expression

d. Declaration

10 / 30

Category: CS606-mid

Which of the statement is true about Regular Languages?

a. All of the given

b. Regular Languages are easy to understand

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

d. Regular Languages are based on simple and useful theory

11 / 30

Category: CS606-mid

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

a. Start

b. None of given

c. Front end

d. Back end

12 / 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}

13 / 30

Category: CS606-mid

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

a. False

b. True

14 / 30

Category: CS606-mid

Responsibility of ______________ is to produce fast and compact code

a. Instruction selection

b. None of given

c. Instruction scheduling

d. Register allocation

15 / 30

Category: CS606-mid

Functions of Lexical analyzer are?

a. Removing comments

b. Removing constants, identifiers and keywords

c. All of the given

d. Removing white space

16 / 30

Category: CS606-mid

a. g

b. i

c. h i

d. g, I

17 / 30

Category: CS606-mid

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

a. Backward

b. Forward

c. Decent

d. Ascent

18 / 30

Category: CS606-mid

a. g

b. g, i

c. h

d. g, h, i, $

19 / 30

Category: CS606-mid

An important component of semantic analysis is __________________

a. None of the given

b. type checking

c. flush checking

d. code checking

20 / 30

Category: CS606-mid

________________ algorithm is used in DFA minimization

a. Robert’s

b. James’s

c. None of given

d. Hopcroft’s

21 / 30

Category: CS606-mid

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

a. True

b. False

22 / 30

Category: CS606-mid

____________________ phase which supports macro substitution and conditional compilation

a. None

b. Preprocessing

c. Syntax

d. Semantic

23 / 30

Category: CS606-mid

a. g, h, i, $

b. g, h, $

c. h, i, $

d. h, g, $

24 / 30

Category: CS606-mid

We can get an LL(1) grammar by ________________

a. None of the given

b. Applying left factoring

c. Removing left recurrence and Applying left factoring

d. Removing left recurrence

25 / 30

Category: CS606-mid

a. h, g, i

b. g

c. None of the given

d. h

26 / 30

Category: CS606-mid

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

a. input

b. output

c. input and output

d. none

27 / 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. True

b. False

28 / 30

Category: CS606-mid

NFA is easy to implement as compared to DFA

a. False

b. True

29 / 30

Category: CS606-mid

In Back End module of compiler, optimal register allocation uses_______________

a. None of the given

b. N P-Complete

c. O(log n)

d. O(n log n)

30 / 30

Category: CS606-mid

Parser takes tokens from scanner and tries to generate _______________

a. Parse tree

b. Syntax trace

c. Binary Search tree

d. None of the given

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