Data Structure and Algorithm Analysis
Questions 231 to 240
231.
|
malloc()
returns pointer to
|
||||||||||
If a
binary tree is threaded for an in order traversal order, a NULL right link of
any node is replaced by the address of its
|
|||||||||||
If
graph G has no edges then corresponding adjacency matrix is
|
|||||||||||
Worst
case efficiency of binary search is
|
|||||||||||
The
property that is not expected from good hashing technique should
|
|||||||||||
Graph
structure is available in
|
|||||||||||
The
element at the root of heap is
|
|||||||||||
Worst
case efficiency of which search is O(n)?
|
|||||||||||
Breadth first search
|
|||||||||||
Which
of the following searching methods requires that all keys must reside in
internal memory?
|
Answers
231.
|
Answer : (c)
Reason : character
|
Answer : (a)
Reason : successor
|
|
Answer : (b)
Reason : zero
matrix
|
|
Answer : (a)
Reason : log2
n+1
|
|
Answer : (c)
Reason : produce
no collisions.
|
|
Answer : (e)
Reason : data
structures
|
|
Answer : (c)
Reason : depending
on type of heap it may be smallest or largest
|
|
Answer : (a)
Reason : Sequential
search
|
|
Answer : (a)
Reason : scans
all incident edges before moving to other vertex
|
|
Answer : (a)
Reason : Binary
search
|
hello, your website is really good. We do appreciate your give good results to_pydatetime
ReplyDelete