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

Linked Lists Questions

NA
SHSTTON
826
Solv. Corr.
331
Solv. In. Corr.
1157
Attempted
0 M:3 S
Avg. Time

1 / 33

Choose the correct option.

In a linked list with n nodes, the time taken to insert an element after an element pointed by some pointer is


AO(1)

BO(log n)

CO(n)

DO(n1og n)

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
515
Solv. Corr.
165
Solv. In. Corr.
680
Attempted
1 M:34 S
Avg. Time

2 / 33

Choose the correct option.

For a doubly linked list does the following segment of code removes the element pointed to by X , if it is assumed that X points to neither the first nor the last
element in the list.
X->prev->next = X->next;
X->next->prev = X->prev; ?


ATRUE

BFALSE

CNot Answer

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
212
Solv. Corr.
627
Solv. In. Corr.
839
Attempted
1 M:12 S
Avg. Time

3 / 33

Choose the correct option.

The following while loop is to remove duplicates from an existing list having a head pointer pointing to the first node.Which code will replace ____

current=head;
while(current->next!=NULL)
{
if (current->data == current->next->data)
{
____
}
else
{
current = current->next;
}
} ?


Ap=current->next->next;free(current);current->next = p;

Bp=current->next;free(p);

Cp=current->next;free(current->next);current->next=p;

Dp= current->next->next;free(current->next);current->next = p;

Answer: Option D

Explanation:

ok

Workspace

NA
SHSTTON
516
Solv. Corr.
673
Solv. In. Corr.
1189
Attempted
0 M:32 S
Avg. Time

4 / 33

What does the following function return, if q contains the address of the first element?

int function(NODE *q)
{
int c = 0;
while( q != NULL)
{
q = q->link;
c++;
}
return (c);
} ?


AThe value of the last node of the linked list

BThe value of the first elements of the linked list

CThe address of the last element of the linked list

DThe number of elements in a linked list

Answer: Option D

Explanation:

Consider list1 and list2 linked lists given below:

list1: 15 -> 18 -> 25 -> 30

list2: 11 -> 14 -> 17 -> 23 -> 32 -> 56

What will be the elements of the queue that is returned by the code snippet given below when list1 and list2 are passed as arguments to function, fun?

def fun(input_list1,input_list2):   

 temp1 = input_list1.get_head()   

 temp2 = input_list2.get_head()  

  output_queue = Queue(10)   

 while(temp1 != None and temp2 != None):    

    if(temp1.get_data() < temp2.get_data()):         

   output_queue.enqueue(temp1.get_data())          

  temp1 = temp1.get_next()      

  elif(temp1.get_data() > temp2.get_data()):         

   output_queue.enqueue(temp2.get_data())       

     temp2 = temp2.get_next()     

   else:          

  output_queue.enqueue(temp2.get_data())          

  temp1 = temp1.get_next()           

 temp2 = temp2.get_next()   

 while(temp1 != None):       

 output_queue.enqueue(temp1.get_data())       

 temp1 = temp1.get_next()    

while(temp2 != None):       

 output_queue.enqueue(temp2.get_data())       

 temp2 = temp2.get_next()

  return output_queue

Note: Order of displaying the queue elements is from front to rear.  

Select one:

Workspace

NA
SHSTTON
844
Solv. Corr.
270
Solv. In. Corr.
1114
Attempted
0 M:8 S
Avg. Time

5 / 33

Choose the correct option.

The situation when in a linked list START=NULL is


AUnderflow

BOverllow

CHousefull

DSaturated

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
491
Solv. Corr.
625
Solv. In. Corr.
1116
Attempted
0 M:13 S
Avg. Time

6 / 33

Choose the correct option.

Linked lists are best suited


Afor relatively permanent collections of data

Bfor the size of the structure and the data in the structure are constantly changing

Cfor both of above situation

Dfor none of above situation

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
863
Solv. Corr.
114
Solv. In. Corr.
977
Attempted
0 M:4 S
Avg. Time

7 / 33

Choose the correct option.

Linked lists are best suited for


Arelatively permanent collections of data

Bthe size of the structure and the data in the structure are constantly changing

Cboth of above situation

Dnone of above situation

Answer: Option B

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

8 / 33

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

Answer: Option D

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

9 / 33

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

Answer: Option C

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

10 / 33

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

Dlinked lists

ENone of these

Answer: Option A

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

Data Structures Linked Lists Questions and Answers pdf

At Data Structures topic Linked Lists page No: 1 you will find list of 10 practice questions, tips/trick and shortcut to solve questions, solved questions, quiz, and download option to download the whole question along with solution as pdf format for offline practice. You can practice all the listed Data Structures Linked Lists topic questions offline too, by downloading the MCQs practice question of Linked Lists with detail solution, with formula/Tips & Tricks, with Solved examples and with top-rated users answers, which will give you best answer ascross webs. It is one of the perfect Linked Lists e-book pdf covering all types of questions in detail. These Data Structures test with answers pdf cover all types of question asked in IIFT, XAT, SNAP, GRE, GMAT, NMAT, CMAT, MAT or for IT companies written exam like Wipro, HCL, Infosys, Accenture, Government exams, IBPS Exams etc. There are multiple formats to download your online free Data Structures Linked Lists e-book, like fully solved, unsolved questions with Answers sheet. Even you can customize your ebook format by adjusting the given options in the download section to make it your one of the best Data Structures topic-based ebook. It is recommended to bookmark this page Data Structures Linked Lists for your preparation. Most of the students and fresher candidates finding it hard to clear the Data Structures section in exams. Here Given Linked Lists practice questions, quiz, fully solved questions, tips & trick and Mock tests, which include question from each topic will help you to excel in Linked Lists. Each test has all the basics questions to advanced questions with answer and explanation for your clear understanding, you can download the test result as pdf for further reference.

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.Linked Lists Mock Tests

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.

Data Structures Linked Lists MCQs Practice Questions with Answer

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.