Scribd
Upload
28 views

Data Structures

This document discusses different data structures including associative arrays, linked lists, queues, and stacks. Queues follow a first-in, first-out (FIFO) approach and are well-suited for simulating customer lines, as new customers join the back of the line and the first customer in line is served next.

Uploaded by

ImaginRtist
Copyright
© Attribution Non-Commercial (BY-NC)
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
28 views

Data Structures

This document discusses different data structures including associative arrays, linked lists, queues, and stacks. Queues follow a first-in, first-out (FIFO) approach and are well-suited for simulating customer lines, as new customers join the back of the line and the first customer in line is served next.

Uploaded by

ImaginRtist
Copyright
© Attribution Non-Commercial (BY-NC)
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

Data Structures

Sunday, January 27, 2013 7:35 PM

Associative array - can have elements added or removed in any order Linked list - can have elements added or removed in any order Queues - first item in is the first out (FIFO); can be constructed using arrays or linked lists; array linked lists are limited in the number of items that can be stored in the queue Stacks - last item added is the first one removed (LIFO) Ex: A data structure most appropriate for simulating a customer line at a bank is a: Answer: Queue, because it uses FIFO access.

Computer Science Page 1

You might also like