Consider a minimum spanning tree T in a graph G. If the weight of an edge e of T is decreased, then the resulting tree T is still a minimum spanning tree.

If the keys '1, 2, 3, 4 and 5' are inserted in order into initially empty a AVL tree, the root node is

If all the edges in a graph are unique, then there is only one minimum spanning tree for the graph.

If the keys '1, 2, 3, 4 and 5' are inserted in order into initially empty a AVL tree, the height of the tree is

Consider the infix expression ((a + b * c))* d + e * (f + g). If the expression tree is drawn, then the height of the tree, is

If the keys '1, 2, 3, 4 and 5' are inserted in order into initially empty a AVL tree, the total number of rotations required to balance the tree, is

Consider the data given below: Variable Address Contents p 2568 425 q 4284 2568 r 6242 4284 What is the value of &p?

Consider the infix expression ((a + b * c))* d + e * (f + g) If expression tree is drawn, how many nodes are there in the left subtree of root?

The cost of every edge in a complete graph G = (V,E) is 2. What is the cost of a spanning tree of the graph?

Consider the infix expression ((a + b * c))* d + e * (f + g). If the expression tree is drawn, how many nodes are there at the maximum depth?

Consider the data given below: Variable Address Contents p 2568 425 q 4284 2568 r 6242 4284 What is the value of **r?

Find the address of the element A[3, 8] in the column major order array A[2:7, 4:9] with the base address 1 and each element occupies 4 bytes of memory.

Consider the infix expression ((a + b * c))* d + e * (f + g). If the expression tree is drawn, how many nodes are there in the right subtree of root?

void main() { int arr[4] = {1, 2,3, 4} int *ptr = &arr[0], i; for(i = 0; i < 2; i++) } What should be the statement in the blank to print all the elements in the array?

Consider the data given below: Variable Address Contents p 2568 425 q 4284 2568 r 6242 4284 What is the value of *q?

The memory for S is allocated at

What is the value of the expression '1 2 3 + * 3 2 1 - + *'?

Consider the data given below: Variable Address Contents p 2568 425 q 4284 2568 r 6242 4284 What is the value of *(&q)?

Which of the following is not a valid color of node of graph traversal?

Given an structure declaration Struct student { char first_name[10]; char mid_initital; char last_name[10]; int age; }; student S; The declaration of S allocates ________ bytes of memory.

To accept the first_name, which of the following is the appropriate method?

Which of the following data structures can be termed as push down list?

Find the odd one out.

Consider the data given below: Variable Address Contents p 2568 425 q 4284 2568 r 6242 4284 What is the value of &(*r)?

If A, B, C, ___, Z represent operands and +, -, *, / ­represent operators, which of the following does not represent a valid expression?