#include<stdio.h>
int main()
{
struct bit field{
int x:4;
char c:6;
};
return 0;
}
(or)
struct bit_field{
unisgned int x:3;
unsigned int y:6;
unsigned int z:8;
};
int main()
{
struct bit_field bit;
bit.x=3;
bit.y=15;
bit.z=12;
}
}

A database index is a data structure that improves the speed of operations in a table. Indices can be created using one or more columns, providing the basis for both rapid random lookups and efficient ordering of access to records. The disk space required to store the index is typically less than the storage of the table (since indices usually contain only the key-fields according to which the table is to be arranged, and excludes all the other details in the table), yielding the possibility to store indices into memory from tables that would not fit into it. In a relational databasean index is a copy of part of a table. Some databases extend the power of indexing by allowing indices to be created on functions or expressions. For example, an index could be created on upper(last_name), which would only store the uppercase versions of the last_name field in the index. Another option sometimes supported is the use of "filtered" indices, where index entries are created only for those records that satisfy some conditional expression. A further aspect of flexibility is to permit indexing on user-defined functions, as well as expressions formed from an assortment of built-in functions.

The W3C specification for defining the structure, content, and semantics of XML documents.  

Extension -It is the number of tuples present in a table at any instance. This is time dependent.

Intension -It is a constant value that gives the name, structure of table and the constraints laid on it.

Unlike Relational systems in System R

Ø Domains are not supported

Ø Enforcement of candidate key uniqueness is optional

Ø Enforcement of entity integrity is optional

Ø Referential integrity is not enforced

Data independence means that "the application is independent of the storage structure and access strategy of data". In other words, The ability to modify the schema definition in one level should not affect the schema definition in the next higher level.

Two types of Data Independence:

Ø Physical Data Independence: Modification in physical level should not affect the logical level.

Ø Logical Data Independence: Modification in logical level should affect the view level.

NOTE: Logical Data Independence is more difficult to achieve

There are 2 kinds of heap - 1: a chunk of memory where data is stored and 2: a tree based data structure. When we talk about the heap and the stack we mean the first kind of heap.  The stack is a LIFO data structure that stores variables and flow control information. Typically each thread will have its own stack.

Information contained in an XML structure that is intended to be interpreted by a specific application.