The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
Correct Answer :
D. Traversal
Related Questions
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 difference between linear array and a record is
An array is suitable for homogeneous data but the data items in a record may have different data type
In a record, there may not be a natural ordering in opposed to linear array.
A record form a hierarchical structure but a linear array does not
All of above
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
_______ level is where the model becomes compatible executable code
Abstract level
Implementation level
Application level
All of the above
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 of the following data structure is linear data structure?
Trees
Graphs
Arrays
None of above
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
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 of the following data structure is not linear data structure?
Arrays
Linked lists
Both of above
None of above
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
Which of the following is two way list?
grounded header list
circular header list
linked list with header and trailer nodes
none of above
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
A data structure where elements can be added or removed at either end but not in the middle
Linked lists
Stacks
Queues
Deque
Which of the following data structure store the homogeneous data elements?
Arrays
Records
Pointers
None
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
Binary search algorithm can not be applied to
sorted linked list
sorted binary trees
sorted linear array
pointer array
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
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 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
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 data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
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
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
Which of the following algorithm design technique is used in the quick sort algorithm?
Dynamic programming
Greedy method
Divide and conquer
Backtracking
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
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
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
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
Which of the following is true about the characteristics of abstract data types?
i) It exports a type.
ii) It exports a set of operations
True, False
False, True
True, True
False, False