Re: [ vuZs.net ] Digest for vuZs@googlegroups.com - 24 Messages in 14 Topics

1 view
Skip to first unread message

SIMBA SHAH

unread,
Jan 3, 2012, 10:24:53 AM1/3/12
to vu...@googlegroups.com
isl201 ka gdb to share kren please, aj last date hy

On Tue, Jan 3, 2012 at 7:23 PM, <vu...@googlegroups.com> wrote:

Group: http://groups.google.com/group/vuZs/topics

    Umair Saulat <saulat...@googlemail.com> Jan 02 10:43PM +0500  

    *
    *
     
    --
    *Zindagi mein 2 Logo ka buhat khayal rahkoooo
     
    *
    *Ist woh jiss ney tumhari jeet ke Liye buhat kuch hara hoo (Father)
     
    2nd woh jiss ko tum ney har dukh me pukaara hoo (Mother)
    *
    *
    *
    *Regards, *
    *Umair Saulat*

     

    "████ فرخ منظور ████" <lovely...@gmail.com> Jan 03 12:19AM +0500  

    BC100400794 Umar Hayyat
    BC100400084 Imran Shehzad
     
    Brother agar ap kisi ko benefit pohchana chahtay ho toh please in future
    internet explorer mai quiz open karo.or sath main word open karlo. or
    "ctrl+A" kar k select quiz kro phir "ctrl+c" kr k copy kro or ctrl+v kr k
    word main paste kardo.
    only 5 seconds lagtay hain.
    iss se doosray logon ko faida miljay ga.istrah snapshot se quiz k doran
    search nahin hoti.
     
    On Mon, Jan 2, 2012 at 10:43 PM, Umair Saulat

     

    Umair Saulat <saulat...@googlemail.com> Jan 03 06:24PM +0500  

    *yehi wohi file hai dost sarey quizzes hai aur solved bhi is sey aap ki aur
    almost sarey students ko achi help ho jaye gii check kar ley
    *
    On Tue, Jan 3, 2012 at 12:19 AM, ████ فرخ منظور ████ <lovely...@gmail.com
    > To join this group Send blank email to vuZs+su...@googlegroups.com
    > or visit
    > http://groups.google.com/group/vuZs/subscribe
     
    --
    *Zindagi mein 2 Logo ka buhat khayal rahkoooo
     
    *
    *Ist woh jiss ney tumhari jeet ke Liye buhat kuch hara hoo (Father)
     
    2nd woh jiss ko tum ney har dukh me pukaara hoo (Mother)
    *
    *
    *
    *Regards, *
    *Umair Saulat*

     

    Junaid Tariq <mc100...@vu.edu.pk> Jan 03 12:12AM +0500  

    Anyone has key for the IDM ( Internet Download Manager ). Please ! send me
    ......!

     

    Junaid Tariq <mc100...@vu.edu.pk> Jan 03 12:16AM +0500  

    Please.... Please ! Send me the key....! Today is my last day for trial
    period...!
     

     

    BILAL <mc100...@vu.edu.pk> Jan 03 02:30PM +0500  

    yeh serial key lagao Serial : OX48V-QTRIU-0LW9T-K30JT
    or phir C:\WINDOWS\system32\drivers\etc main ja k host ki file ko notepad
    main open karo or uski setting attach ki hui file jaisi kar do.
     
     
     
    --
    *Every Thing Happens For A Reason,
    Live It, Love It, Learn From It !!!
    Make Your Smile Change The World,
    But Don't Let The World Change Your Smile.... :)*

     

    bc100403112 Qasim Ali Shah <bc100...@vu.edu.pk> Jan 03 02:22AM -0700  

    ap idm 5.15 download krain uske liye key ni chaye
     
    ye life time free hai

     

    bc100400550 Sabahat Butt <bc100...@vu.edu.pk> Jan 03 12:44AM -0800  

    Assalam o Alikum!
     
    plzz share the idea solution of assignment 3 of Mth301 if you have!
    regards,

     

    bc100402527 Abeer Afzal <bc100...@vu.edu.pk> Jan 03 12:37PM +0300  

    & plz share phy101 solution
    On Tue, Jan 3, 2012 at 11:44 AM, bc100400550 Sabahat Butt <

     

    mc100400210 <mc100...@vu.edu.pk> Jan 03 11:47AM +0500  

    sallam
     
    plz share the idea solution of sta 301 3rd assignment.
     
     
     

     

    Hussain Ahmad Zia <mc090...@vu.edu.pk> Jan 02 09:46PM +0500  

    Please find the attached file

     

    Syed Omer Shah <mubara...@gmail.com> Jan 02 08:24AM -0800  

    Assalamu Alaykum Warahmatullahi WaBarakatuhu,
    Here are two MTH302 Assignment#2 Idea Solutions first one is By Shiza
    Choudary and second one is by Danish.

     

    Umair Saulat <saulat...@googlemail.com> Jan 02 10:21PM +0500  

    *Cs402 Assignment Solution 1
    *
    On Mon, Jan 2, 2012 at 6:01 PM, mc110203934 Saira Anjum <
    > To join this group Send blank email to vuZs+su...@googlegroups.com
    > or visit
    > http://groups.google.com/group/vuZs/subscribe
     
    --
    *Zindagi mein 2 Logo ka buhat khayal rahkoooo
     
    *
    *Ist woh jiss ney tumhari jeet ke Liye buhat kuch hara hoo (Father)
     
    2nd woh jiss ko tum ney har dukh me pukaara hoo (Mother)
    *
    *
    *
    *Regards, *
    *Umair Saulat*

     

    mc090404268 Naima Kanwal <mc090...@vu.edu.pk> Jan 02 06:40AM -0800  

    plzzzz i need solution of hrm624'assignment..
     
    On Mon, Jan 2, 2012 at 5:01 AM, mc110203934 Saira Anjum <

     

    Aamir Ali <amirl...@gmail.com> Jan 02 11:54PM +0500  

    *thank u *
    On Mon, Jan 2, 2012 at 10:21 PM, Umair Saulat

     

    mc100202423 Marrium Chaudhary <mc100...@vu.edu.pk> Jan 02 09:29PM -0800  

    mujhy b mgmt628 ki assignment ka solution chahye plz jaldi

     

    bc100200944 Muhammad Junaid Arshad <bc100...@vu.edu.pk> Jan 03 10:30AM +0500  

    Please give me any idea solution of MTH301 current assignment..
     
     
     
     
     
     
    --

     

    Umair Saulat <saulat...@googlemail.com> Jan 02 10:09PM +0500  

    Consider a max heap, represented by the following array;
    40,30,20,10,15,16,17,18,4 After inserting a nodes with value 35.Which of
    following is the updated
     
    max heap?
     
    *40,30,20,10,15,16,17,8,4,35*
     
    40,30,20,10,35,16,17,8,4,15
     
    40,35,20,10,30,16,17,8,4,15
     
    40,35,20,10,15,16,17,18,4,30
     
     
     
    A Threaded Binary Tree is a binary tree in which every node that does not
    have a right child has a THREAD (in actual sense, a Link)
    ___________Successor
     
     
     
    Preorder
     
    *Inorder*
     
    Postorder
     
    Leveloder
     
     
     
     
     
    Which of the following is a property of binary tree?
     
    A Binary tree with N internal nodes has 2+N links, N-1 links to internal
    nodes and N+1 links to external nodes.
     
    A Binary tree with N internal nodes has 2*N links, N-1 links to internal
    nodes and N+1 links to external nodes.
     
    A Binary tree with N internal nodes has 2-N links, N-1 links to internal
    nodes and N+1 links to external nodes.
     
    *A Binary tree with N internal nodes has 2N links, N+1 links to internal
    nodes and N-1 links to external nodes.*
     
     
     
     
     
    A Threaded Binary tree is a binary tree in which every node that does not
    have a right child has a THREAD (in actual sense, a link)_____________
    successor.
     
    Preoder
     
    *Inorder*
     
    Postorder
     
    Levelorder
     
     
     
    If there are 56 internal nodes in a binary tree then how many external
    nodes this binary tree will have?
     
    54
     
    55
     
    56
     
    *57*
     
     
     
     
     
     
     
    Which of the following statement is correct?
     
     
    A threaded Binary tree is a binary tree in which every node that does not
    have a left child has a THREAD (in actual sense, a link) to its INORDER
    successor.
     
    *A threaded Binary tree is a binary tree in which every node that does not
    have a right child has a THREAD (in actual sense, a link) to its PREORDER
    successor.*
     
    A threaded Binary tree is a binary tree in which every node that does not
    have a left child has a THREAD (in actual sense, a link) to its INORDER
    successor.
     
    A threaded Binary tree is a binary tree in which every node that does not
    have a right child has a THREAD (in actual sense, a link) to its POSTORDER
    predecessor.
     
     
     
    It is necessary fro Huffman encoding tree to be,
     
    AVL tree
     
    *Binary tree*
     
    Complete binary Tree
     
    None of these
     
     
     
    A binary tree with 45 internal nodes has _________ links to external nodes.
     
    44
     
    45
     
    *46*
     
    90
     
     
     
    In which of the following tree, parent nodes has key greater than or equal
    to its both children?
     
    Max heap
     
    Binary search tree
     
    Threaded Binary tree
     
    *Complete Binary tree *
     
     
     
     
     
     
     
    If one pointer of the nodes in a binary tree is NULL then it will be a/an
     
    Inner node
     
    Leaf node
     
    External node
     
    Root node
     
     
     
    If there are N external nodes is a binary tree then what will be the no. of
    the internal nodes in this binary tree?
     
    N-1
     
    N
     
    *N+1*
     
    N+2
     
     
     
     
     
     
     
    See the below code and fill the appropriate answer for? Void
    fastlnorder(TreeNod+p) {while((p+nextInorder(p)) !+ ? ) cout <<
    p->getInfo();}
     
    *Dummy *
     
    rootNode
     
    LTH
     
    RTH
     
     
     
    In threaded binary tree, the NULL pointer are replaced by the
     
     
     
    Preorder successor or Predecessor
     
    *Inorder successor or predecessor *
     
    Postorder successor or predecessor
     
    NULL pointer are not replaced
     
     
     
     
     
    In which of the following tree, parent nodes has a key greater than or
    equal to its both children?
     
    Max heap
     
    Binary search tree
     
    Threaded Binary three
     
    Complete Binary tree
     
     
     
    In Complete binary tree the bottom level is filled from _______
     
    *Left to right *
     
    Right to left
     
    Not filled at all
     
    None of the given options
     
     
     
    If the bottom level of a binary tree is NOT completely filled, depicts that
    the tree is NOT a ________
     
    *Complete Binary tree *
     
    Threaded Binary Tree
     
    Expression tree
     
    Perfectly compete Binary tree
     
     
     
    If an expression tree is correct then its root should have,
     
    *An operator *
     
    (
     
    )
     
    an operand
     
     
     
    In threaded binary tree, the NULL pointers are replaced by the
     
    Preorder successor or predecessor
     
    Inorder successor or predecessor
     
    Postorder successor or predecessor
     
    NULL pointer are not replaced
     
     
     
     
     
    A complete binary tree is a tree that is ________ filled, with the possible
    exception of the bottom level.
     
    Partially
     
    *Completely *
     
    Incompletely
     
    Partly
     
     
     
    If the bottom level of a binary tree is not completely filled, depicts that
    the tree is not a _________
     
     
     
    Expression tree
     
    Threaded binary tree
     
    *Complete binary tree *
     
    Perfectly complete binary tree
     
     
     
    An expression tree will always be a,
     
    Complete binary tree
     
    *Binary search tree *
     
    Heap AVL tree
     
     
     
    Which of the following is a property of binary tree?
     
    A binary tree of N external nodes has N internal node
     
    *A Binary tree of N internal nodes has N+1 external node*
     
    A Binary tree of N external nodes has N+1 internal node
     
    A Binary tree of N internal has N-1 external node
     
     
     
    In a threaded binary tree which nodes have NULL child pointers,
    Select correct option:
    *All leaf nodes*
    Nodes other then leaf nodes
    Root Node
    None of the nodes
     
     
     
    In threaded binary tree, the NULL pointers are replaced by the
    Select correct option:
    preorder successor or predecessor
    *inorder successor or predecessor*
    postorder successor or predecessor
    NULL pointers are not replaced
     
     
     
     
     
    A complete binary tree is a tree that is *_______* filled, with the
    possible exception of the bottom level.
    Select correct option:
    partially
    *completely*
    incompletely
    partly
     
     
     
    Which one of the following is TRUE about iteration?
    Select correct option:
    Iterative function calls consumes a lot of memory
    Threaded Binary Trees use the concept of iteration
    *Iteration extensively uses stack memory*
    Recursion is more efficient than iteration
     
     
     
     
     
    If an expression tree is correct then its root should have,
    Select correct option:
    *an operator*
    (
    )
    an operand
     
     
     
    We implement the heap by *____________* .
    Select correct option:
    Threaded Tree
    AVL tree
    *Complete binary tree*
    Expression
     
     
     
    Which of the following statement concerning heaps is NOT true?
    Select correct option:
    *Traversing a heap in order provides access to the data in numeric or
    alphabetical order.
    *Removing the item at the top provides immediate access to the key value
    with highest (or lowest) priority.
    Inserting an item is always done at the end of the array, but requires
    maintaining the heap property.
    A heap may be stored in an array.
     
     
     
     
     
     
     
     
     
     
     
     
     
    Which of the following statement concerning heaps is NOT true?
    Select correct option:
     
    A heap can be stored in a binary search tree.
    A heap can be stored in an array.
    A heap can be used to implement a priority queue.
    A heap can be used to sort data.
     
     
     
     
     
     
     
    A complete binary tree is a tree that is _________ filled, with the
    possible exception of the bottom level.
     
    partially
     
    *completely *
     
    incompletely
     
    partly
     
     
     
     
     
    By using __________we avoid the recursive method of traversing a Tree,
    which makes use of stacks and consumes a lot of memory and time.
     
    Binary tree only
     
    Heap data structure
     
    Huffman encoding
     
     
     
     
     
    Which of the following statement is true about dummy node of threaded
    binary tree?
     
    The left pointer of dummy node points to the itself while the right pointer
    points to the root of tree.
     
    The left pointer of dummy node points to the root node of the tree while
    the right pointer points itself i.e. to dummy node.
     
    The left pointer of dummy node points to the root node of the tree while
    the right pointer is always NULL.
     
    The right pointer of dummy node points to the itself while the left pointer
    is always NULL.
     
     
     
     
     
     
     
     
     
    Threaded binary tree
     
     
     
     
     
     
     
     
     
     
     
    When a complete binary tree, represented by an array then for any array
    element at position i, the parent is at position ______ .
     
    2i-1
     
    2i
     
    2i+1
     
    *floor(i/2)*
     
     
     
     
     
     
     
    When a complete binary tree represented by an array then if right child is
    at position 5 then left child will be at position _____
     
    2
     
    3
     
    *4*
     
    6
     
     
     
     
     
    A binary tree with N internal nodes has _____ links, _______ links to
    internal nodes and ________ links to external nodes.
     
    *2N, N-1, N+1*
     
    N-1, 2N, N+1
     
    N+1, 2N, N-1
     
    N+1, N-1, 2N
     
     
     
    If a binary tree has N + 1 external nodes then,
     
    *It has N internal nodes*.
     
    It has N-1 internal nodes.
     
    It has N/2 internal nodes.
     
    It has N+2 internal nodes.
     
     
     
     
     
    A binary tree with 45 internal nodes has _______links to external nodes.
     
    44
     
    45
     
    46
     
    90
     
     
     
    Consider a binary tree, represented by the following array:
    10,7,9,5,2,1,6,3,4 This is a ________.
     
    Min heap
     
    Max heap (Not Sure)
     
    Threaded binary tree
     
    Binary Search tree
     
     
     
     
     
    Consider a max heap, represented by the following array:
    40,30,20,10,15,16,17,8,4 After inserting a node with value 35.Which of the
    following is the updated max heap?
     
     
     
    Consider a binary tree, represented by the following array: A,B,C,D,E,F,G,I
    Is it a strictly binary tree ?
    Select correct option:
     
    Yes
    *No*
     
     
     
    In threaded binary tree the NULL pointers are replaced by the
     
    preorder successor or predecessor
     
    *inorder successor or predecessor*
     
    inorder successor or predecessor
     
    NULL pointers are not replaced
     
     
     
    Consider a binary tree, represented by the following array:
    A,B,C,D,E,F,G,H,I,J,K,L Is it a strictly binary tree?
     
    Yes
     
    *No*
     
    * *
     
    We implement the heap by ______________ .
     
    Threaded Tree
     
    AVL tree
     
    *Complete binary tree*
     
    Expression
     
     
     
    If there are 56 internal nodes in a binary tree then how many external
    nodes this binary tree will have?
     
     
     
    ► 54
     
    ► 55
     
    ► 56
     
    *►** 57*
     
    * *
     
    Which of the following statements is correct property of binary trees?
     
    ► A binary tree with N internal nodes has N+1 internal links.
     
    ► A binary tree with N external nodes has 2N internal nodes.
     
    *►** A binary tree with N internal nodes has N+1 external nodes. *
     
    ► None of above statement is a property of the binary tree.
     
    * *
     
    Which of the following is a property of binary tree?
     
    ► A binary tree of N external nodes has N internal node.
     
    *►** A binary tree of N internal nodes has N+ 1 external node.*
     
    ► A binary tree of N external nodes has N+ 1 internal node.
     
    ► A binary tree of N internal nodes has N- 1 external node.
     
    * *
     
    Which of the following statement is true about dummy node of threaded
    binary tree?
     
    ► The left pointer of dummy node points to the itself while the
    right pointer points to the root of tree.
     
    * **►** The left pointer of dummy node points to the root node of the
    tree while the right pointer points itself i.e. to dummy node*
     
    ► The left pointer of dummy node points to the root node of the tree
    while the right pointer is always NULL.
     
    ► The right pointer of dummy node points to the itself while the
    left pointer is always NULL.
     
    * *
     
    * *
     
    If the bottom level of a binary tree is NOT completely filled, depicts that
    the tree is NOT a
     
     
     
    ► Expression tree
     
    ► Threaded binary tree
     
    ► *complete Binary tree*
     
    ► Perfectly complete Binary tree
     
    * *
     
    * *Which of the following statement is correct about find(x) operation:
     
     
     
    *►** **A find(x) on element x is performed by returning exactly the
    same node that is found. *
     
    ► A find(x) on element x is performed by returning the root of the
    tree containing x.
     
    ► A find(x) on element x is performed by returning the whole tree
    itself containing x.
     
    ► A find(x) on element x is performed by returning TRUE.
     
     
     
    If there are 23 external nodes in a binary tree then what will be the no.
    of internal nodes in this binary tree?
     
     
     
    * *
     
    * **►** *23
     
    * *
     
    * **►** *24
     
    * *
     
    * **►** *21
     
    * *
     
    * **►** 22*
     
     
     
    f there are N external nodes in a binary tree then what will be the no. of
    internal nodes in this binary tree?
     
     
     
    * **►** N -1*
     
    * *
     
    * **►** *N+1
     
    * *
     
    * **►** *N+2
     
    * *
     
    * **►** *N
     
    * *
     
    * *
     
    Which of the following statement is correct?
     
    * *
     
    * **►** *A Threaded Binary Tree is a binary tree in which every node
    that does not have a left child has a THREAD (in actual sense, a link) to
    its INORDER successor.
     
    * *
     
    * **►** *A Threaded Binary Tree is a binary tree in which every node
    that does not have a right child has a THREAD (in actual sense, a link) to
    its PREOREDR successor.
     
    * *
     
    * **►** A Threaded Binary Tree is a binary tree in which every node
    that does not have a right child has a THREAD (in actual sense, a link) to
    its INORDER successor. *
     
    * *
     
    * **►** *A Threaded Binary Tree is a binary tree in which every node
    that does not have a right child has a THREAD (in actual sense, a link) to
    its POSTORDER successor.
     
    * *
     
    * *
     
    By using __________we avoid the recursive method of traversing a Tree,
    which makes use of stacks and consumes a lot of memory and time.
     
    * *
     
    * **►** *Binary tree only
     
    * *
     
    * **►** Threaded binary tree*
     
    * *
     
    * **►** *Heap data structure
     
    * *
     
    * **►** *Huffman encoding
     
    * *
     
    Consider a min heap, represented by the following array:
     
    10,30,20,70,40,50,80,60
     
    After inserting a node with value 31.Which of the following is the updated
    min heap?
     
     
     
    * *
     
    * **►** 10,30,20,31,40,50,80,60,70*
     
    * *
     
    * **►** *10,30,20,70,40,50,80,60,31
     
    * *
     
    * **►** *10,31,20,30,40,50,80,60,31
     
    * *
     
    * **►** *31,10,30,20,70,40,50,80,60
     
    * *
     
    In complete binary tree the bottom level is filled from ________
     
    * *
     
    * **►** Left to right*
     
    * *
     
    * **►** *Right to left
     
    * *
     
    * **►** *Not filled at all
     
    * *
     
    * **►** *None of the given options
     
    * *
     
    In case of deleting a node from AVL tree, rotation could be prolong to the *
    root* node.
     
     
     
    * *
     
    * **►** Yes *
     
    * *
     
    * **►** *No
     
    *
     
    *
     
    When an array of object is created dynamically then there is no way to
    provide parameterized constructors for array of objects.
     
    *True *
     
    Flase
     
    * *
     
    Which of the following method is helpful in creating the heap at once?
     
    Select correct option:
     
    insert
     
    add
     
    update
     
    *preculateDown*
     
    * *
     
    > dare-arqam-v...@googlegroups.com
    > For more options, visit this group at
    > http://groups.google.com/group/dare-arqam-vu?hl=en
     
    --
    *Zindagi mein 2 Logo ka buhat khayal rahkoooo
     
    *
    *Ist woh jiss ney tumhari jeet ke Liye buhat kuch hara hoo (Father)
     
    2nd woh jiss ko tum ney har dukh me pukaara hoo (Mother)
    *
    *
    *
    *Regards, *
    *Umair Saulat*

     

    mc090402714 Sonia Naqi <mc090...@vu.edu.pk> Jan 02 11:24PM +0500  

    ye downloads main dia hoa form hai jo ap bank sy fillkraty o or scan copy
    report main lgti a
     
     
    On Sun, Jan 1, 2012 at 11:37 AM, mc100202783 Muhammad Arshad Hayat <

     

You received this message because you are subscribed to the Google Group vuZs.
You can post via email.
To unsubscribe from this group, send an empty message.
For more options, visit this group.

--
--
Please visit www.vuzs.net For Current & Old Papers, Quizzes, Assignments and study material.
 
To post a new message on this group, send email to vu...@googlegroups.com
 
Message Posting Rules: http://vuzs.net/faq/4795-vuzs-google-groups-basic-rules-for-posting-messages.html
--
To unsubscribe from this group, send email to vuZs+uns...@googlegroups.com
--
To join this group Send blank email to vuZs+su...@googlegroups.com
or visit
http://groups.google.com/group/vuZs/subscribe

Reply all
Reply to author
Forward
0 new messages