-
Priority Queue
What is Priority Queue? Explain with example.
Suresh-Blore
- Jul 25th, 2011
Waiting queue may not operate on strictly first in first out basis,,but on some complex priority scheme based on such factors as what compiler is being used,the execution time required,number of print lines etc.The resulting queue is called Priority queue.
Vishesh Bibhay
- Jul 9th, 2011
Hello!priority queue is a data structure which exhibits two properties1.structure property2.order propertyStructure property means that the queue will be a complete binary treeOrder property ...
-
Sorting algorithms
Which is the best sorting algorithm and why? I know again that it depends on the implementation but how do you select that a particular one is the best one to implement. In other words what are the factors for selecting a sorting algorithm?
Shrima Baskar
- Jul 26th, 2011
the best sorting algorithm is quick sort as it is O(nlogn) and will be able to process the input data fast even in case of very large n. In case of small n ,insertion sort is best and when the range o...
-
Reverse Single Linked List
How will you reverse a single linked list which consists of nodes a to z using recursion?
sasibhushan.m
- Jul 31st, 2011
Node* reverse_recursive(node *root)
{
if(root->link != NULL)
{
reverse_recursive(root->link);
root->link->link = root;
return (root);
}
else
{
head = root;
}
} -
Without using /,% and * operators. write a function to divide a number by 3.
Alok Mishra
- Aug 4th, 2011
"c #include #include void main() { int i,n; float m,j=0; clrscr(); printf("enter the no"); scanf("%d",&n); if(n==1) { m=0.3333; printf("%f",m); } if(n==2) { m=0....
Satish Anjaneyappa
- Apr 8th, 2011
Int quoitent=-1, rem=0;int number;while(number>=0){ rem=number; quoitent +=1; //quoitent= quoitent+1; number -=3; //number=number-3;}
-
What are the various kinds of sorting techniques? Which is has least worst case?
These are some sorting techs,bubble sortquick sortinsertion sortselection sortmerge sortheap sorttell me any more sorting is found..... ad which is best....
akshay
- Aug 25th, 2011
BUBBLE SORT:
Code- BUBBLE SORT:
- #include<iostream.h>
- #include<string.h>
- #include<math.h>
- #include<stdlib.h>
- "Enter number of elements:""Enter no's: ""Sorted list is:"
vinod148
- Oct 23rd, 2009
HEAP sort is the best algorithmO(n log n) time for best, avg and worst caseO(1) spacelet me know if any other sorting algorithm present if that exceeds the limit i gave
Each entry in a link list is called a node TRUE or FALSE ?
shiksha
- Aug 28th, 2011
Yes each entry in a link list is called node and this node consist of two parts-info, and next add.
What is the difference between declaration and definition?
ashok reddy chenikala
- Aug 31st, 2011
Declaration means just identify the datatype and some memory allocation. If we print the value it gives garbage value.
Definition means declaration and assign some value to that variable. i.e. definition = declaration + initialization.jontyrodes
- May 9th, 2008
Definitionint * ii is definitionsince we can store a address without allocating memory*i is definition since we can assign *i = 4 ;Definitionchar *cc is definition since it can store a address of a ch...
How to find the loop in singly linked list
If we are having the singly linked list then last node of the list is linked with middle (or) any node in the list then it causes the loop then how to find the loop with less time complexity
Rahul_Sharma
- Sep 4th, 2011
Method 1.check the node pointed to by the outer loop, with every node of the inner loop. Method2. Have a visited flag in each node of the linked list. Flag it as visited when you reach the node. When...
prasanjeet
- Aug 25th, 2011
Take 2 pointers (say p & q) pointing to the start of the list. Increment p by one and q by 2 till p and q points to the same node (in case of loop) or one of them reaches the end (in case of no loop).
Arrays Vs Linked List
Among arrays and linked list, which one is easiest to imlement and why?
Deletions at Both the Ends
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.a. Input-restricted dequeb. Output-restricted dequec. Priority queuesd. None of above
Shilpa chavare
- Sep 12th, 2011
Your qtn itself has the answer.. wen insertion is restricted to one end, then it obviously has to be input restricted dequeue..:)
Programming in C
Define data type NodeCD, declare 100 variables of CD1 & access data?
shraisy
- Sep 20th, 2011
Code- span style="font-style: italic;">//defining node// declaring 100 variables of type structure// to access
- {
- scanf("%d""%d
- , arr[i]);
- }
- please correct me if wrong !
Can a class have more than one finally block ?
Time Complexity of Adding Three Matrices
What is the time complexity of adding three matrices of size NXN cell-by-cell?
Manish Yadav
- Oct 15th, 2011
Time Complexity of Adding Three Matrices because there is only two loop are needed for adding the matrix so complexity will be o(n^2), there is no effect for increase the number of matrix. it will be same for n number of matrix.
Codesonia_mehta
- Jul 6th, 2010
Program looks like......for(i=0;i<n;i++){ for(j=0;j<n;j++) { result[i][j]=a[i][j]+b[i][j]+c[i][j]; }}loop will execute n*n times...and 2 add operations..if 1 add op takes 'c' time, thentotal time= 2*c*n*nthus, time complexity= n*n......
What is the difference bitween NULL AND VOID pointer?
Gaurav bisht
- Nov 9th, 2011
NULL pointer means- it points to nothing
whereas,void pointer refers to the fact that the pointer has no data type declared with it and it can be used to point variable of any data-type-int,float,etc..
ex-int*(void_ptr)rohini.nitd
- Aug 17th, 2009
NULL pointer says that it is not pointing to any object, but a VOID pointer says that it can point to any object.
Macro Usage
Why macro cannot be used in place of inline function?
What are the advantages and disadvantages of non linear data structure ?
snyder
- Feb 27th, 2012
Advantage The basic and the only (in my opinion) advantage is that various algorithms such as searching algorithms are optimized using non linear data structure. When time complexity is compared, the...
Bit Transformation
The process of transforming 1 bit pattern into another is called ______________
snyder
- Feb 29th, 2012
It is called conditioning. This question is actually related to electronics and you can find it in "Telecommunication Networks".
Define datastructure?
yogitag
- Mar 5th, 2012
Data Structure is the way of organizing data as per the requirement and defining few operations that can be operated on it
snyder
- Feb 27th, 2012
Data Structure is way of organizing data in memory so as to use it in an efficient manner and is best suited for the algorithm to be implemented.
Ans