[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
73
Solv. Corr.
198
Solv. In. Corr.
271
Attempted
0 M:0 S
Avg. Time

31 / 48

Choose the correct option.

The nodes in a skip list may have many forward references. their number is determined

Aprobabilistically

Bsequentially

Crandomly

Dorthogonally

ENone of these

Explanation:

The number of forward references are determined probabilistically, that is why skip list is a probabilistic algorithm.

Workspace

NA
SHSTTON
108
Solv. Corr.
102
Solv. In. Corr.
210
Attempted
0 M:0 S
Avg. Time

32 / 48

Choose the correct option.

Consider the 2-level skip list

How to access 38?

Atravel 20-30-35-38

Btravel 20-38

Ctravel 20-30-40-38

Dtravel 20-40-38

ENone of these

Explanation:

Let us call the nodes 20, 30, 40 as top lines and the nodes between them as normal lines. the advantage of skip lists is we can skip all the elements between the top line elements as required.

Workspace

NA
SHSTTON
146
Solv. Corr.
521
Solv. In. Corr.
667
Attempted
0 M:12 S
Avg. Time

33 / 48

Choose the correct option.

What datastructures can be used in implementing a free list?

Barrays

Dtrees

ENone of these

Explanation:

Sort trees can also be used in impelementing free lists which remaincomplex.

Workspace

NA
SHSTTON
72
Solv. Corr.
107
Solv. In. Corr.
179
Attempted
0 M:0 S
Avg. Time

34 / 48

Choose the correct option.

What are different ways of implementing free lists and which is simple among them?

Abest fit, first fit, worst fit, simple-first fit

Bbest fit, first fit, worst fit, simple-worst fit

Cbest fit, first fit, worst fit, simple-best fit

Dbest fit simple-best fit

ENone of these

Explanation:

The‭ ‬simplest form of memory management system can be called as first-fit.‭ ‬a device or system maintains a single‭ ‬list of free memory locations.‭ ‬When request to memory is sent,‭ ‬the list is searched and the first block that is large enough is returned.

Workspace

NA
SHSTTON
40
Solv. Corr.
107
Solv. In. Corr.
147
Attempted
0 M:0 S
Avg. Time

35 / 48

What’s wrong with this code which returns xor of two nodes address ?

struct node* XOR (struct node *a, struct node *b)
{
return ((int) (a) ^ (int) (b)); //this logic is used to fill the nodes with address of a xor linked list
}

Anothing wrong. everything is fine

Bparameters are wrong

Ctype casting at return is missing

Dtotal logic is wrong

ENone of these

Explanation:

It must be typecasted– return (struct node*)((int) (a) (int) (b));

Workspace

NA
SHSTTON
125
Solv. Corr.
72
Solv. In. Corr.
197
Attempted
0 M:0 S
Avg. Time

36 / 48

Choose the correct option.

The self organizing list improves _____

Aaverage access time

Bdeletion

Cinsertion

Dbinary search

ENone of these

Explanation:

The self-organizing list rearranges the nodes based on the access probabilities of the nodes. So the required elements can be located efficiently. Therefore, self-organizing list is mainly used to improve the average access time.

Workspace

NA
SHSTTON
43
Solv. Corr.
138
Solv. In. Corr.
181
Attempted
0 M:0 S
Avg. Time

37 / 48

Choose the correct option.

Which of the following is not the rearranging method used to implement self-organizing lists?

Acount method

Bordering method

Cmove to front method

Dleast frequently used

ENone of these

Explanation:

Least frequently used is a buffer replacement policy, while other three are methods to reorder the nodes in the self-organizing lists based on their access probability.

Workspace

NA
SHSTTON
33
Solv. Corr.
132
Solv. In. Corr.
165
Attempted
0 M:0 S
Avg. Time

38 / 48

Choose the correct option.

Given 10,8,6,7,9
swap the above numbers such that finally you got 6,7,8,9,10
so now reverse 10
9,7,6,8,10
now reverse 9
8,6,7,9,10
7,6,8,9,10
6,7,8,9,10
at this point 6 is ahead so no more reversing can be done so stop.
To implement above algorithm which datastructure is better and why ?

Alinked list. because we can swap elements easily

Bxor linked list. because there is no overhead of pointers and so memory is saved

Carrays. because we can swap elements easily

Ddoubly linked list. because you can traverse back and forth

ENone of these

Explanation:

Workspace

NA
SHSTTON
374
Solv. Corr.
305
Solv. In. Corr.
679
Attempted
0 M:11 S
Avg. Time

39 / 48

Choose the correct option.

Free lists are used in

Astatic memory allocation

Bcontagious allocations

Cdynamic memory allocation

Dare used for speeding up linked list operations

ENone of these

Explanation:

Their property is meant for dynamic allocations.

Workspace

NA
SHSTTON
105
Solv. Corr.
74
Solv. In. Corr.
179
Attempted
0 M:20 S
Avg. Time

40 / 48

Choose the correct option.

What are implicit and explicit implementations of freelists?

Agarbage collection and new or malloc operators respectively

Bimplicit implementation is not favored

Cnew or malloc and garbage collection respectively

Dexplicit implementation is not favored

ENone of these

Explanation:

Gc and new most widely known.

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 Customize Online Mock Test

This is own type of mock test, where At this Data Structures Linked Lists MCQs mock test section, you will able to attempt only the questions related to Linked Lists, in that question will be a different level, important, and all the questions will be part of some of the mock tests across Q4interview FREE Mock test. You need to choose the topic as Linked Lists, and click on Double click to generate your customize mock test. While attempting the mock test you need to choose any of the one options out of given option. It is recommended to go through the direction given along with each question, as these questions will be randomly and so that same direction will not be applicable across the entire test. Once you submit your mock test, the result will be generated for Linked Lists Customize mock test, where your performance point points will be highlighted. Q4interview analysis every single point which helps you to improve your topic understanding and help you to know your type of mistakes and way to improve Linked Lists questions, by providing the same type of practice questions from practice exercise. The best part of this Linked Lists, all these mock tests listed here are free and you can take as Many time, as many you want. When you continue to give Linked Lists Customize Online Mock Test here regularly, then you will understand how much you have developed your accuracy on a topic, after that you will be able to decide how much attention you need to focus on. Your continued practice will increase your confidence, speed and thinking ability intensely, the Linked Lists Customize topic on which you will practice more will beneficial for you in future during campus placement.

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

## Data Structures Linked Lists solved examples question

Clarity of concepts is a must if you want to master the skill of solving Data Structures problems. This page contains sample Data Structures Linked Lists questions and answers for freshers and competitive exams. Linked Lists Questions with the detailed description, the explanation will help you to master the topic. Here solved examples with detailed answer description, explanations are given and it would be easy to understand. How to solve qLinked ListsData Structures? Here are some examples solved with the Common Rules/tricks/tips of Data Structures. Enhance your chance to score maximum marks in Data Structures sections through. Error Spotting Grammar Questions Online Test for Free. Fully solved Sentence Formation MCQs questions with detailed answer description. Data Structures is an important topic for any exams but most aspirants find it difficult. You need to learn various tricks tips, rules, etc to solve quickly. At this page, you will find frequently asked Linked Lists questions or problems with solutions, shortcuts, formulas for all-important competitive exams like IT companies exams, interviews. It is always a best practice to go through the example and understand the types of question and way to solve it, so let's do some examples to calculate efficiency, read through all the given here solved examples. You can post your solution, tips, trick and shortcut if you have any in respect to questions.

You can get here fully solved Linked Lists examples with a detailed answer and description. You can solve Linked Lists problems with solutions, the questions by companies wise by filtering the questions, additionally, you can check what type of questions are being asked in IT companies Written Round from Linked Lists. Linked Lists became one of the most important sections in the entire competitive exams, Companies Campus, and entrance online test. Go through Linked Lists Examples, Linked Lists sample questions. You can Evaluate your level of preparation in Linked Lists by Taking the Q4Interivew Linked Lists Online Mock Test based on most important questions. All the Linked Lists practice questions given here along with answers and explanations are absolutely free, you can take any number of time any mock Test.

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