[Pak Youth] Current Cs 301 Quisses (date 2 january 2013).

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.



Which of the following is a property of binary tree?
Select correct option:

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.

Which one of the following traversals give the mathematical expression of an expression tree,
Select correct option:

inorder
preorder
levelorder
postorder

There are ________cases in the process of deletion of a node in AVL Tree,
Select correct option:

2
3
4
5


In building Huffman encoding tree from leaf nodes,
Select correct option:

we start with characters with least frequencies.
we start with characters with maximum frequencies.
we start with characters with medium frequencies.
none of the options.


A binary tree with 45 internal nodes has _______links to external nodes.
Select correct option:

44
45
46
90


If both pointers of the node in a binary tree are NULL then it will be a/an
Select correct option:

Inner node
Leaf node
Root node
None of the given options


Consider a binary tree, represented by the following array: A,B,C,D,E,F,G,I,J Is it a strictly binary tree?
Select correct option:

Yes
No

It is necessary for Huffman encoding tree to be,
Select correct option:

AVL Tree
Binary Tree
Complete Binary Tree
None of these

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 ________ successor
Select correct option:

Preorder
Inorder
Postorder
levelorder

If the bottom level of a binary tree is not completely filled, depicts that the tree is not a _____.
Select correct option:
Expression tree
Threaded binary tree
complete binary tree
Perfectly complete binary tree

Which one of the following traversals give the mathematical expression of an expression tree,
Select correct option:
inorder
preorder
levelorder
postorder

Which one of the following is best for traversals,
Select correct option:
AVL tree
Binary Search Tree
Heap
Threaded Binary Tree


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 ________ successor.
Select correct option:
Preorder
Inorder
Postorder
levelorder

If an expression tree is correct then its root should have,
Select correct option:
an operator
(
)
an operand

If one pointer of the node in a binary tree is NULL then it will be a/an
Select correct option:
Inner node
Leaf node
External node
Root node

If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a ----------
Select correct option:
Complete Binary tree
Threaded binary tree
Expression tree
Perfectly complete Binary tree

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

t is necessary for Huffman encoding tree to be,
Select correct option:
AVL Tree
Binary Tree
Complete Binary Tree
None of these

--
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To post to this group, send email to pak-youth@googlegroups.com.
To unsubscribe from this group, send email to pak-youth+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/pak-youth?hl=en.