Scribd
Upload
46 views

Data Structures and Algorithms Assignment 2.

The document contains two sections describing data storage. The first section shows how numeric data elements 0, 1, 7, 4, 3, 2, 8, 5 can be stored in an array with indexed cells. The second section describes how non-numeric data items Ghost, Chipi, Paris, Megalo, Ameno can be stored using (a) a singly linked list and (b) a doubly linked list, requesting diagrams to illustrate each.

Uploaded by

Tashinga Ryan Manunure
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
46 views

Data Structures and Algorithms Assignment 2.

The document contains two sections describing data storage. The first section shows how numeric data elements 0, 1, 7, 4, 3, 2, 8, 5 can be stored in an array with indexed cells. The second section describes how non-numeric data items Ghost, Chipi, Paris, Megalo, Ameno can be stored using (a) a singly linked list and (b) a doubly linked list, requesting diagrams to illustrate each.

Uploaded by

Tashinga Ryan Manunure
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

1.

Consider the following data elements: 0, 1, 7, 4, 3, 2, 8, 5 By way of a diagram show how the above
data can be stored in an array, conceptually. Your diagram must clearly show the cells as well as the
cell index.

2. Consider the following data items: Ghost, Chipi, Paris, Megalo, Ameno By way of a diagram,
illustrate how the above data can be stored using (a) a singly linked list; (b) a doubly linked list

You might also like