List of top Computer Science and IT Engineering Questions asked in AP PGECET

According to the Rice's Theorem, any non-trivial property of the language recognized by a Turing Machine is:

Which of the following is true about a good hash function?

Which type of grammar is mainly used in programming languages?

Name the computational model that can simulate both PDA and DFA?

What type of automaton is mainly used for simple pattern matching?

In a deterministic finite automaton, the behaviour of transitions is strictly defined for every input symbol at each state. Identify the statement that correctly describes this property.

The problem solving technique which divides a problem into smaller sub problems and then combines their results _________

Which algorithm is commonly used to find a minimum spanning tree?

Name the notation that represents the average-case complexity of an algorithm.

Which time complexity grows the slowest as input size increases?

What is the time complexity of the optimal solution for the 0/1 Knapsack problem with n items and capacity W using Dynamic Programming?

In a singly linked list, what is the time complexity to delete a node given a pointer to that specific node?

A statement that is always false regardless of truth values is called______

Which circuit produces output only based on current inputs without memory?

The Bellman-Ford algorithm is preferred over Dijkstra's algorithm when the graph contains:

Which sorting algorithm has the best-case time complexity of $O(n)$ when the input array is already sorted?

Boolean algebra is mainly used in which area?

Which data structure allows insertion and deletion at both ends?

Which tree traversal visits left subtree, root, then right subtree?

Which data structure is used to implement priority scheduling?

Which data structure is used for level order traversal in trees?

Which of the following parameter passing mechanisms allows a function to modify the actual variable in the calling function?

In a circular queue implemented using an array of size $MAX$, if 'front' and 'rear' are the indices, the condition for the queue being full is:

Which data structure is used by the compiler to manage function calls and local variables (Activation Records)?

A grammar is given:
$E \rightarrow E + T \mid T$
$T \rightarrow T * F \mid F$
$F \rightarrow (E) \mid id$
For the input: $id + id * id$, what is the correct interpretation?