C Programming

#include<stdio.h>

int main()

{

int d,j=1,i,flag=0,count=0,k=0;

int b[];

char a[],c;

printf("enter the number=");

scanf("%s",a);

printf("enter the digit=");

scanf("%c",&c);

printf("the place value of given digit is:");

for(i=0;a[i]!='\0';i++)

{

if(a[i]==c)

{

b[k]==a[i]-'0';

b[k]=b[k]=*j;

flag=1;

count++;

k++;

}

j=j*10;

}

if(flag==1)

{

printf("the place value of given digit %c is:",c);

for(i=0;i<count;i++)

printf("\n%d",b[i]);

}

else

printf("your entered digit is not present in number");

return 0;

}

Cached memory is read each time the file is read. This can increase the computers performance. Uncached memory is not read each time.

The Bourne Again Shell (bash) was originally written by Brian Fox. It is maintained as part of the GNU project and has several developers, now led by Chet Ramey.

Cannot be solved without knowing what an 'Element' is.

A user variable is a memory which is used in specific function or functionality. A system variable is kinda of generic, accessible to all users of the system. It does not bind to specific process as such.

If you have written it yourself, then it is the former, otherwise it is the latter.

What OS is the other machine, and what program are you running? I believe Sun uses a different architecture than most other machines, but I can't remember off the top of my head.

MFC is the Microsoft Foundation Class library which provides the Windows Application Framework Extensions (AFX). The library is really nothing more than a class wrapper to make it easier to work with the Windows API using C++ classes. Although still used today it has largely been replaced by the .NET framework.

try this:

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <time.h>

#define MAX_LINE_LEN 80

#define WS1 " \t$"

#define WS2 " \t"

#define N_MAX 36

const char *p0 = "How much money do you have?";

const char *p1 = "Enter 1 for odd, 2 for even";

const char *p2 = "Place your bet";

typedef enum { false = 0, true } bool;

int getInt(const char *prompt, const char *ws);

int main(int argc, char *argv[]) {

time_t t;

int balance, bet, choice, ball;

bool betOk, win;

srand((unsigned)time(&t));

balance = getInt(p0, WS1);

while (balance > 0) {

do {

choice = getInt(p1, WS2);

} while ((choice < 1) (choice > 2));

for (betOk = false; betOk false) {

printf("invalid input, try again: ");

}

}

return z;

}

• Because fuuck you !!

% = Shift + 5

Example:

printf ("7%%3=%d\n", 7%3);

result: 7%3=1

one more thing this operator works only with integer type numbers not floating numbers.

C

A constant value.

Many ways, depending on the robot complexity, how it is being ran and other factors. Conventional 'robots' have motors, sensors, and a computer. Usually the computer runs a program that does all the programming, this can be done in ANY language that the programmer fancies the most. There are some robots called BEAM robots that aren't programmed using code or programming, but instead react as a neural network (like an organic brain) or reactions from the pre built electronics in the robot. This is a VERY open question

#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();

}

There is a lot of different ones, so it really depends on what kind of software you want to design.

The stack search method cannot be performed recursively.

//Perhaps this is what you want.

//@author Rosencrantz

import java.util.Scanner;

class TriangleFun

{

public static void main(String[] args)

{

Scanner scan = new Scanner(System.in);

boolean done = false;

while(true)

{

System.out.print("Calculate AREA or PERIMETER? Type DONE to quit.");

String input = scan.nextLine().trim();

if(input.equalsIgnoreCase("DONE"))

break;

if(input.equalsIgnoreCase("AREA"))

{

System.out.print("Enter the base length: ");

double base = scan.nextDouble();

System.out.print("Enter the height: ");

double height = scan.nextDouble();

System.out.println("Area is: " + (1/2.0) * base * height);

}

else

{

System.out.print("Enter length of side 1: ");

double length1 = scan.nextDouble();

System.out.print("Enter length of side 2: ");

double length2 = scan.nextDouble();

System.out.print("Enter length of side 3: ");

double length3 = scan.nextDouble();

System.out.println("Perimeter is: " + (length1 + length2 + length3));

}

scan.nextLine();

}

}

}

//A better edited version is in the links

You would use neither Java nor C++, you would use Objective-C, in conjunction with the Apple iPod API (iPod Library Access).

Not possible.

Functions in C language may call themselves (ie can be recursive) without restrictions.

in some cases, aloop control variable does not have to be initialized.

You will need to traverse the list i times to get to the element you want deleted. Each time you go thru the list you will need to remember the forward pointer from the previous element because when you get to the element you want to delete the previous forward pointer needs to be pointed to the I + 1 element of the list.