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
Correct Answer :
A. P contains the address of an element in DATA.
Related Questions
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 name does not relate to stacks?
FIFO lists
LIFO list
Piles
Push-down lists
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 not linear data structure?
Arrays
Linked lists
Both of above
None of above
Two main measures for the efficiency of an algorithm are
Processor and memory
Complexity and capacity
Time and space
Data and space
_____ is not the component of data structure.
Operations
Algorithms
Storage Structures
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
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 complexity of Bubble sort algorithm is
O(n)
O(log n)
O(n2)
O(n log n)
The situation when in a linked list START=NULL is
underflow
overflow
housefull
saturated
Which data structure is used in breadth first search of a graph to hold nodes?
Array
Stack
Tree
queue
Which of the following data structure cant store the non-homogeneous data elements?
Arrays
Records
Pointers
None
The complexity of Binary search algorithm is
O(n)
O(log )
O(n2)
O(n log n)
Which of the following is non-liner data structure?
List
Stacks
Trees
Strings
Two dimensional arrays are also called
tables arrays
matrix arrays
both of above
none of above
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
Stack is also called as
Last in first out
First in last out
Last in last out
First in first out
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
……………. 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 data structure store the homogeneous data elements?
Arrays
Records
Pointers
None
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
The memory address of the first element of an array is called
floor address
foundation address
first address
base address
The number of possible ordered trees with three nodes A,B,C is?
16
12
6
10
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
The term push and pop is related to the
array
lists
stacks
all of 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 data structure allows deleting data elements from and inserting at rear?
Stacks
Dequeues
Queues
Binary search tree
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
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