Notes Bel Sample Paper| preparation material for computer Science students-Part 4/June 2011

Published by Roma Rahul Gupta for Jobs_For_Everyone

 Notes Bel Sample Paper| preparation material for computer Science students-Part 4

Today I am going to post Questions on Data Structure.
Let's Start preparation for BEL_Exam26 june 2011_CS

Guys, As we all know that BEL is going to take test on 26 june 2011.

I have already  posted Bel Sample Paper| questions on COMPILER DESIGN , Digital Electronics and COMPUTER NETWORK lastly.

Bel Sample Paper|Data Structure
1.In worst case Quick Sort has order
(A) O (n log n) (B) O (n2/2)
(C) O (log n) (D) O (n2/4)

Answer:B) O (n2/2)
Explanation:Read about Quick Sort
2.A full binary tree with n leaves contains
(A) n nodes. (B) log n 2 nodes.
(C) 2n –1 nodes. (D) n 2 nodes.
Answer:(C) 2n –1 nodes.
Explanation:Read about full binary tree
3.The smallest element of an array’s index is called its
(A) lower bound. (B) upper bound.
(C) range. (D) extraction.
Answer:(A) lower bound.

4.The data structure required for Breadth First Traversal
(A) queue (B) stack
(C) array (D) tree

Answer:(A) queue
5.The number of leaf nodes in a complete binary tree of depth d is
(A) 2d (B) 2d–1+1
(C) 2d+1+1 (D) 2d+1
Answer:(A) 2d
KEEP READING !!!!
MORE QUESTIONS FROM DIFFERENT SUBJECTS WILL POST IN  ANOTHER POST.

If you like my work please don't forget to give comments.