Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i<=n), the index of the parent is:(A) floor ((i+1)/2)(B) ceiling ((i+1)/2)(C) floor (i/2)(D) ceiling (i/2)

Consider an array representation of an n element binary heap where the

1.	Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i<=n), the index of the parent is:(A) floor ((i+1)/2)(B) ceiling ((i+1)/2)(C) floor (i/2)(D) ceiling (i/2)
Answer»

Discussion

No Comment Found

Related InterviewSolutions

If the time is now 4 O’clock, what will be the time after 101 hours from now ?(A) 9 O’clock(B) 8 O’clock(C) 5 O’clock(D) 4 O’clock
Let m=(313)4 and n=(322)4. Find the base 4 expansion of m+n.(A) (635)4(B) (32312)4(C) (21323)4(D) (1301)4
Suppose there are six files F1, F2, F3, F4, F5, F6 with corresponding sizes 150 KB, 225 KB, 75 KB, 60 KB, 275 KB and 65 KB respectively. The files are to be stored on a sequential device in such a way that optimizes access time. In what order should the files be stored ?(A) F5, F2, F1, F3, F6, F4(B) F4, F6, F3, F1, F2, F5(C) F1, F2, F3, F4, F5, F6(D) F6, F5, F4, F3, F2, F1
Which module gives control of the CPU to the process selected by the short – term schedular ?(A) Dispatcher(B) Interrupt(C) Schedular(D) Threading
Consider the graph given below :Use Kruskal’s algorithm to find a minimal spanning tree for the graph. The List of the edgesof the tree in the order in which they are chosen is ?(A) AD, AE, AG, GC, GB, BF(B) GC, GB, BF, GA, AD, AE(C) GC, AD, GB, GA, BF, AE(D) AD, AG, GC, AE, GB, BF
Two atomic operations permissible on Semaphores are __________ and __________.(A) wait, stop(B) wait, hold(C) hold, signal(D) wait, signal
How many distinguishable permutations of the letters in the word BANANA are there ?(A) 720(B) 120(C) 60(D) 360
Find the boolean product A⊙B of the two matrices.(A) (1)(B) (2)(C) (3)(D) (4)
Negation of the proposition is:(A) (1)(B) (2)(C) (3)(D) (4)
Let G be an undirected connected graph with distinct edge weight. Let Emax be the edge with maximum weight and Emin the edge with minimum weight. Which of the following statements is false?(A) Every minimum spanning tree of G must contain Emin.(B) If Emax is in minimum spanning tree, then its removal must disconnect G.(C) No minimum spanning tree contains Emax(D) G has a unique minimum spanning tree.

Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i&lt;=n), the index of the parent is:(A) floor ((i+1)/2)(B) ceiling ((i+1)/2)(C) floor (i/2)(D) ceiling (i/2)

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment

Consider an array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array (i<=n), the index of the parent is:(A) floor ((i+1)/2)(B) ceiling ((i+1)/2)(C) floor (i/2)(D) ceiling (i/2)