How a value can be accessed through an address?How pointers can be used a funtions?
Latest Answer: It contains adrress of function. It is denoted as * fun(). ...
Make a middle node of doubly link list to the top of the list.
Latest Answer: node *n1,*n2;n1 = n2 = head;while((n2->next) && (n2->next->next)){ n1 = n1->next; n2 = n2->next->next;]// n1 points to the middle nown1->prev->next = n1->next;n1->next->prev ...
How is memory reserved using a declaration statement?
Latest Answer: When you delare any variable it is assigned in the data segment.Data Segment (data+bss+heap)stackand this is so memory is reserved. ...
Write an algorithm to calculate the number of items in a static queue?
Latest Answer: [F=front, R=rear, P= pointer, q[] is the array variable] Algorithm: if F != R P= F count = 0 while(P
What is Priority Queue? Explain with example.
Latest Answer: Heap is also called a priority queue. Heaps are of two types one is min heap and other is max heap. Min heap contains min at the top of tree. ...
What is Circular Queue? Explain with examples.
Latest Answer: In a normal Queue when queue becomes full we can not add more items, so
following items are lost. But in a circular queue when queue becomes full
it will start overwriting the items from beginning so that new items/data won't
waste. It is ...
How do you convert doubly linked list to single without using structures?
Latest Answer: Saynode{infonode lptr,rptr}main{node p;p=start;q=p->rptr;while(p!=Null){q->lptr=Null;p=q;q=p->rptr;}} ...
Latest Answer: Linear:
May not need pointers to access
Need more time for searching than non-linear Easier to access
Non-linear: Need pointers to access ...
If you have one million named objects and you want to store them in a data structure that lets you insert new objects quickly and search for an object by name quickly, what data structure should you use?
Latest Answer: AVL trees ...
How will you identify Stack Overflow?
Latest Answer: Stack overflow condition is raised when Top=max-1 where max is the size of the array n, Top is the topmost element. ...
View page [1] 2 3 4 5 6 7 8 9 10 Next >>
Go Top
