Answer:
#include <iostream>
using namespace std;
struct StudentType{
string studentName;
int studentId;
}
int n;
char answer[20];
int main(){
cout<< "Enter the size of the array: ";
cin >> n;
StudentType *student = new StudentType(n);
for (int i = 0; i < n; i++){
int name;
int number;
cin>> name;
cin >> number;
student[i].studentName = name;
student[i].studentId = number;
}
for (int i = 0; i < 20; i++){
cout<< "Enter answers: ";
cin >> ans;
answer[i] = ans;
}
}
Explanation:
The C++ source code has three global variables namely, answer which is an array of character data type, StudentType which is a structure data type and the integer variable n. The main function declares and initializes the dynamic-spaced student array of the structure datatype with the n variable.
Answer:
the coefficient of x here is 4
Explanation:
pls let me know if its wrong or right ..i"ll try another way than:?
Answer:
Cyber crime is also known as computer crime in which the illegal activities are done by the computer and many mobile devices. There are many types of crime but the cyber crime are associated with the computer crime by hacking personal documents and email spamming.
To resolve these type of cyber crime there is special type of police which is known as cyber cell. Data theft, cyber stalking and accessing other user data without there permission is all comes under the cyber crime.
Computer forensics is type of application that are used in investigation purpose and gathering the information from the computer.
The main aim of computer forensic is to perform and maintain the various type structured investigation and also maintain the systematic documents for the evidence.
Answer:
well you can download some apps from the play store and it is easy for you to learn from there (interactive)
Answer:
quicksort.cpp
void quickSort(int arr[], int left, int right) {
int i = left, j = right;
int tmp;
int pivot = arr[(left + right) / 2];
/* partition */
while (i <= j) {
while (arr[i] < pivot)
i++;
while (arr[j] > pivot)
j--;
if (i <= j) {
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
i++;
j--;
}
};
/* recursion */
if (left < j)
quickSort(arr, left, j);
if (i < right)
quickSort(arr, i, right);
}
