GATE CSE 1999 | GATE CSE Year Wise Previous Years Questions

PREVIOUS NEXT

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Which of the following is correct?

B-trees are for storing data on disk and B⁺ trees are for main memory.

Range queries are faster on B⁺ trees.

B-trees are for primary indexes and B⁺ trees are for secondary indexes.

The height of a B⁺ tree is independent of the number of records.

GATE CSE 1999

MCQ (More than One Correct Answer)

-0

Zero has two representations in:

Sign magnitude

$$1's$$ complement

$$2's$$ complement

None of the above

GATE CSE 1999

MCQ (More than One Correct Answer)

-0

Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?

$$XOR$$ gates, $$NOT$$ gates

$$2$$ to $$1$$ multiplexers

$$AND$$ gates, $$XOR$$ gates

Three-input gates that output $$(A.B) + C$$ for the inputs $$A. B$$ and $$C.$$

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Which of the following functions implements the Karnaugh map shown below? GATE CSE 1999 Digital Logic - K Maps Question 3 English

$$\overline A B + CD$$

$$D\left( {C + A} \right)$$

$$AD + \overline A B$$

$$(C + D)(\overline C + D)(A + B)$$

PREVIOUS NEXT

GATE CSE Papers

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

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