adplus-dvertising
frame-decoration

Question

Which of the following statement is true?

i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.

ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

a.

i-only

b.

ii-only

c.

Both i and ii

d.

None of the above

Answer: (c).Both i and ii

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which of the following statement is true? i) Using singly linked lists and circular list, it is not possible to traverse the list backwards. ii) To find the predecessor, it...

Similar Questions

Discover Related MCQs

Q. What will be the value of top, if there is a size of stack STACK_SIZE is 5

Q. ………… is not the operation that can be performed on queue.

Q. Which of the following is not the type of queue?

Q. Which is/are the application(s) of stack

Q. A data structure where elements can be added or removed at either end but not in the middle is called …

Q. When does top value of the stack changes?

Q. A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

Q. In a priority queue, insertion and deletion takes place at ………………

Q. Which of the following is an application of stack?

Q. Which of the following name does not relate to stacks?

Q. The term "push" and "pop" is related to the

Q. A data structure where elements can be added or removed at either end but not in the middle

Q. Which data structure allows deleting data elements from front and inserting at rear?

Q. The postfix form of the expression (A + B)∗(C∗D − E)∗F / G is

Q. What is the postfix form of the following prefix expression -A/B*C$DE ?

Q. The minimum number of multiplications and additions required to evaluate the polynomial
P = 4x3+3x2-15x+45 is

Q. The data structure required to evaluate a postfix expression is

Q. The data structure required to check whether an expression contains balanced parenthesis is

Q. What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

Q. The process of accessing data stored in a serial access memory is similar to manipulating data on a