Answer Posted / satish
if a variable is declared as volatile ,optimization is not
done regarding to that variable.If the value is modified
many number of times,each time CPU goes and reads from main
memory rather than cache memory.
The usage of this can be
understood clearly only at kernel level but not at
application level.
Is This Answer Correct ? | 36 Yes | 2 No |
Post New Answer View All Answers
What are pointers in C? Give an example where to illustrate their significance.
What does c value mean?
Lists the benefits of c programming language?
What is c variable?
What is p in text message?
What is the use of a semicolon (;) at the end of every program statement?
What are c identifiers?
how to introdu5ce my self in serco
What is the right type to use for boolean values in c?
why wipro wase
This is a variation of the call_me function in the previous question:call_me (myvar)int *myvar;{ *myvar += 5; }The correct way to call this function from main() will be a) call_me(myvar) b) call_me(*myvar) c) call_me(&myvar) d) expanded memory
You have given 2 array. You need to find whether they will
create the same BST or not.
For example:
Array1:10 5 20 15 30
Array2:10 20 15 30 5
Result: True
Array1:10 5 20 15 30
Array2:10 15 20 30 5
Result: False
One Approach is Pretty Clear by creating BST O(nlogn) then
checking two tree for identical O(N) overall O(nlogn) ..we
need there exist O(N) Time & O(1) Space also without extra
space .Algorithm ??
DevoCoder
guest
Posted 3 months ago #
#define true 1
#define false 0
int check(int a1[],int a2[],int n1,int n2)
{
int i;
//n1 size of array a1[] and n2 size of a2[]
if(n1!=n2) return false;
//n1 and n2 must be same
for(i=0;i
Why is structure padding done in c?
How can I call fortran?
write a sorting prgm to sort 50 nos and sum them and also remove all the occurrences of 15 and print it?