Stack and queue

Stack and queue
Author(s):
Pankaj gaur
Keywords:
Stack , Queue , Data Structure
Abstract
An array is a random access data structure, where each element can be accessed directly and in constant time. A typical illustration of random access is a book - each page of the book can be open independently of others. Random access is critical to many algorithms, for example binary search. A linked list is a sequential access data structure, where each element can be accesed only in particular order. A typical illustration of sequential access is a roll of paper or tape - all prior material must be unrolled in order to get to data you want. In this note we consider a subcase of sequential data structures, so-called limited access data sturctures.
Article Details
Unique Paper ID: 142712 Publication Volume & Issue: Volume 2, Issue 6 Page(s): 322 - 325
Article Preview & Download

Share This Article

NCSST-2023

AICTE Sponsored National Conference on Smart Systems and Technologies

Last Date: 25th November 2023

LATEST INNOVATION’S AND FUTURE TRENDS IN MANAGEMENT

Last Date: 7th November 2023

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org