i need this mcq answers

1. A stack is a version of A. linked list B. LIFO list C. sequential list D. FIFO list 2. In a doubly linked list, a node normally has ( ) the number of pointers A. 1 B. 2 C. 3 D. 4 3. In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is ( ) A. 1 B. n/2 C. n D. logN 4. Which boolean expression indicates whether the numbers in two nodes ( p and q ) are the same. Assume that neither p nor q is null. A. p==q B. p.data = q.data C. p.link ==q link D. None of the above. 5. The operation for adding an entry to a queue is traditionally called: A. Add B. Enqueue C. Insert D. Push 6 If the sequence of pushing elements into a stack is a,b,c,d which output sequence is impossible? ( ). A. abcd B. bcad C. cbad D. cabd 7. Which is not an abstract data structure? ( ). A. queue B. sort C. tree D. graph 8. In the linked list implementation of the stack class, where does the push method place the new entry on the linked list? A. At the head B. At the tail C. After all other entries that are greater than the new entry