Bissoy.com
Doctors Medicines MCQs Q&A

A doubly linked list is declared as struct Node{                 int Value;                 struct Note*fwd;                 struct Node * Bwd; } Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segments of code deletes the node pointed to by X from the doubly liked list, if it is assumed that X points to neither the first nor the last node of the list?

A doubly linked list is declared as struct Node{                 int Value;                 struct Note*fwd;                 struct Node * Bwd; } Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segments of code deletes the node pointed to by X from the doubly liked list, if it is assumed that X points to neither the first nor the last node of the list? Correct Answer x → Bwd → Fwd = X → Fwd → Bwd = X → Bwd;

code:

struct Node{

                int Value;

                struct Note*fwd;

                struct Node * Bwd;

}

Explanation:

It is given that X points to neither the first nor the last node of the list, So we need to give code to delete the intermediate node of the doubly linked list.

Address

1000

2000

3000

Node

A

X

B

 

Delete X:

A → Fwd = X → Fwd

B → Bwd = X → Bwd

Also:

A → Fwd  = X → Bwd → Fwd

B → Bwd = X → Fwd → Bwd

Therefore:

x → Bwd → Fwd = X → Fwd → Bwd = X → Bwd;.

Will delete X:

Hence option 1 is correct

Related Questions

In a survey of n students of a collage, it was found that 52% liked watching movies, 45% liked watching Web series and 65% liked watching TV Serials. Also, 22% liked watching movies and web series both, 25% liked watching web series and TV serials both and 30% liked watching movies and TV serials both. 10% liked watching all the three and 5% liked watching none of these. If the total number of students who liked watching only one of the three given programs is 190. Then, what is the value of n?
What is the output of following program? abstract class Sum { public abstract int sumOfTwo(int n1, int n2); public abstract int sumOfThree(int n1, int n2, int n3); public void disp( ){ System.out.println("Method of class Sum"); } } class DemoAbstract1 extends Sum { public int sumOfTwo(int num1, int num2) { return num1+num2; } public int sumOfThree(int num1, int num2, int num3) { return num1+num2+num3; } public static void main(String args[ ]){ Sum obj = new DemoAbstract1( ); System.out.println(obj.sumOfTwo(3, 7)); System.out.println(obj.sumOfThree(4, 3, 19)); obj.disp( ); } }
Which of the following should be used for freeing the memory allocated in the following C code?
#include struct p{ struct p *next; int x;};int main(){ struct p *p1 = (struct p*)malloc(sizeof(struct p)); p1->x = 1; p1->next = (struct p*)malloc(sizeof(struct p)); return 0;}
In a survey it was found that 21 people liked fictional movies, 26 liked horror movies and 29 people liked comedy movies. If 14 people liked fictional and horror movies, 12 people liked fictional and comedy movies, 14 people liked horror and comedy movies and 8 people liked all three kinds of movie. Find how many people liked exactly 2 type of movies.
In a survey it was found that 21 people liked fictional movies, 26 liked horror movies and 29 people liked comedy movies. If 14 people liked fictional and horror movies, 12 people liked fictional and comedy movies, 14 people liked horror and comedy movies and 8 people liked all three kinds of movie. Find how many people liked only comedy movie.
The number of distinct nodes the following struct declaration can point to is . . . . . . . .
struct node{ struct node *left; struct node *centre; struct node *right;};
Consider the following two C code segment. Y and X are one- and two-dimensional arrays of size n and n × n respectively, where 2 ≤ n ≤ 10. Assume that in both code segments, elements of y are initialized to 0 and each element X[i] [j] of array X is initialized to i + j. Further assume that when stored in main memory all elements of x are in same main memory page frame. Code segment 1:                 //initialize elements of y to 0                 //initialize elements X[i] [j] of X to i+j                       for (i = 0; i < n; i++)                                 Y[i] += X[0] [i]; Code Segment 2:                 //initialize elements of Y to 0                 //initialize elements X[i] [j] of X to i+j                        for (i = 0; i < n; i++)                                 Y[i] += X[i] [0]; Which of the following statements is/are correct? S1: Final contents of array Y will be same in both code segments S2: Elements of array X accessed inside the for loop shown in code segment 1 are contiguous in main memory S3: Elements of array X accessed inside the for loop shown in code segment 2 are contiguous in main memory
What will output when you compile and run the following code?#include
struct student
{ int roll;
int cgpa;
int sgpa[8]; }; void main()
{ struct student s = { 12,8,7,2,5,9 };
int *ptr;
ptr = (int *)&s;
clrscr();
printf( "%d", *(ptr+3) );
getch(); }
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the near node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operations can be performed in O(1) time? I. Next pointer of front node points to the rear node. II. Next pointer of rear node points to the front node.
In a survey of 400 students in a school, 100 students liked apple juice, 150 students liked orange juice and 75 students liked both apple and orange juice. Find the number of students which neither liked apple nor orange juice?