Big Endian In big endian, you store the most significant byte in the smallest address. Here’s how it would look:   Address Value 1000 90 1001 AB 1002 12 1003 CD Little Endian In little endian, you store the least … Continue reading →

Optimization Levels Without any optimization option, the compiler’s goal is to reduce the cost of compilation and to make debugging produce the expected results. Statements are independent: if you stop the program with a breakpoint between statements, you can then … Continue reading →

What is a Thread? Technically, a thread is defined as an independent stream of instructions that can be scheduled to run as such by the operating system. But what does this mean?  To the software developer, the concept of a … Continue reading →

Figure of circular queue R->Rear F->Front Initially rear=front=0 Circular queue is as shown in figure it is like a array size in which element are from 0 to (n-1) if array is of length n it is divided into nodes … Continue reading →

fifo is just similar to pipe as its second name suggest which is named pipe… In fifo and pipe first difference is pipe cannot be seen in directory but named pipe(fifo ) can be accessed or seen inside the pipe … Continue reading →

Semaphore is quiet easy and simple… Lets take an example from our real life which makes semaphore a simple task for me…. when we are using a printer on lan network and ten’s of computer are connected to the same … Continue reading →

Process:- Process is execution of set of statements in sequential way. Fork():-It is a system call that create a duplicate process of the process which is evoking the system call(fork). After the fork statement the remaining part of a process … Continue reading →

Comparison between different processors currently in use.

If any one of you want to get auto indenting while writing code in vim editor and if you are fed up of giving command again and again in every page go to /etc and than open file named vimrc … Continue reading →

I have completed data decompression with functions and get the actual data back from the compress file.

1 head 1.20; 2 access; 3 symbols; 4 locks 5 root:1.20; strict; 6 comment @ * @; 7 8 9 1.20 10 date 2014.02.24.18.01.15; author root; state Exp; 11 branches; 12 next 1.19; 13 14 1.19 15 date 2014.02.24.08.37.55; author … Continue reading →

Completed my master array declaring functions of each type.

#include<stdio.h> int main() { int i,l,a,b,c; int lcm=1,hcf=1; int prime[26]={1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97}; printf(“enter the numbers”); scanf(“%d%d%d”,&a,&b,&c); for(i=1;i<26;i++) { l=prime[i]; if(a%l==0 && b%l==0 && c%l==0) { hcf*=l; } else { if(a%l==0) lcm*=l; if(b%l==0) lcm*=l; if(c%l==0) lcm*=l; } } } printf(“\nHcf of three number … Continue reading →