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
Correct Answer :
D. all of above
Related Questions
Which of the following data structure is non linear type?
Lists
Strings
Graph
Stacks
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
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
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 data structure store the homogeneous data elements?
Arrays
Records
Pointers
None
The complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
The operation of processing each element in the list is known as
Sorting
Merging
Inserting
Traversal
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
The memory address of the first element of an array is called
floor address
foundation address
first address
base address
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
Herder node is used as sentinel in ____
Graphs
Binary tree
Stacks
Queues
When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
Which of the following data structures are indexed structures?
linear arrays
linked lists
both of above
none of above
Which of the following is non-liner data structure?
List
Stacks
Trees
Strings
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
The term push and pop is related to the
array
lists
stacks
all 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
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
Linked list are not suitable data structure of which one of the following problems ?
Binary search
Insertion sort
Radix sort
Polynomial manipulation
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
None of above
Which of the following case does not exist in complexity theory
Best case
Null case
Worst case
Average case
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
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
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
The complexity of linear search algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
Which of the following data structure is not linear data structure?
Arrays
Linked lists
Both of above
None of above
Finding the location of the element with a given value is:
Traversal
Search
Sort
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