Algorithms, Objects & Iterators in C++ Quiz 2

1 / 47

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

2 / 47

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

Value

Size

Pointer

Memory

3 / 47

What are unary functors?

Functors that accepts other than a specific type of parameter

Functors that accepts only one parameter

Functors that accepts two parameters

Functors that accepts more than one parameters

4 / 47

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

5 / 47

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

Can be used with relational operators also

Can be used as both accessing and assigning iterator

Forward iterator can be incremented or decremented

Can be used with arithmetic operators also

6 / 47

What are Random-access Iterators?

Input iterator with the additional property of random access

Same as Bi-directional iterator

Output iterator with the additional property of random access

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

7 / 47

What are binary functors?

Functors that accepts other than a specific type of parameter

Functors that accepts two parameters

Functors that accepts only one parameter

Functors that accepts more than one parameters

8 / 47

Which of the following is correct about Input Iterators?

All of the mentioned

Cannot be used in multi-pass algorithms

They cannot be decremented

Can only be incremented

9 / 47

Which operator is used to deallocate the memory?

empty

destroy

insert

free

10 / 47

How many parameters are required for sort_heap function?

2 or 3

11 / 47

What are Bi-directional iterators?

Iterator same as Forward Iterator

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

Forward Iterator that can be used in both directions

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

12 / 47

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

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

sorts the elements of a sequence in descending 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

13 / 47

Which operator is used to allocate the memory?

new

free

14 / 47

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

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

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

15 / 47

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

prev()

next()

advance()

move()

16 / 47

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

<any>

17 / 47

Which of the following is correct about Functors?

Functors should be declared global

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

Functors should not be declared outside the main function

Functors have a state

18 / 47

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

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

To generate the random sequence in a range

To select any random number from the given sequence.

To rearrange given sequence randomly

19 / 47

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

mltiplication<T> f(a1, a2);

add<T> f(a1, a2);

subtract<T> f(a1, a2);

plus<T> f(a1, a2);

20 / 47

What is the use of checked iterators?

Not allow you to overwrite the bounds of your container

Overwrite the bounds of your container

Overwrite the bounds of your iterators

It will check the list value

21 / 47

Which of the following is a Modifying Sequence Operation?

equal()

any_of()

swap()

all_of()

22 / 47

What kind of pattern is iterator pattern?

Sequence pattern

Design pattern

Adapter pattern

Star pattern

23 / 47

Which of the following is an arithmetic unary functor?

logical_not<T> f;

negate<T> f;

logical_and<T> f;

logical_or<T> f;

24 / 47

What will happen if the iterator is unchecked?

Arising of compiler warnings

Nothing will execute

Arising of compiler warnings & Unchecked behavior on program

Unchecked behavior on program

25 / 47

Pick the correct statement.

Input iterator moves sequentially downwards

Input iterator moves in both direction

Input iterator moves sequentially backward

Input iterator moves sequentially forward

26 / 47

Where are allocators implemented?

Standard library

C++ code library

String library

Template library

27 / 47

Which header file is used to manipulate the allocater?

memory

allocater

iterator

object

28 / 47

How many types of Iterators are there?

29 / 47

Which of the following is correct?

Both Input and Output Iterators are used for assigning

Input Iterators are used for assigning

Both Input and Output Iterators are used for accessing

Output Iterators are used for assigning

30 / 47

What is the correct syntax for declaring an allocator?

template < class T > class;

template class()

template < class T > class allocator;

template class allocator;

31 / 47

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

32 / 47

Which of the following operators are overloaded for functors?

()

[]

33 / 47

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

Memory & Class pointer

Memory pointer

Object pointer

Class pointer

34 / 47

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

<algos>

35 / 47

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

Includes a new element in the range

Includes a new element in the end

Compares two ranges of data

Compares two sorted ranges of data

36 / 47

What is the use of reference member type in allocator?

Point to an element

Sequence of an element

Reference to an element

Quantities of element

37 / 47

What does the checked iterator allow you to find?

Warnings

Run time error

Warnings & Run time error

Compile time error

38 / 47

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

accumulate()

checksum()

findsum()

calcsum()

39 / 47

What kind of errors do checked iterators detect?

Uninitialized iterators

Both Uninitialized iterators and range access

Initialized iterators

Range access

40 / 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

41 / 47

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

search()

swap()

remove()

transform()

42 / 47

How many ways are there to use functors?

43 / 47

Which of the following is correct about Input Iterators?

Input iterators can work with sequence operators

Input iterators can work with arithmetic operators

Input iterators can be used with all relational operators

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

44 / 47

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

return_type operator(Class_name)(arguments);

return_type operator(arguments);

return_type operator(arguments)();

return_type operator()(arguments);

45 / 47

Which of the following is a logical unary functor?

logical_or<T> f;

negate<T> f;

logical_and<T> f;

logical_not<T> f;

46 / 47

What are functors in C++?

Objects that are used to call the function of other classes

Functions that are called only once in a program

Objects of a class which are treated as functions

Functions that are called using pointer objects

47 / 47

How many adaptors support the checked iterators?

Provide Your Information

NameEmailPhone Number

Your score is

The average score is 0%