1

GATE CSE 2006

MCQ (Single Correct Answer)

+2

-0.6

The following function computes the value of

^{m}C_{n}correctly for all legal values m and n (m≥1,n≥0 and m>n)```
int func(int m, int n)
{
if (E) return 1;
else return(func(m -1, n) + func(m - 1, n - 1));
}
```

In the above function, which of the following is the correct expression for E?2

GATE CSE 2006

MCQ (Single Correct Answer)

+1

-0.3

A scheme for storing binary trees in an array X is as follows. Indexing of X starts at 1 instead of 0. the root is stored at X[1]. For a node stored at X[i], the left child, if any, is stored in X[2i] and the right child, if any, in X[2i+1]. To be able to store any binary tree on n vertices the minimum size of X should be

3

GATE CSE 2006

MCQ (Single Correct Answer)

+1

-0.3

In a binary tree, the number of internal nodes of degree 1 is 5, and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree is

4

GATE CSE 2006

MCQ (Single Correct Answer)

+2

-0.6

Suppose that we have numbers between 1 and 100 in a binary search tree and want to search for the number 55. Which of the following sequences CANNOT be the sequence of nodes examined?

Paper analysis

Total Questions

Algorithms

14

Compiler Design

6

Computer Networks

6

Computer Organization

9

Data Structures

12

Database Management System

8

Digital Logic

4

Discrete Mathematics

25

Operating Systems

8

Programming Languages

1

Theory of Computation

6

More papers of GATE CSE

GATE CSE 2024 Set 2

GATE CSE 2024 Set 1

GATE CSE 2023

GATE CSE 2022

GATE CSE 2021 Set 2

GATE CSE 2021 Set 1

GATE CSE 2020

GATE CSE 2019

GATE CSE 2018

GATE CSE 2017 Set 1

GATE CSE 2017 Set 2

GATE CSE 2016 Set 2

GATE CSE 2016 Set 1

GATE CSE 2015 Set 1

GATE CSE 2015 Set 2

GATE CSE 2015 Set 3

GATE CSE 2014 Set 1

GATE CSE 2014 Set 3

GATE CSE 2014 Set 2

GATE CSE 2013

GATE CSE 2012

GATE CSE 2011

GATE CSE 2010

GATE CSE 2009

GATE CSE 2008

GATE CSE 2007

GATE CSE 2006

GATE CSE 2005

GATE CSE 2004

GATE CSE 2003

GATE CSE 2002

GATE CSE 2001

GATE CSE 2000

GATE CSE 1999

GATE CSE 1998

GATE CSE 1997

GATE CSE 1996

GATE CSE 1995

GATE CSE 1994

GATE CSE 1993

GATE CSE 1992

GATE CSE 1991

GATE CSE 1990

GATE CSE 1989

GATE CSE 1988

GATE CSE 1987

GATE CSE
Papers

2023

2022

2020

2019

2018

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

1989

1988

1987