CS301 Mid Dec 2010 Paper

20 mcqs and 6 long question are included
MCQS are almost all from past papers

1. Why we use queue data structure in level order traversal? 2 marks
2. write down two cases inwhich we use double rotataion in an AVL tree? 3 marks
3. a diagram was of binaary tree we have to tell the correct statements from the statements provided? 3 marks
4.a while loop is given in which we have to put teh right statement instaed of wuestion mark ? 5marks
5. which statements are correct and incorrect and explain ur answer in detail ?5marks
a. int x;
int *y=& x;
b.
int x;
int& y= x;
c.
int x;
int y = x;
6. what is the difference between binary and AVL tree?
2 marks