Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
Correct Answer :
B. Null case
Related Questions
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 operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
The elements of an array are stored successively in memory cells because
by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
the architecture of computer memory does not allow arrays to store other than serially
both of above
none of above
The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
3 additions and 2 deletions
2 deletions and 3 additions
3 deletions and 4 additions
3 deletions and 3 additions
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
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
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following is two way list?
grounded header list
circular header list
linked list with header and trailer nodes
none of above
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
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
Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?
3,4,5,2,1
3,4,5,1,2
5,4,3,1,2
1,5,2,3,4
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
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
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 data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
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
Which of the following data structure is linear data structure?
Trees
Graphs
Arrays
None of above
When determining the efficiency of algorithm the time factor is measured by
Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm
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
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
AVL tree
Red-black tree
Lemma tree
None of the above
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
The memory address of the first element of an array is called
floor address
foundation address
first address
base address