5. Each node in a linked list has pairs of ______ and _____
6.inserting and deleting an element ina a stack is called _____and _____ operation
7.Array I'd also known as ______ data structure
8.In a diagonal Matrix the non zero elements M(i,j)are at positions for_____
9.An array is ordered , finite collection of ____ element
10.A stack is also known as
11.A double linked list is also known as
12.write ADT OF LINEAR LIST
Answers
Answered by
0
Answer:
5. link field and information field
Answered by
0
ANSWER :
5. Each node in a linked list has pairs of LINK FIELD and INFORMATION FIELD.
6. Inserting and deleting an element ina a stack is called PUSH and POP operation.
7. Array I'd also known as HOMOGENEOUS data structure.
8. In a diagonal Matrix the non zero elements M(i,j)are at positions for ZERO.
9. An array is ordered , finite collection of HOMOGENOUS DATA element.
10. A stack is also known as LIFO.
11. A double linked list is also known as TWO WAY LIST.
12. Write ADT OF LINEAR LIST
A list is an abstract data type that denotes a linear collection of data objects in some sort of order, where each item has a specified place in the list.
#SPJ6
Similar questions