What u are talking about is not implemented in simple queue.
so both are false.
1..If we use only Front pointer in queue, then insertion takes O(n) time while deletion in O(1) time. flase.
Deletion in O(1) time thats ok but if 1st element insert then u can delete second in O(1) time.
2..If we use only Rear pointer in queue, then insertion is O(1) and deletion is not possible.
insertion not possible b/c u can go in left direction in simple queue.