Aspire Faculty ID #17411 · Topic: UGC NET Computer Science June 2024 (Paper II) · Just now
UGC NET Computer Science June 2024 (Paper II)

For the given two machines which of the following is correct?

Solution

From the diagrams:


• Both machines are deterministic (each state has exactly one transition for each input symbol).

• The first machine has states A and B with transitions on a and b.

• The second machine has states A, B, C, but the accepted language behavior matches the first machine.


Both machines accept the same language, even though the number of states differs.


Thus they are equivalent machines.

Previous 10 Questions — UGC NET Computer Science June 2024 (Paper II)

Nearest first
1
The number of tokens in the following line: for i in range(begin : end : step) :
Topic: UGC NET Computer Science June 2024 (Paper II)
2
Match List-I with List-II: List-I (Boolean Expression)List-II (Dual of Boolean Expression)  A. $x(y+0)$&…
Topic: UGC NET Computer Science June 2024 (Paper II)
3
According to the Nyquist theorem, to produce the original analog signal, one necessary condition is:
Topic: UGC NET Computer Science June 2024 (Paper II)
4
The language of the following PDA would be: $\delta(q_0,a,z_0)=(q_0,aaaz_0)$ $\delta(q_0,a,a)=(q_0,aaa)$ $\delta(q_0,b…
Topic: UGC NET Computer Science June 2024 (Paper II)
5
A least integer $n$ such that $f(x)$ is $O(x^n)$ for each of the following functions. Arrange according to the value of…
Topic: UGC NET Computer Science June 2024 (Paper II)
6
Which of the following is/are true in case of tree locking?A. It ensures shorter waiting times.B. It ensures freedom fr…
Topic: UGC NET Computer Science June 2024 (Paper II)
7
In Windows scheduling, which of the following option is correct?
Topic: UGC NET Computer Science June 2024 (Paper II)
8
Services provided by point-to-point protocol (PPP):A. frame formatB. establishment of the linkC. flow controlD. sequenc…
Topic: UGC NET Computer Science June 2024 (Paper II)
9
A computer system with cache access time of 100 ns, a main memory access time of 1100 ns, and a hit ratio of 0.9. The a…
Topic: UGC NET Computer Science June 2024 (Paper II)
10
The Boolean expression for the following would be:$F(A,B,C) = \Sigma(0,2,6)$$d(A,B,C) = \Sigma(1,3,5)$
Topic: UGC NET Computer Science June 2024 (Paper II)

Next 10 Questions — UGC NET Computer Science June 2024 (Paper II)

Ascending by ID
1
For the fuzzy set $A = {(x_1,0.3),(x_2,0.7),(x_3,0.4)}$, the complement of $A$ would be represented as:
Topic: UGC NET Computer Science June 2024 (Paper II)
2
Regarding the subroutines, see the following sequence of tasks to be performed:A. Turn on the interrupt facility.B. Ser…
Topic: UGC NET Computer Science June 2024 (Paper II)
3
Arrange the following simple graphs based on number of spanning trees they have:A. $K_3$ (Complete graph with 3 nodes)B…
Topic: UGC NET Computer Science June 2024 (Paper II)
4
Techniques for performing I/O:A. Programmed I/OB. Interrupt-driven I/OC. Rotational I/OD. Direct memory accessE. Channe…
Topic: UGC NET Computer Science June 2024 (Paper II)
5
Which of the following is not the most common property in social network?
Topic: UGC NET Computer Science June 2024 (Paper II)
6
An ambiguous grammar is one which has:A. More than one derivationsB. More than one left most derivationsC. More than on…
Topic: UGC NET Computer Science June 2024 (Paper II)
7
The sequence of steps for a page replacement algorithm will be:A. find a frame that is not currently being usedB. chang…
Topic: UGC NET Computer Science June 2024 (Paper II)
8
What will be the ordering of typical steps when processing a high-level query?A. Query optimizerB. Runtime database pro…
Topic: UGC NET Computer Science June 2024 (Paper II)
9
The height of a binary search tree for the words banana, peach, apple, pear, coconut, mango and papaya using alphabetic…
Topic: UGC NET Computer Science June 2024 (Paper II)
10
Match List-I with List-II List-I List-II A. Verification I. White box Testing B. ValidationII.…
Topic: UGC NET Computer Science June 2024 (Paper II)
Ask Your Question or Put Your Review.

loading...