Sign Up

Have an account? Sign In Now

Sign In

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

Sorry, you do not have permission to ask a question, You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here
Sign InSign Up

SIKSHAPATH

SIKSHAPATH Logo SIKSHAPATH Logo

SIKSHAPATH Navigation

  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Home/Questions/Q 19944
Next
Answered
Pavanagg
  • 0
Pavanagg
Asked: January 18, 20232023-01-18T12:59:00+05:30 2023-01-18T12:59:00+05:30In: C++

Which of the following is NOT a container adapter in C++?

  • 0

Which of the following is NOT a container adapter?

  1. stack
  2. queue
  3. deque
  4. priority-queue
c
  • 1 1 Answer
  • 507 Views
  • 0 Followers
  • 0
Answer
Share
  • Facebook

    1 Answer

    • Voted
    • Oldest
    • Recent
    1. Best Answer
      ADMIN 2
      2022-07-31T12:34:45+05:30Added an answer on July 31, 2022 at 12:34 pm
      This answer was edited.

      Deque is NOT a container adapter.

      Correct Option is C.

      Container adapters are interfaces that provide a specific set of functionality by limiting the functionality of an existing container. When implementing container adapters, the underlying container can be specified.

      A stack, for example, is a container that provides Last-In, First-Out (LIFO) access. Elements are removed in the reverse order in which they were inserted, making it difficult to access elements in the middle. It is typically built on top of a deque container.

      A queue, on the other hand, is a container that provides First-In, First-Out (FIFO) access. Elements are removed in the same order in which they were inserted, again making it difficult to access elements in the middle. It is also typically built on top of a deque container.

      A priority_queue is a container that provides sorted-order access to elements. Elements can be inserted in any order, and the “lowest” value can be retrieved at any time. C++ STL priority queues are internally implemented using a heap structure, which is often built on top of a vector container.

       

      • 1
      • Reply
      • Share
        Share
        • Share on WhatsApp
        • Share onFacebook
        • Share on Twitter
        • Share on LinkedIn

    Leave an answer
    Cancel reply

    You must login to add an answer.

    Forgot Password?

    Need An Account, Sign Up Here

    Sidebar

    store ads

    Stats

    • Questions 1k
    • Answers 1k
    • Posts 127
    • Best Answers 66
    • LINEAR PROGRAMMING AND OPTIMIZATION TECHNIQUES NOTES
    • What is the Difference Between Section, Article and Aside in HTML5?
    • NPTEL Cloud Computing Assignment 3 Answers 2023
    • NPTEL Ethical Hacking Assignment 3 Answers 2023
    • NPTEL Problem Solving Through Programming In C Week 1 & 2 Assignment Answers 2023

    Explore

    • Recent Questions
    • Questions For You
    • Answers With Time
    • Most Visited
    • New Questions
    • Recent Questions With Time

    Footer

    Sikshapath Logo

    Helpful Links

    • Contact
    • Disclaimer
    • Privacy Policy Notice
    • TERMS OF USE
    • FAQs
    • Refund/Cancellation Policy
    • Delivery Policy for Sikshapath

    Follow Us

    © 2021-23 Sikshapath. All Rights Reserved

    Ads Blocker Image Powered by Code Help Pro

    Ads Blocker Detected!!!

    We have detected that you are using extensions to block ads. Please support us by disabling these ads blocker.

    Refresh

    Insert/edit link

    Enter the destination URL

    Or link to existing content

      No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.