Is Linked List 'linear' or 'Non-linear' data structure?
Answer / mamata anayak
Linked list is a linear data structure because their data elements are not placed in order as physical placement memory values instead each data element point to next data element, its is a data structure collecting of nodes which represent a sequence.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is raid (redundant array of inexpensive disks)?
What is heap tree explain with example?
1) Program A and B are analyzed and found to have worst- case running times no greater than 150nlog2n and n2 respectively.Answer the folloWing questions if possible.. i) which program has the better guarantee on the running time,for larger values of n(n>10000) ? ii) which program has the better guarantee on the running time,for small values of n(n<100) ? iii) which program will run faster on average for n =1000 2) wRite a program to compute the number of collisions required in a long random sequence of insertions using linear probing ,quadratic probing and double hashing 3) what is the optimal way to compute A1 A2 A3 A4 A5 A6 where the dimensions of the matrices are A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30 A6 : 30 X 15
Explain linear linked implementation of Stack and Queue?
How can one find a cycle in the linked list? IF found how to recognize the cycle and delete that cycle?
Define a path in a tree?
Minimum number of queues needed to implement the priority queue?
What is the difference between data types and data structures?
How does a hashmap work?
Is arraylist heterogeneous?
Why do we need algorithm?
What is type structure?