Register

ibps bank it officer

324 views
0 votes
0 votes
which of following is useful in implementing heap sort

1. stack

2.list

3.queue

4.set
User Avatar

Please log in or register to answer this question.

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

Related questions

0 votes
0 votes
0 answers
1
Kushagra1234 asked Oct 28, 2018
232 views
ibps it officer
sorting is useful for 1.report generation 2.minimizing the storage needed 3. making searching eaiser and efficient 4. reporting queries eaisely 5 none
sorting is useful for 1.report generation2.minimizing the storage needed3. making searching eaiser and efficient4. reporting queries eaisely5 none
User Avatar
0 votes
0 votes
0 answers
2
mk_007 asked Jan 12
43 views
OIL IT Senior officer
From where to get syllabus for OIL senior officer IT.
From where to get syllabus for OIL senior officer IT.
User Avatar
1 votes
1 votes
1 answer
3
somya agarwal asked Feb 19, 2017
1,527 views
MPPSC IT Officer exam
Floating point representation wit 8 bit fraction and 6 bit exponent of the binary number + 1001.11 is : a. Fraction : 01001110 , exponent : 000100 b. Fraction : 10011100 , exponent : 000011 c. Fraction : 00100111 , exponent : 000100 d. Fraction : 01001110 , exponent : 100100
Floating point representation wit 8 bit fraction and 6 bit exponent of the binary number + 1001.11 is :a. Fraction : 01001110 , exponent : 000100b. Fraction : 10011100 , ...
User Avatar
0 votes
0 votes
1 answer
4
Kushagra1234 asked Nov 16, 2018
1,691 views
ibps 2014
if n elements are sorted in a binary search tree .what would be the asymptotic complexity to search a key in the tree. a. o(1) b. 0(log n) c. o(n) d. o(n log n)
if n elements are sorted in a binary search tree .what would be the asymptotic complexity to search a key in the tree.a. o(1)b. 0(log n)c. o(n)d. o(n log n)
User Avatar
Link Copied!