Register

UGC NET CSE | June 2010 | Part 2 | Question: 32

• edited by
2,710 views

2 Answers

Voting & Accepting an answer helps improve the community
← Previous · Ace BookletNext → · TOC
← Previous in category · UGC NET CSE | June 2...Next in category → · GATEBOOK
Position:
Show:

Related questions

2 2 votes
1 1 answer
6.6k
6.6k views
Misbah Ghaya asked Sep 15, 2016
6,574 views
UGC NET CSE | June 2010 | Part 2 | Question: 23
In a complete binary tree of n nodes, how far are the two most distant nodes ? Assume each edge in the path counts as !About $\log_{2} n$About $2 \log_{2} n$About $n \log...
1 1 vote
2 2 answers
5.5k
5.5k views
Misbah Ghaya asked Sep 15, 2016
5,495 views
UGC NET CSE | June 2010 | Part 2 | Question: 25
In a $\text{B}$ tree of order $5$, the following keys are inserted as follows : $7, 8, 1, 4, 13, 20, 2, 6$ and $5$ How many elements are present in the root of the tree ?...
0 0 votes
3 3 answers
3.5k
3.5k views
Misbah Ghaya asked Sep 15, 2016
3,517 views
UGC NET CSE | June 2010 | Part 2 | Question: 24
A chained hash table has an array size of $100$. What is the maximum number of entries that can be placed in the table ?$100$$200$$10000$There is no upper limit
0 0 votes
2 2 answers
8.1k
8.1k views
Misbah Ghaya asked Sep 15, 2016
8,084 views
UGC NET CSE | June 2010 | Part 2 | Question: 22
What is the most appropriate data structure to implement a priority queue ?HeapCircular arrayLinked listBinary tree