A doubly linked list is declared asstruct Node { int Value; struct Node *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 linked list, if it is assumed that X points to neither the first nor the last node of the list?(A) X->Bwd->Fwd = X->Fwd; X->Fwd->Bwd = X->Bwd ;(B) X->Bwd.Fwd = X->Fwd ; X.Fwd->Bwd = X->Bwd ;(C) X.Bwd->Fwd = X.Bwd ; X->Fwd.Bwd = X.Bwd ;(D) X->Bwd->Fwd = X->Bwd ; X->Fwd->Bwd = X->Fwd;

A doubly linked list is declared asstruct Node { int Value; struct Nod

1.	A doubly linked list is declared asstruct Node { int Value; struct Node 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 linked list, if it is assumed that X points to neither the first nor the last node of the list?(A) X->Bwd->Fwd = X->Fwd; X->Fwd->Bwd = X->Bwd ;(B) X->Bwd.Fwd = X->Fwd ; X.Fwd->Bwd = X->Bwd ;(C) X.Bwd->Fwd = X.Bwd ; X->Fwd.Bwd = X.Bwd ;(D) X->Bwd->Fwd = X->Bwd ; X->Fwd->Bwd = X->Fwd;
Answer»

Discussion

No Comment Found

Related InterviewSolutions

Which of the following comment about peep-hole optimization is true?(A) It is applied to small part of the code and applied repeatedly(B) It can be used to optimize intermediate code(C) It can be applied to a portion of the code that is not contiguous(D) It is applied in symbol table to optimize the memory requirements.
The time complexity of computing the transitive closure of binary relation on a set of n elements is known to be(A) O(n)(B) O(n log n)(C) O(n 3/2)(D) O(n 3)
In multi-programmed systems, it is advantageous if some programs such as editors and compilers can be shared by several users.Which of the following must be true of multi-programmed systems in order that a single copy of a program can be shared by several users?I. The program is a macroII. The program is recursiveIII. The program is reentrant(A) I only(B) II only(C) Ill only(D) I, II and III
In a file which contains 1 million records and the order of the tree is 100, then what is the maximum number of nodes to be accessed if B+ tree index is used?(A) 5(B) 4(C) 3(D) 10
Which of the following is application of Breath First Search on the graph?(A) Finding diameter of the graph(B) Finding bipartite graph(C) Both (a) and (b)(D) None of the above
A class of 30 students occupy a classroom containing 5 rows of seats, with 8 seats in each row. If the students seat themselves at random, the probability that the sixth seat in the fifth row will be empty is(A) 1/5(B) 1/3(C) 1/4(D) 2/5
( G, *) is an abelian group. Then(A) x = x -1, for any x belonging to G(B) x = x2, for any x belonging to G(C) (x * y )2 = x2 * y2, for any x, y belonging to G(D) G is of finite order
The domain of the function log( log sin(x) ) is(A) 0 < x < π(B) 2nπ < x < (2n + 1) π , for n in N(C) Empty set(D) None of the above
Consider the following C code segment:#include main(){ int i, j , x ; scanf("%d", &x); i = 1 ; j = 1; while ( i< 10 ) { j = j * i; i = i + 1; if (i == x) break ; } }For the program fragment above, which of the following statements about the variables i and j must be true after execution of this program? [!(exclamation) sign denotes factorial in the answer](A) ( j = (x - 1 )! ) ∧ (i >= x)(B) ( j = 9!) ∧ (i =10)(C) (( j = 10!) ∧ (i = 10 )) V (( j = (x - 1)!) ∧ (i = x ))(D) (( j = 9!) ∧ (i = 10)) V (( j = (x - 1)!) ∧ (i = x ))
The following paradigm can be used to find the solution of the problem in minimum time:Given a set of non-negative integer, and a value K, determine if there is a subset of the given set with sum equal to K:(A) Divide and Conquer(B) Dynamic Programming(C) Greedy Algorithm(D) Branch and Bound

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment