Recent content by mooncrater

This might suffice.

Thanks for you people replying out there. I just got the answer, and well, it's simple ( and a little embarrassing too!). My predecessor method isn't optimal. It can be made in ##O(h)##. So We can get INSERT and DELETE to work in ##O(h)##. Thanks. Moon.

What happens, if instead of having any pointer pointing to a node's parent, we had pointer pointing to the node's successor? We know, that Searching would remain the same. But in my opinion Insertion and Deletion would change. This would happen, because in insertion, we would be needed to find...

Well, that's what I tried to do. Instead of taking the whole range of the tree, I considered a range ##k## that is less than ##n## (the total number of elements), By starting from the elements who need ##h## loop runs, in order to find their successor. And as ##k## increases, I included other...

Consider the algorithms : TREE-SUCCESSOR(x) 1. if x.right_child !=NIL 2. return TREE-MINIMUM(x.right_child) 3. y=x.parent 4. while y != NIL and x == y.right_child 5. x = y 6. y = y.parent 7. return y TREE-MINIMUM(x) 1. while x.left_child != NIL 2. x = x.left_child...

Sorry, forgot about the expansion of the majestic ##e^{x}## itself. Moon.

Sorry, but I'm facing a problem again. I found about incomplete gamma functions on wikipedia: https://en.wikipedia.org/wiki/Incomplete_gamma_function And I found that the upper incomplete gamma function, and the limiting function( defined as ##\gamma *##) suffice my needs. As it's given that ...

Thanks ! :)

There is this summation, that I've been trying to solve, but am not able to do so. It is : $$\sum\limits_{i=k}^{n} \frac {1}{(n-i)! m^{i-1}}$$ I would be happy to find it's upper bound too. So what I did was intensely naive. I made the denominator the minimum by making ##(n-i)! = 1## and...

Homework Statement So the question is: Show that a directed multigraph having no isolated vertices has an Euler circuit if and only if the graph is weakly connected and the in degree and out degree of each vertex are equal.Homework Equations Euler circuit: A circuit that has all edges of the...

Thanks! I got it now.☺ Moon.

Homework Statement The given question is: Show that a simple graph with at least two vertices has at least two vertices that are not cut vertices.Homework Equations Cut vertices: The removal of cut vertices and all edges incident to them produces a subgraph more connected components than in the...

Homework Statement The question is : "A step down transformer having turns ratio 10:1 and input 230 V,50 Hz is used in a half wave rectifier. The diode forward resistance is 15 ohms and resistance of secondary winding is 10 ohms . For a load resistance of 4 kilo ohms, calculate the average and...

Homework Statement In my book ,I found this line which says ,"The collector current comprises two components-the majority and the minority carriers .The minority-current component is called the leakage current and is given the symbol ##I_{CO}## .The collector current, therefore is determined in...

Okay! Thats just a different ( and non-efficient) way of representing numbers. Thanks..:)