Problem:
Question 1: How do I write the pseudocode for a "dequeue" method for a linked list? The linked list has a head (front) and tail (rear) pointer. Ensure the "empty case" is addressed.
Question 2: Translate into predicate logic the definition of the symmetric property of relations given below:
A relation R on a set X is symmetric if for all x, y ?X, if (x,y) ?R, then (y,x) ?R.
Please can anyone help me to answer these question in detail.