Get Off-Campus Placement Jobs Info !!!
Programs asked in Mettl Coding Round
Click To Practce List of Programs asked in Nagarro !!!

# Societe Generale Placement Questions & Answers :: Societe Generale

25.56K

## Total Qs: 224+

NA
SHSTTON
33
Solv. Corr.
142
Solv. In. Corr.
175
Attempted
0 M:0 S
Avg. Time

81 / 224

Choose the correct option.

In what way the Symmetry Sparse Matrix can be stored efficiently?

BBinary tree

CHash table

DHeap

| | Topic: | Asked In Societe Generale |

Explanation:

Since Symmetry Sparse Matrix arises as the adjacency matrix of the undirected graph. Hence it can be stored efficiently as an adjacency list.

NA
SHSTTON
131
Solv. Corr.
35
Solv. In. Corr.
166
Attempted
0 M:0 S
Avg. Time

82 / 224

Choose the correct option.

If column-major order is used, how is the following matrix stored in memory? Babcdefghi

Dihgfedcba

| | Topic: | Asked In Societe Generale |

Explanation:

It starts with the first element and continues in the same column until the end of column is reached and then proceeds with the next column. Fortran follows column-major order.

NA
SHSTTON
237
Solv. Corr.
338
Solv. In. Corr.
575
Attempted
0 M:41 S
Avg. Time

83 / 224

Choose the correct option.

If the array is already sorted, then the running time for merge sort is: ?

AO(1)

BO(n*log n)

CO(n)

DO(n^2)

| | Topic: | Asked In Societe Generale |

Explanation:

Here is no explanation for this answer

NA
SHSTTON
183
Solv. Corr.
312
Solv. In. Corr.
495
Attempted
0 M:0 S
Avg. Time

84 / 224

Choose the correct option.

quicksort algorithm is used to sort an array of N elements. If all the N values w
complexity of quicksort that uses first element as the pivot. ?

AO(N*N)

BO(1)

CO(N)

DO(N log N)

| | Topic: | Asked In Societe Generale |

Explanation:

Here is no explanation for this answer

NA
SHSTTON
369
Solv. Corr.
147
Solv. In. Corr.
516
Attempted
0 M:14 S
Avg. Time

85 / 224

Choose the correct option.

The complexity of merge sort algorithm is

AO(n)

BO(log n)

CO(n2)

DO(n log n)

| | Topic: | Asked In Societe Generale |

Explanation:

Here is no explanation for this answer

NA
SHSTTON
73
Solv. Corr.
157
Solv. In. Corr.
230
Attempted
0 M:0 S
Avg. Time

86 / 224

Choose the correct option.

What is the time taken to delete a minimum element in a leftist heap?

AO(N)

BO(N log N

CO(log N)

DO(M log N)

| | Topic: | Asked In Societe Generale |

Explanation:

The time taken to delete a minimum element in a leftist heap is mathematically found to be O(log N).

NA
SHSTTON
93
Solv. Corr.
110
Solv. In. Corr.
203
Attempted
0 M:0 S
Avg. Time

87 / 224

Choose the correct option.

The amortized time efficiency for performing deletion of a minimum element is?

AO(N)

BO(log N)

CO(N2)

DO(M log N)

| | Topic: | Asked In Societe Generale |

Explanation:

The amortized time efficiency for performing deletion of a minimum element is mathematically found to be O(log N).

NA
SHSTTON
259
Solv. Corr.
271
Solv. In. Corr.
530
Attempted
1 M:39 S
Avg. Time

88 / 224

Which one of the following statements about the function Process Array is CORRECT?
Consider the C function given below. Assume the array listA contains (n>0) elements, sorted in ascending order.

int Process array (int * list A, int x, int n)
{
int i, j, k;
i =0;j=n-1;
do {
k = (i+j)/2;
if (x<=list A[k])
j=k-1;
if (list A[k] <=x)
i =k+1;
} while (i <=j);
if (list A[k] == x)
return (k);
else
return -1;
}

AIt will run into an infinite loop when x is not in listA

BIt is an implementation of binary search.

CIt will always find the maximum element in listA.

DIt will return -1 even when x is present in listA.

| | Topic: | Asked In |

Explanation:

Here is no explanation for this answer

NA
SHSTTON
297
Solv. Corr.
271
Solv. In. Corr.
568
Attempted
0 M:0 S
Avg. Time

89 / 224

Choose the correct option.

In worst case Quick Sort has order

AO(n log n)

B$$O\left(n^{2}\right)$$

CO(log n)

D$$O\left(\frac{n^{2}}{4}\right)$$

| | Topic: | Asked In Societe Generale |

Explanation:

Here is no explanation for this answer

NA
SHSTTON
108
Solv. Corr.
155
Solv. In. Corr.
263
Attempted
0 M:0 S
Avg. Time

90 / 224

Choose the correct option.

Select the code snippet which returns the top of the stack.

I. public int top()
{
if(q1.size()>0)
{
return q1.poll();
}
else if(q2.size()>0)
{
return q2.poll();
}
return 0;
}

II. public int top()
{
if(q1.size()==0)
{
return q1.peek();
}
else if(q2.size()==0)
{
return q2.peek();
}
return 0;
}

III. public int top()
{
if(q1.size()>0)
{
return q1.peek();
}
else if(q2.size()>0)
{
return q2.peek();
}
return 0;
}

IV. public int top()
{
if(q1.size()>0)
{
return q2.peek();
}
else if(q2.size()>0)
{
return q1.peek();
}
return 0;
}

AI

BII

CIII

DIV

| | Topic: | Asked In Societe Generale | 