Do you know how memory is allocated for structure members in C Always, contiguous(adjacent) memory locations are used to store structure members in memory. Consider below example to understand how memory is allocated for structures. Example program for memory allocation … Continue reading →

When you develop a desktop or server application, almost always the development platform (the machine that runs your compiler) and the target platform (the machine that runs your application) are the same. By “platform” I mean the combination of CPU … Continue reading →

booting process. 1.BIOS(Basic Input/Output System) 2.MBR(Master Boot Record) 3.LILO or GRUB LILO:-LInux LOader GRUB:-GRand Unified Bootloader 4.Kernel 5.init 6.Run Levels 1.BIOS: i.When we power on BIOS performs a Power-On Self-Test (POST) for all of the different hardware components in the … Continue reading →

2 RCS file: shel4,v 3 Working file: shel4 4 head: 1.1 5 branch: 6 locks: strict 7         root: 1.1 8 access list: 9 symbolic names: 10 keyword substitution: kv 11 total revisions: 1;     selected revisions: 1 12 description: 13 program … Continue reading →

shell script is powerful and easy to use programming language. They are used for doing multiple jobs at a time. In shell script memory allocation is done on interpreter in the form of byte. shell script are interpreted not complied. … Continue reading →

RCS file: msg.c,v Working file: msg.c head: 1.19 branch: locks: strict akshat: 1.19 access list: symbolic names: keyword substitution: kv total revisions: 19;    selected revisions: 19 description: IPC project. This projectb is client server based project using msg queues. Server … Continue reading →

head 1.1; access; symbols; locks arjun:1.1; strict; comment @ * @; 1.1 date 2014.04.01.15.08.45; author arjun; state Exp; branches; next ; desc @we are using msg queue in ipc project @ 1.1 log @Initial revision @

Bash is the shell, or command language interpreter, for the GNU operating system. The name is an acronym for the ‘Bourne-Again SHell’, a pun on Stephen Bourne, the author of the direct ancestor of the current Unix shell sh, which … Continue reading →

head    1.1; access; symbols; locks root:1.1; strict; comment    @ * @; 1.1 date    2014.04.01.11.46.19;    author root;    state Exp; branches; next    ; desc @push and pop in stack . @ 1.1 log @Initial revision @ text @#include<stdio.h> #include<stdlib.h> #define MAX 5 … Continue reading →

up vote 8 down vote accepted Physical addressing means that your program actually knows the real layout of RAM. When you access a variable at address 0x8746b3, that’s where it’s really stored in the physical RAM chips. With virtual addressing, … Continue reading →

SIMPLE USES OF SOCKET PROGRAMMING IN EMBEDDED SYSTEMS LINUX WITH ‘C’ Typically two processes communicate with each other on a single system through one of the following inter process communication techniques. Pipes Message queues Shared memory There are several other … Continue reading →

RCS file: server_thread.c,v 3 Working file: server_thread.c 4 head: 1.1 5 branch: 6 locks: strict 7         root: 1.1 8 access list: 9 symbolic names: 10 keyword substitution: kv 11 total revisions: 1;     selected revisions: 1 12 description: 13 this is … Continue reading →

whats the diffrenece between these two?? int *function (int) int (*function) (int)

//header.h// #include 2 #include 3 #define MAX 5 4 int push(void **,int *); 5 int pop(void **,int *); 6 void display(void **,int *); //fun.c// #include”abc.h” 2 int push(void **astack,int *atop) 3 { 4 static char ch=1; 5 if(*atop >= MAX-1) … Continue reading →