Scribd
Upload
76 views1 page

Introduction To Data Structure: NPTEL IIT Guwahati

Multi-dimensional arrays allow data to be indexed by more than one integer and are commonly one- or two-dimensional. Most programming languages include a built-in array data type. Linked lists consist of nodes containing data and links to the next node. They allow constant-time insertion and removal of nodes anywhere in the list but do not support random access like arrays. Linked lists are self-referential as each node contains a link to another node of the same type.

Uploaded by

veereshkumarmkolli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
76 views1 page

Introduction To Data Structure: NPTEL IIT Guwahati

Multi-dimensional arrays allow data to be indexed by more than one integer and are commonly one- or two-dimensional. Most programming languages include a built-in array data type. Linked lists consist of nodes containing data and links to the next node. They allow constant-time insertion and removal of nodes anywhere in the list but do not support random access like arrays. Linked lists are self-referential as each node contains a link to another node of the same type.

Uploaded by

veereshkumarmkolli
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

NPTEL IIT Guwahati

Introduction to Data Structure

http://nptel.ac.in/courses/106103069/Module_1/slide7.htm

Print this page

Some arrays are multi-dimensional , meaning they are indexed by a fixed number of integers, for example by a
tuple of four integers. Generally, one- and two-dimensional arrays are the most common. Most programming
languages have a built-in array data type.

Link List

In computer science, a linked list is one of the fundamental data structures used in computer programming. It
consists of a sequence of nodes, each containing arbitrary data fields and one or two references ("links") pointing
to the next and/or previous nodes. A linked list is a self-referential data type because it contains a link to another
data of the same type. Linked lists permit insertion and removal of nodes at any point in the list in constant time,
but do not allow random access.
Prev

1 of 1

First | Next | Last

7/9/16, 10:55 PM

You might also like