Register

UGC NET CSE | June 2009 | Part 2 | Question: 24

• edited by
587 views

1 Answer

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

Related questions

0 votes
0 votes
2 answers
1
rishu_darkshadow asked Sep 22, 2017
3,737 views
UGC NET CSE | June 2009 | Part 2 | Question: 27
In a full binary tree of height k, there are ______ internal nodes . 2k-1 2k-1 2k 2k+1
In a full binary tree of height k, there are ______ internal nodes .2k-1 2k-1 2k 2k+1
User Avatar
1 votes
1 votes
4 answers
2
rishu_darkshadow asked Sep 22, 2017
695 views
UGC NET CSE | June 2009 | Part 2 | Question: 26
Queue is a …………. list . $LIFO$ $LILO$ $FILO$ $FIFO$
Queue is a …………. list .$LIFO$ $LILO$ $FILO$ $FIFO$
User Avatar
2 votes
2 votes
2 answers
3
rishu_darkshadow asked Sep 21, 2017
806 views
UGC NET CSE | June 2009 | Part 2 | Question: 28
A binary tree is said to have heap property if the elements along any path : from leaf to root are non-increasing from leaf to root are non-decreasing from root to leaf are non-decreasing from root to leaf are non-increasing
A binary tree is said to have heap property if the elements along any path :from leaf to root are non-increasing from leaf to root are non-decreasing from root to l...
User Avatar
–1 votes
–1 votes
0 answers
4
rishu_darkshadow asked Sep 24, 2017
579 views
UGC NET CSE | June 2009 | Part 2 | Question: 50
We cannot delete the __________ icon but we can made it invisible. Recycle My Computer Internet explorer None of the above
We cannot delete the __________ icon but we can made it invisible.Recycle My Computer Internet explorer None of the abov...
User Avatar
Link Copied!