Binary Tree And Graphs - Online Test

Test Difficulty Level: Easy

Computer Science: Questions from data structure related to binary trees and graphs.

Question: No of edges in a n-vertex complete graph is given by

Option A: n^2

Option B: n(n -1)/2

Option C: n

Option D: n-1

To answer, click the "Start This Test" button below.

tarun mahashwari on 2011-01-10 10:30:45 wrote,

answer of question 15 must be D not B you a**ho**

debabrata SahaChowdhury on 2011-05-28 10:27:43 wrote,

good qns

vibha soni on 2012-05-18 07:16:58 wrote,

some question's answer are wrong........they confused somebody