midterm past paper quiz
midterm past paper quiz

 CS402 Midterm Past Paper

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

Practice Quiz from CS402 Midterm Past Paper

This quiz will evaluate your preparation for the CS402 midterm examination and it is based on the past papers of CS402 . 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
2

Your Time starts now

Times Up


Created on By faisal_faisi

CS402

midterm past paper quiz

CS402 Midterm Past Papers Practice Quiz

Welcome to CS402 Midterm Online Practice Quiz.

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

Questions Will be different every time you will attempt.

1 / 30

Category: Cs402-mid

1. In TG there may exist no paths for certain string.

2 / 30

Category: Cs402-mid

2. Let S = {aa, bb} be a set of strings then s* will have

3 / 30

Category: Cs402-mid

3. If r1 and r2 are regular expressions then which of the following is not regular expression.

4 / 30

Category: Cs402-mid

4. The clouser FA*(star on an FA ) always accept ______string

5 / 30

Category: Cs402-mid

5. In TG, there may be a transition for null string.

6 / 30

Category: Cs402-mid

6. GTG can have _____________ initial state

7 / 30

Category: Cs402-mid

7. Languages generated by kleene star are always ______________.

8 / 30

Category: Cs402-mid

8. Length of strings, generated by infinite language is_______

9 / 30

Category: Cs402-mid

9. RE for the language defined over Σ={a,b} having words starting with a is____

10 / 30

Category: Cs402-mid

10. If S = {aa, bb}, then S* will not contain

11 / 30

Category: Cs402-mid

11. “One language can be expressed by more than one NFA”. This statement is ______________.

12 / 30

Category: Cs402-mid

12. According to 3rd part of the Kleene’s theorem, If a language can be accepted by an RE then it can be accepted by a _________ as well

13 / 30

Category: Cs402-mid

13. TG can more then one initial state

14 / 30

Category: Cs402-mid

14. In FA, if one enters in a specific state but there is no way to leave it, then that specific state is called

15 / 30

Category: Cs402-mid

15. If a language is expressed through TG, then that language will have its RE.

16 / 30

Category: Cs402-mid

16. One language can be represented by more than one RE” this statement is____

17 / 30

Category: Cs402-mid

17. GTG can have _______________ final state.

18 / 30

Category: Cs402-mid

18. a(a+b)*a+b(a+b)*b is RE for the language defined over S={a,b} having words beginning and ending with same letters

19 / 30

Category: Cs402-mid

19. Which statement is true?

20 / 30

Category: Cs402-mid

20. If L1 and L2 are expressed by regular expressions r1 and r2, respectively then the language expressed by r1 + r2 will be _________

21 / 30

Category: Cs402-mid

21. One language can be represented by more than one RE” this statement is____

22 / 30

Category: Cs402-mid

22. S={a,bb,bab,baabb} set of strings then S* will not have

23 / 30

Category: Cs402-mid

23. Which of the following is not a word of language EQUAL?

24 / 30

Category: Cs402-mid

24. One FA has n states and m letters in the alphabet. Then FA will have _____ number of transitions in the diagram.

25 / 30

Category: Cs402-mid

25. a*b* = (ab)* this expression is __________

26 / 30

Category: Cs402-mid

26. Every FA should be __________

27 / 30

Category: Cs402-mid

27. Σ={a,Aa,Abb}, then string aAaAbbAa has ________ length.

28 / 30

Category: Cs402-mid

28. In TG there may exist no paths for certain string

29 / 30

Category: Cs402-mid

29. The length of output string in case of _________ is one more than the length of corresponding input string

30 / 30

Category: Cs402-mid

30. In FA one enter in specific stat but there is no way to leave it then state is called

Your score is

The average score is 70%

Share your results with your fellow students

LinkedIn Facebook Twitter VKontakte
0%

Exit

Note before downloading CS402  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 CS402  midterm past paper click here.