**21. Which data structure allows deleting data elements from front and inserting at rear?**

a. Stacks

b. Queues

c. Deques

d. Binary search tree

ans:b

**22. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.**

a. Input-restricted deque

b. Output-restricted deque

c. Priority queues

d. None of above

ans:a

**23. Which of the following data structure is non-linear type?**

a. Strings

b. Lists

c. Stacks

d. None of above

ans:d

**24. Which of the following data structure is linear type?**

a. Strings

b. Lists

c. Queues

d. All of above

ans:d

**25. To represent hierarchical relationship between elements, which data structure is suitable?**

a. Deque

b. Priority

c. Tree

d. All of above

ans: c

**26. A binary tree whose every node has either zero or two children is called**

a. Complete binary tree

b. Binary search tree

c. Extended binary tree

d. None of above

ans: c

**27. The depth of a complete binary tree is given by**

a. Dn = n log2n

b. Dn = n log2n+1

c. Dn = log2n

d. Dn = log2n+1

ans: d

**28. When representing any algebraic expression E which uses only binary operations in a 2-tree,**

a. the variable in E will appear as external nodes and operations in internal nodes

b. the operations in E will appear as external nodes and variables in internal nodes

c. the variables and operations in E will appear only in internal nodes

d. the variables and operations in E will appear only in external nodes

ans: a

**29. A binary tree can easily be converted into q 2-tree**

a. by replacing each empty sub tree by a new internal node

b. by inserting an internal nodes for non-empty node

c. by inserting an external nodes for non-empty node

d. by replacing each empty sub tree by a new external node

ans: d

**30. When converting binary tree into extended binary tree, all the original nodes in binary tree are**

a. internal nodes on extended tree

b. external nodes on extended tree

c. vanished on extended tree

d. None of above

ans: a

**More Questions & Answers:-**

**Page1 Page2 Page3 Page4 Page5 Page6 Page7 Page8 Page9**

## No comments:

## Post a Comment