You are given a file called “std” and composed of “Number, Name, Address” fields/attributes. (You can define the type of fields by yourself) Write an algorithm that makes “insert, delete, update and retrieve”, processes on the records in the file. “Number” field is the key of each record.

only ALGORITHM no code needed

When running anti-virus software , what could be a reason where recipitent is not guaranteed that data being streamed will not get interrupted?

The "instance" relationship shows that something is an object of a

What is the worst-case complexity of the maxrepeats function? assume that the longest string in the names array is at most 25 characters wide (i. e., string comparison can be treated as o( class namecounter { private: int* counts; int nc; string* names; int nn; public: namecounter (int ncounts, int nnames); int maxrepeats() const; }; int namecounter: : maxrepeats () { int maxcount = 0; for (int i = 0; i < nc; ++i) { int count = 1; for (int j = i+1; j < nc; ++j) { if (names[i] == names[j]) ++count; } maxcount = max(count, maxcount); } return maxcount; }