Algorithms, Objects & Iterators in C++ Quiz 2

1 / 47

What is the property of stable sort function provided by the STL algorithm?

sorts the elements of a sequence in descending order preserving the relative order of equivalent elements

sorts the elements of a sequence in ascending order preserving the relative order of equivalent elements

arranges the sequence randomly preserving the relative order of equivalent elements

same as sort function of STL algorithm

2 / 47

What does the checked iterator allow you to find?

Compile time error

Warnings & Run time error

Warnings

Run time error

3 / 47

Which of the following is correct about Input Iterators?

Input iterators can be used with all relational operators

Input iterators can work with arithmetic operators

Input iterators can work with sequence operators

No value can be assigned to the location pointed by Input Iterator

4 / 47

Which of the following is correct about Functors?

Functors should not be declared outside the main function

Overloaded operator () function is not a member of the class

Functors have a state

Functors should be declared global

5 / 47

What are Bi-directional iterators?

Forward Iterator that can be used in both directions

Iterator that can only be used to access the sequence from both sides

Iterator same as Forward Iterator

Iterator that can only be used to assign the sequence from both sides

6 / 47

What is the correct syntax for declaring an allocator?

template < class T > class allocator;

template class()

template < class T > class;

template class allocator;

7 / 47

Which of the following is an arithmetic unary functor?

logical_or<T> f;

negate<T> f;

logical_and<T> f;

logical_not<T> f;

8 / 47

What are Random-access Iterators?

Iterators that can be used to access elements at an arbitrary offset position

Same as Bi-directional iterator

Input iterator with the additional property of random access

Output iterator with the additional property of random access

9 / 47

Which of the header file is used to implement algorithms provided by C++ STL?

<algos>

10 / 47

How many ways are there to use functors?

11 / 47

What kind of pattern is iterator pattern?

Design pattern

Sequence pattern

Adapter pattern

Star pattern

12 / 47

How many types of Iterators are there?

13 / 47

Which of the following operators are overloaded for functors?

()

[]

14 / 47

Which of the following is correct?

Both Input and Output Iterators are used for accessing

Output Iterators are used for assigning

Both Input and Output Iterators are used for assigning

Input Iterators are used for assigning

15 / 47

What are unary functors?

Functors that accepts more than one parameters

Functors that accepts other than a specific type of parameter

Functors that accepts two parameters

Functors that accepts only one parameter

16 / 47

What is the correct function prototype of () operator overloading?

return_type operator(arguments)();

return_type operator(Class_name)(arguments);

return_type operator()(arguments);

return_type operator(arguments);

17 / 47

What are binary functors?

Functors that accepts only one parameter

Functors that accepts two parameters

Functors that accepts other than a specific type of parameter

Functors that accepts more than one parameters

18 / 47

Pick the correct statement.

Input iterator moves sequentially backward

Input iterator moves sequentially forward

Input iterator moves in both direction

Input iterator moves sequentially downwards

19 / 47

1. What is the property of partial sort function provided by the STL algorithm?

sorts the elements after the middle element in ascending order and remaining elements are left without any specific order

sorts the elements before the middle element in descending order and remaining elements are left without any specific order

sorts the elements after the middle element in descending order and remaining elements are left without any specific order

sorts the elements before the middle element in ascending order and remaining elements are left without any specific order

20 / 47

Which function is used increment the iterator by a particular value?

move()

advance()

prev()

next()

21 / 47

What is the use of includes function in c++?

Compares two sorted ranges of data

Includes a new element in the range

Compares two ranges of data

Includes a new element in the end

22 / 47

What is the use of random_shuffle() function of STL algorithm?

To generate the random sequence in a range

To select any random number from the given sequence.

To rearrange given sequence randomly

To generate a sequence in a given range and arrange them in random order

23 / 47

Which header file is required to use accumulate() function?

24 / 47

In which type of semantics does c++ implements iterator?

Size

Memory

Pointer

Value

25 / 47

Which of the following is a Non-modifying Sequence Operation?

remove()

search()

swap()

transform()

26 / 47

Which of the following is correct about Input Iterators?

Can only be incremented

They cannot be decremented

All of the mentioned

Cannot be used in multi-pass algorithms

27 / 47

Which of the following is a logical unary functor?

negate<T> f;

logical_not<T> f;

logical_or<T> f;

logical_and<T> f;

28 / 47

Which of the following is an advantage of Forward iterator over input and output iterator?

Can be used as both accessing and assigning iterator

Forward iterator can be incremented or decremented

Can be used with relational operators also

Can be used with arithmetic operators also

29 / 47

Which function can be used to find the sum of a vector container?

calcsum()

accumulate()

checksum()

findsum()

30 / 47

Which of te following is a built-in example of functors in C++?

add<T> f(a1, a2);

subtract<T> f(a1, a2);

plus<T> f(a1, a2);

mltiplication<T> f(a1, a2);

31 / 47

Where are allocators implemented?

Template library

Standard library

String library

C++ code library

32 / 47

How many adaptors support the checked iterators?

33 / 47

What is the use of reference member type in allocator?

Quantities of element

Point to an element

Sequence of an element

Reference to an element

34 / 47

Which of the following is a Modifying Sequence Operation?

equal()

all_of()

any_of()

swap()

35 / 47

Which of the following header file is required to use in-bulit functors of C++?

<any>

36 / 47

What is the use of checked iterators?

Overwrite the bounds of your iterators

Overwrite the bounds of your container

It will check the list value

Not allow you to overwrite the bounds of your container

37 / 47

Which operator is used to allocate the memory?

free

new

38 / 47

How many parameters are required for sort_heap function?

2 or 3

39 / 47

Which header file is used to manipulate the allocater?

memory

allocater

object

iterator

40 / 47

Which of the following can serve as random-access iterator?

Object pointer

Class pointer

Memory pointer

Memory & Class pointer

41 / 47

What kind of errors do checked iterators detect?

Both Uninitialized iterators and range access

Uninitialized iterators

Initialized iterators

Range access

42 / 47

What are Iterators?

STL component used for vectors

STL component used to define template classes

STL component used to point a memory address of a container

STL component used to call functions efficiently

43 / 47

What are functors in C++?

Objects of a class which are treated as functions

Functions that are called only once in a program

Objects that are used to call the function of other classes

Functions that are called using pointer objects

44 / 47

How many types of sequence operations are provided by the C++ algorithm STL?

45 / 47

What will happen if the iterator is unchecked?

Arising of compiler warnings

Nothing will execute

Unchecked behavior on program

Arising of compiler warnings & Unchecked behavior on program

46 / 47

Which operator is used to deallocate the memory?

destroy

insert

free

empty

47 / 47

How many categories of iterators are there in c++?

Provide Your Information

NameEmailPhone Number

Your score is

The average score is 0%