Scribd
Upload
37 views8 pages

Priorities Presentation

This document outlines a report on priority logic and data structures. It will introduce priority logic and give examples, define it, and state the problem. It will describe the methodology using a singly linked list and why it is efficient. It will provide code to solve the problem, show results, and conclude how it handles priority reordering and changes for a company's orders list.

Uploaded by

MRSLFi --
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
37 views8 pages

Priorities Presentation

This document outlines a report on priority logic and data structures. It will introduce priority logic and give examples, define it, and state the problem. It will describe the methodology using a singly linked list and why it is efficient. It will provide code to solve the problem, show results, and conclude how it handles priority reordering and changes for a company's orders list.

Uploaded by

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

PRIORITIES

DATA STRUCTURE
AND ALGORTHEM
: TABLE CONTENTS
◾ 01 ◾ 05
◾ Table of contents ◾ Methodology
◾ 02 ◾ 06
◾ Abstract/Summary ◾ Results
◾ 03 ◾ 07
◾ Introduction ◾ Conclusion
◾ 04 ◾ 08
◾ Problem Statements ◾ References
: SUMMARY
: In this report we will talk about
Introduction about praiority logic that includes examples of praiority logic , definition -
. of praiority logic
. problem statement and how we build the program and all functions we used -
: solution of problem that includes -
. Data structure we used and whay we use it*
. How the code work step by step and wich the algorithm we used *
. the program code and what output we should get it by program *
. show the results from our program -
: INTRODUCTION

◾ In our life we need to manage thing in spicific order like: from big to small or
from most important to less important this logic called priority . It is so ,
efficiently to implement priority in all side of our life it helps us to manage our
task, or things to preform tasks in short time that logic can be useful on our
program to manage lists from higher level to lower level . As a result that
give us the definition of priority which is a collection of elements where the
.elements are stored according to their priority levels
: PROBLEM STATEMENT

There is a company receives many orders with unorganized


priorities then company need to reorganize this orders to be in
range from highest priority to lowest priority . As a result ,
company's orders will be represented as list of priorities as
numbers and the lowest number will be highest priority . when
one order is postponed then its priority is increased by 2 to be
executed
: METHODOLOGY
to solve this problem , we found that the best and most efficient data structur is Singly linked
list
?WHY WE USE LINKED LIST

At first, Linked list is a node based data structure , so that we can easily insert and delete any
node in just one step . In addition, it represents the nodes as a list of elements . Secondly, there
Is unlimited number of elements , because it allocate the size dynamicly . At conclusion, the
. complexpity is always O(N) in deletion, search and traversing
: CONCLUSION
In this project , we solve one of the companies issue which is the priority of the orders , how can we execute the orders in the
right
.order? what will happened to the list if we do some changes at their order? all these questions we have answer it in our project

: We have used list of functions which is


InsertOrder () 
disaplylist()

ExecuteOrder ()

 waitingList()
: REFERNCES

LAB07(LINKED lIST PART1)


TEXTBOOK

You might also like