0
Still curious? Ask our experts.
Chat with our AI personalities
Ezra
Rafa
ViviAdd your answer:
Earn +20 pts
Write a C program to implement relocatable loader?
#include<stdio.h> #include<conio.h> #include<string.h> #include<stdlib.h> struct object_code { int locctr; char add[10]; }obcode[300]; void main() { char input[100][16],output[100][16],binary[20],address[20],stloc[10]; int len,bitmask,loc,tlen=0,tloc,textloc,i=0,location,j,k,count=0,start,n,num=0,inc=0; FILE *fp1,*fp2; clrscr(); fp1=fopen("linput.dat","r"); fp2=fopen("reloadout.dat","w"); printf("Enter the location where the program has to be loaded:"); scanf("%s",stloc); start=atoi(stloc); location=start; tloc=start; fscanf(fp1,"%s",input[i]); while(strcmp(input[i],"T")!=0) { strcpy(output[i],input[i]); i++; fscanf(fp1,"%s",input[i]); strcpy(output[i],input[i]); } itoa(start,output[2],10); while(strcmp(input[i],"E")!=0) { strcpy(output[i],input[i]); if(strcmp(input[i],"T")==0) { for(j=0;j<3;j++) { i++; fscanf(fp1,"%s",input[i]); strcpy(output[i],input[i]); } bitmask=atoi(output[i]); itoa(bitmask,binary,2); strcpy(output[i],NULL); textloc=atoi(output[i-2]); textloc=textloc+start; itoa(textloc,output[i-2],10); for(n=0;n<(textloc-(tloc+tlen));n++) { strcpy(obcode[inc].add,"xx"); obcode[inc++].locctr=location++; } tlen=atoi(output[i-1]); tloc=textloc; k=0; } else { if(binary[k]==1) { num=0; len=strlen(output[i]); strcpy(address,NULL); for(j=2;j<len;j++) { address[num]=output[i][j]; output[i][j]='\0'; num++; } loc=atoi(address); loc=loc+start; itoa(loc,address,10); strcat(output[i],address); } k++; len=strlen(output[i]); num=0; for(n=0;n<len;n++) { obcode[inc].add[num++]=output[i][n]; if(num>1) { obcode[inc++].locctr=location++; num=0; } } } i++; fscanf(fp1,"%s",input[i]); } strcpy(output[i],input[i]); i++; fscanf(fp1,"%s",input[i]); loc=atoi(input[i]); loc=loc+start; strcpy(output[i],itoa(loc,address,10)); count=0; i=0; n=0; fprintf(fp2,"%d\t",obcode[n].locctr); for(n=0;n<inc;n++) { fprintf(fp2,"%s",obcode[n].add); i++; if(i>3) { fprintf(fp2,"\t"); i=0; count++; } if(count>3) { fprintf(fp2,"\n%d\t",obcode[n+1].locctr); count=0; } } getch(); }
What is conversion function how it is created explain its syntax?
A conversion function is a function that converts data from one type to another. A conversion function has one argument of the type being converted from while the return type is the type being converted to. If required, additional arguments may be used to refine the conversion. Conversion functions are required to provide conversions between types that cannot be handled by a built-in cast.char* itoa(int value, char* str, int base);This non-standard function is an example of a conversion function, converting a built-in integer type to a null-terminated ASCII string representing the integer's value in a given base. The return value is simply the string pointed to by the strargument.
What is conversion function How it is created Explain its syntax.?
A conversion function is a function that converts data from one type to another. A conversion function has one argument of the type being converted from while the return type is the type being converted to. If required, additional arguments may be used to refine the conversion. Conversion functions are required to provide conversions between types that cannot be handled by a built-in cast.char* itoa(int value, char* str, int base);This non-standard function is an example of a conversion function, converting a built-in integer type to a null-terminated ASCII string representing the integer's value in a given base. The return value is simply the string pointed to by the strargument.
How Convert decimal to binary using stack?
Decimal to Binary Using a StackThere is no need to program a computer to convert from decimal to binary because all programming languages do this by default; they are binary computers after all. That is, if we want to store the decimal value 42 in computer memory, we simply assign the literal constant 42 to some variable or constant. But the value that is actually assigned is really the binary value 00101010. Moreover, even if we were to assign the hexadecimal value 0x2A or even the octal value 052, the value will still be automatically converted to the binary value 00101010. These are all different representations of the decimal value forty-two, but 00101010 is the only way that value can be physically stored in computer memory. Of course we may choose to store the value as a string, "42", however it is no longer a numeric value at that point, it is a character array. However, most languages will provide some library function that can convert the string representation of a numeric value into their actual numeric representation. In C, for instance, we would simply use the atoi() function. Nevertheless, it is not something we need to specifically cater for; the function does all the hard work for us, converting the string, "42", into the equivalent binary value 00101010. However, although decimal integer values are always stored in native binary code, presenting that binary value to the user isn't as straightforward. All languages will automatically convert the binary value back to decimal for display purposes, but what it's actually doing behind the scenes is converting the binary value 00101010 into the string "42" and then printing the string. In other words, it is the reverse of the atoi() function, essentially the equivalent of the itoa() function. Given that we don't need to program either of these conversions, it's easy to forget that these conversions are taking place. Given that humans work predominantly in decimal it is only natural that these conversions be done automatically for us, but it is a high-level concept; it is an abstraction. While there's nothing wrong in thinking at a high-level, it's important to be aware of the low-level operations that are actually taking place, because the more we know about what's really going on behind the scenes, the more easily we can exploit them. The high-level concept of converting from decimal to binary is only one such example where we can exploit the fact that the conversion to binary is already done for us behind the scenes. All we really need to do is present the result to the user. To achieve this we need to convert the binary value to a string, in much the same way as the itoa() function converts a binary value into a decimal string, except we convert to a binary string. A stack makes this incredibly simple. We simply examine the low-order bit and push a '1' character onto the stack if the bit is set, otherwise we push a '0'. We then shift all the bits one bit to the right and repeat the process. We continue in this manner until the binary value is zero. If the number of elements on the stack is not an exact multiple of 8, we can (optionally) push additional '0' characters onto the stack for padding. Finally, we print the top-most element on the stack and then pop it off the stack, repeating until the stack is empty. Thus if we use the value 00101010 once more, we examine the low-order bit. It is not set so we push a '0' onto the (empty) stack. We then shift the bits one place to the right, giving us 00010101. The low-order bit is now set so we push a '1'. We repeat the process, pushing a '0', then a '1', another '0' and another '1'. At this stage, the binary value is 00000000 so we are done. The stack has only six elements so we (optionally) push another two '0' characters onto the stack for padding. Now we begin popping the stack, printing the top-most element before each pop. When we are done, we will have output the character sequence "00101010". The following code in C++ shows how this might be implemented as a function. The return value is a string containing the binary representation of the function argument, dec. std::string dec2bin(int dec) { std::stack s {}; initialise an empty stack of characters while (dec) { if (dec & 0x1) // if the low-order bit is set... s.push ('1'); else s.push ('0'); dec >>= 0x1; // shift-right } while (s.size() % 8) s.push('0'); // pad the stack to the nearest 8-bit boundary std::string bin {}; // initialise return value (empty string)while (!s.empty()) {bin.append (s.top());s.pop();}return bin;} Example usage:int main() {std::cout > i;std::cout
How do you write a program to print Armstrong numbers between 1 and 100 using for loop?
/*Program to find Armstrong number between 1 to N*/ int main() { int n = 0, remainder, sum = 0, i = 0, noDigits = 0, isArm = 0; char ch[60] = {0}; printf("Find the Arm Strong Numbers between 1 to N"); scanf("%d", &n); for(i = 1; i<n; i++) { isArm = i; itoa(isArm, ch, 10); noDigits = strlen(ch); while(isArm) { remainder = isArm%10; isArm=isArm/10; sum= sum+pow(remainder, noDigits); } if(sum == i) printf("\nArm Strong Nos are %d\n", i); sum = noDigits = 0; } }
