GATE CSE 2002 | GATE CSE Year Wise Previous Years Questions

PREVIOUS NEXT

GATE CSE 2002

MCQ (Single Correct Answer)

-0.6

Horizontal micro programming

does not require use of signal decoders.

Results in larger sized micro instructions then vertical micro programming

Uses one bit for each control signal

All of the above

GATE CSE 2002

MCQ (Single Correct Answer)

-0.3

In serial data transmission, every byte of data is padded with a $$‘0’$$ in the beginning and one or two $$‘1’s$$ at the end of byte because

Receiver is to be synchronized for byte reception

Receiver recovers lost $$‘0’s$$ and $$‘1’s$$ from these padded bits

Padded bits are useful in purity computation

None of the above

GATE CSE 2002

MCQ (Single Correct Answer)

-0.3

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

log₂ n

n/2

log₂ n − 1

GATE CSE 2002

MCQ (Single Correct Answer)

-0.6

The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is:

n/2

(n-1)/3

(n-1)/2

(2n+1)/3

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