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.39K

Tot. Mock Test: 3


Total Qs: 224+

NA
SHSTTON
144
Solv. Corr.
157
Solv. In. Corr.
301
Attempted
0 M:0 S
Avg. Time

51 / 224

Choose the correct option.

In which layer the bridges are used.


Adata link layer

Bsession layer

Cphysical layer

Dnetwork layer

Answer: Option A

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
193
Solv. Corr.
89
Solv. In. Corr.
282
Attempted
0 M:0 S
Avg. Time

52 / 224

Choose the correct option.

In the transport layer ,TCP is what type of protocol


AConnection Less

BConnection Oriented

CApplication Protocol

DNone of these

Answer: Option B

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
835
Solv. Corr.
1271
Solv. In. Corr.
2106
Attempted
0 M:16 S
Avg. Time

53 / 224

Choose the correct option.

Time taken for addition of element in queue is


AO(1)

BO(n)

CO(log n)

DNone of these options

Answer: Option A

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
1215
Solv. Corr.
639
Solv. In. Corr.
1854
Attempted
0 M:17 S
Avg. Time

54 / 224

Choose the correct option.

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


Aqueue

Bstack

Carray

Dtree

Answer: Option A

Explanation:

Here is no explanation for this answer

ShortCut By :: Ankit

 For finding the shortest path BFS(Breadth First Search) uses Queue data structure and DFS(Depth First Search) uses Stack data structure.

Submit Your Solution

NA
SHSTTON
971
Solv. Corr.
652
Solv. In. Corr.
1623
Attempted
2 M:29 S
Avg. Time

55 / 224

Choose the correct option.

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?


Afront = 2 rear = 5 queue = ______; L, M, N, O, ___

Bfront = 3 rear = 5 queue = L, M, N, O, ___

Cfront = 3 rear = 4 queue = ______; L, M, N, O, ___

Dfront = 2 rear = 4 queue = L, M, N, O, ___

Answer: Option A

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
1139
Solv. Corr.
588
Solv. In. Corr.
1727
Attempted
0 M:48 S
Avg. Time

56 / 224

Choose the correct option.

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 ?


AQueue

BTree

CStack

DHash Table

Answer: Option A

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
84
Solv. Corr.
1371
Solv. In. Corr.
1455
Attempted
1 M:5 S
Avg. Time

57 / 224

Choose the correct option.

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?


A(rear + 1) % CAPACITY

Brear + (1 % CAPACITY)

Crear % (1 + CAPACITY)

D(rear % 1) + CAPACITY

Answer: Option D

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
639
Solv. Corr.
335
Solv. In. Corr.
974
Attempted
0 M:14 S
Avg. Time

58 / 224

Choose the correct option.

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


ADynamic Programming

BBackTracking

CGreedy method

DDivide and Conquer

Answer: Option D

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
447
Solv. Corr.
385
Solv. In. Corr.
832
Attempted
0 M:15 S
Avg. Time

59 / 224

Choose the correct option.

What is the worst case performance of Selection sort algorithm?


AO(log n)

BO(n* n)

CO(n)

DO(n log n)

Answer: Option B

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
86
Solv. Corr.
271
Solv. In. Corr.
357
Attempted
0 M:54 S
Avg. Time

60 / 224

What is the following code segment doing?
void fn( ){
char c;
cin.get(c);                   
if (c != '\n') {
fn( );
cout.put(c);
}
}

AThe string entered is printed as it is

BThe string entered is printed in reverse order.

CIt will go in an infinite loop.

DIt will print an empty line.

Answer: Option B

Explanation:

Here is no explanation for this answer

Submit Your Solution


Here is the list of questions asked in Online Aptitude Test for Societe Generale Societe Generale online arithmetic test. Practice Societe Generale Written Test Papers with Solutions and take Q4Interview Societe Generale Online Test Questions to crack Societe Generale written round test. Overall the level of the Societe Generale Online Assessment Test is moderate. Only those candidates who clear the written exam will qualify for the next round, so practic all the questions here and take all the free tests before going for final selection process of Societe Generale