http://www.gate.iitg.ac.in/?page_id=748
@ vishal chugh see this
https://gateoverflow.in/blog/3316/go-%26-me
Please ignore this comment, was a mistake -
For the following question :
A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let n denote the number of nodes in the queue. Let enqueue be implemented by inserting a new node at the head, and dequeue be implemented by deletion of a node from the tail.
The answer key says option "D". Doesn't look right to me.
Also for this question
Let ⊕ and ⊙ denote the Exclusive OR and Exclusive NOR operations, respectively. Which one of the following is NOT CORRECT?
Answer key says "C" which seems to be incorrect.
64.3k questions
77.9k answers
244k comments
80.0k users