1
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Consider the following rooted tree with the vertex labelled P as the root
The order in which the nodes are visited during an in-order traversal of the tree is
The order in which the nodes are visited during an in-order traversal of the tree is2
GATE CSE 2014 Set 1
Numerical
+1
-0
Consider a rooted n node binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having exactly 4 nodes O(na Logbn ). Then the value of a + 10b is _________
Your input ____
3
GATE CSE 2011
MCQ (Single Correct Answer)
+1
-0.3
A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?
A
B
C
D
4
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is TRUE?
Questions Asked from Marks 1
GATE CSE 2025 Set 2 (2) GATE CSE 2025 Set 1 (3) GATE CSE 2023 (1) GATE CSE 2022 (1) GATE CSE 2021 Set 2 (1) GATE CSE 2021 Set 1 (1) GATE CSE 2020 (2) GATE CSE 2018 (1) GATE CSE 2017 Set 1 (1) GATE CSE 2015 Set 3 (2) GATE CSE 2015 Set 2 (2) GATE CSE 2015 Set 1 (3) GATE CSE 2014 Set 3 (1) GATE CSE 2014 Set 1 (1) GATE CSE 2011 (1) GATE CSE 2008 (1) GATE CSE 2007 (2) GATE CSE 2006 (2) GATE CSE 2005 (1) GATE CSE 2004 (2) GATE CSE 2003 (1) GATE CSE 2000 (1) GATE CSE 1998 (1) GATE CSE 1996 (2) GATE CSE 1995 (1) GATE CSE 1987 (2)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization