Given below are two statements
Statement I: LL(1) and LR are examples of Bottom-up parsers.
Statement II: Recursive descent parser and SLR are examples of Top-down parsers.
In light of the above statements, choose the correct answer from the options given below.
Previous 10 Questions — UGC NET Computer Science Nov 2021 (Paper II)
Nearest first
1
2
3
4
5
6
7
8
9
10
Which of the following concepts can be used to identify loops?A. Depth first orderingB. DominatorsC. Reducible graphsCh…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Match List I with List IIList IList IIA. $S\to XY,\ X\to 0,\ Y\to 1$I. Greibach Normal FormB. $S\to aS\mid bSS\mid c$II…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
What language is accepted by the pushdown automaton$M=({q_0,q_1,q_2},\{a,b\},\{a,b,z\},\delta,q_0,z,\{q_2\})$with…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Find the regular expression for the language accepted by the automata given below.
Topic: UGC NET Computer Science Nov 2021 (Paper II)
What is the minimum number of states required to the finite automaton equivalent to the transition diagram given below?
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Given below are two statementsStatement I: The family of context free languages is closed under homomorphism.Statement …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Let$L_1=\{0^n1^n0^m\mid n\ge 1,\ m\ge 1\}$$L_2=\{0^n1^m0^m\mid n\ge 1,\ m\ge 1\}$$L_3=\{0^n1^n0^n\mid n\ge 1\}$Which of…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Any string of terminals that can be generated by the following context-free grammar, where $S$ is start nonterminal sym…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Which of the following languages are not regular?A. $L=\{(01)^n0^k\mid n>k,\ k\ge 0\}$B. $L=\{c^nb^ka^{n+k}\mid n\ge…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Consider the following linear optimization problem:Maximize $Z=6x+5y$Subject to $2x-3y\le 5$$x+3y\le 11$$4x+y\le 15$and…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Next 10 Questions — UGC NET Computer Science Nov 2021 (Paper II)
Ascending by ID
1
2
3
4
5
6
7
8
9
10
The postfix form of the expression $(A+B)*(C*D-E)*F/G$ is ______
Topic: UGC NET Computer Science Nov 2021 (Paper II)
A double-ended queue (deque) supports adding and removing items from both ends of the queue. The operations supported b…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Two balanced binary trees are given with $m$ and $n$ elements, respectively. They can be merged into a balanced binary …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
A data structure is required for storing a set of integers such that each of the following operations can be done in $O…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Consider the following graph.Among the following sequencesI. $a\ b\ e\ g\ h\ f$II. $a\ b\ f\ e\ h\ g$III. $a\ b\ f\ h\ …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Given below are two statementsStatement I: In an undirected graph, number of odd degree vertices is even.Statement II: …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
Which of the given options provides the increasing order of asymptotic complexity of functions $f_1,\ f_2,\ f_3$ …
Topic: UGC NET Computer Science Nov 2021 (Paper II)
The order of a leaf node in a $B+$ tree is the maximum number of value, data record pointer pairs it can hold. Given th…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
A hash function $h$ defined as $h(key)=key\ mod\ 7$, with linear probing, is used to insert the keys $44,45,79,55,91,18…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
In the following table, the left column contains the names of standard graph algorithms and the right column contains t…
Topic: UGC NET Computer Science Nov 2021 (Paper II)
