Register

UGC NET CSE | June 2012 | Part 3 | Question: 42

• edited by
3,222 views
2 votes
2 votes

Which of the following binary tree is optimal, if probabilities of successful search and unsuccessful search are same?

 

 

• edited by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4.8k
views
1 answers
2 votes
go_editor asked Jul 7, 2016
4,776 views
UGC NET CSE | June 2012 | Part 3 | Question: 25, UGCNET-Dec2013-III: 42
Which is not the correct statement(s)?Every context sensitive language is recursiveThere is a recursive language that is not context sensitiveI is true II is falseI is true and II is trueI is false II is falseI is false and II is true
User Avatar
3.3k
views
1 answers
2 votes
go_editor asked Jul 7, 2016
3,316 views
UGC NET CSE | June 2012 | Part 3 | Question: 47
The colour of an object is largely determined by its diffuse reflection coefficient. If $K_d = (0.8, 0.4, 0)$, then what shall be the colour of ... the light used is blue and magenta?White and RedRed and BlueBlack and WhiteBlack and Red
User Avatar
2.1k
views
2 answers
2 votes
go_editor asked Jul 7, 2016
2,146 views
UGC NET CSE | June 2012 | Part 3 | Question: 22
The transform which possess the highest ‘energy compaction’ property isSlant transformCosine transformFourier transformKarhunen-Loeve transform
User Avatar
4.0k
views
1 answers
3 votes
go_editor asked Jul 8, 2016
3,971 views
UGC NET CSE | June 2012 | Part 3 | Question: 75
Halftoning is defined asA technique to obtain increased visual resolution using multiple intensity levelsA technique for using minimum number of intensity ... using appropriate number intensity levels to obtain increased visual resolution
User Avatar
Link Copied!