Write a program that takes a 5 digit number and calculates 2 power that number and prints it(should not use big integers and exponential functions)
2 6750What 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?
2 4060struct abc { unsigned int a; char b; float r; }; struct xyz { int u; struct abc tt; }ww; ww = (struct xyz*)malloc(sizeof(struct xyz)); will the memory be allocated for the inner structure also?
1 6533Write a program that takes a 5 digit number and calculates 2 power that number and prints it.
1 3977Snake Game: This is normal snake game which you can find in most of the mobiles. You can develop it in Java, C/C++, C# or what ever language you know.
Accenture, Gridco, IBM, Kevin IT, TCS, Vimukti Technologies,
7 12175In the below code, how do you modify the value 'a' and print in the function. You'll be allowed to add code only inside the called function. main() { int a=5; function(); // no parameters should be passed } function() { /* add code here to modify the value of and print here */ }
1 3052
How can I find the modification date of a file?
What is difference between structure and union with example?
Explain is it better to bitshift a value than to multiply by 2?
Explain what are the different file extensions involved when programming in c?
Write a program to swap two numbers without using a temporary variable?
find the value of y y = 1.5x+3 for x<=2 y = 2x+5 for x>2
Difference between MAC vs. IP Addressing
Apart from dennis ritchie who the other person who contributed in design of c language.
Explain data types & how many data types supported by c?
Why is void main used?
Difference between Function to pointer and pointer to function
What is the use of parallelize in spark?
Explain what is the concatenation operator?
The performance of an operation in several steps with each step using the output of the preceding step a) recursion b) search c) call by value d) call by reference
What is the time and space complexities of merge sort and when is it preferred over quick sort?