Answer / sanjay bhosale

Segments are nothing but sections for e.g code segment(also called text region),data segment, stack segment and heap segment.
They represent different parts of the process or different aspects of the process.

Offsets represents address where next read of write should begin.

Answer / mayank

When paging technique is performed ,The page will breaks in
to the segments and its sequence is said to be segments and
is width or can be said as length is called is offset.
In sort...
segment is physical address..
and offset is logical address..

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  

---

posted by surbhi just now main() { float a = 5.375; char *p; int i; p=(char*)&a; for(i=0;i<=3;i++) printf("%02x",(unsigned char) p[i]); } how is the output of this program is :: 0000ac40 please let me know y this output has come

2 Answers   GATE,

---

void main() { static int i=5; if(--i){ main(); printf("%d ",i); } }

1 Answers  

---

why nlogn is the lower limit of any sort algorithm?

0 Answers  

---

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)); }

1 Answers   Satyam,

---

---

#include <stdio.h> #define a 10 main() { #define a 50 printf("%d",a); }

2 Answers  

---

Write a C program to print look and say sequence? For example if u get the input as 1 then the sequence is 11 21 1211 111221 312211 12112221 .......(it counts the no. of 1s,2s etc which is in successive order) and this sequence is used in run-length encoding.

1 Answers  

---

write the function. if all the character in string B appear in string A, return true, otherwise return false.

11 Answers   Google,

---

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.

2 Answers  

---

main() { int c[ ]={2.8,3.4,4,6.7,5}; int j,*p=c,*q=c; for(j=0;j<5;j++) { printf(" %d ",*c); ++q; } for(j=0;j<5;j++){ printf(" %d ",*p); ++p; } }

2 Answers   CSS, Wipro,

---

main() { int i=-1,j=-1,k=0,l=2,m; m=i++&&j++&&k++||l++; printf("%d %d %d %d %d",i,j,k,l,m); }

1 Answers  

---

prog. to produce 1 2 3 4 5 6 7 8 9 10

4 Answers   TCS,

---