Finding the location of the element with a given value is:
Traversal
Search
Sort
None of above
Correct Answer :
B. Search
Related Questions
Which of the following data structure can't store the non-homogeneous data elements?
Arrays
Records
Pointers
Stacks
The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
……………. Is a pile in which items are added at one end and removed from the other.
Queue
Stack
List
None of the above
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 of the following is not the part of ADT description?
Data
Operations
Both of the above
None of the above
To represent hierarchical relationship between elements, Which data structure is suitable?
Tree
Graph
Priority
Dequeue
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
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 term push and pop is related to the
array
lists
stacks
all of above
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
Which data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
Which of the following data structure is linear type?
Graph
Binary tree
Trees
Stack
In linear search algorithm the Worst case occurs when
The item is somewhere in the middle of the array
The item is not in the array at all
The item is the last element in the array
The item is the last element in the array or is not there at all
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
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 case does not exist in complexity theory
Best case
Null case
Worst case
Average case
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 of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
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
Which of the following data structure is non linear type?
Lists
Strings
Graph
Stacks
______ is very useful in situation when data have to stored and then retrieved in reverse order.
Stack
Queue
List
Link list
Which if the following is/are the levels of implementation of data structure
Application level
Abstract level
Implementation level
All of the above
The complexity of merge sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
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
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
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
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
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue