1.

Name the two parts of a node in a linked list.

2.

What is the difference between array and a linked list.

3.

Why is a linked list called as Dynamic data structure.

4.

X points to first node of a linked list . Search the first occurrence of ITEM in the list
and split the list into two so that Y point to the sub list beginning with item.

5.

Given a list START , delete a node whose data value is ITEM.

6.

Combine two linked lists X & Y into a single linked list so that the elements of X
follow the elements of Y.

7.

Insert a new node that follows the node containing data value XII.

8.
(for Practical File)
9.

Give necessary declarations for a queue containing float type numbers . Also
write a user defined function in C++ to insert a float type value in the queue .
Use Linked list representation of queue.

10.

Each node of a stack contains the following information , in addition to the

required pointer field :
(i) Roll No of the student

(ii)

Age of the student

Give the structure of node for the linked stack in question .

TOP is a pointer that points to the topmost node of the stack . Write the
following functions :
(i) PUSH( ) : To push a node in the stack , which is dynamically allocated.
(i) POP( ) : To remove a node from the stack and release memory..