What has to put when we are inserting as assembly language
code into the C code? or When we are inserting as assembly
language code into the C code we have to insert one thing
at the start and of the assembly language. What are they?

Answers were Sorted based on User's Feedback



What has to put when we are inserting as assembly language code into the C code? or When we are in..

Answer / vaishnavi

we can insert assembly code by using asm()
asm("assembly code")
The compiler will insert these asm code into the assembly code being generated, and hence the compiler-supplied and the user-supplied assembly will be combined

Is This Answer Correct ?    3 Yes 0 No

What has to put when we are inserting as assembly language code into the C code? or When we are in..

Answer / sivavendra

Yes,, we have to give the assembly code as inline function as follows.....

asm
{
"assembly instructions"
}

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More C Interview Questions

Array is an lvalue or not?

0 Answers  


what is the difference between strcpy() and memcpy() function?

2 Answers  


What is the use of structure padding in c?

0 Answers  


What is dynamic variable in c?

0 Answers  


How can you read a directory in a C program?

0 Answers  


 write a program that will open the file, count the number of occurences of each word in the the complete works of shakespeare.  You will then tabulate this information in another file.

0 Answers  


i have to apply for the rbi for the post of officers. i need to know abt the entrance questions whether it may be aps or techinical....

0 Answers   RBI,


I have a function which accepts a pointer to an int. How can I pass a constant like 5 to it?

3 Answers  


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<n1-1;i++) { if( !( (a1[i]>a1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

0 Answers   Facebook,


What should malloc() do? Return a null pointer or a pointer to 0 bytes?

0 Answers  


int main(){ float f=8.0; if(f==8.0) printf("good"); else printf("bad"); } what is the answere and explain it?

3 Answers  


#include<stdio.h> int main( ) { Int a=300, b, c; if(a>=400) b=300; c=200; printf(“%d%d ”, b, c); return0; }

1 Answers  


Categories