Answer Posted / yogesh

#include<stdio.h>
int main(int argc,char *argv[])
{
FILE *fp;
char ch;
fp=fopen(argv[0],"r");
while(!feof(fp))
{
ch=fgetc(fp);
printf("%c",ch);
}
}

Compile the program as cc -o filename filename.c
and run as
./filename

how to create a 3x3 two dimensional array that will give you the sums on the left and bottom columns

3656

---

Develop a routine to reflect an object about an arbitrarily selected plane

3637

---

Set up procedure for generating a wire frame display of a polyhedron with the hidden edges of the object drawn with dashed lines

3554

---

how to test pierrot divisor

2774

---

write a c program to input initial & final time in the format hh:mm and find the time intervel between them? Ex inputs are initial 06:30 final 00:05 and 23:22 final 22.30

2712

---

#include int main(void) { int a=4, b=2; a=b<>2 ; printf("%d",a); return 0; }

1652

---

Write a routine to implement the polymarker function

4926

---

I need your help, i need a Turbo C code for this problem.. hope u'll help me guys.? Your program will have a 3x3 array. The user will input the sum of each row and each column. Then the user will input 3 values and store them anywhere, or any location or index, temporarily in the array. Your program will supply the remaining six (6) values and determine the exact location of each value in the array. Example: Input: Sum of row 1: 6 Sum of row 2: 15 Sum of row 3: 24 Sum of column 1: 12 Sum of column 2: 15 Sum of column 3: 18 Value 1: 3 Value 2: 5 Value 3: 6 Output: Sum of Row 1 2 3 6 4 5 6 15 7 8 9 24 Sum of Column 12 15 18 Note: Your program will not necessary sort the walues in the array Thanks..

3331

---

could you please send the program code for multiplying sparse matrix in c????

3598

---

What is the difference between proc means and proc tabulate ? explain with a simple example when you have to use means or tabulate?

4550

---

3) Int Matrix of certain size was given, We had few valu= es in it like this. =97=97=97=97=97=97=97=97=97=97=97 1 = | 4 | | 5 | &= nbsp; | 45 =97=97=97=97=97=97=97=97=97=97=97 &n= bsp; | 3 | 3 | 5 | = | 4 =97=97=97=97=97=97=97=97=97=97=97 34 |&nbs= p; 3 | 3 | | 12 | &= nbsp; =97=97=97=97=97=97=97=97=97=97=97 3 | &nbs= p; | 3 | 4 | = | 3 =97=97=97=97=97=97=97=97=97=97=97 3 | = ; | | | = ; 3 | =97=97=97=97=97=97=97=97=97=97=97 &= nbsp; | | 4 | = ; | 4 | 3 We w= ere supposed to move back all the spaces in it at the end. Note: = If implemented this prog using recursion, would get higher preference.

3789

---

why nlogn is the lower limit of any sort algorithm?

2868

---

How to palindrom string in c language?

11145

---

Design an implement of the inputs functions for event mode

3538

---

How can you relate the function with the structure? Explain with an appropriate example.

3469

---