This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 4.(done) Maximum number of nodes in a tree with n levels. (a)2^(n-1) (b)(2^n)-1 (ans) (c)2^(n-1) - 1 5.(done) Complete graphwith n nodes have (a)n-1 edges (b)n(n-1)/2 (ans)...
View Full Document
This note was uploaded on 06/27/2010 for the course MACS MCA taught by Professor Brs during the Spring '10 term at National Institute of Technology, Calicut.
- Spring '10