logo

CuriousTab

CuriousTab

Discussion


Home Interview Technology Comments

  • Question
  • How many parameters are present in mismatch method in non-sequence modifying algorithm?


  • Options
  • A. 1
  • B. 2
  • C. 3
  • D. 4

  • Correct Answer


  • Explanation

    There are four parameters. They are first1, last1, first2, predicate.


  • Technology problems


    Search Results


    • 1. How many items are presented in the associate container?

    • Options
    • A. 2
    • B. 3
    • C. 4
    • D. 5
    • Discuss
    • 2. What does the sequence adaptor provide?

    • Options
    • A. Insertion
    • B. Deletion
    • C. Interface to sequence container
    • D. None of thse
    • Discuss
    • 3. How the member functions in the container can be accessed?

    • Options
    • A. Iterator
    • B. Indirect
    • C. Both a & b
    • D. None of these
    • Discuss
    • 4. Which is best for coding the standard libary for c++?

    • Options
    • A. no trailing underscores on names
    • B. complex objects are returned by value
    • C. have a member-swap()
    • D. All of the mentioned
    • Discuss
    • 5. What is the Run-Time Type Information?

    • Options
    • A. Information about an object?s datatype at runtime
    • B. Information about the variables
    • C. Information about the given block
    • D. None of these
    • Discuss
    • 6. What kind of object is modifying sequence algorithm?

    • Options
    • A. Function template
    • B. Class template
    • C. Method
    • D. None of these
    • Discuss
    • 7. What is the kind of execution does sequence point allow?

    • Options
    • A. Non-overlap
    • B. Overlap
    • C. Concurrent
    • D. None of these
    • Discuss
    • 8. Which keyword is used to declare the min and max functions?

    • Options
    • A. iostream
    • B. string
    • C. algorithm
    • D. None of these
    • Discuss
    • 9. How the different permutations are ordered in c++?

    • Options
    • A. Compare lexicographicaly to each other elements
    • B. By finding the highest element in the range
    • C. By finding the lowest element in the range
    • D. None of the mentioned
    • Discuss
    • 10. Where does the allocaters are implemented?

    • Options
    • A. Template library
    • B. Standard library
    • C. C++ code library
    • D. None of these
    • Discuss


    Comments

    There are no comments.

Enter a new Comment