Online Aptitude Test for Societe Generale

In which layer the bridges are used.

In the transport layer ,TCP is what type of protocol

Time taken for addition of element in queue is

The data structure required for Breadth First Traversal on a graph is

Let the following circular queue can accommodate maximum six elements with the following data
front = 2 rear = 4
queue = _______; L, M, N, ___, ___
What will happen after ADD O operation takes place?

6, 8, 4, 3, and 1 are inserted into a data structure in that order. An item is deleted using only a basic data structure operation. If the deleted item is a 1, the data structure cannot be a ?

We need to implement a queue using a circular array. If DATA is a circular array of CAPACITY elements, and rear is an index into that array, what will be the index for the element after rear?

Which of the following algorithmic paradigm is used in the merge sort?

What is the worst case performance of Selection sort algorithm?

void fn( ){
char c;
cin.get(c);                   
if (c != '\n') {
fn( );
cout.put(c);
}
}