0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
What is the difference between binary heap and binomial heap?
The difference between Binomial heap and binary heap is Binary heap is a single heap with max heap or min heap property and Binomial heap is a collection of binary heap structures(also called forest of trees).
What is a real world example of a fjord?
A fjord is a real world example of a fjord! They exist in the real world.
A real life example of a octagon?
a real life example of an octagon is a stop sign.
What is a real life example of and isosceles triangle?
A pennant is a real life example of an isosceles triangle.
Is pi an Example of a number that is not real?
No. The square root of negative one is an example of an imaginary (not real) number. Pi is irrational, but real.
Is heap a real group?
yes it is.
What is Jenna Heap's mother's name?
her adoptive mother's name is Sarah Heap (adoptive father: Silas), but her real mother's name is Cerys (real father: Milo Banda).
What is the running time of transforming an arbitrary array into heap?
Building a heap from an arbitrary array takes O(n) time for an array of n elements.
What is an example of a real time cost?
example of data real time processing is to go shop and buy some of good another thing is to drink medical
What is a real time example of stack?
cars in garage
Is ATMs an example of real time processing?
yes
What is the real time example for Trojan horse?
yes
What is the difference between binary heap and binomial heap?
The difference between Binomial heap and binary heap is Binary heap is a single heap with max heap or min heap property and Binomial heap is a collection of binary heap structures(also called forest of trees).
What is real time software?
A real time software is one which are time based. For example : Railway reservation system, e-Banking etc.
How a heap is created?
You should know classes & pointers before heaps. My idea of a heap is a bit like this: You have a class or struct(i.g. Heap_t) with a pointer to another of itself, and some data. Example: class Heap_t{ public: Heap_t(){ Pointer=NULL; } Heap_t * point; int data; }; int main(){ //Variable Heap_t * heap;//This will hold a pointer to the root of the heap Heap_t tmp; //Temporary storage for a piece of the heap before it is added Heap_t * cur; //Temporary storage for the current piece of the heap //Setup the heap tmp.data=0;//Make data something meaningful cur=(Heap_t *) tmp;//Make the root of the heap heap=cur;//Backup the root of the heap //Make the heap big for(int i=1;i<10;i++){ tmp.data=i;//Make the data something meaningfull (*cur).next=(Heap_t *) tmp; //Add tmp to the heap } //Do stuff //Exit return(0); } You could also use a reference or use it without a pointer or a reference. This is a bit more like a linked list, but it is an example.
Real time example for double ended queue?
glass tumler
Difference between Fibonacci heap and binomial heap?
Like a binomial heap, a fibonacci heap is a collection of tree. But in fibonacci heaps, trees are not necessarily a binomial tree. Also they are rooted, but not ordered. If neither decrease-key not delete is ever invoked on a fibonacci heap each tree in the heap is like a binomial heap. Fibonacci heaps have more relaxed structure than binomial heaps.
