midterm past paper quiz
midterm past paper quiz

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%
0 votes, 0 avg
1

Your Time starts now

Times Up

Created on By faisal_faisi

CS606

midterm past paper quiz

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

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

2 / 30

Category: CS606-mid

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

3 / 30

Category: CS606-mid

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

4 / 30

Category: CS606-mid

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

5 / 30

Category: CS606-mid

5. Lexer and scanner are two different phases of compiler

6 / 30

Category: CS606-mid

6. We can get an LL(1) grammar by ________________

7 / 30

Category: CS606-mid

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

8 / 30

Category: CS606-mid

8. Parser always gives a tree like structure as output

9 / 30

Category: CS606-mid

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

10 / 30

Category: CS606-mid

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

11 / 30

Category: CS606-mid

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

12 / 30

Category: CS606-mid

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

13 / 30

Category: CS606-mid

13. Can a DFA simulate NFA?

14 / 30

Category: CS606-mid

14. In Back End module of compiler, optimal register allocation uses_______________

15 / 30

Category: CS606-mid

15. LR parsers can handle ________________ grammars

16 / 30

Category: CS606-mid

16. Front end of two pass compiler takes_________________ as input.

17 / 30

Category: CS606-mid

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

18 / 30

Category: CS606-mid

18. Consider the grammar
A --> B C D
B --> h B | epsilon
C --> C g | g | C h | i
D --> A B | epsilon First of C is _______________

19 / 30

Category: CS606-mid

19. Lexical Analyzer generator ________________ is written in Java.

20 / 30

Category: CS606-mid

20. ____________avoid hardware stalls and interlocks.

21 / 30

Category: CS606-mid

21. Left factoring is enough to make LL1 grammar

22 / 30

Category: CS606-mid

22. LR parsers can handle ________________ grammars.

23 / 30

Category: CS606-mid

23. We can get an LL(1) grammar by ________________

24 / 30

Category: CS606-mid

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

25 / 30

Category: CS606-mid

25. Front end of two pass compiler takes_________________ as input

26 / 30

Category: CS606-mid

26. In predictive parsing table the rows are ____________________ .

27 / 30

Category: CS606-mid

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

28 / 30

Category: CS606-mid

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

29 / 30

Category: CS606-mid

29. AST summarizes the grammatical structure with the details of derivations.

30 / 30

Category: CS606-mid

30. ________________ algorithm is used in DFA minimization

Your score is

The average score is 23%

Share your results with your fellow students

LinkedIn Facebook Twitter VKontakte
0%

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:
  1. Never miss your Quiz, Assignment, or GDB.
  2. Always try to do your Assignment on your own.
  3. Try your best to finish your video lectures 10 days before exams.
  4. Try your best to read your handouts twice before exams.
  5. Read forward attempt backward.
  6. Never schedule more than one paper on the same day.
  7. Your most difficult paper should have a gap of 1 or more days.
  8. Toughest paper must be scheduled first.
  9. Read questions forward and attempt backward.
  10. 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.

 

RELATED ARTICLESMORE FROM AUTHOR