[Updated] Goldman Sachs Aptitude Test Questions and Answers
Practice List of TCS Digital Coding Questions !!!
Take 50+ FREE!! Online Data Interpretation Mock test to crack any Exams.

# Recent Placement Papers of Societe Generale

82.06K

## Total Qs: 224+

NA
SHSTTON
192
Solv. Corr.
287
Solv. In. Corr.
479
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

Explanation:

Here is no explanation for this answer

NA
SHSTTON
592
Solv. Corr.
119
Solv. In. Corr.
711
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.

Explanation:

Here is no explanation for this answer

NA
SHSTTON
806
Solv. Corr.
145
Solv. In. Corr.
951
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.

Explanation:

Here is no explanation for this answer

NA
SHSTTON
177
Solv. Corr.
512
Solv. In. Corr.
689
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

Explanation:

Here is no explanation for this answer

NA
SHSTTON
181
Solv. Corr.
230
Solv. In. Corr.
411
Attempted
0 M:16 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

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
227
Solv. Corr.
648
Solv. In. Corr.
875
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

Explanation:

Here is no explanation for this answer

NA
SHSTTON
445
Solv. Corr.
377
Solv. In. Corr.
822
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

Explanation:

Here is no explanation for this answer

NA
SHSTTON
360
Solv. Corr.
537
Solv. In. Corr.
897
Attempted
0 M:7 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)

Explanation:

Here is no explanation for this answer

NA
SHSTTON
645
Solv. Corr.
352
Solv. In. Corr.
997
Attempted
0 M:49 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

Explanation:

Here is no explanation for this answer

NA
SHSTTON
818
Solv. Corr.
280
Solv. In. Corr.
1098
Attempted
0 M:9 S
Avg. Time

70 / 224

Choose the correct option.

The data structure required to evaluate a postfix expression is

Aqueue

Bstack

Carray