DaniWeb IT Discussion Community - C

dynamic array

cmsc — Sun, 22 Nov 2009 06:52:18 GMT

I want to make a dynamic array. but when I view the array, I think there's something wrong with the index part. Please help. Thanks!

here's my code:

#include





main(){



        int* a;

        int number;

        int choice;

        int index = 0;

        int head;

        

        

        while(choice!=4){

        

                printf("\tMENU\t\n");

                printf("[1] add number to array\n");

                printf("[2] view array\n");

                printf("[3] search using linear search\n");

                printf("[4] quit program\n");

                scanf("%d", &choice);

                

                switch(choice){

                        case 1: head = add(&index, a);

                                        break;

                        

                        case 2:head = view(&index,a);

                                        break;

                                        

                        //case 3:linsearch(&index,array[5]);

                                        //break;

                                        

                        case 4: return;

                                        break;

                                        

                        default: printf("invalid input!!!\n");

                        

                }

}

}



 int add(int* index, int* a){

        

        int number;

        int i;

        

                printf("enter number you want to enter in the array.\n");

                scanf("%d", &number);

                

                *a = (int) malloc (5*sizeof(int));

                

                for(i = 0; i <= *index; i ++){

                        a[i] = number;

                }

                

                return *index;

}



 view(int* index, int* a){



        int i; 

        printf("\n");

        

                for(i = 0; i <= *index; i++){

                        printf("index: %d, %d ", *index, a[i]);

                }

                printf("\n\n");

                

                return a[5];

}

Scheduler

Cmad — Sun, 22 Nov 2009 05:18:36 GMT

Iam currently working on the design of preemptive scheduler iln Borland C. I want to know about the use of interrupts and timers in Borland C for preempting the task. Just clue of upgrading about them is enough.

How to color some text in Dev C

DoEds — Sun, 22 Nov 2009 03:45:56 GMT

#include
#include

#define SIZE 31

int main()
{
int array[SIZE]={0};
int i,j;
int startDay=0,numDays=30;

printf(" S M T W TH F S\n");

for (i=1;i<=1+ startDay*5;i++)
printf(" ");

for (i= 1; i <= numDays; i++)
{

printf("%2d",i);
if ((i+startDay)%7 > 0)
{ printf(" ");
system("color 6");}

else
printf("\n ");
}
startDay = (startDay + numDays)%7;

getchar();
getchar();
}

I used

system("color ");

but it will only colorize my enter text...
I only want to colorize the days in Sunday;

I dont know how to do it...Can anyone teach me please?.,

Converting long integer Into Array

dieom — Sat, 21 Nov 2009 17:05:11 GMT

What I am trying to accomplish here is to split a long integer apart so I can look at its first, last, and center digits. What I am currently using is this:

int main() {

  long i, t[1024];

  

  i = 100;



  while (i < 150) {

    t = i; // My attempt at converting the long into an array.

    printf("%ld\n", t[2]);

    i += 1;

  }

Any help would be appreciated!

FILE stream, syntax in getc

neithan — Sat, 21 Nov 2009 15:38:39 GMT

Hi everyone, i have this portion of code

while(c = getc(file) != EOF)

c is an int and file is a FILE *file = fopen(filename, "r");

The filename points to a file with 2 lines, 10 characters total. That while always makes c a value of 1 (accodring to ASCII -> start text, dunno what that mean).
But when i use this while:

while((c = getc(file)) != EOF)

It works perfect. I though that was equivalent...i'm missing something on basic syntax here. What's wrong in the first while?

Thank you.

char in c?

dewdropz — Sat, 21 Nov 2009 10:32:32 GMT

hi, i am new to c have to write a program to check the shape.
I think the error is somewhere at shape= square. I know i can use printf statements but i want it in this format. Can someone help me please?

#include 

int main (void)

{

int length,breadth;

char shape;

printf("Input your length: ");

scanf("%f", &length);

printf("Input your breadth: ");

scanf("%f", &breadth);



if (length=breadth)

       { 

            shape= 'square';      

       } 

else {

            shape = 'rectangle'

        }

printf(" the length is%d, breadth is %d , hence given shape is %s", length, breadth, shape);

Need help to create matrix

rahul.nutron — Sat, 21 Nov 2009 06:54:14 GMT

I have to create a matrix in c from microarray data that so I have to read each string line wise and compare they are related or not. help me....***

Error in simple C menu

Mattpd — Sat, 21 Nov 2009 06:21:58 GMT

If I run the program, and select q, it will quit correctly. If I select e it goes to the edit menu but prints it twice. If I then select q it goes to the main menu and prints the default case, "please select from menu", then prints the main menu again. If I select q now, it goes to the edit menu, not quitting the program like it did before. So now it's stuck in a loop between main and edit when I select q.

#include   

#include 



void edit(void){



printf ("\nEDIT MENU\n");

printf ("  (a)Add\n");

printf ("  (p)Display\n");

printf ("  (i)Reutrn\n");

printf ("  (o)Check Out\n");

printf ("  (d)Delete\n");

printf ("  (q)Main Menu\n");





char choice;

scanf ("%c",&choice); 



switch (choice) {



case 'a':

  system("./add");

  break;

  



case 'p':

  system("./display");

  break;



case 'i':

  system("./return");

  break;



case 'o':

  system("./checkout");

  break;



case 'd':

  system("./delete");

  break;



case 'q':

  main();



default:

  edit();



}



}



void reports(void)

{



}



void add(void)

{

}



void del(voi)

{

}



int main(void){



        

printf ("MAIN MENU\n");

printf ("  (e)Edit\n");

printf ("  (r)Reports\n");

printf ("  (q)Quit\n");



char choice;

scanf ("%c",&choice); 



switch (choice) {

  case 'e':

  edit();

  break;

  

  

  case 'r':

  reports();

  break;

  



  case 'q':

  break;



  default: 

  printf("Choose from the menu\n");

  main();

}

return 0;

}

how to use the local variable form one function to other function

thebluestar — Sat, 21 Nov 2009 02:21:55 GMT

Here is the problem:write in saparate function without using global variable
1/(function input)enter N in the range [0,20], then enter N numbers
2/(function display)Display N numbers in 2 columns
Here is my source code

#include

#include

void Input(int *p,int n)

{

    int i;

    do

    {

     printf("Enter N numbers u want to input: ");

     scanf("%d",&n); 

    }while ( (n<0) || (n>20) );

    p =(int *)malloc(n*sizeof(int));

    printf("Ennter %d numbers: ",n);

    for( i=0; i
    {

         printf("\nNumber%: ",i);

         scanf("%d",p+i);

    }

    

}



void Display(int *p, int n)

{

     int i;

     printf("test");

     for( i=0; i
     {

        printf(" %d",p[i]);  

     }

}



int main()

{

  int *a, *N;

  Input(a,&N);

  Display(a,&N);

  getch();

  return 0;

}

I don't know how can I use the variable N in function input for the next function.

memcpy with int clears entire buffer

cmk2901 — Sat, 21 Nov 2009 00:21:09 GMT

Hi,

I have a char* buffer that is 1024 bytes in size, and am trying to write an int to a particular offset in the buffer, in this case 0, but all offsets have the same problem.

I initialize the buffer to some values when I first start up. For example, the first 8 bytes contain two separate ints, followed by 2 chars. When I print this out, it shows up as full.

However, when I try to add another value as shown in the code below, it completely destroys all the other data in the buffer.

char* buffer = new char[1024];



***buffer initialization code***



int fd = 4;

int bufferOffset = 0;



memcpy(buffer + bufferOffset, &fd, 4);



cout << buffer << endl;

Does anyone know why this could be happening? I'm under the impression that the above code should copy the 4 bytes of an int to my buffer, not completely destroy it.

Pixel Count

cokacola — Fri, 20 Nov 2009 18:44:43 GMT

The purpose of the program is to take a position and count how many "pixels" are in the "blob". If there is no "pixel" aka the value is 0, the blob number is 0. If there is a pixel, the blob_check function recursively checks the surrounding cells for "pixels" aka values of 1. My program compiles but doesn't accurately count the number of pixels in the blob. Please help!

#include 

#include 



int blob_check(int tab[][], int x, int y);



#define N 5



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

{

        int x,y,i,j;

        int row=0;

        char line[80];

        int table[N][N] = { {1,1,0,0,0},

                                                {0,1,1,0,0},

                                                {0,0,1,0,1},

                                                {1,0,0,0,1},

                                                {0,1,0,1,1}};

                                

        printf("\t0\t1\t2\t3\t4\t");

        printf("\n   -----------------------------------------");                        

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

        {

                printf("\n   |\n%d  |\t", i);

                for(j=0;j<5;j++)

                {

                        printf("%d\t", table[i][j]);

                }

        }

                                                                

                                                                

        printf("\n\nEnter x-y coordinates of cell  => ");

        scanf("%d %d", &x, &y);                                                                

        

        printf("Pixel quantity in blob: %i\n", blob_check(table, x, y));

        

        system("pause");

        return 0;

}



int blob_check(int pic[N][N], int x, int y)

{

        if (pic[x][y] == 0)

                return 0;

        else

        {

                pic[x][y] = 0;

                

                int sum = 1;

                

                //check 

                if (x>0)

                {

                        sum += blob_check(pic, x-1, y);

                        if (y
                                sum += blob_check(pic, x-1, y+1);

                }

                else if (y
                {

                        sum += blob_check(pic, x, y+1);

                        if (x
                                sum += blob_check(pic, x+1, y+1);

                }

                else if (x
                {

                        sum += blob_check(pic, x+1, y);

                        if (y>0)

                                sum += blob_check(pic, x+1, y-1);

                }                

                else if (y>0)

                {

                        sum += blob_check(pic, x, y-1);

                        if (x>0)

                                sum += blob_check(pic, x-1, y-1);

                }



                return sum;

        }

}

C program for to find optimal path

kirtics344 — Fri, 20 Nov 2009 15:42:07 GMT

Time limit : 10 secs. (The program must produce output for all test cases within the stipulated time)

A spaceship carrying a convention of high ranking officials had a close shave with a meteor. They are now scattered over the surface over a meteor and the spaceship is beyond repair.
Fluke LandCrawler was an emergency replacement for a space rescue mission in the distant galaxy Alfa-Bentauri. You are KHAL – the computer on the land-Rover carrying Fluke. He needs to rescue as many survivors as possible but can’t figure out the best path. Fluke lied about his CompSc. Degree to get in to SpaceTravel Inc; he is banking on you to save his job.
Just to make things worse, Fluke’s shuttle was designed by Elbonians and not tested before being deployed due to this unforeseen emergency. You now find that the “Back”, “Left”, “Right” and “Fwd” buttons on the shuttle are unintuitive to say the least:
e.g. if Fluke’s Rover is in the slot marked as FL below (facing east), there are 4 possible slots that he can move to (shown in Blue). In short, it can not move back (towards the west) and is always facing east. He can only rescue people by moving to the slot that they are standing in.

Each survivor of the crash has a rank R (1<= R <= 5) e.g. some are Chancellors Rank5 and at the other end of the spectrum are Guards Rank1.
Determine the optimal path – that can
- save a group of people with the maximum total rank. High ranking officials are key to maintaining peace across various factions in the federation. Guards are sworn to protect them and will stay behind if required.
- If you have one optimal path, you should tell Fluke the command seq for the same. If more than one path is optimal, you should tell Fluke all the possible command seq and let him decide
- Time is of the essence – it is critical that the people be rescued as quickly as possible.

Input
- The first line contains n where n is the side of the square grid on which the rover will move. 4 <= n <= 100. Top-left co-ordinate is (0,0) and bottom right co-ordinate is (n-1, n-1)
- The next line is the number of test cases n (2 in the example below) that follow (< 5). Each test case is comprised of a number of lines.
o The first line of the test case contains the position where the space rover is beamed down/placed initially (facing east).
o The next line contains the number of survivors, k.
 This is followed by k lines, each having 3 integers relevant to each survivor. E.g. 1 3 5 indicates that there is a survivor at (1,3) and has Rank 5.

4
2
0 1
4
1 3 5
2 0 5
2 2 1
3 2 3
0 1
5
1 3 5
2 0 5
2 2 5
3 0 5
3 2 3

The test cases represent the following scenarios respectively.

Output
You should print out the results to console (via printf or equivalent)
For each test case, output the maximum cumulative rank of people you can save as the first line. That is to be followed by the command seq (1 or multiple) for the path(s) – See the example below.
8
LB
BL
10
RF

Explanation:

Rules:
• Your program must accept a string as a command line argument. It should then proceed to open the file of that name in the same/current directory, which contains one or more test cases. Output should be printed to console via printf (or equivalent).
• The program will not expect any user input. Please test your program for compile / run time errors before submitting.
• You may submit multiple submissions – strive for solutions that are elegant, memory and time efficient.
• The time limit if specified is for all the test cases to be executed; the time limit is NOT per test case

Attached Files

BIQ-004-KHAL_222.doc (50.5 KB)

Interesting C program for Accelerator

kirtics344 — Fri, 20 Nov 2009 15:33:44 GMT

You’ve been given an assorted set of gears. Each gear has a different number of teeth – the notches on a gear that interlock with notches on another gear to transmit speed. You have a couple of belts one coupled to an input and the other for the output. You are given the rpm of the input belt Si and a minimum value So (where So > Si) so that you can increase the speed via a system of gears as shown above
You need to figure out all the possible pairs of gears that can be used to achieve an output rpm >= So.
Input
The input is specified in a file containing test-cases.
• The first line contains the number of gears that are available to you, g.
• The next line contains g numbers indicating the number of teeth on each gear, separated by spaces.
• The next line contains the number of test cases – n
o This is followed by n test cases. Each test case is specified by 2 speed values on a single line. (So here the first test case specifies that you need to design a gear-system that increases Si = 50 rpm to a value above 200 rpm)
7
20 10 4 6 40 25 100
2
50 200
35 75

Output
9
15

E.g. for raising the speed from 50 to 200, any of the following 9 pairs can be used
[100, 6] [40, 6] [25, 6] [25, 4] [20, 4] [40, 4] [100, 4] [100, 20] [100, 10]

Rules :
• Your program must accept a string as a command line argument. It should then proceed to open the file of that name in the same/current directory, which contains one or more test cases. Output should be printed to console via printf (or equivalent).
• The program will not expect any user input. Please test your program for compile / run time errors before submitting.
• You may submit multiple submissions – strive for solutions that are elegant, memory and time efficient.
• The time limit if specified is for all the test cases to be executed; the time limit is NOT per test case
* We would compile your program into an executable and run it (e.g. c:\>X.exe TestCases.txt)

How to create a dynamic array in recursion?

beatenbob — Fri, 20 Nov 2009 12:55:13 GMT

Hi all. Just a simple question but I SERIOUSLY need some help from you guys for my programming assignment.

The assignment given was water jug problem.

Now my question is, does C allow for the creation of dynamic array during a recursion?
Suppose I have another function, which returns a value (well in my case the function returns a character), and I'm gonna store the character into a dynamic array(which in the current function). This means that the dynamic array is constantly "enlarged" as long as another function returns a value to the current function where the dynamic array is located. If the other function stops returning a value, the whole process stops.

Thanks in advance.

Standards & Implementations

Iam3R — Fri, 20 Nov 2009 08:56:56 GMT

Hi ,
this one is with respect to C.
(i)
when we use array an array index always starts from zero .
is it a standard one? or compilers are implemented that way?
if compilers are implented that way they must have followed some standard.
(ii)
the array name cannot be changed is it the standard or compiler dependent.

i have never heard that array index starts from 1 and base address can be changed.

Thanks,
Danian

errors in C program..plz help

sahasra — Fri, 20 Nov 2009 05:57:06 GMT

Hi,
I am new to this site.
Can you please help me with this. I have written a C program and i m getting the following errors
1) " 'puts' was not declared in scope "
the same error for 'gets' and 'itoa' command...i have included stdio.h,string.h,stdlib.h,math.h as the header files
2)" expected constructor , destructor or type conversion before '=' token " ......for the code k=1.92 ....i have declared 'k' as a float
3) expected ',' before '}' token

kindly clear my queries
Thank you,
sahasra.

A challenging problem in Recursion

Tamaki — Fri, 20 Nov 2009 04:30:08 GMT

At least for me it is:)
This is an assignment problem and I can really use some help!

INTRO TO PROBLEM:
So the problem is a basic logic problem, where I'm sure you're all familiar with...
From my assignment page, the problem

Imagine that you have 2 jugs, a small one and a large one, with integer capacities of sCap

and lCap gallons, respectively (sCap < lCap). Initially both jugs are empty. You are

allowed to completely fill each jug from a tap, or empty them on the ground. You can also

pour one jug into the other: pouring stops when either the receiving jug is full or no water is left

in the pouring jug (i.e. no water is spilled). Note that each pouring action will cause a positive

number of whole gallons to be transferred.

Given two integer values sFinal and lFinal, the problem is to find a valid sequence

of actions such that after performing the actions, the small and large jugs contain exactly

sFinal and lFinal gallons of water, respectively.

WHAT I NEED HELP ON
Basically I have a few functions that are ready to be used...
I will attach a .c file at the end of this post for the code...
I took a long time checking over this post and adding comments, any sort of help on recursion is appreciated...
I just don't understand how to start this recursion

#include 

#include 

#include 

#include 

#include 



char  *solve(const char curSequence[], int sCur, int lCur, int sCap, int lCap, int sFinal, int lFinal);

void prettyPrint(const char solution[], int sCap, int lCap);

bool actionIsPossible(char action, int sCur, int lCur, int sCap, int lCap);

void getUpdatedJugsAmounts(char action, int sCur, int lCur, int sCap, int lCap, int *sUpdated, int *lUpdated);

bool occurs(const char curSequence[], int sVal, int lVal, int sCap, int lCap);

bool applyAction(char action, const char curSequence[], int sCur, int lCur, int sCap, int lCap, char updatedSequence[], int *sUpdated, int *lUpdated);



//a testing main method that was given

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

{

  int sCap, lCap, sFinal, lFinal;

  if (argc < 5)

  {

    printf("Usage: jugs smallCapacity largeCapacity smallFinal largeFinal\n");

    return 0;

  }

  sCap = atoi(argv[1]);

  lCap = atoi(argv[2]);

  sFinal = atoi(argv[3]);

  lFinal = atoi(argv[4]);*/



  char *solution;

  solution =  solve("", 0, 0, 3, 4, 0, 2);

  printf("The solution is: %s\n", solution);

  if (strcmp(solution, "Not Found") != 0)

     prettyPrint(solution, sCap, lCap);



  free(solution);

  return 0;

}

//This is the function I'm having trouble with...

//Basically this function should follow this idea

////////////////////////////////////////////////////////////////////////

/*char *solve(curSequence, curConfig, capacities, finalConfig)

//        if the current configuration == the final configuration then

//                it means that no further action is needed so simply

//                allocate space and return a copy of curSequence as the solution

//        else

//                pick one of the 6 actions and apply it to the curConfig

//                (you may want to call applyAction)

//                if the action is applicable (i.e. it is possible and it

//                does not create a cycle) and a recursive call to

//                solve(updatedSequence, updatedConfig, capacities, finalConfig)

//                returns a solution then return this solution

//                otherwise clean up any dynamically allocated spaces and if any

//                un-tried action is left, then try it (as above)

//                if no more action is left to try then

//                allocate space and return the string "Not Found".8?*/

//////////////////////////////////////////////////////////////////////

///////////////////my crappy recursion////////////////////////////////

char *solve(const char curSequence[], int sCur, int lCur, int sCap, int lCap, int sFinal, int lFinal){

        if (sCur == sFinal && lCur == lFinal) {

                int i;

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

                char *solution = (char *)malloc(i*sizeof(char *));

                strcpy(solution,curSequence);

                return solution;

        }

        else {

            char *solution = (char *)malloc(sizeof(char *));

            printf("here\n");

            char *curAct = (char *) malloc (sizeof(char *));

            char god[] = {'f', 'F', 'p', 'P', 'e', 'E'};

            int i;

            for(i = 0; i < 6; i++){

            if(applyAction(god[i], solution, sCur, lCur, sCap, lCap, curAct, &sCur, &lCur)){

                curAct = solve(solution, sCur, lCur, sCap, lCap, sFinal, lFinal);

                printf("recur\n");

            }

            else

                free(curAct);

            strcat(solution,curAct);

            return solution;

        }

               solution = (char *)malloc(sizeof(char)*(strlen("Not Found") + 1));

        strcpy(solution,"Not Found");

        return solution;

}

//A simple print method in the format  A1  so on

void prettyPrint(const char curSequence[], int sCap, int lCap){

        int i, j = strlen(curSequence)+1;

        int s = 0, l = 0;

        for(i = 0 ; i < j; i++){

                printf("<%d,%d> ", s, l);

                getUpdatedJugsAmounts(curSequence[i], s, l, sCap, lCap, &s, &l);

                printf("%c ", curSequence[i]);

        }

}

//There are certain restrictions on which action is possible at a given configuration

//returns true if possible, false otherwise

bool actionIsPossible(char action, int sCur, int lCur, int sCap, int lCap){

    bool final = false;

    if (action == 'f' && sCur < sCap){final = true;} //the small jug is not already full

    else if (action == 'F' && lCur < lCap){final = true;} //the big jug is not already full

    else if (action == 'p' && sCur > 0 && lCur < lCap){final = true;} //the small jug is not empty AND the big jug is not full

    else if (action == 'P' && lCur > 0 && sCur < sCap){final = true;} //the big jug is not empty AND the small jug is not full

    else if (action == 'e' && sCur > 0){final = true;} //the small jug is not already empty

    else if (action == 'E' && lCur > 0){final = true;} //the big jug is not already empty 

    return final;

}

//calculated the new amounts and returns them through pointers

void getUpdatedJugsAmounts(char action, int sCur, int lCur, int sCap, int lCap, int *sUpdated, int *lUpdated){

    *sUpdated = sCur; *lUpdated = lCur;

    if (action == 'f'){*sUpdated = sCap;}

    else if (action == 'F'){*lUpdated = lCap;}

    else if (action == 'p'){for (; lCur < lCap && sCur > 0; sCur--, lCur++);*sUpdated = sCur; *lUpdated = lCur;}

    else if (action == 'P'){for (; sCur < sCap && lCur > 0; lCur--, sCur++);*sUpdated = sCur; *lUpdated = lCur;}

    else if (action == 'e'){*sUpdated = 0;}

    else if (action == 'E'){*lUpdated = 0;}

}

//If the given sequence does not for a repeated config/cycle

//ie: if you start wiht <0,0> and perform PP on sCap = 3 lCap = 4, first <0,4> then <0,4>, which gives u a repeated configuration...

//returns true if there is a repeated config, false otherwise

bool occurs(const char curSequence[], int sVal, int lVal, int sCap, int lCap){

    int i, j = strlen(curSequence)+1;

    int sCur = 0, lCur = 0;

    bool final = false;

    if (sVal == 0 && lVal == 0){final = true;}

    for (i = 0; i < j ; i++){

         //printf("%d = %d %d = %d\n",sCur,sVal,lCur,lVal);

        if (actionIsPossible(curSequence[i], sCur, lCur, sCap, lCap)){

                getUpdatedJugsAmounts(curSequence[i], sCur, lCur, sCap, lCap, &sCur, &lCur);

                if (sCur == sVal && lCur == lVal){final = true;}

        }

}

    return final;

}

//apply the action, update the sequence with the new action, and pass the new values back with points and the updated sequence with the array.

//return true if the action is possible and does not cycle, false otherwise

bool applyAction(char action, const char curSequence[], int sCur, int lCur, int sCap, int lCap, char updatedSequence[], int *sUpdated, int *lUpdated){

        bool final = false;

        strcpy(updatedSequence,curSequence);

        int s = 0, l = 0;

        const char act[2] = {action};

        if (actionIsPossible(action, sCur, lCur, sCap, lCap)){

                getUpdatedJugsAmounts(action, sCur, lCur, sCap, lCap, &s, &l);

                if (!occurs(curSequence, sCur, lCur, sCap, lCap)){

                        *sUpdated = s;

                        *lUpdated = l;

                        updatedSequence = strcat(updatedSequence,act);

                        final = true;

                }

        }

        return final;

}

Thank you again for any help!

Attached Files

Waterjugs.c (6.7 KB)

round robin

lathachowdary — Fri, 20 Nov 2009 04:25:11 GMT

i want program for round robin in c

left operand of -> has incompatible type

agentmusic — Thu, 19 Nov 2009 21:40:32 GMT

Hello

Im trying to compile the following code but I get the error "left operand has incompatible type" because of the line:

test2_2_U->Out2= test2_2_U->Out3;

I have been looking through the forum but I couldnt find a hint what Im doing wrong. Any hint is appreciated.

Thanks Thomas

static BlockIO_test2_2 test2_2_B;      /* Observable signals */

static D_Work_test2_2 test2_2_DWork;   /* Observable states */

static ExternalInputs_test2_2 test2_2_U;/* External inputs */

static ExternalOutputs_test2_2 test2_2_Y;/* External outputs */



void rt_OneStep(RT_MODEL_test2_2 *test2_2_M)

{

 

 test2_2_step(&test2_2_B, &test2_2_DWork, &test2_2_U, &test2_2_Y);

 test2_2_Y->Out2=  test2_2_Y->Out3;



}

where test2_2_U is defined as:



   66   typedef struct {

   67     real_T Out1_f;                       /* '/Out1' */

   68     real_T Out2;                         /* '/Out2' */

   69     real_T Out3;                         /* '/Out3' */

   70     real_T Out4;                         /* '/Out4' */

   71   } ExternalOutputs_test2_2;

   72

Problem with permuting bits

kolosick.m188 — Thu, 19 Nov 2009 20:44:04 GMT

I am having a slight problem implementing this code. What I need to do is take a list of 16 unsigned characters and permute the bits according to IPTable. 0 in IPTable refers to bit 0, 1 refers to bit 1, etc. Here is my code which isn't working.

unsigned char IPTable[128] = {0, 32, 64, 96, 1, 33, 65, 97, 2, 34, 66, 98, 3, 35, 67, 99, 4, 36, 68, 100, 5, 37, 69, 101, 6, 38, 70, 102, 7, 39, 71, 103, 8, 40, 72, 104, 9, 41, 73, 105, 10, 42, 74, 106, 11, 43, 75, 107, 12, 44, 76, 108, 13, 45, 77, 109, 14, 46, 78, 110, 15, 47, 79, 111, 16, 48, 80, 112, 17, 49, 81, 113, 18, 50, 82, 114, 19, 51, 83, 115, 20, 52, 84, 116, 21, 53, 85, 117, 22, 54, 86, 118, 23, 55, 87, 119, 24, 56, 88, 120, 25, 57, 89, 121, 26, 58, 90, 122, 27, 59, 91, 123, 28, 60, 92, 124, 29, 61, 93, 125, 30, 62, 94, 126, 31, 63, 95, 127};



void IP(unsigned char * input, unsigned char * output)

{

        unsigned char i;

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

        {

                output[i / 8] ^= (128 >> (IPTable[i] % 8)) & input[IPTable[i]];

        }

Thanks for the help. By the way this code definitely won't work if output isn't set to all zeroes, I already know that and that isn't the error.

shell programming in c

dena — Thu, 19 Nov 2009 18:09:39 GMT

hi
please can any one help me in my shell project
like this :

Develop a c program which serve as s shell interface that accepts user command and then executes each command in separate process. The shell interface provides a command prompt ( sh> ) after which next command is entered .

#define TRUE 1 



while(TRUE){ //repeat forever 

  type_prompt(); //display prompt on the screen 

  read_command (command, parameters); //read input from terminal 

  if(fork()!=0){ //fork off child process 

  waitpid(‐1, &status, 0); //wait for child to exit 

  } 

else{ 

  execve(command, parameters, 0); //execute command 

  } 

}

Write a shell that is similar to the above code snippet, but contains enough code that it actually works so you can test it. You may also add some features such as redirection of in input and output, pipes, and background jobs.
If the user entered “& “ at the end of his/her command, then the process (command) will be executed in the background and the shell WILL Not WAIT It To Terminate.
You can experience background process yourself by trying the following command on bash shell.
> kwrite
The kwrite application will be run, and the shell prompt will not prompt a user until you terminate kwrite. On the contrary, if you tried the following command, the prompt will return to the user to accept other commands while kwrite (child process) is running in the background!
please

Code Snippet Linked List

xavier666 — Thu, 19 Nov 2009 05:52:48 GMT

This is just a linked list program for those who need help understanding the fundamentals. Put comments if you find some bugs.
The program is about maintaining a student database (their roll number and their age)
I've used Turbo C++ 4.5 as the compiler

:icon_cool:

Comparing different lines in a file

flipjoebanana — Thu, 19 Nov 2009 04:31:55 GMT

Hello,
If I want to say compare a line at a given line number to another line at a different given line number how can I do this? I know I could iterate through the file and store the lines into a data structure and perform comparisons that way but the file is very large and was wondering how I could avoid that without taking up more memory? Or any other thoughts, thanks.

help with adding primes

eskaflowne — Thu, 19 Nov 2009 03:23:39 GMT

now I have never posted before so I hope this is in the right spot/format..

this problem is driving me insane. I need prove the Goldbach conjecture that is, "every even integer n > 2 is equal to the sum of 2 prime numbers." Then with a starting point and ending point prove this. (Ei: start at 2 end at 10 => 2 = 1 +1, 4 = 1 + 3....10 = 5 + 5)

The problem that I have is that I cant seem to figure out what is wrong with my code. When I run it the loop jumps over some intervals that it couldn't find a prime for and I just don't really know how to fix this as well as making the intervals go up 2 instead of 1 without a syntax error.

now this is what I have so far...

#include 

#include 

#include 





/* function to create a random number */



int randomInteger(int low, int high)

{

        static short firstRun = 1;

        int offset;

        if(firstRun)

        {

                //If this is the first call to this procedure, randomize the seed

                srand(time(NULL));

                //and set first run to 0 so we know its  been run

                firstRun = 0;

        }

        offset = low;

        low = 0;

        high -=offset;

        return ((rand()%high)+offset);

}





/* function to see if a number is prime */



int prime_check(int num)

{

        int i;

        int check = 0;



        for(i=1;i<=num;i++)

        {

                if(num % i == 0)

                {

                        check = check +1;

                }

        }



        if(check == 2)

        /* printf("number is prime\n"); */

        return 1;



        else

        /*printf("number is not prime\n");*/

        return 0;

}









int main()

{

        int a,b,i;

        int prime1, prime2;

        int start = 2;

        int end = 20;





        for(i = start; i <= end; i++)

        {

                prime1 = randomInteger(1,i);



                a = prime_check(prime1);



                if(a==1)

                {

                        prime2 = (i - prime1);



                        b = prime_check(prime2);



                        if(b==1)

                        printf("%d = %d + %d\n", i, prime1, prime2);



                        else

                        randomInteger(1,i);

                }



                else

                randomInteger(1,i);





                /*lets me see what numbers the program skipped*/



                printf("%d\n", i);





        }



        return 0;

}

when I compile and run it I get something that looks like this...

2
3
4 = 2 +2
5 = 3 +2
6
7 = 5 + 2
8 = 5 + 3
9
10 = 5 +5
11
12
13
14 = 7 +7
15
16
17
18 = 5 + 13
19 = 17 + 2
20

Hash and Rehash

MeBjess — Thu, 19 Nov 2009 01:32:49 GMT

I have been working on a basic accounting program, the accounts were supposed to be stored in a array, but I never got that part of the program working. Is there anyway I can get a sample of hash code that would help me understand what I need to do? In my case, I am trying to get the account numbers to be stored in the hash array (that's how he worded it in class). I have searched through my book for the class and I did not find anything about hashing.

Any tips, tricks, or code sample would be appreciated.

Thanks in advance!

decimal to binary, palindrome!

lisedaton — Wed, 18 Nov 2009 22:58:27 GMT

hi all!!,

can somebody help me??

I need to do a program that scan a decimal, transform it to binary and check if it is palindrome or not and print "palidrome" or "not palindrome"....

i can only use functions and cant use arrays or anything else!

can somebody help me???
these week i got really sick and i need to give that in and im blank!!... help!

thanx

read a string input

bufospro — Wed, 18 Nov 2009 20:36:21 GMT

Hi,
I want to make a program that reads a string.
But I would like to read only characters, neither numbers nor special characters(@,#$%^&*()!). Also, no spaces between characters.

#include 

#include 



char *enter_a_string(int maxcharacters)

{



        char *ptr;

        int len;



        printf("Enter string : ");

        char array[50];



        do{

                scanf("%s",array);

                  len = strlen(array);

                        

                if(len > maxcharacters)

                {

                        printf("Maximum %d  characters. Try again : ",maxcharacters);

                }



        }while(len > maxcharacters);



        ptr = array;



return ptr;

}



int main()

{

        char array[50];

        strcpy(array,get_personal_elements(15));

}

Could someone help me please?
Thanks a lot

simple string problem

Ineedhelpplz — Wed, 18 Nov 2009 17:51:07 GMT

So everything in my program works except for the main itself. The program is supposed to take in a file provided through standard input and print out the descending order of words followed by the frequency that they occur. I can do this individually line for line but am having trouble putting it together as a whole to count all the lines and not just one specific line. Here is my code:

blade71(382)% cat test.c

#include 

#include 



#define MAX_WORD_LENGTH    31

#define MAX_TEXT_LENGTH 10000

#define TRUE                1

#define FALSE               0

#define BUFSIZE 100



/* Structure defining a count of the occurrences of a given word */

struct WordCounter

{

 char *word;

 int word_count;

 struct WordCounter *pNext;  /* Pointer to the next word counter in the list */

};



      /* Function prototypes */

void addWord(char *pWord);

/* Adds a word to the list or updates exisiting word */

int is_separator(char ch);

/* Tests for a separator character */

void show(struct WordCounter *pWordcounter);

/* Outputs a word and its count of occurrences */

struct WordCounter* createWordCounter(char *word);

/* Creates a new WordCounter structure */

int getword(char *, int);

/* Self explanitory */

int getch(void);

void ungetch(int);



      /* Global variables */

struct WordCounter *pStart = NULL;

/* Pointer to first word counter in the list */

char buf[BUFSIZE];

int bufp = 0;



main()

{

 char text[MAX_TEXT_LENGTH];    /* Stores input text */

 char buffer[MAX_WORD_LENGTH];  /* Buffer to hold a word */

 size_t i = 0;                  /* Index to text */

 int len = 0 ;                  /* Word length */

 struct WordCounter *pCounter = NULL;  /* Pointer to a word counter */

 printf("Calculating frequency of word occurances:\n");

gets(text); This line only gets the first line.  To get the next I thought I could do something like footnote 1.



/* Extract the words from the text  */

 while(text[i] != '\0')

 {

  /* Skip over separators */

  while(is_separator(text[i]))

  ++i;

  /* It is either the end of the string or the start of a word    */

  /* As long as it is not the string terminator copy the character */

  len = 0;              /* Reset character count    */

  while((!is_separator(text[i])) && (text[i] != '\0'))

  buffer[len++] = text[i++];

  if(len>0)               /* Check we have some characters in the word */

    {

     buffer[len] = '\0';   /* We reached the end of a word so add terminator */

     addWord(buffer);      /* Add the word to the list */

    }

  }

                                                                                 /* List the words and their counts */

 pCounter = pStart;

 while(pCounter != NULL)

  {

   show(pCounter);

   pCounter = pCounter->pNext;

  }

 printf("\n");

 /* Free the memory that we allocated */

 pCounter = pStart;

 while(pCounter != NULL)

  {

   free(pCounter->word);        /* Free space for the word */

   pStart = pCounter;           /* Save address of current */

   pCounter = pCounter->pNext;  /* Move to next counter    */

   free(pStart);                /* Free space for current  */

  }

}



/* Returns TRUE if the argument is a separator character and FALSE otherwise */

int is_separator(char ch)

{

 /* Separators are space, comma, colon, semicolon, double quote, question mark, exclamation, and period */

 static char separators[] = { ' ' , ',',':' , '\"', '?' , '!' , '.'};

 int i = 0;

 for(i = 0 ; i
  {

   if(ch == separators[i])

   return TRUE;

  }

 return FALSE;

}

                                                                                void show(struct WordCounter *pWordcounter)

{

 /* output the word left-justified in a fixed field width followed by the count */

 printf("\n%-30s   %5d", pWordcounter->word,pWordcounter->word_count);

}



void addWord(char *word)

{

 struct WordCounter *pCounter = NULL;

 struct WordCounter *pLast = NULL;

 if(pStart == NULL)

  {

   pStart = createWordCounter(word);

   return;

  }

                                                                                 /* If the word is in the list, increment its count */

 pCounter = pStart;

 while(pCounter != NULL)

  {

   if(strcmp(word, pCounter->word) == 0)

    {

     ++pCounter->word_count;

     return;

    }

   pLast = pCounter;            /* Save address of last in case we need it */

   pCounter = pCounter->pNext;  /* Move pointer to next in the list        */

  }



 /* If we get to here it's not in the list - so add it */

   pLast->pNext = createWordCounter(word);

}



/* Create and returns a new WordCounter object for the argument */

struct WordCounter* createWordCounter(char *word)

{

  struct WordCounter *pCounter = NULL;

  pCounter = (struct WordCounter*)malloc(sizeof(struct WordCounter));

  pCounter->word = (char*)malloc(strlen(word)+1);

  strcpy(pCounter->word, word);

  pCounter->word_count = 1;

  pCounter->pNext = NULL;

  return pCounter;

}

while(scanf("%s",&text[x] != EOF))

{

gets(&text[x]);

x++;

}

However, C being the type dependent pain in the ass that it is...this doesn't work or I'm just unaware of how to cast it to work.

bios.h: No such file or directory

jmangu — Wed, 18 Nov 2009 17:27:36 GMT

Hello,

I'm trying to compile a program related with serial communication via RS232. I've found this program at microsoft page http://support.microsoft.com/?scid=k...1&x=9&y=11#top. When I try to compile this same program in Dev C++ editor the following message appears:
bios.h: No such file or directory. Please, help me about what can I do in order to advance or give me an alternative solution. Thanks in advance.

/* Compile options needed: none

 - The following program is a simple example which sends and receives

   one character to/from COM1:

*/ 



#include 

#include 



void main(void)

{

    unsigned com1_status;

    unsigned com1_send;

    unsigned com1_rec;

    unsigned com1_init;

    int result, mask;



    /* open serial port at 1200 baud, 8 data bits,

    ** No parity, 1 stop bit */ 

    com1_init = _bios_serialcom(_COM_INIT, 0,

        _COM_CHR8 | _COM_NOPARITY | _COM_STOP1 | _COM_1200);

    printf("Init status: 0x%4.4X\n", com1_init);



    /* send an '*' to com1 */ 

    com1_send = _bios_serialcom(_COM_SEND, 0, '*');

    printf("Send status: 0x%4.4X\n", com1_send);



    mask = 0x6100;

    /* value used to mask:

    *    bits 0-7 are related to modems,

    *    bits 8-15 are for port status,

    *      check to see that the following bits are set:

    *         8 (data ready)

    *        13 (Transmission-hold  register empty)

    *        14 (Transmission-shift register empty)

    */ 



    /* check the status */ 

    com1_status = _bios_serialcom(_COM_STATUS, 0, 0);

    printf("COM1 status: 0x%4.4X\n", com1_status);



    /* wait until a character is ready */ 

    do {

        /* check the status */ 

        com1_status = _bios_serialcom(_COM_STATUS, 0, 0);



        /* mask off the low order byte of com1_status */ 

        com1_status = com1_status & 0xFF00;

    } while( (mask & com1_status) == 0);



    /* get a character */ 

    com1_rec =  _bios_serialcom(_COM_RECEIVE, 0, 0);

    printf("Read status: 0x%4.4X\n", com1_rec);



    /* print the character we just received */ 

    result = com1_rec & 0x00FF;

    printf("Character: 0x%2.2X  =  %c\n", result, (char)result);

}

Dynamic include in C

ahamed101 — Wed, 18 Nov 2009 17:17:29 GMT

Hi All,
Let me explain the problem.

I have multiple include files as in class1.inc, class2.inc, class3.inc etc. Contents of an include file will be like

class1.inc

{

"john",

12,

68,



"steve",

12,

98,



"mat",

12,

95,



};

This will basically serve as a static array of structures. Here there are three field name(char*), age(int), avg(float).
In my program I want to assign the value of one of these file to a structure variable. My code goes like this

struct std_

{

        char name[50];

        int age;

        float avg;

}

std_str, *std_ptr;



int main(int argc, char **argv)

{

                

        if(!strcmp(argv[2],"class1")

        {

                static std_str obj[200] = 

                #include "class1.inc"

                

                ...

        }

        else if(!strcmp(argv[2],"class2")

        {

                ...        

        }

return 0;

}

The above code will work fine. But what I want is

int main(int argc, char **argv)

{

        char file[50];



        /* I want to dynamically generate the include file name and include it */

        strcat(file, argv[2]);

        strcat(file, ".inc")

                

        static std_str obj[200] = 

        #include file

        

return 0;

}

But unfortunately, the compilation fails, saying #include expects a file name.

Is there anyway to achieve this?

Thanks and Regards,
Ahamed.

Asynchronous Server with threads

siggivara — Wed, 18 Nov 2009 13:20:46 GMT

I'm trying to create a simple server that starts a new thread for each new client that connects. I know I can use fork(), but I've heard that threads are more efficient. Also I have some global queues, so if I used fork(), each process would get their own version of the queues. (I could fix this with shared memory).

But I'm not sure where to implement this in my code.
Heres the pseudocode of my server and main accept() loop:

Global queue1;

Global queue2;





while(1) {

    

    

    

    

}

So I need to know where/how, in my code, to implement threads, and which type of threads to use. It is supposed to run on Linux.
Also I need to know how to synchronize Global queue1 and Global queue2 so that the threads can access and write/delete from them without problems.

How to output all the letters of the alphabet randomly?

Jelmund — Wed, 18 Nov 2009 11:01:40 GMT

Hello people :)

My teacher gave me a new project to work on.
I need to write an application that output all the letters of the alphabet in a random order.
I've made some applications before but im still kinda new to this.
Could any of you give me a hint or put me in the right direction?

Kind regards,
Jelmund

PS: i already searched on the internet

Socket programming in C

george_82 — Tue, 17 Nov 2009 08:11:30 GMT

Hi all,
How to do socket programming in C.I need to control an external device through TCP/IP or UDP/IP so that when I send a query the device should be capable to respond.

Interrupts in C

Mathura — Tue, 17 Nov 2009 04:26:57 GMT

Dear colleagues I am currently working on designing a scheduler using Borland C. I am struck with the concept of interrupts. I am trying clock tick interrupt for task switching. In all materials they say you will continue to your regular job until the interrupt occurs. I don't think it suddenly occurs with out setting it in the context of the task. this is my first project in C. currently my tasks don't have separate stack of their own. all share the same stack. so i will be happy if you people tell me in what way i should update my knowledge.
in my part i will help to you people too.

find the 3rd ',' in a string line

ubi_ct83 — Tue, 17 Nov 2009 02:08:46 GMT

Hi experts,

i have this line of string: a1,b2,c3,a2,b1,c2,a3,b2,c4,

from this line,i want to load into a string array like this:
array[0]=a1,b2,c3,
array[1]=a2,b1,c2,
array[3]=a3,b2,c4,

seriously i have no idea at all.ive done sumthing but looks like rubbish.i really hope dat u experts can help me.

thanks for advance

void seeding()

{

   char seed_array[100];//line of characters in this array

   printf ("seed real=> %s\n",seed);

   char *p=NULL;



   for (int i=0;i<= 100;i++)

   {

       p=strchr(seed,',');

       if (atoi(p)==3)

       {

        strcpy (seed_array[i],p);

        *p='\n';

       }

       printf ("seed array=> %s\n",seed_array[i]);

   }



   printf("seeding test is running!!!!\n");

 }

Starting out using structures . . .

Soileau — Mon, 16 Nov 2009 19:05:26 GMT

#include 



struct poly {

        int len;

        int arr[];

        char *name;

};





int main() {

        int i;

        struct poly p;

        p.len = 45;

        p.arr[3] = {1,1,1};

        p.name = "Josh";



        printf("%d",p.len);

        for(i = 0; p.arr[i] != NULL ; i++)

                printf("%d",p.arr[i]);

        printf("%s",p.name);

        return 0;

}

I tried to make a simple program to see if I understood structures. Apparently, I do not. Haha.

I am getting these error messages when I compile:
struct.c:5: error: flexible array member not at end of struct
struct.c: In function âmainâ:
struct.c:14: error: expected expression before â{â token

Does anyone mind helping me learn what I did wrong and how to fix it?

Thank you!

What is the correct o/p for the following code?

userits — Mon, 16 Nov 2009 17:56:02 GMT

include

void main()

{

int i=5;

int c;

c=i++ + ++i + i++ + --i;

printf("\n%d",i++ + ++i + i++ + --i);

printf("\n%d",c);

}

The o/p that I'm getting is
31
23

while my friend got
34
20.

Also why are the 2 (printf ' c 'and printf 'expression') values different. Is it because printf evaluation is different from how a normal expression would be evaluated?

thanks in advance.

Avegare number of comparisons

timaquerra — Mon, 16 Nov 2009 15:41:41 GMT

Hello,

I have a program which searches for (using binary search) specific word in ordered list and counts number of comparisons it makes until it finds the target!

My problem is: how can I count average of number of comparisons?

Here is how searching function works:

int binary_search(char *array[], int end, char *target, int *location, int *compare_count){

        

        int first;

        int middle;

        int last;



        first = 0;

        last = end;

        *compare_count = 0;



        while(first <= last){

                middle = (first + last)/2;

                

                if(strcmp(array[middle], target) < 0){

                        first = middle + 1;;

                }

                else if(strcmp(array[middle], target) > 0){

                        last = middle - 1;

                }

                else

                        break;

                (*compare_count)++;

        }



        *location = middle; 

        

        if(first == last) first--;



        return(strcmp(target, array[middle]) == 0);

}

Winsock hooks

lacompsr — Mon, 16 Nov 2009 15:34:14 GMT

I'm looking for code to inject code into a webpage at the specified location. Can we do this using winsock hooks.
Can somebody help me with this. I need this urgently:confused:

Homework: parking problem

Hanyack — Mon, 16 Nov 2009 14:25:13 GMT

im new at C, actually just started programming in general, and im having a good amount of problems with this program.

#include 







int main(void)



{

char vehicle;

char car;

char truck;

int hrsn, minn;

int hrso, mino;

int time;

int rt;

int amo;



printf("What time did you park(military time-(hh,mm))?");

scanf("%d,%d", &hrsn, &minn);



printf("What time did you leave(military time-(hh,mm))?");

scanf("%d,%d", &hrso, &mino);



printf("Where you driving a car or truck?");

scanf("%c", &vehicle );



if (hrsn < (hrso - 1) && minn > mino)

{ hrso = hrso - 1;

mino = mino + 60;

}

if (mino - minn > 1 && mino - minn < 30)

{

mino - minn = 30;

}



else if (mino - minn > 30 && mino - minn < 60)

{

mino - minn = 60;

}



else {

mino - minn = 00;

}



rt = hrso - hrsn:mino - minn;



if (vehicle == car)

{ scanf("%c", &car);

if (time < 3)

{car = 0;

}

else

{car = 1.5;

}

}





else {

scanf("%c", &truck):

if (time < 2)

{truck = 1;

}

else

{truck = 2.3;

}

}

amo = rt * %c;







}

printf("%c");

Printf("Time in %d:%d\n", hrsn, minn);

Printf("Time out %d:%d\n", hrso, mino);



printf("Parking Time %d\n", time);

printf("Rounded time %d\n", rt);



printf("Ammount Owed $ %d\n", amo);





return 0;





}

im trying to do this:

Problem 2: (P) Write a C program to calculate the parking fare for customers who park their cars in a parking lot when the following information is given:
a. A character showing the type of vehicle: C for car, T for truck.
b. An integcr between 0 and 24 showing the hour the vehicle entered the lot.
c. An integer between 0 and 60 showing the minute the vehicle entered the lot.
d. An integer between 0 and 24 showing the hour the vehicle left the lot.
e. An integer between 0 and 60 showing the minute the vehicle left the lot.
This is a public lot. To encourage people to park for a short period of time, the management uses two different rates for each type of vehicle, as shown in Table
CAR $0 / hr first 3 hr $1.50 / hr after 3 hr
TRUCK $1 / hr first 2 hr $2.30 / hr after 2 hr
Input data consists of a character and a set of four integers. The character represents type of vehicle and the four integers indicate: Hour entered the lot, Minute entered lot, Hour exited lot, and Minute exited the lot.

Output should be like:

Type of vehicle:
TIME-IN HR:MN
TIME-OUT HR:MN
----------
PARKING TIME HR:MN
ROUNDED TIME HOURS

TOTAL CHARGE $ _____.__

im sure there are alot of mistakes
any help is greatly appriciated

problem in passing strings from array of atring

arsh_arsh — Mon, 16 Nov 2009 10:22:15 GMT

i have a problem in which i have to remove char from strings by sending one string and char ata time to a function.
in the below code it works fine for first string but for each successive string initial characters are not passed ..like for second call first chatcter of string will not be passed and so on.

#include 

#include 



#define MAXLEN 100

void fnRemChar(char*,char);

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

{



    system("clear");

    int iNoOfStr;

    char acInpStr[MAXLEN][MAXLEN];

    char cChar;

    printf("\nEnter number of strings to be entered(should not be greater than %d):",MAXLEN);

    fflush(stdin);

    scanf("%d",&iNoOfStr);

    void (*REMOVE) (char* ,char);



        /* REMOVE Pointer to Function fnRemChar */

        REMOVE = fnRemChar;



    for(int iCount=0;iCount
    {

        printf("\n ENTER %d String: ",iCount+1);

        getchar();

        fgets(acInpStr[iCount],MAXLEN,stdin);

        fflush(stdout);

        fflush(stdin);

    }

    printf("\n Enter character to be removed: ");

    scanf("%c",&cChar);



    for(int iCount=0;iCount
    {

        REMOVE(acInpStr[iCount],cChar);

    }

}

void fnRemChar(char *acInpStr,char cChar)

{

    char acFinalStr[MAXLEN];

    int iCount=0,iCount1=0;

    while(acInpStr[iCount]!='\0')

 if(acInpStr[iCount] != cChar)

        {

            printf("\n %c",acInpStr[iCount]);

            acFinalStr[iCount1]=acInpStr[iCount];

            iCount1++;

        }

        iCount++;

    }

    printf("\n %s\n",acFinalStr);

}

about recursion

aman rathi — Mon, 16 Nov 2009 09:17:23 GMT

helllo
last day i did program related to recursion that is factorial of numbers i red lot of books in my library but i found only this program only in every book.
i also thought lot on recursion but i did not find any more program please can anybody tell me or can give any clue to do more programs by using this concept.
i do not want program coding i just want question on it or any clue
please help me.

about pointers

aman rathi — Mon, 16 Nov 2009 09:01:06 GMT

hello
i am a student of sgrrits dehradun doing bca now a days my pointers chapter is going on its difficult to understand but mostly i did it but i want to know that how it is use ful for us in the c.
i only find its 1 benefit that is by using pointers you can return two or more values in a function.
please can anybody tell how it is more useful for us and what are that programs that can be excutes by using only pointers?
please also tell me any site or give me any link where i find lot of lot clues to do programs by using pointer.

Code or function for key press like mouse button press

danibootstrap — Mon, 16 Nov 2009 08:29:37 GMT

Hi,

Is there a way to write code or do functions exist for keypress down and keypress up of the keyboard.There are functions for mouseleft button down and mouse left button up.Is it possible with keyboard keys in windows?Like "Alt"+"F" etc...

Any sample code or resource would greatly help.Thanks in advance.

Serial port reading error

george_82 — Mon, 16 Nov 2009 07:18:48 GMT

//The below mentioned code is not working on my C compiler.The //errors im getting is :(1)Extra parameter in call to_ inport b_.
//(2)Too few parameters in call to "outport".(line 25)
//(3)Not an allowed type(line 25)

#include

#include

#include



void main()

  {

    char data;

    int choice;

    clrscr();



  printf("Enter the choice to send or receive from COM1::");

  scanf("%d",&choice);





  if(choice==1)

    {

      printf("Enter data to send::");

      scanf("%c",data);

      inportb(0x03f8,data);

    }





  else

    {

data=outport(0x3f8);

printf("reding from  COM1::%d",data);



    }

getch();

}

put void function into loop statement?

timaquerra — Mon, 16 Nov 2009 05:14:33 GMT

is it possible to put void function into loop statement?

Calendar in C program using julian dates

julie_kaz — Mon, 16 Nov 2009 04:21:44 GMT

I need help understanding julian dates.
I am trying to create a program using julian dates where user enters month & year and show the calendar of that month.
I especially don't understand the "int toJulian()"...

here is what I have so far:

#include 

#define START 1900 //fixed year



//PROTOTYPES here



void main(void)

{

        int day, month, year, startDay, numDays;

        numDays = 0;

        startDay = 1;

        day = 0;

        getMonthYear(&month, &year);

        toJulian(month, day, year);

        yearsToDays(year);

        printCalendar(startDay, numDays);

}

void getMonthYear(int *month, int *year)

{

        printf("Enter month: ");

        scanf_s("%d", month);

        printf("Enter year: ");

        scanf_s("%d", year);

        printf("\n"); 



}

int toJulian(int month, int day, int year) //takes calendar date and calculates its julian day within the year

{

        int count;

        for(count = 1; count < month; ++count)

                day =+ daysInMonth(month, year);

        

}

int daysInMonth(int month, int year) //takes a month and year and calculates how many days are in this particular month

{

        int numDays;

        if (month == 1)

                numDays = 31;

        else if (month == 2)

                numDays = 28 + leapYear(year);

        else if (month == 3)

                numDays = 31;

        else if (month == 4)

                numDays = 30;

        else if (month == 5)

                numDays = 31;

        else if (month == 6)

                numDays = 30;

        else if (month == 7)

                numDays = 31;

        else if (month == 8)

                numDays = 31;

        else if (month == 9)

                numDays = 30;

        else if (month == 10)

                numDays = 31;

        else if (month == 11)

                numDays = 30;

        else if (month == 12)

                numDays = 31;

}

int leapYear(int year) //takes year and returns 1 if leap year otherwise 0

{

        if (year % 400 == 0)

                return 1;

        else 

                return 0;

}

long yearsToDays(int year) // takes year returns the number of days from 1/1/1900 to end of previous year.

{

        int count;

        long days;

        for(count = START; count < year; ++count)

                days = 365 + leapYear(year);

}

void printCalendar(int startDay, int numDays)

{

        int num, dayid;

        printHeader();



}

void printHeader()

{

        printf("SUN MON TUE WED THU FRI SAT\n");

}

need help with pointers

hosh — Mon, 16 Nov 2009 03:24:23 GMT

Hi
i'm trying to compile this code, but getting warning. need some help to understand what I'm doing wrong.

void printGraph(FILE *out, GraphRef G){

out = fopen (out, "w");
if( out==NULL ){
printf("Unable to open file %s for writing\n", out);
exit(1);
}
}

warning: passing arg 1 of `fopen' from incompatible pointer type

Code Snippet fseeko64() and ftello64() for deal with large files (eg. file dimension)

AuSsIeStOnE — Sun, 15 Nov 2009 23:39:01 GMT

fseek() and ftell() work only for files < 2,147,483,647 bytes

fseeko64() and ftello64() from can deal with files up to 18,446,744,073,709,552,000 bytes

the printf format for unsigned long long val is %I64d

eg. Obtaining the file dimension (this code was tested with GNU GCC compiler (MinGW/Cygwin) from code::blocks)

stdio.h function body

ybean4 — Sun, 15 Nov 2009 19:14:01 GMT

stdio.h only includes function declarations. Where does the compiler look for the function bodies?

Weird characters with char pointer

neithan — Sun, 15 Nov 2009 16:18:22 GMT

Hi, i'm facing a weird behavior in this code that i just wrote. It was supposed to read a string from stdin and just write it out.
I've debugged it and for me it reads perfectly, but in the while (line 38), *p just seems to be taking weird chars although it's pointing to the correct mem address (checked with those printf i put).
What's going on?

#include 

#define LONG 100



char * leer();

void printar(char *);



int main()

{

    printf("Insert a string: ");

    //char *str = leer();

    printar(leer());

    return 0;

}



char * leer()

{

    char str[LONG], *p;

    int c;

    p = str;



    while((c = getchar()) != EOF)

    {

        if(c == '\n')

        {

            *p = 0;

            break;

        }

        *p = c;

        printf("p = %p, *p = c = %c\n", p, *p);

        p++;

    }

    return str;

}



void printar(char *str)

{

    char *p = str;

    while(*p != 0)

    {

        printf("p = %p, *p = %c\n", p, *p);

        putchar(*p);

        p++;

    }



}

Help with a network design problem

rt.arti — Sun, 15 Nov 2009 15:47:35 GMT

Hello All!

I have been working on a network design problem and am having a problem in the following part-

What I am trying to do here --
{
for every set of edges (a,b),
{ for all arcs (l,m)
assign length of -- arc [l,m] = edge [a,b][l,m]
shortest_path (num_nodes, arr_nodes, source);
}
----------------------------------------------------------------------------
Part of the Code which does the above looks like this -

for ( node = arr_nodes; node < arr_nodes + num_nodes; node++ )

{

edge_tail = (node - arr_nodes) + min_node;



for ( arc_pointer = node -> first; arc_pointer != (node+1) -> first; arc_pointer++ )

{

edge_head = ((arc_pointer -> head_edge) - arr_nodes) + min_node;



for ( node1 = arr_nodes; node1 < arr_nodes + num_nodes; node1++ )

{

tail_arc = tail1[count1];



for ( arc_pointer1 = node1 -> first; arc_pointer1 != (node1+1) -> first; arc_pointer1++ )

{

head_arc = ((arc_pointer->head_edge)-ndp)+nmin;

printf ( " Tail_Edge = %2ld Head_Edge = %2ld Tail_Arc = %2ld Head_Arc = %2ld Length = %4lf\n", edge_tail, head_in, tail_arc, head_arc, ta->len );

arc_pointer1 -> length = weight2[edge_tail][edge_head][tail_arc][head_arc];

shortest_path (num_nodes, arr_nodes, source);

}

count1++;

}

}

}

As of now it gives segmentation fault while displaying output at the print statement.

Kindly guide me in knowing what is wrong in my coding so that it could give the desired result.

Thanks!

I need 2d array program

dipisahu — Sun, 15 Nov 2009 14:57:38 GMT

i need 2d array programm

How to draw lines or circle (graphics) onto windows screen?

danibootstrap — Sun, 15 Nov 2009 12:34:20 GMT

Hi ,

Is there a way that I can draw lines or circles etcc..(graphics) onto windows screen?

Please let me know.Sample code would greatly help.

How to open and external file or program using C

danibootstrap — Sun, 15 Nov 2009 12:31:41 GMT

Hi,

I want to write code for opening an external file or program from the C program.Could anyone tell me how to do this?

Say if I want to open calculator.exe I mention the path in the program and it should open it or say if I want to open "image.jpg" with the default program...How shall I do this?

Any sample code would be of great help.

Thanks in advance

Operarors in C?

jk2005.jeeva — Sun, 15 Nov 2009 10:00:41 GMT

Hi

Anyonem, could you please explain clearly about the order of evaluation of increment, decrement operators in an expression in C?

Thanks in advance..

problem with struct creation

bufospro — Sun, 15 Nov 2009 09:06:11 GMT

Hi,
I would like to make a database with users.
But I take errors in the function

Could someone help me please?

My code is :

typedef struct user user;



int id2=0;



struct user

{

   char name[20];

  char last[20];

  int id;

};



int function(user* users, int id, char name[], char surname[]){

user* u = users+id2;

strcpy(u->name,name1);

strcpy(u->surname,surname1);

u->id=id2;

}



main()

{

  char name1[20];

  char surname1[20];

  users[50];



if(function(users, id,name1,surname1))

    ++id2;



// and then I would like to print name,surname,id form created struct ..... ??

}

Thanks a lot

error C2059: syntax error : '<'

redroze — Sun, 15 Nov 2009 07:19:01 GMT

hello guys,

I get this error MSG and I can't understand what is the problem with my code. my program consist a menu with 5 options:
1. The program remove double digit from a given number.
2. The program rotate the first number to the right according to the second number.
3. The program checks if the 2 numbers are permmutations of each other.
4. The program search how many times the second number appear in the first number,
9. Exit.

I know it's very long but please try to help me, I really don't have a clue. All programs work fine when I run them in a seperate file but when I put them all together I get this error so I assume there's something wrong with the menu.

cheers,
Elad.

Attached Files

site.txt (4.9 KB)

Need Help Translating

vampgirl13 — Sun, 15 Nov 2009 03:56:57 GMT

Hi,
I was wondering if anyone can help me translate this into java.
Thanks

#include "Element.h"

#include 



element * Element(int s1, int w1, double c1, int x1, int k1)

{

        element * retval = malloc(sizeof(element));

        retval->s = s1;

        retval->w = w1;

        retval->c = (float) s1 / (float) w1;

        retval->x = x1;

        retval->k = k1;

        return retval;

}

typedef struct

{

        int s; //value of coin

        int w; // weight of coin

        float c; // (s / w) 

        int x; // number of coin to be used

        int k; // index of coin of this value in S[n]

} element;



element * Element(int s1, int w1, double c1, int x1, int k1);

#include "externals.h"



int B = 7;

int n = N;



int S[N] = {4, 1, 3};

int X[N];

int W[N];



element * A[N];

element * Solution[N];

#include "Element.h"

#include 

#include 



#define N 3



#define new 

#define BOOL int

#define FALSE 0

#define TRUE 1





extern int B;

extern int n;



extern int S[N];

extern int X[N];

extern int W[N];



extern element * A[N];

extern element * Solution[N];

#include "functions.h"

#include 

#include 

#include 





/**************************************************************

 Algorithm:                Sort

 

 Parameters:                an array of pointers to element objects.

 

 Description:        algorithm looks at the "value density" (c) of 

 the objects and sorts them upon that parameter

 in non-increasing order.

 

 Side Effects:        algorithm modifies global array "A"

 parameter is technically not used, but

 replacement of "A" with the parameter

 will cause effect to be on the parameter

 this is strictly unecessary in this particular

 algorithm

 **************************************************************/

void Sort(element * array[])

{

        element * largest;

        int i, j;

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

        {

                largest = A[i];

                for (j = i; j < n; j++) 

                {

                        if (A[j]->c > largest->c)

                        {

                                largest = A[j];

                                A[j] = A[i];

                                A[i] = largest;

                        }

                }

        }

}









/**************************************************************

 Algorithm:                Greedy

 

 Parameters:        A "remainder" (number to be consumed), and an

 integer "i" marked as a starting index for

 manipulations on global array.

 

 Description:        A greedy algorithm to increase the concentrations

 of each object in the sorted array to consume as

 much of the remainder as possible given the

 starting element lovcated at the index.

 

 Side Effects:        The algorithm modifies both global arrays "A" 

 (necessarily) and "Solution" (conditionally). 

 Producing viable solutions to the value partitioning

 problem, and replacing the global solution

 if the local one is more efficient based on the

 constraints of the problem.

 **************************************************************/

void Greedy(int remainder, int i)

{

        int number;

        number = floor(remainder / A[i]->s);

        

        A[i]->x = number;

        if (totalValue(A, 0, N-1) == B) 

        {

                if (!Solution[0] || totalWeight(A, 0, N-1) < totalWeight(Solution, 0, N-1)) 

                {

                        copyArr(A, Solution);

                }

                return;

        }

        else if (i == (N-1))

        {

                return;

        }

        else 

        {

                Greedy((remainder % A[i]->s), (i+1));

        }

}





/**************************************************************

 Algorithm:                Backtrack

 

 Parameters:        Integers "start" and "stop" marking the indicies

 of the global array "A" over which the algorithm

 will operate during its call. 

 

 Description:        A backtracking algorithm, assuming a pre-sorted

 array in "locally greedy" (between the indicies) 

 concentrations. The algorithm moves slowly between

 start and stop, from right to left, decrementing 

 the concentration of the object at the current

 index, calling Greedy() from that point. This

 forces a trace over the entire permutation space

 of all viable solutions. Comparisons to the global

 solution array, as described in documentation above,

 are performed in Greedy(). The algorithm recurses

 until the entire solution space between the indicies

 is mapped. Then returns control to the calling

 function. (In terminus, main())

 

 Side Effects:        The algorithm modifies global array "A" directly

 and "Solution" indirectly by calling Greedy()

 which has this known side effect.

 **************************************************************/

void Backtrack(int stop, int start)

{

        int dec_pos = start;

        while (TRUE) 

        {

                if (dec_pos < 0) 

                {

                        return;

                }

                if (A[dec_pos]->x != 0) 

                {

                        A[dec_pos]->x--;

                }

                else 

                {

                        dec_pos--;

                        continue;

                }

                Greedy(B-totalValue(A, 0, dec_pos), (dec_pos + 1));

                Backtrack((dec_pos + 1), N-2);

                if (dec_pos != stop)

                {

                        dec_pos--;

                }

                else 

                {

                        break;

                }

        }

}





/**************************************************************

 Algorithm:                totalValue

 

 Parameters:        An array of pointers to element objects

 two integers start and end.

 

 Description:        Computes the total value of the objects between

 the indicies given their concentrations and

 individual values.

 

 Side Effects:        None

 **************************************************************/

int totalValue(element * array[], int start, int end)

{

        register int i;

        int total = 0;

        element * e;

        for (i = start; i <= end ; i++) 

        {

                e = array[i];

                total += e->s * e->x;

        }

        return total;

}





/**************************************************************

 Algorithm:                totalWeight

 

 Parameters:        An array of pointers to element objects

 two integers start and end.

 

 Description:        Computes the total weight of the objects between

 the indicies given their concentrations and

 individual weights.

 

 Side Effects:        None

 **************************************************************/

int totalWeight(element * array[], int start, int end)

{

        register int i;

        int total = 0;

        element * e;

        for (i = start; i <= end ; i++) 

        {

                e = array[i];

                total += e->w * e->x;

        }

        return total;

}





//prints the entire array to STDIO

void printArr(element * array[])

{

        register int i = 0;

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

        {

                printf("%i, ", array[i]->x);

        }

        printf("\n");

}





//prints elements and their values to STDIO, used for debugging and for useful info

void printElements(element * array[])

{

        register int i;

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

        {

                printf("%i:\n\t%i\n\t%i\n\t%i\n\t%f\n\n", i, array[i]->s, array[i]->w, array[i]->k, array[i]->c);

        }

}



//copies the contents of one array of element objects into another to preserve the values.

void copyArr(element * source[], element * target[])

{

        register int i = 0;

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

        {

                element * old_e = source[i];

                element * new_e = new Element(old_e->s, old_e->w, old_e->c, old_e->x, old_e->k);

                target[i] = new_e;

        }

}





/**************************************************************

 Algorithms:        initialization functions

 

 Parameters:        None

 

 Description:        Computes the weight values for each object based

 on the total function w() given as input in this

 assignment. The array of objects "A" is constructed.

 The first element in "Solution" is set to NULL to 

 prevent a segfault when first checking against the

 total weight in Greedy().

 

 Side Effects:        Global arrays W, A, and Solution are modified.

 **************************************************************/



void initialize()

{

        Solution[0] = NULL;

        initialize_W();

        initialize_A();

}



void initialize_A()

{

        register int i;

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

        {

                A[i] = new Element(S[i], W[i], 1, 0, i);

        }

}



void initialize_W()

{

        register int i;

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

        {

                W[i] = w(S[i]);

        }

}





//total function w given in the assignment, this can be any total function on the set of real integers

//it is currently set to return 1, as the last step in debugging was to check the condition for objects

//with equal weight. 

int w(int s)

{

        return 1;

}

#include "externals.h"



void Sort(element * array[]);

void Greedy(int remainder, int i);

void Backtrack(int stop, int start);



int totalValue(element * array[], int start, int end);

int totalWeight(element * array[], int start, int end);



void printArr(element * array[]);

void printElements(element * array[]);

void copyArr(element * source[], element * target[]);



void initialize();

void initialize_A();

void initialize_W();

int w(int s);

#include 

#include "functions.h"



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

{

        initialize();

        Sort(A);

        printElements(A);

        Greedy(B, 0);

        Backtrack(0, N-2);

        if (totalValue(Solution, 0, N-1) != B) 

        {

                printf("No Solution\n");

        }

        else 

        {

                printArr(Solution);

        }

        return 0;

}

arrays

leeba — Sat, 14 Nov 2009 21:53:14 GMT

I am trying to write a program that reads a string and shortens it if the letters are in a row. For instance abcdghigjhkhdf becomes a-dg-igkhkhdf. I want that it erases the ;etters it erases but it is not working. HEre is my code:

#include 



#define MAXSTRING 100 

void main()

{

        char str[MAXSTRING]={0};



        printf("Please input a string of letters without a space or numbers.");

        scanf_s("%s", &str);



        convertString(str);



}



        void convertString(char string[])

        {

                int i=0;

                char startOfNewConinuation=0;

                

                while (string[i]!= 0)

                {

                        if (string[i]!= '-')

                                startOfNewConinuation=string[i];



                        if ((string[i+1]=string[i]+1) && (startOfNewConinuation=string[i]))

                                string[i+1]='-';

                        else

                                string[i]='';

                        i++;

                }

                printf("\nThe new string is %s",string);

        }

Passing a pointer

kgomes — Sat, 14 Nov 2009 18:08:54 GMT

In an assignment for class we have to ask the user how many characters they'd like to enter and then read the characters into an array of that size. I've had problems with calling a function to do this. I will also be passing this array to other functions, so I'm not sure if anything has to be modified either.

This is what I've done so far

#include 

#include 

#include 



void Test(char, int);



int main()

{

    char *text;

    int i, size, *sizeptr;

    sizeptr = &size;

    Test(text, size);

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

    {

        putchar(text[i]);

    }

    system("PAUSE");

    return(0);

}



void Test(char *text, int *sizeptr)

{

    int i;

    printf("How many characters do you want to enter?\t");

    scanf("%d", sizeptr);

    text = (char*) malloc(*sizeptr * sizeof(char));

    memset(text, 0, *sizeptr);

    printf("Enter your text: (DO NOT INCLUDE SPACES)\n");

    scanf("%s", text);

}

Parsing in C

pmee — Sat, 14 Nov 2009 14:25:32 GMT

Hi,

I'm new to this site so apologies for any mistakes. I'm trying to write a program to parse string from a file. In each string I then have to parse the different strings for example:

add h'13', 4

So I've to parse the 'add' bit, the '13' bit and the '4' bit. At the minute I'm trying to use strtok but I'm getting a run time error.

/* Libraries */

#include 

#include 



/* Main Function */

int main()

{

        /* Declarations */

    char *instruction;

    char *action;

    char *number;

    char *number2;

    

    instruction = "add  h'13', 4";

    

    printf("%s \n",instruction);



// The run time error occurs here



    action = strtok ( instruction, " " );

    number = strtok ( NULL, " ' " );

number2 = strtok ( NULL, "," );



        printf("%s \n %s \n %s \n", action, number, number2);



        system("PAUSE");

        return 0;

}

Any help you can give me would be greatly appreciated. Thanks.

Remove Duplicate Items from char Array

voxis — Sat, 14 Nov 2009 08:08:56 GMT

What is the method to remove dupplicate items from an character array??

A Sample Program is Here which take two arrays merge them and sort them please include some lines that should remove duplicates from an resulted array??

#include 



  

// A simple bubble sort

void sort(char data[], int length)

{

   int end = length - 1;

   for (int i = 0; i < length; ++i) 

   {

       for (int j = 0; j < end; ++j) 

       {

           if (data[j] > data[j+1])

           {

               char tmp = data[j];

               data[j] = data[j+1];

               data[j+1] = tmp;

           }

       }

       --end;

   }

}



int main(void)

{

   char firstArray[10];

   char secondArray[10];

   char mergedArray[20];



   int i;

   int mergedIndex;



   printf("Put in the first array\n");

   fgets(firstArray, sizeof(firstArray), stdin);



   printf("Put in the second array\n");

   fgets(secondArray, sizeof(secondArray), stdin);



   // Copy the first array into the merged array

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

   {

       mergedArray[i] = firstArray[i];

   }

   mergedIndex = i;

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

   {

       mergedArray[mergedIndex++] = secondArray[i];

   }

   mergedArray[mergedIndex] = 0;



   sort(mergedArray, mergedIndex);

   printf("Merged array is '%s'\n", mergedArray);

   return 0;

}

Thanks inAdvance

Help with loops

speedy94519 — Sat, 14 Nov 2009 04:52:01 GMT

My code:

  printf("\n"); 

  printf("\tSlalom Race, Version 1.0\t\t\n\n");

  printf("1. Play\n");

  printf("2. Instructions\n"); 

  printf("3. Quit\n\n"); 

  printf("Your choice: "); 

  scanf("%d", &choice); 

  }  

 

  /* Initializes loop to begin game */ 

  while (choice != 3) { 

 

  /* Begins execution of game and Selects instructions if needed */ 

  while (choice == 1) { 

  printf("You are at the start.\n"); 

   printf("Time elapsed: 0.000000 sec\n"); 

  printf("Current velocity: 0.000000 m/sec\n"); 

  printf("Next Gate: 1. Velocity limit: 10.00 m/sec\n"); 

   printf("Your action (1 - 7):"); 

   scanf("%d", &accelComand); 

 



   /* Determines if the command is in between 1 and 7 */ 

   while (!(accelComand <=SEVEN) || !(accelComand >= 1)) { 

   printf("Your action (1 - 7):"); 

   scanf("%d", &accelComand); 

   } 

 

    /* Calculates velocity and time of Leg1 */ 

   accelLeg1 = acceleration[accelComand-1]; 

   velLeg1 = sqrt(TWO*accelLeg1*FIFTY); 

   timeLeg1 = (velLeg1 / accelLeg1); 

   printf("\n\n"); 

 

   if (velLeg1 > 10) { 

   printf("\n\n\n");

    printf("Your velocity at gate 1 was %f m/sec\n",velLeg1); 

   printf("You have lost control and went into"); 

   printf(" a nearby snow pile!\n");

    printf("You failed the race and went"); 

   printf(" face down into the snow!\n"); 

   printf("Better luck next time!\n"); 

 

    } 

 else { 

  if (velLeg1 <= 0) {

   printf("You stopped before reaching the gate.\n"); 

  printf("Your attempt to pick up the speed laned you"); 

  printf(" in a snow pile.\n"); 

  printf("You failed the race due to your"); 

  printf("overburdening caution.\n"); 

  printf("Better luck next time.\n");

  }

   } 

  printf("\n"); 

  printf("You are at Gate 1\n"); 

  printf("Time elapsed: %f sec\n", timeLeg1);

   printf("Current velocity: %f m/sec\n",velLeg1); 

   p rintf("Next Gate: 2. Velocity limit: 18.00 m/sec\n"); 

    printf("Your action (1 - 7):"); 60. scanf("%d", &accelComand);

As you can see my code asks the user to input 3 numbers: 1,2,3 in lines 1-7. My only concern is when they choose 1. When they select "1", game execution begins and depending on the given command (the command itself is the acceleration which determines the time and velocity) lines 34 - 51 will determine the output of lines 54-60. If one of the conditions are satisfied in lines 34-51 THEN the program will go back in asking the user in lines 1-7 again. That is my problem, i dont know what to put in lines 34-51 if one of the conditions are satisfied and go back in asking the user in lines 1-7. Any suggestions?????

help making MakeFile

cabosun — Sat, 14 Nov 2009 01:20:09 GMT

I am suppose to make a MakeFile for the 2 source files named p4a.c and p4b.c
Am i doing this makefile correctly? Any suggestions would be so helpful

my MakeFile so far

.SUFFIXES: .c .o

CC - gcc

CFLAGS = -g

.c.o:

     $(CC) $(CFLAGS) -c $,



sample: p4a.c p4b.c

       gcc p4a.c p4b.c -o sample



p4a.c:



p4b.c:



clean:

       rm -f *.o core

p4a.c

#include

#include





main(int argc,char* argv[])

{

        short int a[100][5];

        short int res;





        FILE *fp1;

        if(!(fp1=fopen(argv[1],"r")))

                printf("Error opening file\n");

        else

        {

        FILE *fp2;

                int i,j,k,l;

                i=j=0;

                

                while(!feof(fp1))

                {

                        for(j=0;j<4;j++)

                                fscanf(fp1,"%d",&a[i][j]); 

                        i++;

                }

                

                for(k=0;k
                {

                        unsigned short int musk=!0; //musk=11...111

                        musk=musk|15;                                //musk=000..001111

                        musk=musk<<12;                                //musk=111100..000

                        

                        res=0;

                        for(l=0;l<4;l++)

                        {

                                short int temp=(a[k][l]&musk);

                                res=res|temp;

                                musk=musk>>4;

                        }

                        a[k][4]=res;

                }



                

                if(!(fp2=fopen(argv[2],"w")))

                        printf("Error:cannot open file");

                else

                {

                        for(k=0;k
                        {

                                for(j=0;j<5;j++)

                                        fprintf(fp2,"%d%s",a[k][j],"\t");

                                fprintf(fp2,"%s","\n");

                        }

                        fclose(fp1);

                        fclose(fp2);

                }



}



        return 0;

}

p4b.c

#include

#include

#include



typedef struct token

{

        char name[15];

        int def,usecount,use[100];

}identifier;



identifier id[1000];

int idcounter;



void search(char* token,int linenum)

{

        int i;

        for(i=0;i
        {

                if(!strcmp(token,id[i].name))                

                {

                        id[i].use[id[i].usecount]=linenum;

                        id[i].usecount++;

                        return;

                }



        }

        //insert

        strcpy(id[idcounter].name,token);

        id[idcounter].def=linenum;

        id[idcounter].usecount=0;

        idcounter++;                

        

}



void check(char line[81],int linenum)

{

        char token1[15];

        char* token=(char*)malloc(sizeof(char)*15);

        if(line[0]=='_' || (line[0]>='a' && line[0]<='z') || (line[0]>='A' && line[0]<='Z'))                

        {

                token=strtok(line," ,\t");        //take label

                strcpy(token1,token);

                if(token1[strlen(token1)-1]==':')

                        token1[strlen(token1)-1]='\0';

                search(token1,linenum);

                

                token=strtok(0," ,\t");                //skip opcode\datatype

                strcpy(token1,token);

                if(token1[0]=='.')                        //check data type

                        return;

                while(token)

                {

                        token=strtok(0," ,\t");

                        if(token)

                        {

                                strcpy(token1,token);

                                if(token1[0]=='#')

                                        return;                        //start of comment

                                else if(token1[0]=='_' || (token1[0]>='a' && token1[0]<='z') || (token1[0]>='A' && token1[0]<='Z'))

                                {

                                        if(token1[strlen(token)-1]=='\n')

                                                token1[strlen(token)-1]='\0';

                                        search(token1,linenum);

                                }

                        }

                }

        }

        else

        {

                token=strtok(line," ,\t");        //skip opcode

                token=strtok(0," ,\t");                //search for optional operands

                while(token)

                {

                        strcpy(token1,token);

                        if(token1[0]=='#')

                                return;                        //start of comment

                        else if(token1[0]=='_' || (token1[0]>='a' && token1[0]<='z') || (token1[0]>='A' && token1[0]<='Z'))

                        {

                                if(token1[strlen(token)-1]=='\n')

                                        token1[strlen(token)-1]='\0';

                                search(token1,linenum);

                        }

                        token=strtok(0," ,\t");        

                }

        }

}



main(int argc,char* argv[])

{

        char line[81],line2[81];        

        int i,linenum,p,q;

        FILE *fp1,*fp2;



        if(argc!=3)                //check invalid command

        {

                printf("Invalid command argument number\n");

                return 1;

        }



        if(!(fp1=fopen(argv[1],"r")))

        {

                printf("Error opening inputfile\n");

                return 1;

        }

        if(!(fp2=fopen(argv[2],"w")))

        {

                printf("Error opening outputfile\n");

                return 1;

        }

        linenum=i=1;

        while(fgets(line,81,fp1))

        {

                

                if(line[0]=='#')

                {

                        //fputs(strcat(strcat(itoa(i,str,100),".  "),line),fp2);

                        //fputs("\n",fp2);

                        fprintf(fp2,"%d%s",i,".  ");

                        fputs(line,fp2);

                        linenum++;

                        i++;

                }

                else if(strlen(line)>1)

                {

                        strcpy(line2,line);

                        fprintf(fp2,"%d%s",i,".  ");

                        fputs(line2,fp2);

                        //fputs(strcat(strcat(itoa(i,str,100),".  "),line2),fp2);        

                        check(line,linenum);                

                        i++;

                        linenum++;

                        //printf("%d.\t%s",i,line);

                }

                else

                {

                        fputs(line,fp2);

                //fputs("\n",fp2);

                        linenum++;

                                        

                }



        }



        fprintf(fp2,"%s","\n\n\tCross Reference Table\n");



        fprintf(fp2,"%s","\n\nname\t\t def\t \tuse\n\n");

        for(p=0;p
        {

                fprintf(fp2,"%s\t\t%d\t\t",id[p].name,id[p].def);

                for(q=0;q
                {

                        if(q==0)

                                fprintf(fp2,"%d",id[p].use[q]);

                        else

                                fprintf(fp2,"%c%d",',',id[p].use[q]);

                }

                fprintf(fp2,"%s","\n");

        }

        fclose(fp1);

        fclose(fp1);





        return 0;

}

fread() and fseek()

candoc — Fri, 13 Nov 2009 19:44:40 GMT

If I am fread()'ing through a file and want to append it when i find a particular item, can i just do an fwrite() when i find it or do i have to first fseek() to that location and then do an fwrite()?

Decide number of arguments in vararg method

siggivara — Fri, 13 Nov 2009 18:56:51 GMT

I've written a method that takes a variable number of arguments. My problem is that the method is supposed to do one thing if there is only one argument, and something different if it recieves multiple arguments.
If it's one argument I'm supposed to get info from a global variable, but if its more than one I'm getting the info from the last argument given.

Here is what the method looks like and what it does when there is multiple arguments. Since the last argument always is 4 digits I know when to stop the for loop.

//Sends the message

void sendMessage(int tlfNumber1, ...) {

        //Initiating va_list element

        va_list argumentList;

                

        //Starting/getting the parameters

        va_start(argumentList, tlfNumber1);

        

        int i;

        int j;

        //Looping all the elements

          for (i = tlfNumber1; j != 4; i = va_arg(argumentList, int)) {

                  /* Checking what parameter it is by converting the int argument to string and check the length of the string.

                   * If the argument was 4 digits it was the message_ID and therefore the last argument.

                   */

                  char paramAsString[20];

                  sprintf(paramAsString, "%d", i);

                  j = strlen(paramAsString);

                

                  printf("%d ", j);

          }

}

So I need som way to check the number of arguments passed to this method.

Thanks

C program for writing test cases

kirtics34 — Fri, 13 Nov 2009 14:43:45 GMT

Code Exercise – BIQ-001
Mr.X owns a small business in a region with poor law-and-order. Recently his warehouse has been plagued by thieves. Gangs of thieves raid over his warehouse from time to time, stealing his raw material, affecting his business. He has studied the occurrances and noticed it that they are cyclical.

Assuming that a work week starts every Monday, and Sat and Sun are holidays, predict the total number of days when business would be affected.

Picture (Metafile) please see attached jpgeg

e.g. (Refer to Image) He has noticed that currently there seem to be 2 gangs. Gang1 raids every 4 days, whereas Gang2 strikes every 6 days.

Raids On Holidays are okay - since there is no raw material on those days. If more than gang raids the warehouse on a particular day, it is still counted as one bad day. So the answer in this case is 5.

Sample Input: (file)
The input is in the form of text file containing test cases.
2
2
4 6
21
3
3 4 8
14

The first line indicates the number of test cases - 2 above. Each test case is made up of 3 lines.
The first line of every test case indicates the number of gangs, n. (i.e 2 for TestCase#1)
The next line contains n integers, where each number k indicates that the gangi strikes every k days. (i.e. 4 and 6 for TestCase#1)

The next line is the number of days d, for which the prediction is needed. 0 <= d <= 365 (i.e. 21 days for TestCase#1)

Sample output: (can be printed to console.. via printf or equivalent)
5
5

Your program should accept the name of the input file (in the same dir) as a command line argument and print out the output of each test case on a new line.

Attached Images

Simulation.jpg (14.5 KB)

Attached Files

	Entrepreneur_X.doc (43.5 KB)
	Entrepreneur_X.txt (2.2 KB)

a simple question about a program

bufospro — Fri, 13 Nov 2009 13:33:13 GMT

Hi,
I need your help for my program.

My code is :



void user()

{



        char str[15];

        int i=0;

        

        do{

                printf("\nPrint str.\n");

                fgets(str,15,stdin);

                i = strlen(str);

        }while(i>15);

}



void menu()

{

        printf("Press :\n"); 

        printf("0. \n");

        printf("1. \n");

        printf("2. \n");

}



int get_choice()

{

 int choice = 0 ;

 const char* const valid_choices = "012" ;



 do

 {

   fputs( "Your choice : ", stdout ) ;

   fflush( stdin ) ;

   choice = toupper( fgetc( stdin ) ) ;

   fgetc( stdin ) ;



   if( strchr(valid_choices, choice) == NULL )

   {

     fputs("Invalid option.\n");

     choice = 0 ;

   }

 } while( choice == 0 ) ;



 return choice ;

}







main()

{

        int choice=0;



        do

           {

             menu() ;

                   choice = get_choice() ;



                      switch(choice)

                      {

                          case 0: user();

                                            break ;

                          case 1: break ;

                          case 2: break;

                }

                     

         }while(choice != 2);

  

}

When I press string with <15 number of characters all is ok.
But if my str is 17 characters , then is printed two times
'Your choice : Invalid Option'

Could anyone help me fix it ?
Thanks

Finding middle value in C...

DoEds — Fri, 13 Nov 2009 12:12:19 GMT

Can anyone give me some ideas on how to find the middle value between 3 numbers.? I really dont know how to start...

I know how find minimum and maximum but finding the Middle value is kinda hard for me...

For those C Wizards give me some idea advice please?., just an idea u dont have to give codes... thx!

Can this be done in a faster way?

want_to_code — Thu, 12 Nov 2009 22:27:03 GMT

Given an array of elements. An element is called as a leader if it is greater than all
the elements to the right of it. Print all the leaders in O(n)?
The following is my approach.Can anyone tell me how to improve the code and also the current time complexity?
Is recursion more efficient in this case?

#include

void findLeaders(int a[],int n)

{

 int i,j=n-1,flag=0;

 for(i=0;i
 {

   if(a[i] > a[i+1])

   {

        while(a[i]>a[j])

        {

                if((i+1) ==j) 

                {

                        flag=1;

                        printf("\nleader = %d",a[i]);

                        break;

                }

                else   j--;

        }

        j=n-1;

   }

 }

 if(!flag)  printf("\nNo leader in the given array\n");

}

 



int main()

{

 int a[100],n=0,i=0;

 printf("\nEnter n:");

 scanf("%d",&n);

 for(i=0;i
        scanf("%d",&a[i]);

 findLeaders(a,n);

 printf("\n\n");

 return 0;

}

Thanks in advance.

Error in network prog. code....

henabibi — Thu, 12 Nov 2009 20:24:10 GMT

I am trying to run this program but it is giving "unable to open socket" eror.
i am running this program on a server via putty which is hosted in my univerity server with wireless network.
the code is :

#include 

#include 

#include 

#include 

#include 

#include 

#include 

#include 

#include 

#include 



#define PROTOCOL htons(0x0800)

#define BUFFERLENGTH 1500



char *r_cInterface = NULL;                //stores the name of interface to be captured from

int r_iTime = 0;                        //time for which sniffer will run

int sock;                                //socket to be opened and programmed for capturing

long r_lPacketCount = 0;                //no of packets captured

int r_iContinue = 1;                        //usd for thread

struct ip *r_pIPHeader = NULL;                //ipheader



pthread_t r_Capture;                        //capturing thread

void initializeInterface (char *r_cInterface);        //programs interface in promic mode

void *captureTraffic(void * args);                //capture packets from interface and displays 

void capture_start ();                                //start capturing thread

void capture_stop ();                                //stop capturing thread



void initializeInterface(char *r_cInterface)

{

        struct ifreq ifr;                //structure to hold interface data

        strcpy (ifr.ifr_name, r_cInterface);        //copy name of interface into structure

        if ( (sock=socket(PF_PACKET,SOCK_DGRAM,PROTOCOL)) < 0)        //open socket on interface

        {

                printf("\nUnable to open Socket");

                exit(EXIT_FAILURE);

        }

                if ((ioctl (sock , SIOCGIFFLAGS , &ifr)) < 0)        // get flags of socket into structure

        {

                close (sock);

                printf("\nUnable to get flags");

                exit (EXIT_FAILURE);

        }

                ifr.ifr_flags |= IFF_PROMISC;        //set flags to promisc

                if (ioctl (sock , SIOCSIFFLAGS , &ifr) < 0)        //send structure data back to socket flags

        {

                close (sock);

                printf("\nUnable to set flags");

                exit (EXIT_FAILURE);

        }

}



void *captureTraffic(void * args)

{

        char r_caBuffer [BUFFERLENGTH];                //holds bytes recieved

           r_lPacketCount = 0;

        int i=0;

        int r_iBytesReceived = 0;

        while (r_iContinue)

        {

                r_iBytesReceived = recvfrom (sock,r_caBuffer,BUFFERLENGTH,0,NULL,NULL);

                r_lPacketCount ++;

                r_pIPHeader = (struct ip *)r_caBuffer;

                printf("\n\n\nPacket Number : %d",r_lPacketCount);

                      printf("\nSource IP     : %s",inet_ntoa(r_pIPHeader->ip_src));

                      printf("\nDestination IP: %s",inet_ntoa(r_pIPHeader->ip_dst));

                      for (i=0;i
                      {

                              if ((i%10) == 0)

                         printf("\n");

                         printf("%x\t",r_caBuffer[i]);

                      }

           }  // end while

}





void capture_start ()        {

        int result;

        r_iContinue = 1;

        result = pthread_create (&r_Capture, NULL, captureTraffic, (void *) 0);//create capturing thread

        if (result != 0) {

                printf("\nunable to start sniffer\n");

                exit(EXIT_FAILURE);

        }

}



void capture_stop ()        {

        r_iContinue = 0;

}





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

{

        if (argc != 3)

        {

           printf ("\nUSAGE: sniffer  \n");

                exit(EXIT_FAILURE);

        }

        r_cInterface = argv[1];                        //get interface name from input

           r_iTime = (int)atol(argv[2]);                //get running time from input

        initializeInterface(r_cInterface);

        capture_start ();

        sleep(r_iTime);

        capture_stop ();

        return 0;

}

strtok

leeba — Thu, 12 Nov 2009 20:06:18 GMT

I am trying to write a program that accepts a dollar rate and hte accepts a list of amounts adn converts tehm to Shekels and prints in a list with the sums.
HEre si my code:
It is giving em lots of errors and I am having no luck. I think strtok is the main problem but not sure how else to do it.

/*

Requests exchange rate and hen a list of dollar amount.

It then prints in a table the dollar and shekel amount and adds them up

*/

#include 

#include 



void main ()

{

        /* defines maximum list of dollar amounts*/

        #define MAXLINE 100

        

        float rate;

        float *dollar[MAXLINE]={0}; /*starts the array with a 0 so the rest of the array will be set to 0*/ 

        int x=0;

        float sumDollars,sumShekels; 

        int i=0;

        char c;

        int spaceCount=0;

        

        /*starts the sums to 0*/

        sumDollars=0.0;

        sumShekels=0.0;



        printf("Please input the current dollar exchange rate");

        scanf_s("%f",&rate);



        printf("Please input dollar amounts to calculate into Shekels. Return will end the list.");

                

        /* reads the list of dollar amounts*/

        while (spaceCount<=MAXLINE) 

        {

                if ((c=getchar())==' ')

                        spaceCount++;

                if ((c=getchar())=='\n')

        }



        for (i=0; dollar[i]=strtok(c," "), i++);



                printf("$ \t IS\n");

                printf("__ \t __\n");



        /* Prints the list*/

        for ( x=0; dollar[x]!= '\n'; x++) 

                {

                        sumDollars=sumDollars+dollar[x];

                        sumShekels=sumShekels+(dollar[x]*rate);



                        printf("%5.2f \t %5.2f", dollar[x], dollar[x]*rate);

                }

        getchar();

}

program to get product matrix

Ankush dhingra — Thu, 12 Nov 2009 16:51:38 GMT

void main()
{
int a[10][10],b[10][10],c[10][10],i,j,k,m,n,p,q;

printf("Enter The Rows And Cloumns And Of The First Matrix:");
scanf("%d %d",&m,&n);
printf("\nEnter The Rows And Cloumns And Of The Second Matrix:");
scanf("%d %d",&p,&q);

printf("\nEnter Elements Of The First Matrix:\n");

for(i=0;i< m;i++)
{
for(j=0;j< n;j++)
{
scanf("%d",&a[i][j]);
}

}

printf("\nEnter Elements Of The Second Matrix:\n");

for(i=0;i< p;i++) {
for(j=0;j< q;j++)
scanf("%d",&b[i][j]);
}

printf("The First Matrix Is:\n"); /* Print the first matrix */

for(i=0;i< m;i++) {
for(j=0;j< n;j++)
printf(" %d ",a[i][j]);
printf("\n");
}

printf("The Second Matrix Is:\n"); /* Print the second matrix */

for(i=0;i< p;i++) {
for(j=0;j< q;j++)
printf(" %d ",b[i][j]);
printf("\n");
}

if(n!=p) {
printf("Aborting./nMultiplication Of The Above Matrices Not Possible.");
exit(0);
}

else {
for(i=0;i< m;i++) {
for(j=0;j< q;j++) {
c[i][j] = 0;

for(k=0;k< n;k++) {
c[i][j] = c[i][j] + a[i][k] * b[k][j];
}
}
}

printf("\nThe Product Of The Two Matrices Is:\n\n");

for(i=0;i< m;i++) {
for(j=0;j< q;j++) {
printf(" %d ",c[i][j]);
}

printf("\n");

}
}

return 0;

}

program to construct a matrix

Vishu Madaan — Thu, 12 Nov 2009 16:41:11 GMT

#include
#include
void main()
{
int a[10][10],b[10][10],c[10][10],i,j,k,m,n,p,q;

printf("Enter The Rows And Cloumns in the Matrix:");
scanf("%d %d",&m,&n);

printf("\nEnter Elements Of The Matrix:\n");

for(i=0;i< m;i++)
{
for(j=0;j< n;j++)
{
scanf("%d",&a[i][j]);
}
}
printf("The First Matrix Is:\n"); /* Print the first matrix */
for(i=0;i< m;i++)
{
for(j=0;j< n;j++)
printf(" %d ",a[i][j]);
printf("\n");
}
getch();
}

AntiVir reports code as trojan: TR/Eplx.IMG-WMF.bfg

Pim — Thu, 12 Nov 2009 16:01:40 GMT

Hello,

#include 



int main(void)

{

    enum BOOL {foo, bar};

    enum BOOL bFlag;

    return 0;

}

When I compile this and run it AntiVir claims it's the TR/Eplx.IMG-WMF.bfg trojan. Isn't that weird?

[C][for loop] How to print this pattern use "for" ???

Wtyy — Thu, 12 Nov 2009 14:48:55 GMT

How to print this pattern use "for" ???

:?::?::?:

client server talk prob

ROTC89 — Thu, 12 Nov 2009 13:41:16 GMT

ok so i am having problems with my program. its a client program talking to the server program. i have both programs working fine but i do not know how to get the conversation to display on the server side of the conversation. here are the codes and makefile



serv.c





#include 

#include 

#include 

#include 

#include 

#include 



#define MAXLINE 4096

#define SA struct sockaddr

#define SERV_PORT 9877

#define LISTENQ 1024

#define EINTR 0



void str_echo(int sockfd);



int main(int argc,char **argv)

{       int listenfd,connfd,errno;

        pid_t childpid;

        socklen_t clilen;

        struct sockaddr_in cliaddr, servaddr;



        listenfd=socket(AF_INET,SOCK_STREAM,0);



        bzero(&servaddr,sizeof(servaddr));

        servaddr.sin_family= AF_INET;

        servaddr.sin_addr.s_addr= htonl(INADDR_ANY);

        servaddr.sin_port= htons(SERV_PORT);



        bind(listenfd,(SA*) &servaddr,sizeof(servaddr));

        listen(listenfd,LISTENQ);



        for(;;)

        {       clilen=sizeof(cliaddr);

                connfd=accept(listenfd,(SA*) &cliaddr, &clilen);



                if((childpid=fork())==0)

                {       close(listenfd);

                        str_echo(connfd);

                        exit(0);

                }

                close(connfd);

        }

}



void str_echo(int sockfd)

{       ssize_t n, errno;

        char rec_buf[MAXLINE], send_buf[MAXLINE];



        again:

                while((n=read(sockfd,rec_buf,MAXLINE))>0)

                {       fputs(rec_buf,stdout);

                        fgets(send_buf,MAXLINE,stdin);

                        write(sockfd,send_buf,MAXLINE);



                        if(n<0 && errno==EINTR)

                        {       goto again;

                        }else if(n<0)

                        {       fprintf(stderr,"str_echo: read error");

                                exit(1);

                        }

                }

}







cli.c





#include 

#include 

#include 

#include 

#include 

#include 



#define SA struct sockaddr

#define SERV_PORT 9877

#define MAXLINE 4096



void str_cli(FILE *fp, int sockfd);



int main(int argc, char**argv)

{       int sockfd;

        struct sockaddr_in servaddr;



        if(argc !=2)

        {       fprintf(stderr,"usage:tcpcli ");

                exit(1);

        }



        sockfd=socket(AF_INET,SOCK_STREAM,0);

        bzero(&servaddr,sizeof(servaddr));

        servaddr.sin_family=AF_INET;

        servaddr.sin_port=htons(SERV_PORT);

        inet_pton(AF_INET,argv[1],&servaddr.sin_addr);



        connect(sockfd,(SA*) &servaddr, sizeof(servaddr));



        str_cli(stdin,sockfd);



        exit(0);

}



void str_cli(FILE *fp, int sockfd)

{

        char sendline[MAXLINE],recvline[MAXLINE];



        while(fgets(sendline,MAXLINE,fp) != NULL)

        {       write(sockfd,sendline,strlen(sendline));



                if(read(sockfd,recvline,MAXLINE)==0)

                {       fprintf(stderr,"str_cli: server terminated");

                        exit(1);

                }

                fputs(recvline,stdout);

        }

}





and the makefile



all: client server



client: cli.c

        cc -o client cli.c



server: serv.c

        cc -o server serv.c



clean:

        rm client server

I need a Programm In C hex to decimal

hapyharra — Thu, 12 Nov 2009 12:06:36 GMT

hello
I need a programm In C how convert Hexadecimal to decimal plz

C prog DFT

GagandeepKaur — Thu, 12 Nov 2009 11:03:24 GMT

Hi,
im trying to calculATE DFT through this code, i dnt know what's wrong please enlighten. Thanks

#include

#include 

#include 

main()

{

int m,n,r,N,j;

float l,o;

float complex x[1000];

float real, imag;

{

for (m=1;m<=10;m++)

{

for (n=1;n<=10;n++)

{

for (j=1; j<=10;j++)

N=1000;

r=1/N;

l=sin(3*j);

printf("the value of sin is %f",l);



o=exp(6.28*m*n*r);

x[m]=0.0+I*o*l;

//real=creal(x[m]);

//imag=cimag(x[m]);

printf("the val of x[m] is %f", x[m]);



}

}

}

getch();

}

Need Help with backtracking

Justea — Thu, 12 Nov 2009 07:08:44 GMT

hi, Im coding a sodoku program base on backtracking, but somehow it did not work as what I expected, can help me figure out what's the problem?

sodoku.c



#include 

#include 



#define true 1

#define false 0



void printGrid(int board[]) {

    int i,j;

    if (board==NULL){

        printf("No Solution\n");

        return;

    }

    for (i=0;i<9;i++){

        for (j=0;j<9;j++){

            printf ("%d",board[i*9+j]);

            if (j%3==2)

                printf (" ");

            }

        printf ("\n");

        if (i%3==2)

            printf ("\n");

        }       

}



int checkDigit(int board[], int digit, int n) {



    int i,j;

    int ROW;

    int COL;



    ROW=n/9;

    COL=n%9;



    if (ROW<0 || COL<0 || ROW>8 || COL >8 || digit <1 || digit >9 )

        return false;

    if (board[ROW*9+COL]!=0)

        return false;



//scan horizontally and vertically

    for (i=0;i<9;i++){

        if (board[i*9+COL]==digit || board[ROW*9+i]==digit)

            return false;

    }



//scan within the square

    for (j=((ROW/3)*3);j<(((ROW/3)*3)+3);j++){

        for (i=((COL/3)*3);i<((COL/3)*3+3);i++){

            if (board[j*9+ROW]==digit)

                return false;

        }

    }

    return true;

}



int solveGrid(int board[], int n) {



    int i,j,k;

    i=n/9;

    j=n%9;

    int solved=1;

    for (n=0;n<81;n++){

        if (board[n]==0){

            solved=0;

        }

        else

            solved=1;

    }



    if (solved)

        return;

    

    for (i=0;i<9;i++){

        for (j=0;j<9;j++){

            if (board[i*9+j]==0){

                for (k=1;k<=9;k++){

                    if (checkDigit(board,k,i*9+j)){

                        board[i*9+j]=k;

                        solveGrid(board,i*9+j+1);

                    }

                }

            }

        }

    }

}





main.c



#include 

#include 



#define ROW 9

#define COL 9



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



    /* the sudoku grid is represented by this 1D array */

    int board[ROW * COL];

    char filename[100];

    int i, j, input;

    FILE *fp;



    printf("Enter data file name: ");

    scanf("%s", filename);



    fp = fopen(filename, "r");

    if (fp == NULL) {

        printf("Cannot open data file\n");

        exit(0);

    }



    for (i = 0; i < 9; i++) {

        for (j = 0; j < 9; j++) {

            fscanf(fp, "%d", &input);

            board[i * ROW + j] = input;

        }

    }

    fclose(fp);



    // the solver starts from position 0

    if (solveGrid(board, 0)) {

        printf("Solved.\n");

        printGrid(board);

    }

    else

        printf("No Solution.");



    return (EXIT_SUCCESS);

}

gstreamer code...help me

Iam3R — Thu, 12 Nov 2009 03:55:40 GMT

Hi,

i like to know what are the different systems that have gstreamer built in, or systems which allows gstreamer to be installed.

I also like to know what this below lines specifies:
I found this in my shell of proc/version file
Linux Version 2.6.9-5.Elsm gcc version 3.4.3 20041212 (red hat 3.4.3-9.El4) #1 smp wed jan 5 19:30:39 EST 2005.

can i install gstreamer on my system.

Thanks.

Small C program error

cabosun — Thu, 12 Nov 2009 02:50:16 GMT

So I am suppose to write a program that will implementing one method if computing
checksums for a file containing integers.

I am executing the program by a command line from the following form:

p4a inputfile outputfile

I can compile the program in Dev C++ compiler with no errors. But the problem is that
when compile the program in unix command line by:

gcc p4a.c

I get the following errors:

p4a.c: In function `main':
p4a.c:42: parse error before `*'
p4a.c:43: `fp2' undeclared (first use in this function)
p4a.c:43: (Each undeclared identifier is reported only once
p4a.c:43: for each function it appears in.)

Can anyone point me in the right direction in fixing these errors so that I can compile correctly by command line

Here is the code below:

#include

#include





main(int argc,char* argv[])

{

        short int a[100][5];

        short int res;





        FILE *fp1;

        if(!(fp1=fopen(argv[1],"r")))

                printf("Error opening file\n");

        else

        {

                int i,j,k,l;

                i=j=0;

                

                while(!feof(fp1))

                {

                        for(j=0;j<4;j++)

                                fscanf(fp1,"%d",&a[i][j]); 

                        i++;

                }

                

                for(k=0;k
                {

                        unsigned short int musk=!0; //musk=11...111

                        musk=musk|15;                                //musk=000..001111

                        musk=musk<<12;                                //musk=111100..000

                        

                        res=0;

                        for(l=0;l<4;l++)

                        {

                                short int temp=(a[k][l]&musk);

                                res=res|temp;

                                musk=musk>>4;

                        }

                        a[k][4]=res;

                }



                FILE *fp2;

                if(!(fp2=fopen(argv[2],"w")))

                        printf("Error:cannot open file");

                else

                {

                        for(k=0;k
                        {

                                for(j=0;j<5;j++)

                                        fprintf(fp2,"%d%s",a[k][j],"\t");

                                fprintf(fp2,"%s","\n");

                        }

                        fclose(fp1);

                        fclose(fp2);

                }



}



        return 0;

}

Code Snippet Changing the contents of a file

luke1705 — Thu, 12 Nov 2009 01:41:01 GMT

I'm working on a program to score a bowling game. Right now, my terminal says that my program has a seg fault, but I can't tell where. Any other insight on how to help my program do what it's supposed to do would be helpful. I'm still not sure how to weed out all the characters, although I think my fscanf might do that.

Bubble sort structure array problem

matrix0978 — Thu, 12 Nov 2009 00:56:48 GMT

hey guys, i programmed a bubble sort function in C and it doesnt seem to be sorting properly. Ive searched the forums and have seen similar posts and tried them but they dont work. :(
Hoping someone could look over it to see if the concept/sytax is right.

typedef struct

{

        char artist[40];

        char title[60];

        int rating;

} song;



void song_by_title(song oneSong[99], int size)

{

        song temp1;

        int i,j = 0;

        int s = 0;

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

        {

                for(j = 0; j <= size - 1; j++)

                {



                s = strcmp(oneSong[j].title, oneSong[j + 1].title);



                if(s < 0)

                {

                        temp1 = oneSong[j + 1];

                        oneSong[j + 1] = oneSong[j];

                        oneSong[j] = temp1;

                }

                }

        }

}

thank you in advanced
spencer

Forking

thure — Thu, 12 Nov 2009 00:05:13 GMT

I'm having trouble with a forking program.

One process writes to a file, the other waits for the file to be written, prints something out, then deletes it. They essentially process in order based on whether the file is there or not.

The processes should be outputting more useful information than this. As it is, this is the output:

Waiting for data.txt to appear...
Found it! Splitting now.
Producer initialized!
Waiting for values.txt to disappear...
Consumer initialized!
Waiting for values.txt to appear...
Values.txt found! Processing...
Values.txt is gone: processing...

Then both seem to terminate, but I can't tell because they don't finish.

I just need a little push and I should be able to figure the rest out myself.

//includes

#include 

#include 

#include 

#include 



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

        

        int prodpid;

        int conspid;

        FILE *fin;



        printf("Waiting for data.txt to appear...\n");

        do {

                fin=fopen("data.txt", "rt");

        }while(fin==NULL);

        printf("Found it! Splitting now.\n");

        prodpid=fork();

        if(prodpid==0){

                

                char *c=(char*)malloc(4);

                FILE *fval;

                printf("Producer initialized!\n");

                

                while(fgets(c, 4, fin)!=NULL){



                        printf("Waiting for values.txt to disappear...\n");

                        do {

                                fval=fopen("values.txt", "rt");

                        }while(fval!=NULL);



                        printf("Values.txt is gone: processing...\n");

                        int i;

                        char line[2*i+2];

                        char buffer[100];

                        for(i=atoi(c); i>=0; i--){

                                sprintf(buffer, "%i", i);

                                strcat(line, buffer);

                                strcat(line, " ");

                        }

                        fwrite(line, 1, sizeof(line), fopen("values.txt", "w"));

                        printf("Done writing %s.\n", line);

                        fclose(fval);

                        

                }//done with all of the numbers in data.txt

                

                fclose(fin);

                

        }else{

                conspid=fork();

                if(conspid==0){

        

                        int cnt=0;

                        char *c=(char*)malloc(1024);

                        FILE *fval;

                        printf("Consumer initialized!\n");

        

                        while(1){

        

                                printf("Waiting for values.txt to appear...\n");

                                do {

                                        fval=fopen("values.txt", "rt");

                                }while(fval==NULL);

                                printf("Values.txt found! Processing...\n");

                                cnt++;

                                fgets(c, 1024, fval);

                                int num=atoi(strtok(c," "));

                                printf("Processing VALUES.TXT file number %i with values %s\nIt has %i odd numbers\n", cnt, c, num/2+1);

                                fclose(fval);

                                system("rm values.txt");

        

                        }

                        

                }else{wait(conspid);}

        }

wait(prodpid);

return 0;

}

Code Snippet List Windows Logical Drive Letters

Ancient Dragon — Wed, 11 Nov 2009 17:23:27 GMT

This demonstrates how to get a list of your computer's logical drive letters under the MS-Windows operating system.

System() command

shakunni — Wed, 11 Nov 2009 17:17:35 GMT

Hey,

I needed to delete a file created by a child process and our prof suggested that I use the system() command to do so. I 'manned' system but cant find anything useful on how to use it to delete an opened file. Can anyone suggest as to how this could be done?

Thanks,
Kunal.

product of two matrices with undefined number of rows and columns

imolorhe — Wed, 11 Nov 2009 15:34:10 GMT

Hello. Please, i have this little question of finding the product of two matrices in which the user enters the number of rows and columns. i would appreciate it if a solution is given and even more if there are more than one solutions to the question. thanks.

Code Snippet errno - perror vs fprintf + strerror

Is0r — Wed, 11 Nov 2009 15:23:29 GMT

Hi!

From the manpages I know, that perror evaluates the errno. So
using perror and fprintf + strerror, as coded in my example below, should result in the same error messages, but they do not.
The execution of the program leads to the following result:

bash> ./errno_test blub
fopen() failed: No such file or directory
fopen() failed
fopen() failed: Error code 29
fopen() failed: Error code Illegal seek

Can someone explain, where this behavior comes from? I think
fopen calls open, and open might invoke something such as a seek function. Is the errno set inappropriately? Or am I wrong about the
assumption, that perror and fprintf + strerror should cause the same output?

Thanks and Regards!

product of two matrices with undefined number of rows and columns

imolorhe — Wed, 11 Nov 2009 15:18:37 GMT

how can I list the drives/folders on pc (C Code)

cryptacker — Wed, 11 Nov 2009 15:00:19 GMT

hi everyone

I'm trying to listing files/drives/folders in pc but I couldnt find anything.

please help me ..

--[ cryptacker ]--

Const Int and Points

FIG-GHD742 — Wed, 11 Nov 2009 08:27:14 GMT

Hello.

I have a question about Const Int and Points

I have this code

    const int j=18;

    int *k= (int)&j;

    *k=110;

    printf("Data: %d -> %d; %d : %d-> %d\n", &j, j, k, &k, *k);

this well return for me
Data: 2280676 -> 18; 2280676 : 2280672-> 110
but if i remove "const" well i have
Data: 2280676 -> 110; 2280676 : 2280672-> 110 this work.

But how can same memory address have two int ( 18 and 110 )
Can somebody tell me how this are possible?

help me

Iam3R — Wed, 11 Nov 2009 07:12:22 GMT



#include 

#include 

static GMainLoop *loop; 



static gbooleanbus_call (GstBus *bus,GstMessage *msg, gpointer user_data)

{    

        switch (GST_MESSAGE_TYPE (msg))   

         {        

        case GST_MESSAGE_EOS:   

         {                

        g_message ("End-of-stream"); 

        g_main_loop_quit (loop); 

        break;       

       }       

 case GST_MESSAGE_ERROR:   

         {               



         gchar *debug;   

         GError *err;   

         gst_message_parse_error (msg, &err, &debug);  

         g_free (debug);    

         g_error ("%s", err->message);   

         g_error_free (err);  

         g_main_loop_quit (loop);    

         break;   

         }       

 default:        

    break;  

  }     

return true;

} 



voidplay_uri (gchar *uri)

{   

 GstElement *pipeline;   

  loop = g_main_loop_new (NULL, FALSE);  

   pipeline = gst_element_factory_make ("playbin", "player");   

  if (uri)   

 {       

         g_object_set (G_OBJECT (pipeline), "uri", uri, NULL); 

 }  

 

  {     

   GstBus *bus;    

     bus = gst_pipeline_get_bus (GST_PIPELINE (pipeline));  

      gst_bus_add_watch (bus, bus_call, NULL);  

      gst_object_unref (bus);  

  }  

  

 gst_element_set_state (GST_ELEMENT (pipeline), GST_STATE_PLAYING); 

 g_main_loop_run (loop);  

 gst_element_set_state (GST_ELEMENT (pipeline), GST_STATE_NULL);  

 gst_object_unref (GST_OBJECT (pipeline));

} 

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

{   

         gst_init (&argc, &argv);  

           play_uri (argv[1]);  

           return 0;

}

please some one let me know on which system this can be executed ?
i think its for gstreamer related
i have red hat .
can i install gstreamer on redhat
thanks,

Need Help sorting structures

yasaswyg — Wed, 11 Nov 2009 02:10:00 GMT

So I have part of my code done and I'm stuck on how to sort structures.
This is the code i have until now.

Its supposed to ask the user 3 things title, artist name, rating of song

and im supposed to ask the user to sort them in certain order

so its supposed to look something like this on the bottom
"Select the operation to perform -- (t)itle, (a)rtist, (r)ating, (f)ilter, (q)uit"

and its supposed to sort however the user prompts it to

#include 

#include 



struct playlist

{

        int rating;

        char title[80]; 

        char artist[60];

};

int main (void)

{

        struct playlist list1;

        int numOfSongs, i;



        printf("Enter the # of songs to be entered: ");

        scanf("%d", &numOfSongs);

        printf("Enter song info in this order : ");

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

        {

                

                scanf("%s%s%d", &list1.title, &list1.artist, &list1.rating);

                if (i%3)

                { 

                        printf("Enter the next song info in this order : ");

                        scanf("%s%s%d", &list1.title, &list1.artist, &list1.rating);

                }

        }

}

A whole bunch of Segmentation Faults

thure — Wed, 11 Nov 2009 01:07:56 GMT

Hi there,

This is my first time working with an unsafe language, so naturally my first code would be full of memory-related bugs. I still have no idea how I ought to approach some of the problems I've been getting, and I've been resisting asking for help as much as I could.

The assignment I've been given is a buttload of work, so I'd rather not bog anyone down with too much of it. At the moment, I'm trying to work out how to design a menu() function that gives main() both the function choice the user wants and the arguments for that function. Here's what I've got so far:

struct REPLY {

        char use[256];

        char pass[256];

        char type[64];

        char nuse[256];

        char npass[256];

        char ntype[64];

        int option;

};



struct REPLY *reply;



int menu (void)

{

        int o;

        printf("Please type a number corresponding to the following options:\n");

        printf("1. Add\n");

        printf("2. Delete\n");

        printf("3. Edit\n");

        printf("4. Purge\n");

        printf("5. Quit\n");

        scanf("Selection: %i\n", o);

        reply->option=o;

        printf("\n\n%i\n\n\n", reply->option);

        switch(reply->option){

                case '1':

                {

                        printf("Please provide the username.\n");

                        scanf("%s\n", &reply->use);

                        printf("Please provide the password.\n");

                        scanf("%s\n", &reply->pass);

                        printf("Please provide the user type.\n");

                        scanf("%s\n", &reply->type);

                        break;

                }

                case '2':

                {

                        printf("Please provide the username.\n");

                        scanf("%s\n",&reply->use);

                        break;

                }

                case '3':

                {

                        printf("Please provide the username.\n");

                        scanf("%s\n",&reply->use);

                        printf("Please provide the password.\n");

                        scanf("%s\n",&reply->use);

                        printf("Please provide the new username.\n");

                        scanf("%s\n",&reply->nuse);

                        printf("Please provide the new password.\n");

                        scanf("%s\n",&reply->npass);

                        printf("Please provide the new user type.\n");

                        scanf("%s\n",&reply->ntype);

                        break;

                }

                case '4':

                {

                        break;

                }

                case '5':

                {

                        break;

                }

        }

        

        return 0;

}

This code is saved as menu.c, which is included in the inclusion statements of the main function. I'm getting a segmentation fault at

        reply->option=o;

and I haven't been able to find out why. I also get the sense main won't be able to access reply for some reason.

I just need a push, and it's probably so simple it went over my head, but can someone help me out?

Runtime error: Amicable Number

prabindatta — Tue, 10 Nov 2009 22:29:17 GMT

#include 

#include 



struct amicable

{

        int** amicablePair;

        int size;

};



struct amicable *getAmicablePairs(int startnum, int endnum);

int sumFactors(int number);



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

    int startnum = 220;

    int endnum = 284;

    struct amicable* ami;

    int i;

    ami = getAmicablePairs(startnum, endnum);

    if(ami==NULL)

    {

        printf("Error: malloc could not allocate");

        return (EXIT_SUCCESS);

    }

    

    printf("{");



    for(i = 0; isize; i++)

    {

        printf("{%d, %d}",ami->amicablePair[i][0], ami->amicablePair[i][1]);

    }

    printf("}");

     

    //getch();

    //return 0;

    return (EXIT_SUCCESS);

}



int sumFactors(int number){

    int i;

    int sum;

    sum=1;



    for(i=2;i<=number/2;i++){

        if(number%i==0)

            {

                sum=sum+i;

            }

    }

    return sum;

}



struct amicable *getAmicablePairs(int startnum, int endnum)

{   

    int nrows=(endnum-startnum);

    int ncols=2;

        

    int i,j,k=0;

    

    struct amicable* record;



    /*  allocate array of pointers  */

    record->amicablePair=(int**)malloc(nrows*sizeof(int*));

    if(record->amicablePair==NULL)

  {

     printf("Error: malloc could not allocate %d bytes for a\n", 2 * sizeof(int *));

     return record;

  }

    /*  allocate each row  */

     for(i=0;i
          record->amicablePair[i]=(int*)malloc(ncols*sizeof(int));

          if(record->amicablePair[i]==NULL)

          {

            printf("Error: malloc could not allocate %d bytes for a\n", 3 * sizeof(int));

            return record;

         }

     }



     /* problem solution */

    for(i = startnum; i <= endnum; i++)

    {

        for(j = endnum; j >= startnum; j--)

        {

            if ((sumFactors(i)==j) && (sumFactors(j)==i) && (i != j))

            {

                record->amicablePair[k][0]=i;

                record->amicablePair[k][1]=j;

                k++;

            }

        }

    }

   

    record->size=k;    

    return record;

}

I am getting this error while executing (in netbeans 6.7) the above code:

      6 [main] asp11d 3400 _cygtls::handle_exceptions: Exception: STATUS_ACCESS_VIOLATION

    908 [main] asp11d 3400 open_stackdumpfile: Dumping stack trace to asp11d.exe.stackdump



RUN FAILED (exit value 35,584, total time: 421ms)

..............please send me solutions as soon as possible.................
Thanks in advance

urgent help needed in c

leena_gc — Tue, 10 Nov 2009 21:35:13 GMT

please can someone tell me the source code of a c program?
the program is
"create a c program to print the employee pay revision list using arrays and functions and structure"

please do reply fast as i need help urgently

Getline causing SIGSEGV

shmeeps — Tue, 10 Nov 2009 20:58:03 GMT

I'm working on a project for school. Normally I'm a C++ guy, but I have to go through standard C before that, so I'm struggling with certain aspects being different, such as getline. Here's essentially what I'm doing, I have a data file that has a certain about of lines of data. Each set of data is organized the same way and contains 19 pieces to it, consisting of floats, characters, and integers, so there is no trouble there. I read the first 18 elements using fscanf, which works fine, but then switch to getline for the last element which is a string that can contain spaces. However, any time I run this, it crashes with a SIGSEGV, citing strcpy and getdelim as the culprit. Here's the lies of code that really matter, I can post the whole function if necessary, it's just a bit big.

FILE *inputFile = fopen("data.txt", "r");

int bytes = 100;

char *namestr;

int x = 0;



// Get the last part, the name, and the terminating character with getline

namestr = (char *) malloc ((bytes + 1));        

x = getline(&namestr, &bytes, inputFile); // SIGSEGV

Anyone have any ideas?

create functions

mo_91 — Tue, 10 Nov 2009 17:49:29 GMT

Drawing Hello
1. Horizontal Hello
2. Diagonal Hello
Enter choice: 1

* * ****** * * ****
* * * * * * *
******* **** * * * *
* * * * * * *
* * ****** ****** ****** ****

Drawing Hello
1. Horizontal Hello
2. Diagonal Hello
Enter choice: 2

* *
* * ******
******* * *
* * **** * *
* * * * * ****
****** * * * *
****** * * *
****** * *
****