[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.

NA
SHSTTON
214
Solv. Corr.
1015
Solv. In. Corr.
1229
Attempted
0 M:43 S
Avg. Time

21 / 48

Choose the correct option.

ANodes

BStructure

CReferential Structures

DNone of these

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
208
Solv. Corr.
819
Solv. In. Corr.
1027
Attempted
0 M:16 S
Avg. Time

22 / 48

Choose the correct option.

The concatenation of 2 lists can be performed O(1) time. Which of the following implementation of list should be used?

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
66
Solv. Corr.
229
Solv. In. Corr.
295
Attempted
0 M:5 S
Avg. Time

23 / 48

Choose the correct option.

Which of the following is not the properties of XOR lists?

AX⊕X = 0

B(X⊕Y)⊕Z = X⊕(Y⊕Z)

CX⊕0 = X

DX⊕0 = 1

ENone of these

Explanation:

The important properties of XOR lists are X⊕X=0 , X⊕0=X and (X⊕Y)⊕Z = X⊕(Y⊕Z).

Workspace

NA
SHSTTON
123
Solv. Corr.
167
Solv. In. Corr.
290
Attempted
0 M:17 S
Avg. Time

24 / 48

Choose the correct option.

What is a skip list?

Aa linkedlist with size value in nodes

Ba linkedlist that allows slower search within an ordered sequence

Ca linkedlist that allows faster search within an ordered sequence

Da tree which is in the form of linked list

ENone of these

Explanation:

It is a datastructure, which can make search in sorted linked list faster in the same way as binary search tree and sorted array (using binary search) are faster.

Workspace

NA
SHSTTON
80
Solv. Corr.
203
Solv. In. Corr.
283
Attempted
0 M:0 S
Avg. Time

25 / 48

Choose the correct option.

To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?

Abalanced binary search trees

Bbinary trees

Cbinary search trees

ENone of these

Explanation:

Skip lists are similar to any randomly built binary search tree. a BST is balanced because to avoid skew tree formations in case of sequential input and hence achieve O(logn) in all 3 cases. now skip lists can gurantee that O(logn) complexity for any input.

Workspace

NA
SHSTTON
55
Solv. Corr.
208
Solv. In. Corr.
263
Attempted
0 M:0 S
Avg. Time

26 / 48

Choose the correct option.

In _____________ method, whenever a node is accessed, it might move to the head of the list if its number of accesses becomes greater than the records preceding it.

Aleast recently used

Btraspose

Ccount

Dexchange

ENone of these

Explanation:

In the count method, the number of times a node was accessed is counted and is stored in a counter variable associated with each node. Then the nodes are arranged in descending order based on their access counts. And the node with highest access count is head of the list.

Workspace

NA
SHSTTON
127
Solv. Corr.
132
Solv. In. Corr.
259
Attempted
0 M:0 S
Avg. Time

27 / 48

Choose the correct option.

What is the time complexity improvement of skip lists from linked lists in insertion and deletion?

AO(n) to O(logn) where n is number of elements

Bno change

CO(n) to O(1) where n is number of elements

DO(n) to O(n2) where n is number of elements

ENone of these

Explanation:

In Skip list we skip some of the elements by adding more layers. In this the skip list resembles balanced binary search trees. Thus we can change the time complexity from O (n) to O (logn)

Workspace

NA
SHSTTON
246
Solv. Corr.
497
Solv. In. Corr.
743
Attempted
0 M:13 S
Avg. Time

28 / 48

Choose the correct option.

Skip lists are similar to which of the following datastructure?

Astack

Bbinary search tree

Cheap

Dbalanced binary search tree

ENone of these

Explanation:

Skip lists have the same asymptotic time complexity as balanced binary search tree. For a Balanced Binary Search Tree, we skip almost half of the nodes after one comparison with root element. The same thing done in the skip lists. Hence skip lists are similar to balanced Binary search trees.

Workspace

NA
SHSTTON
64
Solv. Corr.
101
Solv. In. Corr.
165
Attempted
0 M:0 S
Avg. Time

29 / 48

Choose the correct option.

Which of the following statements are true ?
I. practical application of XOR linked lists are in environments with limited space requirements, such as embedded devices.
II. xor lists are not suitable because most garbage collectors will fail to work properly with classes or structures that don’t contain literal pointers
III. in order to calculate the address of the next node you need to remember the address of the previous node
IV. xor lists are much efficient than single, doubly linked lists and arrays

Ai, ii, iii, iv

Bi, ii

Ci, ii, iii

Di

ENone of these

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
135
Solv. Corr.
145
Solv. In. Corr.
280
Attempted
0 M:0 S
Avg. Time

30 / 48

Choose the correct option.

What does a xor linked list have ?

Aevery node stores the XOR of addresses of previous and next nodes

Bevery node stores the XOR of addresses of previous and next two nodes

Cactuall memory address of next node

Devery node stores xor 0 and the current node address

ENone of these

Explanation:

Every node stores the XOR of addresses.

Workspace

At Data Structures topic Linked Lists, you will get multiple online quiz difficulty wise, which will have a total of 6 quizzes, categorized as easy, medium, and moderate level. While preparing for any Linked Lists, take all the list quiz and check your preparation level for that topic. Each quiz have 10 different question, which needs to be answered in 20 min., all the listed quiz here is free, however, you will get only one chance for each quiz to attempt(Take Quiz seriously), so it is always recommended to take one quiz in each section before you start solving Linked Lists MCQs practice question, and one after solving all the question of the respective level, you can refer back your Linked Lists quiz result any time or you can download it as pdf for reference.

## Data Structures Linked Lists Quiz Online Test

The details of the Data Structures Linked Lists quiz are as follows. There are 10 questions for you. You have to answer them in 20 minutes. Within 20 minutes you have to see the errors in the sentences given as a question. Four options are also given to you, and you have to choose your opinion. You must be confident in your answer that the choices are difficult. Therefore, below we provide you with some information about Data Structures Linked Lists that you see and keep them in mind while answering questions.

On this Linked Lists section of page you will find the easiest quickest ways to solve a question, formulas, shortcuts and tips and tricks to solve various easiest methods to solve Linked Lists Question Quickly. It contains all the Data Structures topic Linked Lists questions which are common in any of the preliminary exams of any company. The solution is provided along with the questions. The practice of these questions is a must as they are easy as well as scoring and asked in all the exams They will confirm the selection if all the questions attempted wisely with little practice. It is recommanded to Take Mock test based on Data Structures topic and Linked Lists topic based quiz.