GATE CSE 1992 | GATE CSE Year Wise Previous Years Questions

GATE CSE 1992

Subjective

-0

Assume that the last element of the set is used as partition element in Quicksort. If n distinct elements from the set [1…n] are to be sorted, give an input for which Quicksort takes maximum time.

GATE CSE 1992

Fill in the Blanks

-0

Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are sorted is _______.

GATE CSE 1992

MCQ (Single Correct Answer)

-0.6

Which of the following problems is not NP-hard?

Hamiltonian circuit problem

The 0/1 Knapsack problem

Finding bi-connected components of a graph

The graph coloring problem

GATE CSE 1992

MCQ (Single Correct Answer)

-0.6

Consider the SLR(1) and LALR (1) parsing tables for a context-free grammar. Which of the following statements is/are true?

The goto part of both tables may be different.

The shift entries are identical in both the tables.

The reduce entries in the tables may be different.

The error entries in the tables may be different.

PREVIOUS NEXT

GATE CSE Papers

2023