[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
133
Solv. Corr.
29
Solv. In. Corr.
162
Attempted
0 M:0 S
Avg. Time

41 / 48

Choose the correct option.

Are the below statements true about skiplists?
In a sorted set of elements skip lists can implement the below operations

I. given a element find closest element to the given value in the sorted set in O(logn)
II. find the number of elements in the set whose values fall a given range in O(logn)

ATRUE

BFALSE

Explanation:

To achieve above operations augment with few additional stuff like partial counts.

Workspace

NA
SHSTTON
110
Solv. Corr.
45
Solv. In. Corr.
155
Attempted
0 M:43 S
Avg. Time

42 / 48

Choose the correct option.

How to maintain multi-level skip list properties when insertions and deletions are done?

Adesign each level of a multi-level skip list with varied probabilities

Bebalancing of lists

Cthat cannot be maintained

Dreconstruction

ENone of these

Explanation:

For example consider a 2 level skip list. the level-2 skip list can skip one node on a average and at some places may skip 2 nodes, depending on probabilities. this ensures O(logn).

Workspace

NA
SHSTTON
20
Solv. Corr.
127
Solv. In. Corr.
147
Attempted
0 M:0 S
Avg. Time

43 / 48

Choose the correct option.

Ainternal fragmentation

Bwe no more have the hole lists in order of memory address, so it is difficult to detect if 2 holes remain adjacent in memory and shall be merged into one hole

Cit takes so much space

Dboth a and c are correct

ENone of these

Explanation:

Internal fragmentation is an issue to be dealt and it takes so much space.

Workspace

NA
SHSTTON
25
Solv. Corr.
119
Solv. In. Corr.
144
Attempted
0 M:0 S
Avg. Time

44 / 48

Choose the correct option.

Which of the following is true about the Move-To-Front Method for rearranging nodes?

Anode with highest access count is moved to head of the list

Bmay over-reward infrequently accessed nodes

Crequires extra storage

Drequires a counter for each node

ENone of these

Explanation:

In Move-To-front Method the element which is searched is moved to the head of the list. And if a node is searched even once, it is moved to the head of the list and given maximum priority even if it is not going to be accessed frequently in the future. Such a situation is referred to as over-rewarding.

Workspace

NA
SHSTTON
49
Solv. Corr.
130
Solv. In. Corr.
179
Attempted
0 M:0 S
Avg. Time

45 / 48

Choose the correct option.

Which of the following data structure is preferred to have lesser search time when the list size is small?

Asearch tree

Bself organizing list

Csorted list

ENone of these

Explanation:

Self-organizing list is easy and simple to implement than search tree and it requires no additional space. So using self organizing list is preferred when list size is small.

Workspace

NA
SHSTTON
81
Solv. Corr.
59
Solv. In. Corr.
140
Attempted
0 M:0 S
Avg. Time

46 / 48

Choose the correct option.

What is buddy memory management of free lists ?

Amodified version of first fit

Bmodified version of best fit

Cbuddy allocation keeps several‭ ‬free lists,‭ ‬each one holds blocks which are of one particular size

Da tree representation of free lists

ENone of these

Explanation:

When an allocation request is received,‭ ‬the list that holds blocks that are just large enough to satisfy the request are considered, and an open location is returned.‭ ‬If no‭ ‬free‭ ‬blocks that are smaller than two times the size that are requested are available,‭ ‬a larger block is split in two to satisfy the requirements.

Workspace

NA
SHSTTON
58
Solv. Corr.
60
Solv. In. Corr.
118
Attempted
0 M:0 S
Avg. Time

47 / 48

Choose the correct option.

Assume there is a free list which contains nodes and is filled with a value if it is already assigned and the value will be the size of requested block else will be 0. The below code represents what ?

z = startpoint;
while ((z < end) && (*z <= len))
{
assign this block
}

Acode for first fit

Bcode for worst fit

Ccode for best fit

Dnone of the mentioned

ENone of these

Explanation:

As z is start point and now from beginning we are moving and checking if we reached end and then checking size naively assigning the first block which is bigger than required size hence it is first fit.

Workspace

NA
SHSTTON
65
Solv. Corr.
78
Solv. In. Corr.
143
Attempted
0 M:0 S
Avg. Time

48 / 48

Choose the correct option.

How does implicit free lists(garbage collection) works in adding memory to free list ?

Awhichever comes last will be added to free list

Bcertain blocks cannot be used if there are no pointers to them and hence they can be freed

Cwhichever comes first will be added to free list

Dmakes a probabilistic guess

ENone of these

Explanation:

When no pointers pointing a block that means it is useless to be in memory.

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.

## Why Data Structures Linked Lists?

In this practice section, you can practice Data Structures Questions based on "Linked Lists" and improve your skills in order to face the interview, competitive examination, IT companies Written exam, and various other entrance tests (CAT, GATE, GRE, MAT, Bank Exam, Railway Exam etc.) with full confidence.

## Where can I get Data Structures Linked Lists questions and answers with explanation?

Q4Interview provides you lots of fully solved Data Structures (Linked Lists) questions and answers with Explanation. Solved examples with detailed answer description, explanation are given and it would be easy to understand. You can download Data Structures Linked Lists quiz questions with answers as PDF files and eBooks.

## Where can I get Data Structures Linked Lists Interview Questions and Answers (objective type, multiple-choice, quiz, solved examples)?

Here you can find objective type Data Structures Linked Lists questions and answers for interview and entrance examination. Multiple choice and true or false type questions are also provided.