A server can have many definitions, but in this particular case, the answer is A.
Answer:C)Defeated the two most successful human Jeopardy! champions in a three-game match.
Explanation: Watson emerged from the IBM supercomputer made by Thomas Watson .It is made from the two main component analytical software and the artificial intelligence which made it a optimal for the question-answer feature.
Watson defeated Ken Jennings and Brad Rutter(earlier successful contestants) in the program named Jeopardy by answering questions correctly and quickly in 2011.Other options are incorrect because it did not worked as the software engineer,humane genome or won crossword puzzle.Thus the correct option is option (c).
page layout tab or the page setup dialog box
Answer:
-3874₁₀ = 1111 1111 1111 1111 1111 1111 1101 1110₂
Explanation:
2's complement is a way for us to represent negative numbers in binary.
To get 2's complement:
1. Invert all the bits
2. Add 1 to the inverted bits
Summary: 2's complement = -N = ~N + 1
1. Inverting the number
3874₁₀ = 1111 0010 0010₂
~3874₁₀ = 0000 1101 1101₂
2. Add 1 to your inverted bits
~3874₁₀ + 1 = 0000 1101 1101₂ + 1
= 0000 1101 1110₂
You can pad the most signigicant bits with 1's if you're planning on using more bits.
so,
12 bits 16 bits
0000 1101 1110₂ = 1111 0000 1101 1110₂
They asked for double word-length (a fancy term for 32-bits), so pad the left-most side with 1s' until you get a total of 32 bits.
32 bits
= 1111 1111 1111 1111 1111 1111 1101 1110
Hi,
I changed your program using some of the concepts you were trying to use. Hopefully you can see how it works:
#include <string>
#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
short T;
cin >> T;
cin.ignore();
string str[100];
for(int i=0; i<T; i++)
{
getline(cin, str[i]);
}
for (int i = 0; i < T; i++)
{
stringstream ss(str[i]);
string tmp;
vector<string> v;
while (ss >> tmp)
{
// Let's capitalize it before storing in the vector
if (!tmp.empty())
{
transform(begin(tmp), end(tmp), std::begin(tmp), ::tolower);
tmp[0] = toupper(tmp[0]);
}
v.push_back(tmp);
}
if (v.size() == 1)
{
cout << v[0] << endl;
}
else if (v.size() == 2)
{
cout << v[0][0] << ". " << v[1] << endl;
}
else
{
cout << v[0][0] << ". " << v[1][0] << ". " << v[2] << endl;
}
}
return 0;
}
