The number of distinct minimum spanning trees for the weighted graph below is ________

A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 10, 8, 5, 3, 2. Two new elements 1 and 7 are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:

For a C program accessing X[ i ] [ j ] [ k ], the following intermediate code is generated by a compiler. Assume that the size of an integer is 32 bits and the size of a character is 8 bits.

t0 = i * 1024 
t1 = j * 32 
t2 = k * 4 
t3 = t1 + t0 
t4 = t3 + t2 
t5 = X[t4] 

Which one of the following statements about the source code for the C program is CORRECT?

Consider the grammar defined by the following production rules, with two operators * and +

$$\eqalign{ & S \to T*P \cr & T \to U\,|\,T*U \cr & P \to Q + P\,|\,Q \cr & Q \to id \cr & U \to id \cr} $$

Which one of the following is TRUE?