Is double link list a linear data structure? If yes, why?If no, why?

Answered by: snyder on: Mar 13th, 2012

If every element in a DS has almost two adjacent neighbors then it is called a linear DS. . . Hence doubly linked list is a linear DS

Answered by: snyder on: Mar 7th, 2012

To check if a DS is linear or not just do a simple test . . . check if the data elements of the given DS can be accessed in a sequential manner, if it can, then its a linear DS.

A doubly linked list can be accessed in a sequential manner, hence it is a linear linked list.

Data structure

Data structures provide many positive aspects like minimum disk-space efficiency, proper data management but at cost of complexity. What is your opinion?

Answered by: snyder on: Mar 10th, 2012

Although you have to deal with the complexity but you curb many problems that the users may experience. For eg. imagine how much data is stored in the servers of facebook. . .its massive . . .and ye...

Answered by: Rajan Patekar on: Aug 12th, 2011

complexity is at the user side in understanding not for the compiler.

data structure is a way of organising and using the memory effectively and efficiently.

Bit transformation

The process of transforming 1 bit pattern into another is called ______________

Answered by: snyder on: Feb 29th, 2012

It is called conditioning. This question is actually related to electronics and you can find it in "Telecommunication Networks".

Answered by: Rajan Patekar on: Aug 12th, 2011

type casting.

Deletions at both the ends

Identify the data structure which allows deletions at both ends of the list but insertion at only one end.A. Input-restricted dequeb. Output-restricted dequec. Priority queuesd. None of above

Answered by: Shilpa chavare on: Sep 12th, 2011

your qtn itself has the answer.. wen insertion is restricted to one end, then it obviously has to be input restricted dequeue..:)

Answered by: Rajan Patekar on: Aug 12th, 2011

a.input-restricted queue.

Each entry in a link list is called a node true or false ?

Answered by: shiksha on: Aug 28th, 2011

Yes each entry in a link list is called node and this node consist of two parts-info, and next add.

Answered by: Rajan Patekar on: Aug 12th, 2011

True

What is linear and non-linear data structures?

Answered by: izedonmi ezekiel awele on: Apr 3rd, 2012

Linear data structure is such that they are contiguous either by their arrangement in successive memory locations or by means of pointers. To help you understand it better, let say you were given a bo...

Answered by: meiyammai.k on: Sep 18th, 2011

Linear data structures are in which all the data are arranged in sequence manner.for example:linked list,stack queue
Non linear data structure are in which all the data are arranged in random manner.for example :trees,graphs.

### Career Counselling

Have Career Question?