1.The minimum number of edges in a connected cyclic graph on n vertices is a) n-1 b) n c) n+1 d) none of these 2.A full binary tree with n non leaf nodes contains a) n nodes b) log n nodes c)2n-1 nodes d)2n nodes 3.The time complexity of shell sort a) O(n) b) O(log [...]
Tags: isro placement paper, 2009 paper, ISRO opening for Scientist Engineer