Menu
Home / CSE MCQs / Data Structure MCQs :: Data Structure Abstract Data Types

CSE MCQs :: Data Structure MCQs

Data Structure MCQs - Data Structure Abstract Data Types
  1. What is the output of the following piece of code?

    public class array
    {
    public static void main(String args[])
    {
    int []arr = {1,2,3,4,5};
    System.out.println(arr[5]);
    }
    }
    2. A.
    4
    B.
    5
    C.
    ArrayIndexOutOfBoundsException
    D.
    InavlidInputException

    View Answer

    Workspace

    Discuss Discuss in Forum

  2. Choose the code snippet which inserts a node to the head of the list?
    3. A.

    public void insertHead(int data)


    {
    B.

    public void insertHead(int data)


    {
    C.

    public void insertHead(int data)


    {
    D.

    public void insertHead(int data)


    {

    View Answer

    Workspace

    Discuss Discuss in Forum

  3. Which of the following can be used to delete an element from the rear end of the queue?
    4. A.

    public Object deleteRear() throws emptyDEQException


    {
    B.

    public Object deleteRear() throws emptyDEQException


    {
    C.

    public Object deleteRear() throws emptyDEQException


    {
    D.
    None of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum

  4. What is the time complexity of inserting a node in a doubly linked list?
    5. A.
    O(nlogn)
    B.
    O(logn)
    C.
    O(n)
    D.
    O(1)

    View Answer

    Workspace

    Discuss Discuss in Forum

  5. What is not a disadvantage of priority scheduling in operating systems?
    6. 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.
    None of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum

  6. A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?
    7. A.
    Queue
    B.
    Circular queue
    C.
    Dequeue
    D.
    Priority queue

    View Answer

    Workspace

    Discuss Discuss in Forum

  7. What is the need for a circular queue?
    8. A.
    effective usage of memory
    B.
    easier computations
    C.
    all of the mentioned
    D.
    none of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum

  8. In linked list implementation of a queue, from where is the item deleted?
    9. A.
    At the head of link list
    B.
    At the centre position in the link list
    C.
    At the tail of the link list
    D.
    None of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum

  9. What would be the asymptotic time complexity to find an element in the linked list?
    10. A.
    O(1)
    B.
    O(n)
    C.
    O(n2)
    D.
    None of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum

  10. Which of the following points is/are true about Linked List data structure when it is compared with array
    11. A.
    Arrays have better cache locality that can make them better in terms of performance
    B.
    It is easy to insert and delete elements in Linked List
    C.
    Random access is not allowed in a typical implementation of Linked Lists
    D.
    All of the mentioned

    View Answer

    Workspace

    Discuss Discuss in Forum

Java Programming Questions and Answers Interview Questions and Answers