Register

These questions are basic level ones and can be answered in less than a minute if you have seen the topic.

Recent questions tagged easy

0 votes
1 answer
61
Theory Of Computation (NFA/DFA)
**MSQ** The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s) 0 1 01 10
MSQ The Finite State Autometa with a Regular Expression P= 0+1, will accept the string(s)010110
User Avatar
0 votes
0 answers
62
UGC NET CSE | October 2022 | Part 1 | Question: 83
Consider the grammer $\mathrm{S} \rightarrow \mathrm{SbS} \mid \mathrm{a}$ ... true, Only $\text{(B)}$ is true Only $\text{(C)}$ is true Only $\text{(A)}$ is true
Consider the grammer $\mathrm{S} \rightarrow \mathrm{SbS} \mid \mathrm{a}$.Consider the following statements:The string abababa has(A) two parse trees(B) two left most de...
User Avatar
0 votes
2 answers
63
Ace Gate practice booklet Volume 1
Class B network on the internet has a subnet mask of 255.255.119.0 what is maximum possible hosts per subnet. Assuming Classfull Addressing Scheme
Class B network on the internet has a subnet mask of 255.255.119.0 what is maximum possible hosts per subnet. Assuming Classfull Addressing Scheme
User Avatar
Page: