Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


Write a C program that defines a 2-dimentional integer array
called A [50][50]. Then the elements of this array should
randomly be initialized either to 1 or 0. The program should
then print out all the elements in the diagonal (i.e.
a[0][0], a[1][1],a[2][2], a[3][3], ……..a[49][49]). Finally,
print out how many zeros and ones in the diagonal.

Answers were Sorted based on User's Feedback



Write a C program that defines a 2-dimentional integer array called A [50][50]. Then the elements o..

Answer / senthil

// correcting Cfuzz answer

#include <stdio.h>
#include <stdlib.h> // for rand function

#define ROWS 50
#define COLS 50

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

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

// here one loop is sufficient
for(i=0; i < ROWS; i++) {
printf("A[%d][%d] = %2d\n", i, i, A[i][i]);
if(A[i][i] == 0)
{
zero_cnt++;
}
else //if(A[i][i] == 1)
{
one_cnt++;
}
}
printf("\nNumber of zeros in the diagonal = %d", zero_cnt);
printf("\nNumber of ones in the diagonal = %d", one_cnt);
}

Is This Answer Correct ?    0 Yes 0 No

Write a C program that defines a 2-dimentional integer array called A [50][50]. Then the elements o..

Answer / pushpender singh

#include<stdio.h>

main
{
int a,b,c;
a[50][50];
b[][];
for(c=0;c>50;c+a)
{
a=a+c;
b=a;
}
printf("%d",b[][]);
}
}

Is This Answer Correct ?    0 Yes 2 No

Write a C program that defines a 2-dimentional integer array called A [50][50]. Then the elements o..

Answer / cfuzz

/* THIS CODE IS WRONG...CUZ I CAN'T COUNT ZEROS*/


#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] = 1;
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);
}



Is This Answer Correct ?    0 Yes 3 No

Post New Answer

More C Interview Questions

#include<stdio.h> int main() { int a[3][3][2]= {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18}; printf("%d\n",*(*(*a+1)); return 0; } What will be the output of the above question? And how?

1 Answers   Groupon,


What is the mean of function?

0 Answers  


What is the meaning of c in c language?

0 Answers  


There is a 100-story building and you are given two eggs. The eggs (and the building) have an interesting property that if you throw the egg from a floor number less than X, it will not break. And it will always brake if the floor number is equal or greater than X. Assuming that you can reuse the eggs which didn't broke; you got to find X in a minimal number of throws. Give an algorithm to find X in minimal number of throws.

5 Answers   Yahoo,


WHAT IS THE DEFINATION OF IN TECHNOLOGY AND OFF TECHNOLOGY ?

1 Answers   IBM,


When do you say that a digraph is acyclic A)if and only if its first search does not have back arcs B)a digraph is acyclic if and only if its first search does not have back vertices C)if and only if its first search does not have same dfnumber D)None of these

1 Answers   Accenture, IBM,


who is the father of c

4 Answers   Infosys,


what is array?

8 Answers  


What is volatile

2 Answers  


Can a file other than a .h file be included with #include?

0 Answers   Aspire, Infogain,


Is c is a middle level language?

0 Answers  


what is ans for this scanf(%%d",c);

1 Answers  


Categories