Explore topic-wise InterviewSolutions in .

Just as a HANDWRITTEN signature is affixed to a printed letter for VERIFICATION that the letter originated from its purported sender, digital signature performs the same task for an ELECTRONIC MESSAGE. A digital signature is an encrypted version of a message digest, attached together with a message.

Just as a handwritten signature is affixed to a printed letter for verification that the letter originated from its purported sender, digital signature performs the same task for an electronic message. A digital signature is an encrypted version of a message digest, attached together with a message.

Decryption is the REVERSE of ENCRYPTION; it's the transformation of encrypted data back into some intelligible FORM.

Decryption is the reverse of encryption; it's the transformation of encrypted data back into some intelligible form.

The static identifier is used for initializing only once, and the value retains during the life time of the PROGRAM / application. A SEPARATE MEMORY is allocated for ‘static’ variables. This value can be used between function calls. The default value of an uninitialized static variable is zero. A function can also be DEFINED as a static function, which has the same SCOPE of the static variable.

The static identifier is used for initializing only once, and the value retains during the life time of the program / application. A separate memory is allocated for ‘static’ variables. This value can be used between function calls. The default value of an uninitialized static variable is zero. A function can also be defined as a static function, which has the same scope of the static variable.

An enumeration is a data type, used to DECLARE variable that store LIST of NAMES. It is ACT like a database, which will store list of items in the variable. example: enum shapes{TRIANGLE, rectangle,...

An enumeration is a data type, used to declare variable that store list of names. It is act like a database, which will store list of items in the variable. example: enum shapes{triangle, rectangle,...

INT binarySearch(int arr[],int SIZE, int item)

{

int left, RIGHT, middle;

left = 0;

right = size-1;

while(left <= right)

{

middle = ((left + right)/2);

if(item == arr[middle])

{

RETURN(middle);

}

if(item > arr[middle])

{

left = middle+1;

}

else

{

right = middle-1;

}

}

return(-1);

}

int binarySearch(int arr[],int size, int item)

{

int left, right, middle;

left = 0;

right = size-1;

while(left <= right)

{

middle = ((left + right)/2);

if(item == arr[middle])

{

return(middle);

}

if(item > arr[middle])

{

left = middle+1;

}

else

{

right = middle-1;

}

}

return(-1);

}

Garbage collection is the systematic recovery of pooled computer storage that is being used by a program when that program no LONGER NEEDS the storage. This frees the storage for use by other programs 

(or processes within a program). It also ensures that a program using increasing amounts of pooled storage does not reach its quota (in which case it may no longer be able to FUNCTION). 

Garbage collection is an automatic memory management feature in many modern programming LANGUAGES, such as Java and languages in the .NET framework. Languages that use garbage collection are often interpreted or run within a virtual machine like the JVM. In each case, the environment that runs the code is also responsible for garbage collection.

Garbage collection is the systematic recovery of pooled computer storage that is being used by a program when that program no longer needs the storage. This frees the storage for use by other programs 

(or processes within a program). It also ensures that a program using increasing amounts of pooled storage does not reach its quota (in which case it may no longer be able to function). 

Garbage collection is an automatic memory management feature in many modern programming languages, such as Java and languages in the .NET framework. Languages that use garbage collection are often interpreted or run within a virtual machine like the JVM. In each case, the environment that runs the code is also responsible for garbage collection.

Applet is java program that can be embedded into HTML pages. Java applets runs on the java enables WEB browsers such as mozila and internet EXPLORER. Applet is designed to run remotely on the client browser, so there are some RESTRICTIONS on it. Applet can't access SYSTEM resources on the local computer. Applets are used to make the web site more dynamic and entertaining.

Applet is java program that can be embedded into HTML pages. Java applets runs on the java enables web browsers such as mozila and internet explorer. Applet is designed to run remotely on the client browser, so there are some restrictions on it. Applet can't access system resources on the local computer. Applets are used to make the web site more dynamic and entertaining.

The keywords used in java APPLICATION are try, CATCH and FINALLY are used in implementing used-defined exceptions. This Exception class inherits all the METHOD from Throwable class.

The keywords used in java application are try, catch and finally are used in implementing used-defined exceptions. This Exception class inherits all the method from Throwable class.

INTERRUPT is an asynchronous SIGNAL informing a program that an event has occurred. When a program receives an interrupt signal, it takes a SPECIFIED ACTION.

Interrupt is an asynchronous signal informing a program that an event has occurred. When a program receives an interrupt signal, it takes a specified action.

SCOPE refers to the visibility of variables. It is very useful to be able to limit a VARIABLE's scope to a single function. In other words, the variable wil have a LIMITED scope

Scope refers to the visibility of variables. It is very useful to be able to limit a variable's scope to a single function. In other words, the variable wil have a limited scope

An INTERPRETER reads ONE instruction at a time and carries out the actions implied by that instruction. It does not PERFORM any translation. But a compiler translates the entire INSTRUCTIONS

An interpreter reads one instruction at a time and carries out the actions implied by that instruction. It does not perform any translation. But a compiler translates the entire instructions

a) A recursive function is a function which calls itself.

b) The speed of a recursive program is slower because of STACK overheads. (This attribute is evident if you run above C program.)

c) A recursive function must have recursive conditions, terminating conditions, and recursive EXPRESSIONS.

Stack data structure . Because of its LIFO (Last In First Out) PROPERTY it remembers its CALLER so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls. Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be USED.

a) A recursive function is a function which calls itself.

b) The speed of a recursive program is slower because of stack overheads. (This attribute is evident if you run above C program.)

c) A recursive function must have recursive conditions, terminating conditions, and recursive expressions.

Stack data structure . Because of its LIFO (Last In First Out) property it remembers its caller so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls. Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.

If you want to get information on all the techniques of designing, maintaining, building and retrieving data, Data warehousing is the ideal method. A data warehouse is premeditated and generated for supporting the decision making process within an organization.

Here are some of the benefits of a data warehouse:

• With data warehousing, you can provide a common data model for different interest AREAS regardless of data's source. In this way, it BECOMES easier to report and analyze information.
• Many inconsistencies are identified and resolved before loading of information in data warehousing. This makes the reporting and analyzing process simpler.
• The BEST part of data warehousing is that the information is under the control of users, so that in case the system gets purged over time, information can be easily and safely stored for longer time period.
• Because of being different from operational systems, a data warehouse helps in retrieving data without slowing down the operational system.
• Data warehousing enhances the value of operational business applications and customer relationship management systems.
• Data warehousing also leads to proper functioning of support system applications like trend reports, exception reports and the actual performance analyzing reports.

Data MINING is a powerful new technology to extract data for analysis.

If you want to get information on all the techniques of designing, maintaining, building and retrieving data, Data warehousing is the ideal method. A data warehouse is premeditated and generated for supporting the decision making process within an organization.

Here are some of the benefits of a data warehouse:

Data mining is a powerful new technology to extract data for analysis.

A conversion constructor is a single-parameter constructor that is declared without the function specifier 'explicit'. The COMPILER uses conversion constructors to CONVERT objects from the type of the first parameter to the type of the conversion constructor's class.To define implicit CONVERSIONS, C++ uses conversion constructors, constructors that ACCEPT a single parameter and initialize an object to be a copy of that parameter.

A conversion constructor is a single-parameter constructor that is declared without the function specifier 'explicit'. The compiler uses conversion constructors to convert objects from the type of the first parameter to the type of the conversion constructor's class.To define implicit conversions, C++ uses conversion constructors, constructors that accept a single parameter and initialize an object to be a copy of that parameter.

The keyword DELETE is USED to destroy the single variable memory CREATED dynamically which is pointed by single pointer variable.

Eg: int *r=new(int)

the memory pointed by r can be DELETED by delete r.

delete [] is used to destroy array of memory pointed by single pointer variable.

Eg:int *r=new(int a[10])

The memory pointed by r can be deleted by delete []r.

The keyword delete is used to destroy the single variable memory created dynamically which is pointed by single pointer variable.

Eg: int *r=new(int)

the memory pointed by r can be deleted by delete r.

delete [] is used to destroy array of memory pointed by single pointer variable.

Eg:int *r=new(int a[10])

The memory pointed by r can be deleted by delete []r.

The difference between the two is that operator new just ALLOCATES raw memory, nothing else. The new operator starts by using operator new to allocate memory, but then it invokes the constructor for the right TYPE of OBJECT, so the result is a real live object created in that memory. If that object contains any other objects (either embedded or as base classes) those CONSTRUCTORS as invoked as well.

The difference between the two is that operator new just allocates raw memory, nothing else. The new operator starts by using operator new to allocate memory, but then it invokes the constructor for the right type of object, so the result is a real live object created in that memory. If that object contains any other objects (either embedded or as base classes) those constructors as invoked as well.

Data STRUCTURE alignment is the WAY data is ARRANGED and accessed in computer MEMORY. It consists of TWO separate but related issues: data alignment and data structure padding. 

Data structure alignment is the way data is arranged and accessed in computer memory. It consists of two separate but related issues: data alignment and data structure padding. 

1. const char *p - POINTER to a CONSTANT char ('p' isn't MODIFIABLE but the pointer is)
2. char const *p - Also pointer to a constant Char 

However if you had something like:

char * const p - This DECLARES 'p' to be a constant pointer to an char. (Char p is modifiable but the pointer isn't)

However if you had something like:

char * const p - This declares 'p' to be a constant pointer to an char. (Char p is modifiable but the pointer isn't)

A DEBUGGER or debugging TOOL is a COMPUTER PROGRAM that is used to test and debug other programs

A debugger or debugging tool is a computer program that is used to test and debug other programs

Cache Memory is used by the CENTRAL processing unit of a computer to reduce the average time to ACCESS memory. The cache is a smaller, faster memory 

which STORES copies of the data from the most FREQUENTLY used main memory LOCATIONS. As long as most memory accesses are cached memory locations, the average

latency of memory accesses will be closer to the cache latency than to the latency of main memory.

Cache Memory is used by the central processing unit of a computer to reduce the average time to access memory. The cache is a smaller, faster memory 

which stores copies of the data from the most frequently used main memory locations. As long as most memory accesses are cached memory locations, the average

latency of memory accesses will be closer to the cache latency than to the latency of main memory.

stdarg.h

stdarg.h

Getting the arguments from command PROMPT in c is known as command LINE arguments. In c MAIN function has three arguments.They are:

1. Argument counter
2. Argument vector
3. Environment vector

Getting the arguments from command prompt in c is known as command line arguments. In c main function has three arguments.They are:

1. PHYSICAL level : how the DATA is stored PHYSICALLY and where it is stored in database.
2. Logical level : what information or data is stored in the database. eg: Database administrator
3. View level : END users work on view level. if any amendment is made it can be saved by other name.

A DOUBLY linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains TWO fields, called links, that are references to the PREVIOUS and to the next node in the sequence of nodes. The beginning and ending nodes' previous and next links, respectively, point to some kind of TERMINATOR, typically a sentinel node or null, to facilitate traversal of the list. If there is only one sentinel node, then the list is circularly linked via the sentinel node. It can be conceptualized as two singly linked LISTS formed from the same data items, but in opposite sequential orders.

A doubly linked list is a linked data structure that consists of a set of sequentially linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the sequence of nodes. The beginning and ending nodes' previous and next links, respectively, point to some kind of terminator, typically a sentinel node or null, to facilitate traversal of the list. If there is only one sentinel node, then the list is circularly linked via the sentinel node. It can be conceptualized as two singly linked lists formed from the same data items, but in opposite sequential orders.

In an operating system, a deadlock is a situation which occurs when a process enters a waiting state because a resource requested by it is being held by another waiting process, which in turn is waiting for another resource. If a process is unable to change its state INDEFINITELY because the resources requested by it are being used by other waiting process, then the system is said to be in a deadlock.

Mutual Exclusion: At least one resource must be non-shareable.[1] Only one process can use the resource at any given instant of TIME.

Hold and Wait or Resource HOLDING: A process is currently holding at least one resource and requesting additional resources which are being held by other processes.

No Preemption: The operating system must not de-allocate resources once they have been allocated; they must be released by the holding process voluntarily.

Circular Wait: A process must be waiting for a resource which is being held by another process, which in turn is waiting for the first process to release the resource. In general, there is a set of waiting processes, P = {P1, P2, ..., PN}, such that P1 is waiting for a resource held by P2, P2 is waiting for a resource held by P3 and so on till PN is waiting for a resource held by P1.[1][7]

Thus prevention of deadlock is possible by ensuring that at least one of the FOUR conditions cannot hold.

In an operating system, a deadlock is a situation which occurs when a process enters a waiting state because a resource requested by it is being held by another waiting process, which in turn is waiting for another resource. If a process is unable to change its state indefinitely because the resources requested by it are being used by other waiting process, then the system is said to be in a deadlock.

Mutual Exclusion: At least one resource must be non-shareable.[1] Only one process can use the resource at any given instant of time.

Hold and Wait or Resource Holding: A process is currently holding at least one resource and requesting additional resources which are being held by other processes.

No Preemption: The operating system must not de-allocate resources once they have been allocated; they must be released by the holding process voluntarily.

Circular Wait: A process must be waiting for a resource which is being held by another process, which in turn is waiting for the first process to release the resource. In general, there is a set of waiting processes, P = {P1, P2, ..., PN}, such that P1 is waiting for a resource held by P2, P2 is waiting for a resource held by P3 and so on till PN is waiting for a resource held by P1.[1][7]

Thus prevention of deadlock is possible by ensuring that at least one of the four conditions cannot hold.

The two types of integrity RULES are referential integrity rules and entity integrity rules. Referential integrity rules dictate that a DATABASE does not contain orphan FOREIGN key values. This means that A primary key value cannot be modified if the value is USED as a foreign key in a child table. Entity integrity dictates that the primary key value cannot be Null.

The two types of integrity rules are referential integrity rules and entity integrity rules. Referential integrity rules dictate that a database does not contain orphan foreign key values. This means that A primary key value cannot be modified if the value is used as a foreign key in a child table. Entity integrity dictates that the primary key value cannot be Null.

• COMPILER Design,
• Operating System,
• DATABASE Management System,
• STATISTICAL ANALYSIS package,
• NUMERICAL Analysis,
• Graphics,
• Artificial Intelligence,
• Simulation

Arrays is a GROUP of SIMILAR DATA types but STRUCTURES can be group of different data types.

Arrays is a group of similar data types but Structures can be group of different data types.

An abstract class is a class which does not fully represent an object. INSTEAD, it represents a BROAD range of different classes of objects. However, this representation extends only to the features that those classes of objects have in COMMON. Thus, an abstract class provides only a PARTIAL description of its objects.

An abstract class is a class which does not fully represent an object. Instead, it represents a broad range of different classes of objects. However, this representation extends only to the features that those classes of objects have in common. Thus, an abstract class provides only a partial description of its objects.

Macros are PROCESSOR directive which will be replaced at compile time.

The disadvantage with macros is that they just replace the code they are not function CALLS. similarly the ADVANTAGE is they can REDUCE time for replacing the same values.

Macros are processor directive which will be replaced at compile time.

The disadvantage with macros is that they just replace the code they are not function calls. similarly the advantage is they can reduce time for replacing the same values.

<P>USE %p in PRINTF to PRINT the ADDRESS.

Use %p in printf to print the address.

There are FOUR TYPES of storage CLASSES in C. They are extern, register, auto and static

There are four types of storage classes in C. They are extern, register, auto and static

Functions are DECLARED within header file. That is FUNCTION prototypes exist in a header file,not function bodies. They are DEFINED in library (LIB).

Functions are declared within header file. That is function prototypes exist in a header file,not function bodies. They are defined in library (lib).

1. JAVA is Object-Oriented while C is procedural.
2. Java is an Interpreted language while C is a compiled language.
3. C is a low-level language while JAVA is a high-level language.
4. C uses the top-down approach while JAVA uses the bottom-up approach.
5. Pointer go BACKSTAGE in JAVA while C requires explicit handling of pointers.
6. The Behind-the-scenes Memory Management with JAVA & The User-Based Memory Management in C.
7. JAVA supports Method Overloading while C does not support overloading at all.
8. UNLIKE C, JAVA does not support Preprocessors, & does not really them.
9. The standard Input & OUTPUT Functions--C uses the PRINTF & scanf functions as its standard input & output while JAVA uses the System.out.print & System.in.read functions.
10. EXCEPTION Handling in JAVA And the errors & crashes in C.