Interview question based on skill :
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. Which of the following is false about a doubly linked list?
Correct Answer is : ‘#’
2. Given the Node class implementation, select one of the following that correctly inserts a node at the tail of the list. public class Node { protected int data; protected Node prev; protected Node next; public Node(int data) { this.data = data; prev = null; next = null; } public Node(int data, Node prev, Node next) { this.data = data; this.prev = prev; this.next = next; } public int getData() { return data; } public void setData(int data) { this.data = data; } public Node getPrev() { return prev; } public void setPrev(Node prev) { this.prev = prev; } public Node getNext { return next; } public void setNext(Node next) { this.next = next; } } public class DLL { protected Node head; protected Node tail; int length; public DLL() { head = new Node(Integer.MIN_VALUE,null,null); tail = new Node(Integer.MIN_VALUE,null,null); head.setNext(tail); length = 0; } }
Correct Answer is : em
3. What is a memory efficient double linked list?
Correct Answer is : vw
4. Which of the following piece of code removes the node from a given position?
Correct Answer is : RGB Color
5. How do you calculate the pointer difference in a memory efficient double linked list?
Correct Answer is : check
