Sponsored Links


Results 1 to 3 of 3

Thread: CS301 Data Structures Quiz No.1 Solved Fall Semester 2012

  1. #1
    Administrator Vuhelper's Avatar
    Join Date
    Apr 2011
    Posts
    9,578

    18 CS301 Data Structures Quiz No.1 Solved Fall Semester 2012

    Sponsored Links1


    CS301 Data Structures Quiz No.1 Solved Fall Semester 2012


    1.When an executable program run, it is loaded in the memory and becomes a_______.
    Select correct option:
    Thread
    .h file
    Process
    None of the above

    2.A kind of expressions where the operator is present between two operands called ________expressions.
    Select correct option:
    Infix
    Postfix
    Prefix
    None of the above



    3.Which of the following operations returns top value of the stack?
    Select correct option:
    push
    pop
    top
    first


    4.To create a _________ we link the last node with the first node in the list.
    Select correct option:
    Double linked list
    Circularly-linked list
    Linked list
    None of the above

    5.In the calling function, after the execution of the function called, the program continues its execution form the _______after the function call.
    Select correct option:
    Previous line
    Next line
    Beginning
    None of the above


    6.Doubly Linked List always has one NULL pointer.
    Select correct option:
    True
    False

    7. ________ only removes items in reverse order as they were entered.
    Select correct option:
    Queue
    Stack
    Both of these
    None of these


    8.In the linked list implementation of the stack class, where does the push member function places the new entry on the linked list?
    Select correct option:
    After all other entries that are greater than the new entry.
    At the head
    After all other entries that are smaller than the new entry.
    At the tail


    9.Which of the following is known as “Last-In, First-Out” or LIFO Data Structure?
    Select correct option:
    Linked List
    Stack
    Queue
    Tree


    10.Which boolean expression indicates whether the numbers in two nodes (p and q) are the same. Assume that neither p nor q is null.
    Select correct option:
    p == q
    p.data == q.data
    p.nextNode == q. nextNode
    p.data == q

    MORE Question

    1. Local variables of a function are stored in,
    Select correct option:
    Binary Search Tree
    Stack
    Queue
    AVL Tree

    2. Question # 2 of 5 ( Start time: 11:41:31 AM )
    When an executable program run, it is loaded in the memory and becomes a_______.
    Select correct option:
    Thread
    .h file
    Process
    None of the above
    3. In________ the ‘next’ returns false when it reaches to the last node due to the fact that the next field of the last node is set to NULL.
    Select correct option:
    Circular linked list
    Triple linked list
    Singly linked list

    None of the above
    4. A kind of expressions where the operator is present between two operands called ________expressions.
    Select correct option:

    Infix

    Postfix

    Prefix

    None of the above
    5. Question # 1 of 5 ( Start time: 11:44:44 AM ) Total Marks: 1
    Compiler uses which one of the following in Function calls,
    Select correct option:

    Stack


    Queue

    Binary Search Tree

    AVL Tree



    6. Stack and Queue can be implemented using _______,

    Select correct option:

    Singly Link List
    Binary Tree
    Binary Search Tree
    AVL Tree

    7. Which one of the following is TRUE about recursion?
    Select correct option:

    Recursive function calls consume a lot of memory.
    Recursion extensively uses stack memory.
    Recursion extensively uses stack memory.
    Iteration is more efficient than iteration.


    8. Doubly Linked List always has one NULL pointer.
    Select correct option:

    True

    False




    9. Which boolean expression indicates whether the numbers in two nodes (p and q) are the same. Assume that neither p nor q is null.
    Select correct option:

    p == q
    p.data == q.data
    p.nextNode == q. nextNode
    p.data == q


    10. Whenever we call a function, the compiler makes a stack, the top element of the stack is _____ of the function.
    Select correct option:

    First argument
    Return address
    Last argument
    None of the above

    11.

    _____ is the stack characteristic but _______was implemented because of the size limitation of the array.
    Select correct option:

    isFull(),isEmpty()
    pop(), push()
    isEmpty() , isFull()
    push(),pop()

    12.

    Each operator in a postfix expression refers to the previous ______ operand(s).
    Select correct option:

    one
    two
    three
    four

    13.

    The next field in the last node in a singly-linked list is set to_____.
    Select correct option:

    0
    1
    NULL
    false

    14.

    The _____ method of list will position the currentNode and lastCurrentNode at the start of the list.
    Select correct option:
    Remove
    Next
    Start
    Back
    15.

    ______ is the maximum number of nodes that you can have on a stack-linked list ?
    Select correct option:
    Zero
    2n (where n is the number of nodes in linked list)
    Any Number
    None of these

    16.

    In the linked list implementation of the stack class, where does the push member function places the new entry on the linked list?
    Select correct option:

    After all other entries that are greater than the new entry.
    At the head
    After all other entries that are smaller than the new entry.
    At the tail



    17. Which of the following operations returns top value of the stack?
    Select correct option:

    push
    pop
    top
    first

    18. it will be efficient to place stack elements at the start of the list because insertion and removal take _______time.
    Select correct option:

    Variable
    Constant
    Inconsistent
    None of the above


    19. A template is a function or class that is written with a __________data type.
    Select correct option:

    Specific
    Definite
    Generic
    None of the above.

    20. Local variables of a function are stored in,
    Select correct option:
    Binary Search Tree
    Stack
    Queue
    AVL Tree

    21. To create a _________ we link the last node with the first node in the list.
    Select correct option:
    Double linked list
    Circularly-linked list
    Linked list
    None of the above

    22. In the calling function, after the execution of the function called, the program continues its execution form the _______after the function call.
    Select correct option:
    Previous line
    Next line
    Beginning
    None of the above

    23. Which of the following can be used to reverse a string value,
    Select correct option:
    Stack
    Queue
    Both of these
    None of these

    24. Question # 4 of 5 ( Start time: 05:32:20 PM ) Total Marks: 1
    Each node in doubly link list has,
    Select correct option:
    1 pointer
    2 pointers
    3 pointers
    4 pointers


    25. In________ the ‘next’ returns false when it reaches to the last node due to the fact that the next field of the last node is set to NULL.
    Select correct option:
    Circular linked list
    Triple linked list
    Singly linked list
    None of the above



    26. only removes items in reverse order as they were entered.
    Select correct option:

    Queue
    Stack
    Both of these
    None of these

    27. A queue is a ________data structure, whereas a stack is a ________data structure.
    Select correct option:

    FIFO, LIFO
    LIFO,FIFO
    both of these
    none of these



    28. The principal benefit of a linked list over a conventional array is that the order of the linked items may be_____ from the order that the data items are stored in memory.
    Select correct option:

    Same
    Identical
    Different
    Equivalent



    29. Whenever we call a function, the compiler makes a stack, the top element of the stack is _____ of the function.
    Select correct option:

    First argument
    Return address
    Last argument
    None of the above


    30. The _____ method of list will position the current Node and lastCurrentNode at the start of the list.
    Select correct option:

    Remove
    Next
    Start
    Back

  2. #2
    Junior Member
    Join Date
    May 2012
    Posts
    10
    any one have latest quize idea

  3. #3
    Administrator Vuhelper's Avatar
    Join Date
    Apr 2011
    Posts
    9,578
    jald he upload kr dein gay latest idea Quiz

    Sponsored Links

Thread Information

Users Browsing this Thread

There are currently 1 users browsing this thread. (0 members and 1 guests)

Similar Threads

  1. Replies: 0
    Last Post: 01-24-2013, 04:50 PM
  2. Replies: 0
    Last Post: 11-14-2012, 03:11 PM
  3. CS301 Data Structures Assignment No 2 Fall Semester 5th November 2012
    By Vuhelper in forum Assignments & Solutions
    Replies: 0
    Last Post: 11-05-2012, 05:09 PM
  4. Replies: 4
    Last Post: 01-23-2012, 09:14 PM
  5. Replies: 0
    Last Post: 12-22-2011, 03:18 AM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  
-: Vuhelp Disclaimer :-
None of the files shown here are hosted or transmitted by this server. The links are provided solely by this site's users. The administrator's or staff of Vuhelp.net cannot be held responsible for what its users post, or any other actions of its users. You may not use this site to distribute or download any material when you do not have the legal rights to do so. It is your own responsibility to adhere to these terms. If you have any doubts about legality of content or you have any suspicions, feel free to contact us.
Online Education | JhelumSoft