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
9

Data structures and Algorithms MCQ with Answers

9) The average search time of hashing, with linear probing will be less if the load factor

is far less than one

equals one

is far greater than one

none of these

Answer is:

is far less than one

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

10) Heap allocation is required for languages

That support recursion

That support dynamic data structure

That use dynamic scope rules

All of above

Answer is:

That support dynamic data structure

11) A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers

Preorder

Postorder

Inorder

None of these

Answer is:

None of these

12) A character of the data that binary search uses but the linear search ignores, is

Order of the list

Length of the list

Maximum value in the list

Minimum value in list

Answer is:

Order of the list

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