I am too Lazy to update about me.

Alma Mater:

B-tech in Computer Science
2014 to 2017

Experience:

Not updated.
Tud
Multichoice
1 year 3 months ago

Sorry i also misunderstood

previously i followed the steps given in geeks for geeks

In Heapsort, we first build a heap, then we do following operations till the heap size becomes 1.
a) Swap the root with last element
b) Call heapify for root
c) reduce the heap size by 1.

In this question, it is given that heapify has been called few times and we see that last three elements in given array are the 3 maximum elements in array. So situation is clear, it is maxheapify which has been called 3 times.

but right now i am also confused.

moreless
Tud
Multichoice
1 year 3 months ago

Yeah! you are going correct.

problem is only in last two steps

we start heapify from bottom to up

so,first perform heapify in right subtree and then parent.

moreless
Tud
Video lecture
1 year 5 months ago

@dashish

Loglogx and (logx)2  both are different

Log2log22128= log 128=7

(Log22128)2=128*128

morelessWatch Now
Tud
Video lecture
1 year 5 months ago

We write X-1=1/X

Therefore log-1x=1/logx

morelessWatch Now
KIRAN KUMAR
Himanshu Kaushik
Ranita Biswas
Pritam Prasun
Pritam Prasun
905
naveen kumar t
15081
Jagmeet
19669
Hemant Suthar
21646
ABHIJIT GAJANAN NAIK
25906
S Nidesh
35031
10 Feb 2017 - 7:17am

23

more less

1 indian and (0 or 1 or 2 or 3 ) Chinese=>3C1*(3C0+3C1+3C2+3C3)

=3*8=24

2 indian and (0 or 1 or 2 or 3 ) Chinese=>3C2*(3C0+3C1+3C2+3C3)

=3*8

3 indian and (0 or 1 or 2 or 3 ) Chinese=>3C3*(3C0+3C1+3C2+3C3)

=1*8

more less
9 Feb 2017 - 11:16am

Yeah! I got it

I read this before few days...

Btw thanks..

more less
8 Feb 2017 - 5:55pm

We can't generate abb from given grammar

more less
8 Feb 2017 - 5:19pm

No. Of a's is equal to no. Of b's

By tracing we get set of strings derived from a grammar

more less
6 Feb 2017 - 2:23pm

@dashish

A to B is many to one that means in every relationship only one entity of B can participate and many entity  of A is participate in one relationship. So, 1000 triples

Same for A to C. So, 10  triples

B and C is one to one. So, only 10 triples are possible.

Maximum no of triples is 1000

more less
6 Feb 2017 - 2:18pm

@dashish

Thank you... Now I understood

more less
6 Feb 2017 - 12:21pm

If beta is non-terminal then we have to define closure of beta

So to determine lookaheads of new production it is useful.

So, look ahead has effects on items....

more less
6 Feb 2017 - 10:54am

A to B and A to C is many to one relationship that means

Every B and every C is participate in a relationship therefore 1000 triples or 10 triples.

Maximum no. Of triples of entities are 1000

more less
6 Feb 2017 - 10:23am

Both are true

more less