Distinguish between a singly and a doubly linked list.
Linked Lists
Original Khojo Papers practice question — not from a past board paper.
A linked list is a linear collection of nodes, each holding a data field and a reference to the next node. It can grow and shrink at run time without any fixed capacity, and insertion or deletion in the middle needs only pointers to be changed rather than elements to be shifted.
No citable source has been recorded for this record. Treat it as practice material, not as fact.
Against that, it cannot be indexed directly and each node costs extra memory for the link.
From the same topic and chapter, at a similar level.
Distinguish between a singly and a doubly linked list.
Linked Lists
Write the Java class definition of a node of a singly linked list holding an integer.
Linked Lists
Write the algorithm to insert a node at the beginning of a singly linked list.
Linked Lists
Write the algorithm to delete the first node of a singly linked list.
Linked Lists
State and verify the absorption law X + X·Y = X using a truth table.
Boolean Algebra
Write a recursive Java method to compute the factorial of a non-negative integer n.
Recursion