Data Structures

11. _________ is not a technique of tree traversal.

1. pre-order
2. post-order
3. prefix
4. in-order

View answer

12. _________ is not the operation that can be performed on Queue.

1. Traversal.
2. Insertion.
3. Deletion.
4. Retrieval.

View answer

13. _________ is the situation where data-structure is empty.

1. Overflow.
2. Underflow.
3. Null.
4. Empty.

View answer

14. The average number of key comparisons done in a successful sequential search in a list of length n is _________.

1. log n.
2. n-1/2.
3. n/2.
4. n+1/2.

View answer

15. A _________ is a reference to a memory location, which is used to store data that is described in a data type.

1. element.
2. variable.
3. pointer.
4. memory.

View answer

16. A _________ list is a header list where the node points back to the header node.

1. Circular header.
2. Grounded header.
3. Two way header.
4. One way header.

View answer

17. A _________ list is a list where the last node contains null pointer.

1. circular header.
2. grounded header.
3. rounded header.
4. linked header.

View answer

18. A _________ refers to a single unit of values.

1. data value.
2. attribute value.
3. data item.
4. elementary.

View answer

19. A binary tree of depth "d" is an almost complete binary tree if _________.

1. each leaf in the tree is either at level.
2. for any node.
3. both a and b.
4. None.

View answer

20. A code which deals about short form of a program is called _________ code.

1. program.
2. data.
3. pseudo.
4. derived.

View answer