The answers are 1, 3, and 5.
Answer:
C++.
Explanation:
<em>Code snippet.</em>
#include <map>
#include <iterator>
cin<<N;
cout<<endl;
/////////////////////////////////////////////////
map<string, string> contacts;
string name, number;
for (int i = 0; i < N; i++) {
cin<<name;
cin<<number;
cout<<endl;
contacts.insert(pair<string, string> (name, number));
}
/////////////////////////////////////////////////////////////////////
map<string, string>::iterator it = contacts.begin();
while (it != contacts.end()) {
name= it->first;
number = it->second;
cout<<word<<" : "<< count<<endl;
it++;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////
I have used a C++ data structure or collection called Maps for the solution to the question.
Maps is part of STL in C++. It stores key value pairs as an element. And is perfect for the task at hand.
<span>An attribute in a relation of a database that serves as the primary key of another relation in the same database is called a
</span>
Answer: see description
Explanation:
first we accommodate the bit pattern in a matrix of 4x4 which is the minimum length checksum field, now with even parity two-dimensional scheme we need to complete this matrix by adding one row and one column by adding at the end of each row a 1 or a 0 to complete pairs of 1's:
we have
![\left[\begin{array}{cccc}1&1&1&0\\0&1&1&0\\1&0&0&1\\1&1&0&1\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bcccc%7D1%261%261%260%5C%5C0%261%261%260%5C%5C1%260%260%261%5C%5C1%261%260%261%5Cend%7Barray%7D%5Cright%5D)
so we complete with this, adding a row at the end which matches a pair number of 1's
![\left[\begin{array}{ccccc}1&1&1&0&1\\0&1&1&0&0\\1&0&0&1&0\\1&1&0&1&1\\1&1&0&0&0\end{array}\right]](https://tex.z-dn.net/?f=%5Cleft%5B%5Cbegin%7Barray%7D%7Bccccc%7D1%261%261%260%261%5C%5C0%261%261%260%260%5C%5C1%260%260%261%260%5C%5C1%261%260%261%261%5C%5C1%261%260%260%260%5Cend%7Barray%7D%5Cright%5D)
Answer:
I don't know if this is right output is {1,3}
Explanation:
