Thnx Thnxxxxxxxxxx alooooooooooot for uploading of these papers... :-)
for full solve papers check attachmentView more random threads:
- mgt502 paper solved by saba g
- Solved CS201 - Introduction to programming Final Term...
- mgt101 solved midterm papers download from vuhelp
- ACC501 Business Finance mid term solve paper spring 2011
- help me please
- if U need Solved papers of any Subject
- mgt603 Strategic Management mid term paper may 2011
- cs402 solved paper fall 2010
- FIN621 Financial Statement Analysis Solved midterm paper...
- Eng201 final term paper for 2011
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
Thnx Thnxxxxxxxxxx alooooooooooot for uploading of these papers... :-)
you are welcome. I hope you will also share your paper.
Urgent call: 03455242488. | Virtual University Assignments
Virtual University GDBs | Virtual University Papers | Vu Projects | Vu Handouts
About Expert
thanxxxxxxxxxxxxxxxxxxx bro .
Dear bro
app log mit k b subject k papers send keia karro
best of luck all of you
There are currently 1 users browsing this thread. (0 members and 1 guests)