Test Difficulty Level: Easy
Syllabus of Test
Computer Science: Questions from data structure related to binary trees and graphs.
Sample Question from this online test:
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.
Related Online Tests:
tarun mahashwari on 2011-01-10 16:30:45 wrote,
answer of question 15 must be D not B you a**ho**
debabrata SahaChowdhury on 2011-05-28 15:27:43 wrote,
vibha soni on 2012-05-18 12:16:58 wrote,
some question's answer are wrong........they confused somebody
Amit Dixit on 2012-06-28 04:26:09 wrote,
ans of que 15==d and ans of ques 5==d
mridu sahu on 2012-12-10 10:39:34 wrote,
answer 15 must be D
Hafizullah Bakhtyar on 2013-07-16 06:43:22 wrote,
this is the best test
vempati narmada on 2013-08-14 10:32:09 wrote,
gud. i feel some answers are wrong so i want explanation also.