Take FREE!! Online Cocubes Mock Test to Crack various Companies Written Exams.
Get Off-Campus Placement Jobs Info !!!
Take 30+ FREE!! Online Arithmetic Aptitude Mock test to crack any Exams.

# Societe Generale Placement Questions & Answers :: Societe Generale

50.54K

## Total Qs: 224+

NA
SHSTTON
166
Solv. Corr.
237
Solv. In. Corr.
403
Attempted
0 M:0 S
Avg. Time

61 / 224

Choose the correct option.

Which of the following statement is false ?

AArrays are dense lists and static data structure

BData elements in linked list need not be stored in adjacent space in memory

CPointers store the next data element of a list

DLinked lists are collection of the nodes that contain information part and next pointer

| | Topic: | Asked In Societe Generale |

Explanation:

Here is no explanation for this answer

NA
SHSTTON
519
Solv. Corr.
103
Solv. In. Corr.
622
Attempted
0 M:28 S
Avg. Time

62 / 224

Choose the correct option.

The smallest element of an array's index is called its

Alower bound.

Bupper bound.

Crange.

Dextraction.

| | Topic: | Asked In Societe Generale |

Explanation:

Here is no explanation for this answer

NA
SHSTTON
700
Solv. Corr.
134
Solv. In. Corr.
834
Attempted
0 M:5 S
Avg. Time

63 / 224

Choose the correct option.

The largest element of an array index is called its

Alower bound.

Brange.

Cupper bound.

DAll of these.

| | Topic: | Asked In Societe Generale |

Explanation:

Here is no explanation for this answer

NA
SHSTTON
157
Solv. Corr.
464
Solv. In. Corr.
621
Attempted
0 M:24 S
Avg. Time

64 / 224

Choose the correct option.

The hash function is
H1(k) = k % 50.
In the case of collision, the hash function used is
H(k) = (H1(k) + M x H2(k)) % 50
where H1(k) = k % 50 and H2(k) = k % 20.
M is initialized to 0 and is incremented by 1 each time a collision occurs.
This could be categorized under which of the following collision detection technic

ALinear Probing

CRe-Hashing

DDouble Hashing

| | Topic: | Asked In Societe Generale |

Explanation:

Here is no explanation for this answer

NA
SHSTTON
157
Solv. Corr.
195
Solv. In. Corr.
352
Attempted
0 M:0 S
Avg. Time

65 / 224

Choose the correct option.

Which of the following technique stores data in the hash table itself in case of a collision?

CChaining using binary tree

| | Topic: | Asked In Societe Generale |

Explanation:

Open addressing is used to store data in the table itself in case of a collision. Whereas chaining stores data in a separate entity.

NA
SHSTTON
206
Solv. Corr.
562
Solv. In. Corr.
768
Attempted
0 M:18 S
Avg. Time

66 / 224

Choose the correct option.

A mathematical-model with a collection of operations defined on that model is called

BAbstract Data Type

CPrimitive Data Type

DAlgorithm

| | Topic: | Asked In Societe Generale |

Explanation:

Here is no explanation for this answer

NA
SHSTTON
383
Solv. Corr.
339
Solv. In. Corr.
722
Attempted
0 M:24 S
Avg. Time

67 / 224

Choose the correct option.

O(N) (linear time) is better than O(1) constant time.

ATRUE

BFALSE

| | Topic: | Asked In Societe Generale |

Explanation:

Here is no explanation for this answer

NA
SHSTTON
282
Solv. Corr.
417
Solv. In. Corr.
699
Attempted
0 M:2 S
Avg. Time

68 / 224

Choose the correct option.

An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of

Af(n) x g(n)

BMax ( f(n),g(n))

CMin (f(n),g(n))

Df(n) + g(n)

| | Topic: | Asked In |

Explanation:

Here is no explanation for this answer

NA
SHSTTON
468
Solv. Corr.
277
Solv. In. Corr.
745
Attempted
0 M:55 S
Avg. Time

69 / 224

Choose the correct option.

Convert the infix to postfix for A-(B+C)*(D/E)

AABC+DE/*-

BABC-DE/*-

CABC-DE*/-

DNone of the above

| | Topic: | Asked In 1 |

Explanation:

Here is no explanation for this answer

NA
SHSTTON
586
Solv. Corr.
183
Solv. In. Corr.
769
Attempted
0 M:10 S
Avg. Time

70 / 224

Choose the correct option.

The data structure required to evaluate a postfix expression is

Aqueue

Bstack

Carray

| | Topic: | Asked In |