problem1. Define the data structure ‘Queue’. describe any one of its application

problem2. Describe two types of Priority Queue and the operations performed on them.

problem3. The following operations are performed on the data structure Stack. prepare implementation codes for the following operations:

1) PUSH AN ELEMENT

2) POP AN ELEMENT

3) CHECK STACK UNDERFLOW (empty).

4) DISPLAY STACK CONTENTS

(Note: Use Static Implementation)       

problem4. Define a Linked List and give its representation in ‘C’.

problem5. Give two advantages and two disadvantages of a Linked List over an Array.

problem6. Implement a dynamic Linked List to perform the following operations.

1) Add an element at the end of the Linked List

2) Add an element at the beginning of the Linked list

3) Display the contents of the Linked List

problem7. Graphically represent a Doubly Linked List and prepare one of its advantages as compared to Singly Linked List.