In a graph G, F is a spanning forest of G if

 

(i)F is a subgraph of G containing all the nodes of G

(ii)F is an order forest containing trees T1,T2,...Tn

(iii)Ti contains all the nodes that are reachable in G from the root Ti and are contained in Tj for some j

 

Which of the above conditions is/are true?

Which information is not saved in the activation record when a function call is executed?

The linked list implementation of sparse matrices is superior to the generalized dope vector method because it is __________.

Which situation occurs frequently if the selected hash function is poor?

The post-order traversal of a binary tree starts with:

One difference between a queue and a stack is:

In the diagram of a binary tree, an arrow is called a(n) ____.

In oop, you declare a class that extends another class. this is called ________.

In a(n) ____________________ data type, each data item is a collection of other data items.

Every node (except of the last node) in a singly linked list contains ____.

Every element in an array is assigned a unique number known as a ________.