Data Structures

1. _________ a tree means processing it in such a way that each node is visited only once.

1. Traversing.
2. Implement.
3. Partition.
4. Node.

View answer

2. _________ are used to facilitate the processing of information in an array.

1. Pointers.
2. Memory location.
3. Records.
4. Variables.

View answer

3. _________ data structure is used to implement Depth First search.

1. Array.
2. Linked list.
3. Queue.
4. Stack.

View answer

4. _________ has certain attributes or properties which may be assigned values.

1. field system.
2. record.
3. entity.
4. files.

View answer

5. _________ involves maintaining two tables in memory.

1. Arranging.
2. Bonding.
3. Combing.
4. Chaining.

View answer

6. _________ is a header list where the last node contains the null pointer.

1. Circular Header linked list
2. Grounded Header Linked list
3. Linked list
4. Linear Array

View answer

7. _________ is a header list where the last node points back to the header node.

1. Doubly header List.
2. Singly header List.
3. Grounder Header List.
4. Circular Header List.

View answer

8. _________ is a solution to a problem independent of programming language.

1. Efficient.
2. Linked list.
3. Data structure.
4. Algorithm.

View answer

9. _________ is combining the records in two different sorted files in to a single sorted file.

1. Sorting.
2. Searching.
3. Listing.
4. Merging.

View answer

10. _________ is finding a path/tour through the graph such that every vertex is visited exactly once.

1. Travelling Salesman tour.
2. Eulerian tour.
3. Hamiltonian tour.
4. None.

View answer