Data Structure & Algorithms Question and Answer
Data Structure & Algorithms Question and Answer
1. Each data item in a record may be a group item composed of sub-items; those items which are indecomposabe are called
- lementary items
- Atoms
- Scalars
- All of above
2. Which of the following statement is false ?
- Arrays re dense lists and static data structure
- Data elements in linked list need not be stored in adjacent space in memory
- Pointers store the next data element of a list
- Linked lists are collection of the nodes that contain information part and next pointer
3. Binary search algorithm cannot be applied to
- Sorted binary trees
- Sorted linear array
- Pointer array
- Sorted linked list
4. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
- Housefull
- Saturated
- Underflow
- Overflow
5. When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
- Housefull
- Saturated
- Underflow
- Overflow
6. The situation when in a linked list START=NULL is
- Underflow
- Overflow
- Housefull
- Saturated
7. The following i two-way list
- Grounded header list
- Circular header list
- Linked list with header and trailer nodes
- None of above
8. The following name does not relate to stacks
- FIFO lists
- LIFO list
- Piles
- Push-down lists
9. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in tree for efficiency. These special pointers are called
- Leaf
- Branch
- Path
- Thread
10. In a graph if e=(u, v) means
- e begins at u and ends at v
- u is processor and v is successor
- both B and C are true
- none is true