answersLogoWhite

0


Best Answer

Linked list is a complicated sequence of numbers, each number in linked list is connected to its previous and next number , via a link which is pointer.

Whereas in record data items form hierarchical structure which can be described by means of "level" numbers and these are indexed by attribute names , so there may not be a natural ordering of its elements.

User Avatar

Wiki User

10y ago
This answer is:
User Avatar
More answers
User Avatar

AnswerBot

1w ago

A linked list is a data structure used to store a collection of items where each item points to the next item in the sequence. A record, on the other hand, is a data structure that stores related data fields together in a single unit. Each record typically contains multiple fields or attributes that represent different aspects of the data being stored.

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is the difference between linked list and a record?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Information Science

When you store a list of key fields paired with the storage address for the corresponding data record you are creating?

an index. This index allows for quicker access to data as it provides a direct mapping between the key fields and their corresponding storage addresses, eliminating the need for a full data scan.


What is the difference between table of context and index?

A table of contents provides a list of main headings and subheadings in a document or book in the order they appear, helping readers navigate the content. An index, on the other hand, lists specific topics, names, and terms alphabetically with page numbers where they can be found, aiding readers in locating specific information within the document.


What problems associated with storing data in a list is avoided by storing data in a relational database?

Relational databases provide support for complex queries and relationships between data tables, which is not easily achieved when using a list data structure. Additionally, relational databases offer features like data integrity constraints (such as unique keys and foreign keys) that help ensure data consistency and accuracy. Scalability and performance can also be better managed in a relational database compared to using a list for storing data.


What symbols introduce extra information such as a list?

Symbols like colons (:), semicolons (;), dashes (-), and bullet points (•, *), can be used to introduce extra information such as a list. These symbols help to organize and separate the elements in a list for better readability.


Which one of the following types of information is not included in a master problem list?

The patient's insurance information is typically not included in a master problem list.

Related questions

Difference between linear linked list and circular linked list?

LINEAR STRAIGHT CIRCULAR CURVED


W difference between a linear linked list and a circular linked list?

I would say that there is no such thing as a circular queue. The point of a circular data structure is to allow the end to loop around to the beginning. Since you can only remove items from the beginning of a queue or add them to the front, having these two items linked has no purpose nor benefit.


What is the difference between linked list and Ordinary list?

A list is an abstract data structure, usually defined as an ordered collection of data. A linked list refers to a specific implementation of a list in which each element in the list is connected (linked) to the next element.


How do you remove record file in linked list by using C?

You need to make the previous record's next pointer point to the record you are removing's next record, and (if it is a doubly linked list) the next record's previous pointer point to the record you are removing's previous record. If you are keeping track of the head and/or tail of the list, you need to make sure you update them if you have just removed one of them.


What is linked file organization?

The next record in a linked list is found at the address stored in the record. Records are added at any location in the DASD(Direct Access Storage Device) and pointers adjusted to include them. Deletions are not erased, but pointers changed to omit the deleted record. Just like a normal linked list has a value part in its structures, here the linked list structure can have multiple value parts.


What is linked file?

The next record in a linked list is found at the address stored in the record. Records are added at any location in the DASD(Direct Access Storage Device) and pointers adjusted to include them. Deletions are not erased, but pointers changed to omit the deleted record. Just like a normal linked list has a value part in its structures, here the linked list structure can have multiple value parts.


What is the difference between circular linklist and linklist?

In a circular linked list every node is connected to another node. In a non-circular linked list. There are definitely starting and ending nodes are lacking an incoming and outgoing link, respectively.


What contains A dummy header in the linked list?

a. First record of the actual data


How do you find an element in the linked list?

You might look at the header record if the linked list has one. Better yet graduate to a btree and all these problems go away


What is the difference between array linklist?

Linked list consists of data nodes each pointing to next in the list .An array consist of contiguous chunk memory of predetermined size


What is the difference between list and an outline?

What is the difference between a list and an outlin?


What is difference between a list and an outline?

What is the difference between a list and an outlin?