Linked lists are best suited
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
Correct Answer :
B. for the size of the structure and the data in the structure are constantly changing
Related Questions
Finding the location of the element with a given value is:
Traversal
Search
Sort
None of above
Which of the following data structure is linear type?
Graph
Binary tree
Trees
Stack
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Linked lists are best suited
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
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.
Which of the following is not a limitation of binary search algorithm?
must use a sorted array
requirement of sorted array is expensive when a lot of insertion and deletions are needed
there must be a mechanism to access middle element directly
binary search algorithm is not efficient when the data elements are more than 1000.
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
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
A variable P is called pointer if
P contains the address of an element in DATA.
P points to the address of first element in DATA
P can store only memory addresses
P contain the DATA and the address of DATA
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
The Average case occur in linear search algorithm
When Item is somewhere in the middle of the array
When Item is not in the array at all
When Item is the last element in the array
When Item is the last element in the array or is not there at all
Which of the following data structure is non linear type?
Lists
Strings
Graph
Stacks
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
Which of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
Which of the following name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
Which of the following data structure store the homogeneous data elements?
Arrays
Records
Pointers
None
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
A ______ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
Stacks linked list
Queue linked list
Both of them
Neither of them
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
Which data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
Which of the following is not the required condition for binary search algorithm?
The list must be sorted
there should be the direct access to the middle element in any sublist
There must be mechanism to delete and/or insert elements in list
none of above
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the above
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
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
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