Which of the following statement is true ?
Breath first search cannot be used to find converted components of a graph.
Optimal binary search tree construction can be performed efficiently using dynamic programming.
Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
Depth first search can be used to find connected components of a graph.
Correct Answer :
B. Optimal binary search tree construction can be performed efficiently using dynamic programming.
Related Questions
When determining the efficiency of algorithm, the space factor is measured by
Counting the maximum memory needed by the algorithm
Counting the minimum memory needed by the algorithm
Counting the average memory needed by the algorithm
Counting the maximum disk space needed by the algorithm
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
When new data are to be inserted into a data structure, but there is no available space; this situation is usually called
underflow
overflow
housefull
saturated
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
For an algorithm the complexity of the average case is
Much more complicated to analyze than that of worst case
Much more simpler to analyze than that of worst case
Sometimes more complicated and some other times simpler than that of worst case
None or above
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
Which of the following statement is false?
Arrays are dense lists and static data structure
data elements in linked list need not be stored in adjacent space in memory
pointers store the next data element of a list
linked lists are collection of the nodes that contain information part and next pointer
The memory address of fifth element of an array can be calculated by the formula
LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array
LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array
None of above
Which of the following is non-liner data structure?
List
Stacks
Trees
Strings
Inserting an item into the stack when stack is not full is called _______ Operation and deletion of item form the stack, when stack is not empty is called _______operation.
push, pop
insert, delete
pop, push
delete, insert
Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
Which of the following data structure is not linear data structure?
Arrays
Linked lists
Both of above
None of above
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
If the values of a variable in one module is indirectly changed by another module, this situation is called
internal change
inter-module change
side effect
side-module update
The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?
11
12
13
14
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
Arrays are best data structures
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation
Each data item in a record may be a group item composed of sub-items; those items which are indecomposable are called
elementary items
atoms
scalars
all of above
Each array declaration need not give, implicitly or explicitly, the information about
the name of array
the data type of array
the index set of the array
the first data from the set to be stored
Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?
mn
max(m,n)
min(m,n)
m+n-1
Which data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
Which of the following statement is true ?
Breath first search cannot be used to find converted components of a graph.
Optimal binary search tree construction can be performed efficiently using dynamic programming.
Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
Depth first search can be used to find connected components of a graph.
The term push and pop is related to the
array
lists
stacks
all of above
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
Stack
Input restricted dequeue
Priority queues
Output restricted qequeue