1
GATE CSE 1991
Subjective
+2
-0
Obtain the optimal binary search tree with equal probabilities for the
identifier set (a1, a2, a3) = ( if, stop, while)
Questions Asked from Dynamic Programming (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages