The basic principle of data structures is the computer’s ability to organize, retrieve and store data in its specific memory address. Some common types of data structures that are used in the real world include array, queue, stack, and linked list. Data structures are designed to manage information to suit particular programming so that it can work appropriately according to its designed purpose. Many algorithms have been developed for the purpose of working with data structure to sort data more efficiently. As a relevant topic for this report, I will discuss three common types of data structure to illustrate its use in a real world application.

The first type of data structure I would like to discuss which is very common in most high level programming languages is the use of stack. A stack is called a last-in first-out (LIFO) data structure which takes a form of a container that is particularly designed to operate in that circumstance .The elements of the stacks are inserted and remove only from the end of the container. This means that the last thing we added on the top is also the first thing that will get pulled off from the pile. As an example of how stacks works in real life, think of a deck of playing cards that is faced down on a table. Only the card that is on top of the deck is easily access. If we want to look at the top card, there are a couple of things that we can do, we could peek at it, but leave it on the top of the stack, or we can “pop” it off. When we pop it off the top of the deck, we are taking it off the stack, and if we want to add another card on the top of the stack, we “push” it to the stack. Therefore, if the last card we put on our stack of cards is a diamond, then the first card that we pulled from the top is that same diamond.

There are two main operations for the stack data structure, push() and pop(). The push operation puts an item is on top of the stack, increasing the stack size...

...DataStructures and Algorithms
DSA
Annotated Reference with Examples
Granville Barne
Luca Del Tongo
DataStructures and Algorithms: Annotated Reference with Examples
First Edition
Copyright c Granville Barnett, and Luca Del Tongo 2008.
This book is made exclusively available from DotNetSlackers (http://dotnetslackers.com/) the place for .NET articles, and news from some of the leading minds in the software industry....

...CSCI4117
Advanced DataStructure Project Proposal
Yejia Tong/B00537881
2012.11.5
1. Title of Project
Succinct datastructure in top-k documents retrieval
2. Objective of Research
The main aim of this project is to discover how to efficiently find the k documents where a given pattern occurs most frequently. While the problem has been discussed in many papers and solved in various ways, our research is to look for the...

...BCSCCS 303 R03 DATASTRUCTURES
(Common for CSE, IT and ICT)
L T P CREDITS
3 1 0 4
UNIT - I (15 Periods)
Pseudo code & Recursion: Introduction – Pseudo code – ADT – ADT model, implementations; Recursion – Designing recursive algorithms – Examples – GCD, factorial, fibonnaci, Prefix to Postfix conversion, Tower of Hanoi; General linear lists – operations, implementation, algorithms
UNIT -...

...L10: Stacks
UCCD1024 DataStructures
What you will learn today?
What are stacks?
Why study stacks? How to implement stack using linked list? How to apply the stack concept in application?
This is our emphasis here.
Read Textbook 1: Chapter 7.
L10: Stack Jan 2013 2
What are stacks?
It is a special kind of list. The operations of insert (called push) and delete (called pop) are allowed only at one end (i.e., top). It has the...

...TYPES OF DATA AND COMPONENTS OF DATASTRUCTURESData types
1. Primitive: is a data type provided by a programming language as a basic building block
2. Composite: is any data type which can be constructed in a program using its programming language's primitive data types and other composite types
3. Abstract: is a mathematical model for a certain class of data...

...subjects. The structure should contain 3 subjects and total. 48) Write a program to calculate and print student wise total for 50 students and 3 subjects using pointers. The structure should contain 3 subjects. 49) Write a program to store the information of vehicles use bit fields to store the status information. Assume the vehicle object consists of type, fuel and model member fields. Assume appropriate number of bits for each field. 50) Program for illustration...

...Lecture 1
1.1 INTRODUCTION Datastructure is the branch of computer science that unleashes the knowledge of how the data should be organized, how the flow of data should be controlled and how a datastructure should be designed and implemented to reduce the complexity and increase the efficiency of the algorithm. The theory of structures not only introduces the data...

...Department of Information Technology
LAB MANUAL
IT2205 – DataStructures and Algorithm Lab
INDEX
1. Array Implementation Of Stack
2. Application Of Stack – Conversion Of Infix To Postfix
3. Implementation Of Linear Queue Using Arrays
4. Array Implementation Of Circular Queue
5. Linked List Implementation Of Stack
6. Singly linked list – Linked list...

3230 Words |
56 Pages

Share this Document

Let your classmates know about this document and more at StudyMode.com

## Share this Document

Let your classmates know about this document and more at StudyMode.com