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.
No Answer is Posted For this Question
Be the First to Post Answer
What are segment and offset addresses?
There is a lucky draw held every day. if there is a winning number eg 1876,then all possible numbers like 1867,1687,1768 etc are the numbers that match irrespective of the position of the digit. Thus all these numbers qualify fr the lucky draw prize Assume there is no zero digit in any numbers. write a program to show all the possible winning numbers if a "winning number"is passed as an arguments to the function.
# include <stdio.h> int one_d[]={1,2,3}; main() { int *ptr; ptr=one_d; ptr+=3; printf("%d",*ptr); }
func(a,b) int a,b; { return( a= (a==b) ); } main() { int process(),func(); printf("The value of process is %d !\n ",process(func,3,6)); } process(pf,val1,val2) int (*pf) (); int val1,val2; { return((*pf) (val1,val2)); }
main() { if (!(1&&0)) { printf("OK I am done."); } else { printf("OK I am gone."); } } a. OK I am done b. OK I am gone c. compile error d. none of the above
How do you sort a Linked List (singly connected) in O(n) please mail to pawan.10k@gmail.com if u can find an anser...i m desperate to knw...
6 Answers Microsoft, MSD, Oracle,
main() { int i, j; scanf("%d %d"+scanf("%d %d", &i, &j)); printf("%d %d", i, j); } a. Runtime error. b. 0, 0 c. Compile error d. the first two values entered by the user
#define a 10 int main() { printf("%d..",a); foo(); printf("%d..",a); return 0; } void foo() { #undef a #define a 50 }
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).
char inputString[100] = {0}; To get string input from the keyboard which one of the following is better? 1) gets(inputString) 2) fgets(inputString, sizeof(inputString), fp)
main() { static int var = 5; printf("%d ",var--); if(var) main(); }
main() { int i=5; printf(“%d”,i=++i ==6); }