Home / MCQ Bank / Computer

Computer Miscellaneous On Data Structures Difficulty: Medium

Why is heap implemented using array representations than tree(linked list) representations though both tree representations and heaps have same complexities? for binary heap -insert: O(log n) -delete min: O(log n) for a tree -insert: O(log n) -delete: O(log n) Then why go with array representation when both are having same values ? What will be the output of the following C++ code? #include <stdio.h> #include <stdlib.h> int main () { div_t divresult; divresult = div (38, 5); printf ("%d\n", divresult.rem); return 0; } Select the sequence of execution of function f1(), f2() & f3() in C# .NET CODE? class base { public void f1() {} public virtual void f2() {} public virtual void f3() {} } class derived :base { new public void f1() {} public override void f2() {} public new void f3() {} } class Program { static void Main(string[] args) { baseclass b = new derived(); b.f1 (); b.f2 (); b.f3 (); } } Which searching algorithm can be used to find an item in a sorted array with an index-based approach? What is the output of the code? variable=true if variable puts "true" else puts "false" end