List of top Questions asked in Telangana State Post Graduate Engineering Common Entrance Test

What is the output of lexical analyzer?
_____________ is the sequence of characters in a token
Which phase of the compiler checks the grammar of the program?
Which compiler runs on one machine and generates code for multiple machines?
Which method merges the multiple loops into the single one?
Which optimization technique is used to reduce the multiple jumps?
Moore machine is an example of
A language $L$ is said to be Turing machine (TM) decidable if
A Turing machine that is able to simulate other Turing machines is known as
Choose the correct option when
S1: Initial state of NFA is initial state of DFA
S2: The final state of DFA will be every combination of final set of NFA
Which file is the output of an assembler?
Which among the following is not based on divide and conquer?
Which of the following does not represent the language $\{0, 01\}$?
How many tuples are present in finite state machine?
According to the Chomsky classification, language of finite automata is
What is the regular expression for all strings starting with ab then any number of a or b and ending with bba?
The transition a pushdown automation made by is additionally dependent upon
What is the worst-case time complexity of depth first search of a graph with ‘V’ nodes and ‘E’ edges?
Bellman Ford algorithm provides solution for
Given an array $A = \{15, 23, 27, 32, 45, 49, 60\}$ and key = 49, what are the mid values (corresponding array elements) in the first and second levels of recursion?
What is the best case time complexity for linear search?
How many solutions are there for the 8-Queen problem on an $8 \times 8$ chessboard?
Which among the following is an external sorting technique?
How many passes does an insertion sort algorithm take for sorting an array of ‘n’ elements?
Breadth first search is equivalent to traversal of binary tree