Sponsored Links


Results 1 to 5 of 5

Thread: CS301 Data Structures MIDTERM solve papers Spring 2011

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

    Icon19 CS301 Data Structures MIDTERM solve papers Spring 2011

    Sponsored Links1


    for full solve papers check attachment



    Question No: 9 ( Marks: 1 ) - Please choose one


    I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers will change during an insertion into an EMPTY queue?

    Sponsored Links


    ► Neither changes


    ► Only front pointer changes.


    ► Only rear pointer changes.


    ► Both change.

    Question No: 10 ( Marks: 1 ) - Please choose one


    Consider the following tree.


    How many of the nodes have at least one sibling?

    ► 8

    ► 7

    ► 5

    ► 6



    Question No: 11 ( Marks: 1 ) - Please choose one


    The nodes with no successor are called _________

    ► Root Nodes

    ► Leaf Nodes

    ► Both of these

    ► None of these



    Question No: 12 ( Marks: 1 ) - Please choose one


    AVL Tree is,


    ► Non Linear data structure


    ► Linear data structure


    ► Hybrid data structure (Mixture of Linear and Non Linear)


    ► None of the given options.





    Question No: 13 ( Marks: 1 ) - Please choose one


    We access elements in AVL Tree in,


    ► Linear way only


    ► Non Linear way only


    ► Both linear and non linear ways


    ► None of the given options.




    Question No: 14 ( Marks: 1 ) - Please choose one


    A binary search tree should have minimum of one ________ node/s at each level,


    ► One ( not sure )


    ► Two


    ► Three


    ► Four




    Question No: 15 ( Marks: 1 ) - Please choose one


    Consider the following statements.

    (i) A binary tree can contain at least 2L Nodes at level L.
    (ii) A complete binary tree of depth d is a binary tree that contains 2L Nodes at each level L between 0 and d, both inclusive.
    (iii) The total number of nodes (Tn ) in a complete binary tree of depth d is 2 d+1 - 1 .
    (iv) The height of the complete binary tree can be written as h = log 2 (Tn+1)-1 where Tn is Total number of Nodes.

    Which one of the following is correct in respect of the above statements regarding the Binary trees?


    ► (i) and (iii) only

    ► (i), (ii) and (iii) only

    ► (ii) and (iii) only

    ► (ii), (iii) and (iv) only



    Question No: 16 ( Marks: 1 ) - Please choose one


    “+” is a _________operator.

    ► Unary




    ► Binary

    ► Ternary


    ► None of the above
    Attached Files Attached Files

  2. #2
    Junior Member
    Join Date
    Apr 2011
    Posts
    5
    Thnx Thnxxxxxxxxxx alooooooooooot for uploading of these papers... :-)

  3. #3
    Administrator Xpert's Avatar
    Join Date
    May 2010
    Location
    Jhelum
    Posts
    6,239
    you are welcome. I hope you will also share your paper.

  4. #4
    Junior Member
    Join Date
    Nov 2011
    Posts
    2
    thanxxxxxxxxxxxxxxxxxxx bro .

  5. #5
    Junior Member
    Join Date
    Nov 2011
    Posts
    2
    Dear bro
    app log mit k b subject k papers send keia karro


    best of luck all of you

Thread Information

Users Browsing this Thread

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

Similar Threads

  1. Replies: 19
    Last Post: 11-17-2011, 05:51 PM
  2. Replies: 17
    Last Post: 11-10-2011, 03:41 AM
  3. Replies: 0
    Last Post: 07-09-2011, 10:08 PM
  4. Replies: 7
    Last Post: 06-29-2011, 10:17 PM
  5. Need mid term past papers of cs301( data structures)....
    By ANI in forum MCQ's & Quiz Discussion
    Replies: 1
    Last Post: 05-22-2010, 02:34 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