www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Data structures and Algorithms
13

Data structures and Algorithms MCQ with Answers

13) Which of the following need not to be a binary tree

Search tree

Heap

AVL-Tree

B-Tree

Answer is:

B-Tree

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

14) Which of the following need not be a binary tree?

Search tree

Heap

AVL-Tree

B-Tree

Answer is:

B-Tree

15) Which of the following expressions accesses the (i,j)th entry of an (m x n) matrix stored in column major form?

n x (i -1) + j

m x (n-j) + j

m x(j -1) + i

n x(m-i) + j

Answer is:

m x(j -1) + i

16) Sparse matrices have

many zero entries

higher dimension

many non-zero entries

none of the above

Answer is:

many zero entries

17) The minimum number of edges in a connected cyclic graph on n vertices is

n-1

n

n+1

none of the above

Answer is:

n

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here