Scribd Logo
Upload

Welcome to Scribd!

  • Seminar

    Uploaded by

    Swathi Bhat M
    10 views9 pages
    The document discusses priority search queues, which combine features of finite maps and priority queues. It allows items to be inserted or deleted based on priority. There are different types like ascending and descending priority queues. Priority search queues support both dictionary and priority queue operations, allowing items to be retrieved and removed in priority order. They have various applications and implementation techniques.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses priority search queues, which combine features of finite maps and priority queues. It allows items to be inserted or deleted based on priority. There are different types like ascending and descending priority queues. Priority search queues support both dictionary and priority queue operations, allowing items to be retrieved and removed in priority order. They have various applications and implementation techniques.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views9 pages

    Seminar

    Uploaded by

    Swathi Bhat M
    The document discusses priority search queues, which combine features of finite maps and priority queues. It allows items to be inserted or deleted based on priority. There are different types like ascending and descending priority queues. Priority search queues support both dictionary and priority queue operations, allowing items to be retrieved and removed in priority order. They have various applications and implementation techniques.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 9

    on

    Priority Search Queues

    By,
    KUSHAN.K.A
    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
    1st technique

    2nd technique based on priority

    3rd technique for priority search queues


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

    A1 P3

    A1 P3 S5
    E2

    C4 E2 A1 M6 P3 R7 S5 W8
    A

    E P

    M R S
    C

    W
    A

    E P

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

    You might also like