Interview Questions

1. In single linked list which operations depends on the length of the list?

Options:

a. Delete the last element of the list

b. Add an element before the first element of the list

c. Delete the first element of the list

d. Inter change the first two elements of the list

Reveal Answer

2. Which of the following segment of code deletes the element pointed to by X from the double linked list, if it is assumed that X points to the first element of the list and start pointer points to beginning of the list?

Options:

a. X->bwd=X->fwd; X->fwd=X->bwd;

b. start=x->fwd; start->bwd=NULL;

c. start=x->fwd; x->fwd=NULL;

d. x->bwd->bwd=x->bwd; x->fwd->fwd=x->fwd;

Reveal Answer

3. Which among the following segment of code deletes the element pointed to by x from the double linked list, if it is assumed that X points to the last element of the list?

Options:

a. X->fwd->bwd=NULL;

b. X->bwd->fwd=x->bwd;

c. X->bwd->fwd=NULL;

d. X->fwd->bwd=x->bwd;

Reveal Answer

4. Which among the following segment of code counts the number of elements in the double linked list, if it is assumed that X points to the first element of the list and ctr is the variable which counts the number of elements in the list?

Options:

a. for(ctr=1;x!=NULL;ctr++) x=x->fwd;

b. for(ctr=1;x!=NULL;ctr++) x=x->bwd;

c. for(ctr=1;x->fwd!=NULL;ctr++) x=x->fwd;

d. for(ctr=1;x->bwd!=NULL;ctr++) x=x->bwd;

Reveal Answer

5. Which among the following segment of code counts the number of elements in the double linked list, if it is assumed that X points to the last element of the list and ctr is the variable which counts the number of elements in the list?

Options:

a. for(ctr=1;x!=NULL;ctr++) x=x->fwd;

b. for(ctr=1;x!=NULL;ctr++) x=x->bwd;

c. for(ctr=1;x->fwd!=NULL;ctr++) x=x->fwd;

d. for(ctr=1;x->bwd!=NULL;ctr++) x=x->bwd;

Reveal Answer

6. Which among the following segments of inserts a new node pointed by X to be inserted at the end of the double linked list? The start and last pointer points to beginning and end of the list respectively.

Options:

a. X->bwd=x->fwd; x->fwd=x->bwd;

b. X->fwd=start; ltart->bwd=x;

c. last->fwd=x; x->bwd=last;

d. x->bwd=x->bwd; x->fwd=last;

Reveal Answer

7. A single linked list is declared as follows: struct slist { struct slist *next; int data; } Where among the following segments of code deletes the element pointed to by x from the single linked list, if it is assumed that x points to neither the first nor last element of the list? prev pointer points to previous element.

Options:

a. prev->next=x->next; free(x);

b. x->next=prev->next; free(x);

c. prev->next=x->next; free(prev);

d. x->next=prev->next; free(prev);

Reveal Answer

8. Which among the following segment of code deletes the element pointed to by X from the single linked list, if it is assumed that X points to the last element of the list and prev pointer points to last but one element?

Options:

a. prev->next=NULL; free(prev);

b. x->next=NULL; free(X);

c. prev->next=NULL; free(X);

d. x->next=prev; free(prev);

Reveal Answer

9. Which among the following segments of code inserts a new node pointed by X to be inserted at the beginning of the single linked list? The start pointer points to beginning of the list.

Options:

a. Start->next=x; X=start;

b. X->next=start; Start=X;

c. X->next=start->next; Start=X;

d. X->next=start; Start=x->next;

Reveal Answer

10. Which of the following segments of code inserts a new node pointed by x to be inserted at the end of the circular double linked list? The start pointer points to beginning of the list

Options:

a. X->bwd=start; X->fwd=start->fwd; Start->bwd->fwd=X; Start=X;

b. X->bwd=star->bwdt; X->fwd=start; Start->bwd-=X; Start=X;

c. X->bwd=start->bwd; X->fwd=start; Start->bwd->fwd=X; Start->bwd=x;

Reveal Answer

Interview Questions and Answer

1. In single linked list which operations depends on the length of the list?

2. Which of the following segment of code deletes the element pointed to by X from the double linked list, if it is assumed that X points to the first element of the list and start pointer points to beginning of the list?

3. Which among the following segment of code deletes the element pointed to by x from the double linked list, if it is assumed that X points to the last element of the list?

4. Which among the following segment of code counts the number of elements in the double linked list, if it is assumed that X points to the first element of the list and ctr is the variable which counts the number of elements in the list?

5. Which among the following segment of code counts the number of elements in the double linked list, if it is assumed that X points to the last element of the list and ctr is the variable which counts the number of elements in the list?

6. Which among the following segments of inserts a new node pointed by X to be inserted at the end of the double linked list? The start and last pointer points to beginning and end of the list respectively.

8. Which among the following segment of code deletes the element pointed to by X from the single linked list, if it is assumed that X points to the last element of the list and prev pointer points to last but one element?

9. Which among the following segments of code inserts a new node pointed by X to be inserted at the beginning of the single linked list? The start pointer points to beginning of the list.

10. Which of the following segments of code inserts a new node pointed by x to be inserted at the end of the circular double linked list? The start pointer points to beginning of the list

Packages

Resources

About

Other links