Introduction to Data Structures MCQ question and answer with solution

A. FIFO

B. LIFO

C. Random Access

D. Priority Queue

A. O(n)

B. O(log n)

C. O(n log n)

D. O(1)

A. Array

B. Set

C. List

D. Linked List

A. Fixed size

B. Dynamic size

C. Slow access to elements by index

D. Easier memory allocation

A. Stack

B. Queue

C. Array

D. Tree

A. Huffman codes

B. Interrupt handling in operating system

C. Undo operation in text editors

D. Bayesian spam filter

A.

public void pop()
{
        if(q1.size()>0)
        {
            q2.poll();
        }
        else if(q2.size()>0)
        {
            q1.poll();
        }
}

B.

public void pop()
{
        if(q1.size()>0)
        {
            q1.poll();
        }
        else if(q2.size()>0)
        {
            q2.poll();
        }
}

C.

public void pop()
{
        q1.poll();
	q2.poll();
}

D.

public void pop()
{
        if(q2.size()>0)
        {
            q1.poll();
        }
        else
        {
            q2.poll();
        }
}

A. Dequeue

B. Enqueue

C. Return the front element

D. Return the last element

A. A low priority process might have to wait indefinitely for the CPU

B. If the system crashes, the low priority systems may be lost permanently

C. Interrupt handling

D. Indefinite blocking

A. A queue with insert/delete defined for both front and rear ends of the queue

B. A queue implemented with a doubly linked list

C. A queue implemented with both singly and doubly linked lists

D. A queue with insert/delete defined for front side of the queue