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

Match List-I with List-II:
 List-I
 List-II
A. Back Tracking  I. Automata
 B. Infinite languages with matching numbers
 II. Undecidable Problem
 C. Canonical LR Parser
 III. Predictive Parser
 D. Post Correspondence Problem

 IV. Large number of states

Solution

Backtracking → Predictive parsing may require backtracking → III

Infinite languages with matching numbers → handled using Automata → I

Canonical LR parser → requires large number of states → IV

Post Correspondence Problem → Undecidable problem → II


Matching:


A → III

B → I

C → IV

D → II

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

Nearest first
1
What is a perceptron in ANN?
Topic: UGC NET Computer Science June 2024 (Paper II)
2
Match List-I with List-II List-I List-II A. UnionI. Virtual Reality B. Function II. Shadow mas…
Topic: UGC NET Computer Science June 2024 (Paper II)
3
Which of the followings are sequential circuit?A. Flip flopB. MultiplexerC. CounterD. DecoderE. Adder
Topic: UGC NET Computer Science June 2024 (Paper II)
4
Which of the following are tautology?A. $(p \lor r) \rightarrow p$B. $p \rightarrow (p \land r)$C. $\sim p \rightarrow …
Topic: UGC NET Computer Science June 2024 (Paper II)
5
For making a memory of size $2048 \times 8$ bytes using chips of size $128 \times 4$ bytes, the number of chips require…
Topic: UGC NET Computer Science June 2024 (Paper II)
6
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)
7
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)
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 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)
10
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)

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

Ascending by ID
1
What is the total delay (latency) for a frame size of 10 million bits that is being set up on a link with 20 routers, e…
Topic: UGC NET Computer Science June 2024 (Paper II)
2
A bit string of length four is generated at random. What is probability that it contains at least two consecutive 0’s g…
Topic: UGC NET Computer Science June 2024 (Paper II)
3
Shift-Reduce conflicts are resolved by :
Topic: UGC NET Computer Science June 2024 (Paper II)
4
Back propagation is a learning technique that adjusts weights in the neural network by propagating weight changes :
Topic: UGC NET Computer Science June 2024 (Paper II)
5
Arrange the following from fastest to slowest in speed:A. DRAMB. SRAMC. CPU RegistersD. Magnetic tapesE. Hard disk
Topic: UGC NET Computer Science June 2024 (Paper II)
6
Which of the following statements is/are false?A. A user can assign privileges to any user on any relation.B. A user ca…
Topic: UGC NET Computer Science June 2024 (Paper II)
7
For the regular languages and context free languages which is not correct?A. both are closed under union operationB. bo…
Topic: UGC NET Computer Science June 2024 (Paper II)
8
The instruction LD ADR(X) which is equivalent to$AC \leftarrow M[ADR + XR]$ is in:
Topic: UGC NET Computer Science June 2024 (Paper II)
9
The least values of a signed and unsigned data type variables requiring 8 bits, would be:
Topic: UGC NET Computer Science June 2024 (Paper II)
10
Arrange the following sets in increasing order, on the basis of their cardinality :A. $A_1 = {{1,2},{3}}$B. $A_2 = {{1}…
Topic: UGC NET Computer Science June 2024 (Paper II)
Ask Your Question or Put Your Review.

loading...