Crowdly

Add to Chrome

met2502f25-a.sg

Looking for met2502f25-a.sg test answers and solutions? Browse our comprehensive collection of verified answers for met2502f25-a.sg at distance3.sg.digipen.edu.

Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!

Which is the most appropriate container if your program needs to perform the following tasks:

Read an unknown number of words from a file.

Always insert new words at the back.

Frequently, remove the value from the front.

View this question

Which is the most appropriate container if your program needs to perform the following tasks:

Read an unknown number of integers from a file.

Sort the numbers and then print them to standard output.

View this question

Answer or for the questions below.

The std::find algorithm searches for a value inside a given range. If the algorithm is successful, it returns the iterator position of the element found. If the algorithm fails, it returns the end of the range passed as second argument.

Passing function objects instead of ordinary functions to an algorithm often results in better performance.

std::for_each is the only algorithm that can return a function object.

Function objects cannot be passed as arguments to STL algorithms.

The function std::advance can be used to increment the position of an iterator passed as an argument.

Given an object c instantiated from an STL container Cont::<T>, the expression std::cbegin(c) returns a value of type Cont<T>::const_iterator.

Function objects can only be used with algorithm std::for_each.

std::map containers store key/value pairs as elements in a sorted order based on their key values.

A binary function object takes one argument.

A std::forward_list container supports bi-directional iteration.

A unary function object takes two arguments.

Passing function objects instead of ordinary functions to an algorithm is more advantageous because function objects can have state.

The std::transform algorithm can be used to apply a function to each element of a sequence and store the result [from the function] in the same sequence.

Given iterator iter that points to an element of a container of type std::forward_list<T>, the expression std::prev(iter) will return an iterator to the element preceding the element pointed to by iter.

A function object is an instance of a class that defines a member function operator() with the appropriate parameter types.

View this question

Use the following function template declaration and variable definitions to deduce the template type parameter T for each of the subsequent expressions involving calls to function foo. If template type deduction fails, choose as your answer.

template<typename T>
void foo(T&);
int       x{100};
const int cx{x};
int       &rx{x}; 
int const &crx{x};
int       *pi{&x};
int       a[10]{10};
int const ca[10]{10,20};
int       b[2][10]{};

foo(&x)

foo(a)

foo(pi)

foo(5)

foo(rx)

foo(crx)

foo(b)

foo(&pi)

foo(cx)

foo(x)

foo(&cx)

foo(ca)

View this question

template<typename T>
void foo(T);
int       x{100};
const int cx{x};
int       &rx{x}; 
int const &crx{x};
int       *pi{&x};
int       a[10]{10};
int const ca[10]{10,20};
int       b[2][10]{};

foo(&x)

foo(a)

foo(pi)

foo(5)

foo(rx)

foo(crx)

foo(b)

foo(&pi)

foo(cx)

foo(x)

foo(&cx)

foo(ca)

View this question

Use the following definition of function template Max to answer the subsequent questions.

template <typename T1, typename T2, typename T3 = double>
T3 Max(T1 lhs, T2 rhs) {
  return lhs > rhs ? lhs : rhs;
}

Will expression Max<double>(30.1,10.1) compile?

Will expression Max(30.1,10.1) compile?

The number of template type arguments deduced in expression Max(10,10.1) is:

Will expression Max<double,double,int>(10,10.1) compile?

Will expression Max<>(30.1f,10.2) compile?

Will expression Max<double,double>(30.f,40.f) compile?

Will expression Max<double,int>(10,10.1) compile?

The number of template type parameters in function template Max is:

The number of function parameters in function template Max is:

Will expression Max<int,int,int>(30.2,10.1) compile?

View this question

Use the following definition of function template Max to answer the subsequent questions.

template <typename T1, typename T2, typename T3>
T3 Max(T1 lhs, T2 rhs) {
  return lhs > rhs ? lhs : rhs;
}

The number of template type arguments deduced in expression Max(10,10.1) is:

Will expression Max<double>(10,10.1) compile?

Will expression Max<double,double,int>(10,10.1) compile?

Will expression Max(10,10.1) compile?

Will expression Max<>(10,10.1) compile?

Will expression Max<double,int>(10,10.1) compile?

The number of template type parameters in function template Max is:

Will expression Max<int,int,int>(10,10.1) compile?

The number of function parameters in function template Max is:

Will expression Max<double,double>(10,10.1) compile?

View this question

Assuming all necessary standard library headers are included, use the following code fragment:

template <typename T1, typename T2>
void function(T1, T2) { }
// in function main ...
std::string str {};
int x{};
double y{};
function(str, "");
function(3.5, x);
function(nullptr, &x);
function(y, 7);
function(&x, &x);

to select the functions that are instantiated.