Data Structure Test 2 - Online Test

Test Difficulty Level: Medium

Syllabus of Test

Computer Science: Miscellaneous Questions covering various parts of Data Structure.

Sample Question from this online test:

Question: Construction of a Huffman tree requires the data structures

Option A: Binary tree & Linear Queue

Option B: Binary tree & Circular queue

Option C: Binary tree & Priority queue

Option D: Forest & priority queue

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

Start this Test


sanjay bajaj on 2011-08-12 09:59:17 wrote,


rahul gupta on 2012-01-04 04:44:29 wrote,


Ramnath J on 2012-01-05 04:28:11 wrote,

For qn 12 i feel Option A is the right answer coz in a binary min heap Key(parant(u)) <= Key(u)