priority search queues

Views:
 
Category: Education
     
 

Presentation Description

No description available.

Comments

Presentation Transcript

Seminar:

Seminar Priority Search Queues on By, KUSHAN.K.A

INTRODUCTION:

INTRODUCTION Priority queue It is a special type of data structure in which items can be inserted or deleted based on priority. Types of priority queue Ascending PQ Descending PQ Applications

IMPLEMENTATION:

IMPLEMENTATION 1 st technique 2 nd technique based on priority 3 rd technique for priority search queues

Priority Search Queues:

Priority Search Queues It is an amazing blend of finite maps and priority queues. Features of PSQ Applications Priority search pennants

A tournament tree:

A1 A1 P3 A1 E2 C 4 E 2 A1 M6 P3 S5 P3 R7 S5 W8 A tournament tree

The heap corresponding to the tournament:

The heap corresponding to the tournament A E P M C R S W

The semi-heap corresponding to the tournament:

The semi-heap corresponding to the tournament P E P M C R W A

Conclusion:

Conclusion Priority search queues are an amazing combination of finite maps and priority queues in that they support both dictionary and priority queue operations.

THANK YOU:

THANK YOU

authorStream Live Help