PYQBOOK

Filter Questions

Found 475 question(s)

Q466 MCQ GATE CS Medium 2 Marks 2020
OS → Synchronization
Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized to 0 and not used in CODE SECTION P. wait(a); count=count+1; if (count==n) signal(b); signal(a); wait(b); signal(b); CODE SECTION Q. What does the code achieve?
Choose One:
Correct Answer:
Explanation:
Q467 NAT GATE CS Hard 2 Marks 2020
TOC → Regular Languages
Consider the following language. L = \{x \in \{a,b\}^* | number of a's in x is divisible by 2 but not divisible by 3\}. The minimum number of states in a DFA that accepts L is
Enter Numerical Answer:
Correct Answer:
Explanation:
Q468 MCQ GATE CS Medium 1 Mark 2020
TOC → Regular Languages
Consider the following statements. I. If L1 U L2 is regular, then both L1 and L2 must be regular. II. The class of regular languages is closed under infinite union. Which of the above statements is/are TRUE?
Choose One:
Correct Answer:
Explanation:
Q469 MCQ GATE CS Medium 1 Mark 2020
TOC → Regular Languages
Consider the following statements. I. If L1 U L2 is regular, then both L1 and L2 must be regular. II. The class of regular languages is closed under infinite union. Which of the above statements is/are TRUE?
Choose One:
Correct Answer:
Explanation:
Q470 MCQ GATE CS Hard 1 Mark 2020
TOC → Context Free Language
Consider the language L = {a^n | n >= 0} U {a^n b^n | n >= 0} and the following statements. I. L is deterministic context-free. II. L is context-free but not deterministic context-free. III. L is not LL(k) for any k. Which of the above statements is/are TRUE?
Choose One:
Correct Answer:
Explanation: