data structures & applications

1.      If n is number of nodes how many edges will be there in an undirected graph inorder to be called as complete graph

• n*n-1  /2

• n*(n-1)

• (n-1)/2

For digraph to be called as strongly connected

           

• all pair of vertices should be connected

• every node should be reachable from every other node

When we traverse binary search tree containing integers in reverse inorder (RDL)the sequence obtained is in

  

• ascending order

• descending order

• no definite order

4)what is the maximum height binary tree one can construct with 8 nodes

• 4

• 3

• 8

5)Given 9 as index of right child  ,what would be index of  parent and its left sibling  node  in a binary tree represented using  array    

• 18,10

• 4,7

• 4,8

spanning tree  vertice set  V1 is

• subset of vertice set V of graph G

• equal to vertice set V of G

• both are true

In BFS using adjacency list

• we  suspend traversing the current vertex and move to the adjacency list of new  vertex

• we traverse the entire list associated with a particular vertex visited before visiting new vertex adjacency list

• none of the above

In empty threaded binary tree left thread and right thread of headnode value is

• true, false

• false ,true

• false, false

• true,true

In  binary tree inorder successor of node  N will be in the

i)

ii)l

iii)

• left part of subtree  of a node with root N

• either left or right

• right part of subtree of a node with root N

In a graph represented using head node concept (sparse matrix) ,how do we determine the indegree of a node ?

• by counting no of nodes in column header list of that vertex

• by counting no of nodes in row header of that vertex

• cannot predict