[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
443
Solv. Corr.
688
Solv. In. Corr.
1131
Attempted
0 M:55 S
Avg. Time

1 / 14

Choose the correct option.

What Member function places a new node at the end of the linked list?

Bappend Node

CDisplayNode

DStructNode

ENone of these

Explanation:

The appendNode() member function places a new node at the end of the linked list. The appendNode() requires an integer representing the current data of the node.

Workspace

NA
SHSTTON
1143
Solv. Corr.
1728
Solv. In. Corr.
2871
Attempted
0 M:45 S
Avg. Time

2 / 14

Choose the correct option.

How would you make the middle node of a doubly linked list to the top of the list?
Let assume "X" is the middle node

DNone of these

Explanation:

c

Workspace

NA
SHSTTON
1279
Solv. Corr.
1112
Solv. In. Corr.
2391
Attempted
0 M:27 S
Avg. Time

3 / 14

Choose the correct option.

To create a linked list, we can allocate space and make something point to it, by

writing:

struct-narne *pointer-variable;

Which of the following statement will correctly allocate the space

Apointer-variable= malloc(sizeof(*struct-narne));

Bpointer-variable = malloc(sizeof(struct struct-name));

Cpointer-variable = a!loc(sizeof(struct struct-name));

Dpointer-variable = alloc(sizeof(*struct-name));

Explanation:

A

Workspace

NA
SHSTTON
451
Solv. Corr.
1450
Solv. In. Corr.
1901
Attempted
2 M:5 S
Avg. Time

4 / 14

Choose the correct option.

Assume single linked list pseudo code as follows?

struct Node {
data
next
}
record List {
Node firstNode
}

function1(List list) {
obsoleteNode = list.firstNode; list.firstNode = list.firstNode.next; free obsoleteNode;
}

function2(node node) {
obsoleteNode = node.next; node.next= node.next.next; free obsoleteNode;
}

function3(Node node,Node newNode) {
newNode.next = node.next;node.next= newNode
}

function4(List list, Node newNode) {
newNode.next = list.firstNode; list.firstNode = newNode;
}

Afunction1 removes the first node

Bfunction2 removes node past this one

Cfunction3 inserts newNode after node

Dfunction4 inserts newNode after current first node

Explanation:

What is the purpose of  clear function provided.

def clear(self):

self.tail = None

Select one:

Workspace

NA
SHSTTON
440
Solv. Corr.
650
Solv. In. Corr.
1090
Attempted
0 M:13 S
Avg. Time

5 / 14

Choose the correct option.

Which of the following can a Dynamic Link Library contain?

AOnly Code

BCode and Data Only

CCode and Resources only

DCode, Data and Resources

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
517
Solv. Corr.
714
Solv. In. Corr.
1231
Attempted
0 M:13 S
Avg. Time

6 / 14

Choose the correct option.

Consider a linked list of n elements. What is the time taken to insert an element after an element pointed by some pointer?

AO(1)

BO(log2 n)

CO(n)

DO(nlog2 n)

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
989
Solv. Corr.
894
Solv. In. Corr.
1883
Attempted
0 M:17 S
Avg. Time

7 / 14

Choose the correct option.

Acomponents are all linked together in some sequential manner.

Bthere is no beginning and no end.

Ccomponents are arranged hierarchically.

Dforward and backward traversal within the list is permitted.

Explanation:

geg

Workspace

NA
SHSTTON
366
Solv. Corr.
604
Solv. In. Corr.
970
Attempted
0 M:3 S
Avg. Time

8 / 14

Choose the correct option.

The time required to delete a node x from a doubly linked list having n nodes is

AO(n)

BO(log n)

CO(1)

DO(n log n)

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
371
Solv. Corr.
1314
Solv. In. Corr.
1685
Attempted
0 M:26 S
Avg. Time

9 / 14

Choose the correct option.

Analyse this structure and choose the correct option.

typedef struct node_s
{
struct node_s * prev;
struct node_s * next;
} node_t ; ?

AThis could be a node in a doubly linked list

BThe syntax is incorrect

CThe syntax is incorrect

DA linking error would occur because no data is present

Explanation:

Here is no explanation for this answer

Workspace

NA
SHSTTON
560
Solv. Corr.
806
Solv. In. Corr.
1366
Attempted
0 M:52 S
Avg. Time

10 / 14

Choose the correct option.

"p" and "q" are pointers to a node of the linked list, "head" points to the first node of the list, "next" points to the next node in the list, which of the following is true for the following piece of code:

{
p = p->next;
free(q);
}

BDeletes all but the last node

CDoes not delete any node

DThe program will crash

Explanation:

Here is no explanation for this answer

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.