![subject](/tpl/images/cats/informatica.png)
Computers and Technology, 30.05.2020 20:01 batmandillon21
Write a program that maintains a database containing data, such as name and birthday, about your friends and relatives. You should be able to enter, remove, modify, or search this data. Initially, you can assume that the names are unique. The program should be able to save the data in a fi le for use later. Design a class to represent the database and another class to represent the people. Use a binary search tree of people as a data member of the database class. You can enhance this problem by adding an operation that lists everyone who satisfi es a given criterion. For example, you could list people born in a given month. You should also be able to list everyone in the database.
![ansver](/tpl/images/cats/User.png)
Answers: 2
![](/tpl/images/ask_question.png)
![](/tpl/images/ask_question_mob.png)
Another question on Computers and Technology
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 21.06.2019 21:20
Your program will make use of long long int variables for all calculations. note: the use of long long int requires that you have c++11 support. you should have this automatically if you are using a newer version of visual studio. the support is there for gcc as well, but you may need the -std=c++11 or -std=c++0x compiler flag. you first need to read in the total number of seconds. there is no prompt for the read (that is, you just do the cin without using a cout to display a prompt). this is going to seem a little strange when you are running your program in your ide
Answers: 2
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 22.06.2019 11:30
Awell-diversified portfolio needs about 20-25 stocks from different categories is this true or false?
Answers: 2
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 22.06.2019 20:00
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; }
Answers: 3
![question](/tpl/images/cats/informatica.png)
You know the right answer?
Write a program that maintains a database containing data, such as name and birthday, about your fri...
Questions
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/fizika.png)
Physics, 23.08.2021 14:00
![question](/tpl/images/cats/en.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 23.08.2021 14:00
![question](/tpl/images/cats/mat.png)
Mathematics, 23.08.2021 14:00
![question](/tpl/images/cats/mat.png)
Mathematics, 23.08.2021 14:00
![question](/tpl/images/cats/health.png)
Medicine, 23.08.2021 14:00
![question](/tpl/images/cats/istoriya.png)
History, 23.08.2021 14:00
![question](/tpl/images/cats/obshestvoznanie.png)
Social Studies, 23.08.2021 14:00
![question](/tpl/images/cats/ekonomika.png)
![question](/tpl/images/cats/fizika.png)
![question](/tpl/images/cats/mat.png)
Mathematics, 23.08.2021 14:00
![question](/tpl/images/cats/mat.png)
Mathematics, 23.08.2021 14:00
![question](/tpl/images/cats/mat.png)
![question](/tpl/images/cats/informatica.png)
Computers and Technology, 23.08.2021 14:00
![question](/tpl/images/cats/obshestvoznanie.png)
![question](/tpl/images/cats/obshestvoznanie.png)
Social Studies, 23.08.2021 14:00
![question](/tpl/images/cats/biologiya.png)
Biology, 23.08.2021 14:00
![question](/tpl/images/cats/en.png)