CS301 Data Structures
Solved MCQs
For
a perfect binary tree of height h, having N nodes, the sum of heights of nodes
is _____________.
N
– (h – 1)
N – (h + 1)
N – 1
N – 1 + h
If we want to find median of 50 elements, then after applying buildHeap method, how many times deleteMin method will be called ?
5
25
35
50
N – (h + 1)
N – 1
N – 1 + h
If we want to find median of 50 elements, then after applying buildHeap method, how many times deleteMin method will be called ?
5
25
35
50
Which
of the following heap method increase the value of key at position ‘p’ by the
amount ‘delta’?
increaseKey(p,delta)
decreaseKey(p,delta)
preculateDown(p,delta)
remove(p,delta)
www.vuzs.net
The main reason of using heap in priority queue is
improve performance
code is readable
less code
heap can't be used in priority queues
decreaseKey(p,delta)
preculateDown(p,delta)
remove(p,delta)
www.vuzs.net
The main reason of using heap in priority queue is
improve performance
code is readable
less code
heap can't be used in priority queues
The
total number of nodes on 10th level of a perfect binary tree are :
256
512
1024
Can't be determined
Which property of equivalence relation is satisfied if we say: Ahmad R(is related to) Ahmad
512
1024
Can't be determined
Which property of equivalence relation is satisfied if we say: Ahmad R(is related to) Ahmad
Reflexivity
Symmetry
Transitivity
All of the above
Which of the following heap method lowers the value of key at position ‘p’ by the amount ‘delta’?
Symmetry
Transitivity
All of the above
Which of the following heap method lowers the value of key at position ‘p’ by the amount ‘delta’?
increaseKey(p,delta)
decreaseKey(p,delta)
preculateDown(p,delta)
remove(p,delta)
We can build a heap in _____ time.
decreaseKey(p,delta)
preculateDown(p,delta)
remove(p,delta)
We can build a heap in _____ time.
Linear
Exponential
Polynomial
None of the given options
we can build a heap in linear time using n calls of percolate_down()
Exponential
Polynomial
None of the given options
we can build a heap in linear time using n calls of percolate_down()
If a tree has 50 nodes, then the total edges/links in the tree will be :
CS301- Data Structure-Current-Solved-MCQs-2-1-2012
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,3540,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,
All leaf nodes
Nodes other then leaf nodes
Root Node
None of the nodes
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.
partially
completely
incompletely
partly
Which one of the following is TRUE about iteration?
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
We implement the heap by ____________ .
Threaded Tree
AVL tree
Complete binary tree
Expression
Which of the following statement concerning heaps is NOT true?
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?
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 binary tree, represented by the following array: A,B,C,D,E,F,G,I Is it a strictly binary tree ?
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
► 2
► 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?
Insert
add
update
preculateDown
MIDTERM
EXAMINATION
Spring 2010
CS301- Data Structures
Question No: 1 ( Marks: 1 ) - Please choose one
A
queue where the de-queue operation depends not on FIFO, is called a priority
queue
► False
► True (Page
101)
Question No: 2 ( Marks: 1 ) - Please choose one
The
data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve
this problem we should
►
Use better data structures
► Increase the hard disk space (Page 5)
►
Use the better algorithm
►
Use as much data as we can store on the hard
disk
Question No: 3 (
Marks: 1 ) - Please choose one
Consider
the function X as under
int X
(int& Value)
{
return Value;
}
}
Now a
and b are integers in a calling function. Which one of the following is a valid
call to the above function
X.
►
a = X (b) ;
► a = X (&b) ;
► a = X (*b) ;
► a = X (&b) ;
► a = X (*b) ;
►
None of the given
options
Here function argument passing by reference method is
used, so when we call a function we will give the variable reference as parameter.
Question No: 4 ( Marks: 1 ) - Please choose one
In the
call by value methodology, a copy of the object is passed to the called
function.
► False
► True (Page
202)
Question No: 5 ( Marks: 1 ) - Please choose one
The tree data structure is a
► Linear data structure
► Linear data structure
► Non-linear data structure (Page 112)
►
Graphical data structure
►
Data structure like
queue
Question No: 6 ( Marks: 1 ) - Please choose one
When
should you use a const
reference parameter?
►
Whenever the parameter
has huge size.
► Whenever the parameter has huge size, the
function changes the parameter within its body, and you do NOT want these changes to alter the
actual argument.
► Whenever the parameter has huge size, the function changes the parameter
within its body, and you DO want these changes to alter the actual argument.
►
Whenever the parameter
has huge size, and the function does not change the parameter within its body.
Declaring
a parameter as a const simply means that the function can’t change the value of
its parameters.
Question No: 7 (
Marks: 1 ) - Please choose one
Here
is the start of a C++ class declaration:
class foo
class foo
{
public:
void
x(foo f);
void
y(const foo f);
void z(foo f) const;
void z(foo f) const;
Which of the three member functions can alter the PRIVATE
member variables of the foo object that activates the function?
► Only
x can alter the private member variables of the object that activates the
function.
► Only y can alter the private member variables of the object that activates the function.
► Only z can alter the private member variables of the object that activates the function.
► Only y can alter the private member variables of the object that activates the function.
► Only z can alter the private member variables of the object that activates the function.
► Two of the functions can alter the private
member variables of the object that activates the function.
Only the x and y can alter the private member variable of
the foo class object. Last Option is more correct but not exact. In the last
option the two function name are not mentioned
Question No: 8 (
Marks: 1 ) - Please choose one
What
is the maximum depth of recursive calls a function may make?
►
1
►
2
►
n (where n is the
argument)
► There is no fixed maximum
► There is no fixed maximum
Question No: 9 (
Marks: 1 ) - Please choose one
Suppose n is the number of nodes in a complete Binary
Tree then maximum steps required for a search operation are,
► Log2 (n+1) -1 (Page 139)
►
Log2 (n+1)
► Log2 (n) - 1
► Log2 (n)
► Log2 (n) - 1
► Log2 (n)
Question No: 10 ( Marks: 1 ) - Please choose one
In the linked list implementation of the stack class,
where does the push member function places the new entry on the linked list?
► At
the head (Page 53)
►
At the tail
► After
all other entries that are greater than the new entry.
► After all other entries that are smaller than the new entry.
► After all other entries that are smaller than the new entry.
Question No: 11 (
Marks: 1 ) - Please choose one
Suppose we have a circular
array implementation of
the queue class, with ten items in the queue stored at data[2] through data[11]. The CAPACITY
is 42, i.e., the array has been declared to be of size 42. Where does the push member function place the
new entry in the array?
►
data[1]
►
data[2]
► data[11]
► data[12]
► data[11]
► data[12]
Question No: 12 (
Marks: 1 ) - Please choose one
The
expression AB+C* is called?
►
Prefix expression
► Postfix expression (Page 70)
►
Infix expression
► None of these
► None of these
Question No: 13 (
Marks: 1 ) - Please choose one
_________ is a binary tree where every node has a value,
every node's left subtree contains only values less
than or equal to the node's value, and every node's right subtree contains only values that are greater then or
equal?
than or equal to the node's value, and every node's right subtree contains only values that are greater then or
equal?
►
Strictly Binary Tree
► Binary Search tree Click here for detail
►
AVL tree
► All of these
► All of these
Question No: 14 (
Marks: 1 ) - Please choose one
Consider
the following binary search tree (BST):
If
node A in the BST is deleted, which two nodes are the candidates to take its
place?
►
J and I
► H and E
► D and E
► L and M
► H and E
► D and E
► L and M
Question No: 15 (
Marks: 1 ) - Please choose one
Let’s
call the node as that requires re-balancing. Consider the two cases given
below:
1) An
insertion into left sub tree of the left child of a
2) An
insertion into right sub tree of the right child of a.
Which
of the following statement is correct about these two cases?
1) The insertion occurs outside (i.e., left-left or
right-right) in cases 1 and 2 single rotation can fix the balance in these two cases.
2) The insertion occurs inside ((i.e., left-left or
right-right) in cases 1 and 2. single rotation cannot fix the balance in these two cases
Question No: 16 (
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.
► None of the given options.
Question No: 17 ( Marks: 2 )
AVL
Tree is,
► Non Linear data structure Click here for
detail
►
Linear data structure
► Hybrid
data structure (Mixture of Linear and Non Linear) ► None of the given options.
MIDTERM
EXAMINATION
Spring 2010
Question No: 1 (
Marks: 1 ) - Please choose one
Which
one of the following statement is NOT correct .
► In linked list
the elements are necessarily to be contiguous Click here for
detail
► In linked list
the elements may locate at far positions in the memory ► In linked list each element also has the next to it
►
In an array the elements
are contiguous
Question No: 2 (
Marks: 1 ) - Please choose one
Each
operator in a postfix expression refers to the previous ________ operand(s).
►
One
►
Two (Page 67)
► Three
► Three
►
Four
Question No: 3 (
Marks: 1 ) - Please choose one
Which one of the following calling methods does not
change the original value of the argument in the calling function?
►
None of the given
options
►
Call by passing the value of the argument
► Call
by passing reference of the argument
► Call by passing the address of the argument
► Call by passing the address of the argument
Question No: 4 (
Marks: 1 ) - Please choose one
A
tree is an AVL tree if
►
Any one node fulfills the
AVL condition
►
At least half of the
nodes fulfill the AVL condition
► All the nodes fulfill the AVL condition (Page 213)
►
None of the given options
Question No: 5 (
Marks: 1 ) - Please choose one
Suppose currentNode refers to a node in a linked list
(using the Node class with member variables called data and nextNode). What
statement changes currentNode so that it refers to the next node?
►
currentNode ++;
►
currentNode = nextNode;
► currentNode += nextNode;
► currentNode += nextNode;
►
currentNode = currentNode->nextNode;
Question No: 6 ( Marks: 1 ) - Please choose one
A
queue where the de-queue operation depends not on FIFO, is called a priority
queue
► False
► True (Page
101)
Question No: 7 ( Marks: 1 ) - Please choose one
Which
one is a self- referential data type?
►
Stack
►
Queue
► Link list
► Link list
► All of these Click here for
detail
Question No: 8 ( Marks: 1 ) - Please choose one
Each
node in doubly link list has,
►
1 pointer
► 2 pointers (Page
39)
►
3 pointers
► 4 pointers
► 4 pointers
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?
►
Neither changes
►
Only front pointer
changes.
► Only rear pointer changes.
► Both change.
► 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
► 7
► 5
►
6
A
sibling is an element that shares the same parent with another element
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
► Both of these
► None of these
Question No: 12 ( Marks: 1 ) - Please choose one
AVL
Tree is,
► Non Linear data structure Click here for
detail
► 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.
► 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
► Two Click here for
detail
►
Three
► Four
► 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.
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 Tot
1 comment:
You can get all subjects midterm & Final Term Past Papers By Moaaz and other vu student here http://vukwl.blogspot.com/2017/12/all-subject-solved-midterm-past-papers.html
Post a Comment