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

28.02K

Tot. Mock Test: 3


Total Qs: 224+

NA
SHSTTON
413
Solv. Corr.
127
Solv. In. Corr.
540
Attempted
0 M:3 S
Avg. Time

71 / 224

Choose the correct option.

The data structure required to check whether an expression contains balanced parenthesis is


AStack

BQueue

CTree

DArray

Answer: Option A

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
147
Solv. Corr.
354
Solv. In. Corr.
501
Attempted
0 M:8 S
Avg. Time

72 / 224

Choose the correct option.

The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum


AThree nodes

BTwo nodes

COne node

DAny number of nodes

Answer: Option C

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
143
Solv. Corr.
553
Solv. In. Corr.
696
Attempted
0 M:0 S
Avg. Time

73 / 224

Choose the correct option.

Assume single linked list pseudo code as follows?

struct Node {
data
next
}
record List {
Node firstNode
}

function1(List list) {
obsoleteNode = list.firstNode; list.firstNode = list.firstNode.next; free obsoleteNode;
}

function2(node node) {
obsoleteNode = node.next; node.next= node.next.next; free obsoleteNode;
}

function3(Node node,Node newNode) {
newNode.next = node.next;node.next= newNode
}

function4(List list, Node newNode) {
newNode.next = list.firstNode; list.firstNode = newNode;
}


Afunction1 removes the first node

Bfunction2 removes node past this one

Cfunction3 inserts newNode after node

Dfunction4 inserts newNode after current first node

Answer: Option C

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
330
Solv. Corr.
524
Solv. In. Corr.
854
Attempted
0 M:12 S
Avg. Time

74 / 224

Choose the correct option.

Consider a linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer?


AO(1)

BO(log2 n)

CO(n)

DO(nlog2 n)

Answer: Option A

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
586
Solv. Corr.
212
Solv. In. Corr.
798
Attempted
0 M:3 S
Avg. Time

75 / 224

Choose the correct option.

In a linked list with n nodes, the time taken to insert an element after an element pointed by some pointer is


AO(1)

BO(log n)

CO(n)

DO(n1og n)

Answer: Option A

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
343
Solv. Corr.
403
Solv. In. Corr.
746
Attempted
0 M:0 S
Avg. Time

76 / 224

Choose the correct option.
Consider the following code segment in C to traverse a binary tree using the preorder

typedef struct tree {
int info;
struct  *left;
struct  *right;
}node;

void preorder(node *tree)
{
if (t)
{
Statementl
Statement2
Statement3
}
}
The above Statements should be

Apreorder(tree->right); preorder(tree->left); printf("%d", tree->info);

Bpreorder(tree->left); preorder(tree->right); printf("%d", tree->info);

Cpreorder(tree->left); printf("%d", tree->info); preorder(tree->right);

Dprintf("%d", tree->info); preorder(tree->left); preorder(tree->right);

Answer: Option D

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
169
Solv. Corr.
387
Solv. In. Corr.
556
Attempted
0 M:57 S
Avg. Time

77 / 224

Choose the correct option.

One can convert a binary tree into its mirror image by traversing it in


Ainorder

Bpreorder

Cpostorder

Dany orde

Answer: Option C

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
112
Solv. Corr.
351
Solv. In. Corr.
463
Attempted
0 M:18 S
Avg. Time

78 / 224

Choose the correct option.

A graph with n vertices will definitely have a parallel edge or self loop of the total number of edges are


Amore than n

Bmore than n+1

Cmore than (n+1)/2

Dmore than n(n-1)/2

Answer: Option D

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
114
Solv. Corr.
244
Solv. In. Corr.
358
Attempted
0 M:0 S
Avg. Time

79 / 224

Choose the correct option.

Let A be an adjacency matrix of a graph G. The ij entry in the matrix A^k , gives


AThe number of paths of length K from vertex Vi to vertex Vj.

BShortest path of K edges from vertex Vi to vertex Vj.

CLength of a Eulerian path from vertex Vi to vertex Vj.

DLength of a Hamiltonian cycle from vertex Vi to vertex Vj.

Answer: Option B

Explanation:

Here is no explanation for this answer

Submit Your Solution

NA
SHSTTON
191
Solv. Corr.
317
Solv. In. Corr.
508
Attempted
0 M:8 S
Avg. Time

80 / 224

Choose the correct option.

An adjacency matrix representation of a graph cannot contain information of :


Anodes

Bedges

Cdirection of edges

Dparallel edges

Answer: Option D

Explanation:

Here is no explanation for this answer

Submit Your Solution


Here is the list of questions asked in Campus Placement Papers of Societe Generale Placement Papers of Societe Generale Company. 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