Answer / lee

#include<stdio.h>
#include <stdlib.h>
#include<conio.h>
int main()
{
int A[50][50],i,j,z=0,k,o=0;
for( i = 0 ; i < 50 ; i++ )
{
for( j = 0 ; j < 50 ; j++ )
{
A[i][j]=rand() % 2;
}
}

printf("The diagonal elements are : \n");
for(i=0;i<50;i++)
{
for(j=0;j<50;j++)
{
if(i==j)
{
printf("%d\t",A[i][j]);
if(A[i][j]==0)
z++;
else
o++;
}
}
}

printf("The no. of zeroes : \t %d\nThe no. of ones : \t %d",z,o);
getch();
return 0;
}

Answer / cfuzz

/* this is my code, only thing I'm missing is counting
zeros...WHAT THE HELL am I doing WRONG?*/

#include <stdio.h>

#define ROWS 50
#define COLS 50

int count_occur(int A[], int num_elements, int value);


int main(void)
{
int A[ROWS][COLS];
int i=0, j=0;
int num_occ, value=0;

/* Initializing*/

for(i=0; i < ROWS; i++) {
for(j=0; j < COLS; j++) {
A[i][j] = 0;
A[i][j] = rand() % 2;

}
}

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

if (i == j){
printf("%2d", A[i][j]);
}
}



}

for(value=0; value<1; value++)
{

num_occ = count_occur(A, 50, value);

if (value = 1){

printf("\n\nThe value %d was found %d times.\n", value,
num_occ);
}

else if (value = 0){

printf("\n\nThe value %d was found %d times.\n", value,
num_occ);
}


}

}

int count_occur(int A[], int num_elements, int value)
/* checks array a for number of occurrances of value */
{
int i, count=0;
for (i=0; i<num_elements; i++)
{
if (A[i] == value)
{
++count; /* it was found */
}
}
return(count);
}

void main() { static int i; while(i<=10) (i>2)?i++:i--; printf(“%d”, i); }

2 Answers  

---

All the combinations of prime numbers whose sum gives 32

1 Answers   HHH,

---

void main() { int k=ret(sizeof(float)); printf("\n here value is %d",++k); } int ret(int ret) { ret += 2.5; return(ret); }

1 Answers  

---

&#8206;#define good bad main() { int good=1; int bad=0; printf ("good is:%d",good); }

2 Answers  

---

what will be the position of the file marker? a: fseek(ptr,0,SEEK_SET); b: fseek(ptr,0,SEEK_CUR);

2 Answers  

---

Question: We would like to design and implement a programming solution to the reader-writer problem using semaphores in C language under UNIX. We assume that we have three readers and two writers processes that would run concurrently. A writer is to update (write) into one memory location (let’s say a variable of type integer named temp initialized to 0). In the other hand, a reader is to read the content of temp and display its content on the screen in a formatted output. One writer can access the shared data exclusively without the presence of other writer or any reader, whereas, a reader may access the shared memory for reading with the presence of other readers (but not writers).

1 Answers  

---

programming in c lanugaue programm will errror error with two header file one as stdio.h and other one is conio.h

1 Answers  

---

Is the following code legal? void main() { typedef struct a aType; aType someVariable; struct a { int x; aType *b; }; }

1 Answers  

---

how to swap 3 nos without using temporary variable

4 Answers   Satyam,

---

#include<stdio.h> main() { const int i=4; float j; j = ++i; printf("%d %f", i,++j); }

1 Answers  

---

main() { int i=-1; -i; printf("i = %d, -i = %d \n",i,-i); }

1 Answers  

---

int main() { int x=10; printf("x=%d, count of earlier print=%d", x,printf("x=%d, y=%d",x,--x)); getch(); } ================================================== returns error>> ld returned 1 exit status =================================================== Does it have something to do with printf() inside another printf().

1 Answers  

---