There is no guaranteed job available. Infact GNIIT gives 
you only job assistance. Only and Only if you perform well 
you would be placed. It doesnot matter whether it is GNIIT 
from NIIT or ACCP from Aptech.

union elements share common memory space

Embedded software is a program which will interact with the 
physical world. This will be written for a perticular 
machine or device which will be dedicated to that for ever.
example: Embedded software is buil in to electronic systems 
or cars, home appliances, televisions etc

Normal Software is nothing but the information technoly.

open() is the function created by the user......... which can be used to perform a specific task....

fopen() belongs to FILES..... this is a in built user defined function which is used to open a file which is already existing with the opening mode or create a new file....and which returns a pointer 

syntax:
   file_ptr=fopen("file name","opening mode");

writing program for database management like emplyoee
records....

arraging element in proper order

1.changing d sizeof cursor,
2 clearing d content of screen,
3 drawing graphics shapes 
4 formatting floppy drive
5 interacting with mouse

if a language (supports)follows ObjectOrientedProgramming 
concepts we can say it is a Object Oriented Programming.
 
Object Oriented Programing Concepts are:
1.class
2.object
3.Data Abstraction 
4.Encapsulation
5.Polymorphism
6.Inheritnace
7.Message Communication

Since it obeys OOPs concepts,it is said to be object 
oriented language....

There is no difference between const volatile int i and 
volatile const int j

both binary tree and b tree are same

A B-tree is a method of placing and locating files (called 
records or keys) in a database when all the data is known 
to be on DISK.
A Binary-tree is a method of placing and locating files 
(called records or keys) in a database when all the data is 
known to be in RAM.

It takes thousands of times longer to access a data element 
from hard disk as compared with accessing it from RAM, 
because a disk drive has mechanical parts, which read and 
write data far more slowly than purely electronic media. 

B-trees save time by using nodes with many branches (called 
children), compared with binary trees, in which each node 
has only two children. When there are many children per 
node, a record can be found by passing through fewer nodes 
than if there are two children per node.

Depth of a B-tree is smaller as compared to a binary tree 
and hence B-tree allows a desired record to be located 
faster, assuming all other system parameters are identical.

both b-tree and binary tree are same

void swap(char *s, char *p)
{
  if(0 == s || 0 == p)
    return;
  *s += *p;
  *p = *s - *p;
  *s = *s - *p;
}

int main()
{
  /* Use chars and not strings!! */
  char ac = 'A';
  char bc = 'B';
  char *a = ∾
  char *b = &bc;
  swap(a,b);
}

#include <cstdio>

void swap(char *c, char *d)
{
	*d = *c^*d;				// c = C		d = C^D
	*c = *c^*d;				// c = C^C^D	d = C^D
	*d = *c^*d;				// c = C^C^D	d = C^C^D^C^D
}

main()
{
	char c = 'c';
	char d = 'd';
	swap(&c, &d);
}

void swap(A,B)
{
A=*p;
B=*s;
getch();
}