51. Entries in a stack are "ordered". What is the meaning of this statement?
52. In linked list implementation of a queue, from where is the item deleted?
53. What is the space complexity for deleting a linked list?
54. Which of the following is not the type of queue?
55. What is the functionality of the following piece of code?
public Object delete_key()
{
if(count == 0)
{
System.out.println("Q is empty");
System.exit(0);
}
else
{
Node cur = head.getNext();
Node dup = cur.getNext();
Object e = cur.getEle();
head.setNext(dup);
count--;
return e;
}
}
public Object delete_key()
{
if(count == 0)
{
System.out.println("Q is empty");
System.exit(0);
}
else
{
Node cur = head.getNext();
Node dup = cur.getNext();
Object e = cur.getEle();
head.setNext(dup);
count--;
return e;
}
}56. Consider a small circular linked list. How to detect the presence of cycles in this list effectively?
57. If the elements "A", "B", "C" and "D" are placed in a stack and are deleted one at a time, what is the order of removal?
58. Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?
59. What kind of linked list is best to answer questions like "What is the item at position n?"
60. What is the time complexity of inserting at the end in dynamic arrays?
Read More Section(Introduction to Data Structures)
Each Section contains maximum 100 MCQs question on Introduction to Data Structures. To get more questions visit other sections.