WBUT 2012 DATA STRUCTURE & ALGORITHMS (CS-302/2012-2013) QUESTION PAPER

Submitted by Anonymous (not verified) on Sat, 07/12/2014 - 11:22

CS/B.TECH (CSE-OLD)/ IT (O),ECE (O), EE (O), EEE (O), ICE (O)/SEM-3/CS-302/2012-13

2012

DATA STRUCTURE & ALGORITHMS

Time Allotted : 3 Hours                                                                      Full Marks : 70

The figures in the margin indicate full marks.

Candidates are required to give their answers in their own words

as far as practicable.

GROUP A

( Multiple Choice Type Questions )

 

1. Choose the correct alternatives for the following :

10X1 = 10

i) Inserting a new node after a given node in a doubly

linked list requires

a) four pointer exchanges

b) two pointer exchanges

c) one pointer exchanges

d) np pointer exchange.

ii) A complete binary tree with n leaves contains

a) n nodes b) log 2 n nodes

c) 2n – 1 nodes d) 2n nodes.

iii) A vertex of degree one is called

a) Isolated vertex b) Pendant vertex

c) Coloured vertex d) Null vertex.

Comments

Related Items