Write a C program that will accept 10 names, print out the list, sort the list using ascending order, print out the result. mang chuoi * #include #include #include int main() (char names [10] [31] int n=10; nhap (names, n): xuat(names, n); sapxep (names, n); printf("Ds sau khi sap xep:\n"); xuat(names, n); getch(); return 0;

Write a C program that will accept 10 names, print out the list, sort the list using ascending order, print out the result. mang chuoi * #include #include #include int main() (char names [10] [31] int n=10; nhap (names, n): xuat(names, n); sapxep (names, n); printf("Ds sau khi sap xep:\n"); xuat(names, n); getch(); return 0;

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

In C++, write a program that reads in an array of type int. You may assume that there are fewer than 20 entries in the array. The output must be a two-column list. The first column is a list of the distinct array elements and the second column is the count of the number of occurences of each element.
#include<iostream>#include<string>#include <cstdlib>#include <ctime>#include<time.h>#include <iomanip>using namespace std; void merge(string a[], string b[], int left, int mid, int right) {int nL = mid - left + 1;int nR = right - mid;string leftA[nL], rightA[nR], leftB[nL], rightB[nR];for(int i = 0; i < nL; i++) {leftA[i] = a[nL+i];leftB[i] = b[nL+i];}for(int i = 0; i < nR; i++) {rightA[i] = a[mid+i+1];rightB[i] = b[mid+i+1];}int i = 0, j = 0, k = left;while(i < nL && j < nR) {if(leftA[i] <= rightA[j]) {a[k] = leftA[i];b[k] = leftB[i];i++;}else {a[k] = rightA[j];b[k] = rightB[j];j++;k++;}}while(i < nL) {a[k] = leftA[i];b[k] = leftB[i];i++;k++;}while(j < nR) {a[k] = rightA[j];b[k] = rightB[j];j++;k++;}} void mergeSort(string a[], string b[], int left, int right) {int mid;if(left < right) {mid = left + (right-1)/2;mergeSort(a,b,left,mid);mergeSort(a,b,mid+1,right);merge(a,b,left,mid,right);}} int menu() {int…
a- Write a Python function Salary_levels, that takes a list as an argument and returns the number of the high salaries (salary>=5000), the average salaries(1000<=salary<5000, and the low salaries (salary<1000). You can use the following list : salaries= [500,1070,1450,6500,9000,940,450,400,600,2750,1100,8400,1500,900,1200] b- Use the above function to print the counts of the high, average, and low salaries. N.B: the codes of parts a and b should be included in your answer.
#include<iostream>#include<stdlib.h>#include<time.h>#include<bits/stdc++.h>using namespace std; void merge(int arr[], int l, int m, int r){ int n1 = m - l + 1; int n2 = r - m; int L[n1], R[n2]; for (int i = 0; i < n1; i++) L[i] = arr[l + i]; for (int j = 0; j < n2; j++) R[j] = arr[m + 1 + j]; int i = 0; int j = 0; int k = l; while (i < n1 && j < n2) { if (L[i] <= R[j]) { arr[k] = L[i]; i++; } else { arr[k] = R[j]; j++; } k++; } while (i < n1) { arr[k] = L[i]; i++; k++; } while (j < n2) { arr[k] = R[j]; j++; k++; }} void mergeSort(int arr[],int l,int r){ if(l>=r){ return; } int m =l+ (r-l)/2; mergeSort(arr,l,m); mergeSort(arr,m+1,r); merge(arr,l,m,r);} int main(){ srand(time(0)); long int n; cout<<"Enter the number of…
#include <stdio.h> #include <string.h> int IsPasswordOkay(char* pass) { char Password[12]; strcpy(Password, pass); if (!strcmp(Password, "goodpass")) return(1); else return(0); } int main(int argc, char **argv) { int PwStatus; if (argc < 2) { printf("Input your password\n"); return(-1); } PwStatus = IsPasswordOkay(argv[1]); if (PwStatus == 0) { printf("Acces denied"); return(-1); } else { printf("Access granted"); return(1); } } Write a function to conduct input validation to secure the smallest buffer. You may call this function void SecurePasswordBuffer(const char *arg).
Using c++ Contact list: Binary Search A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe…
task7.c Compare 2 strings function cmp will print out > if s1 is "bigger" than s2, < if s1 is "smaller than s2, = if s1 is "equal" to s2. */ #include <stdio.h> #include <string.h> void cmp(char *s1, char *s2){ return; } int main() { char *string1 = "UNIX rules!"; char *string2 = "Windows drools!"; cmp(string1,string2); return 0; } Start with task7.c, implement the cmp() function. The goal of this function is to compare two strings using the sum of the ASCII value of all the characters in each string. Output of your program should look like this: UNIX rules! is smaller than Windows drools!
#include<iostream>#include<stdlib.h>#include<time.h>#include<bits/stdc++.h>using namespace std; void merge(int arr[], int l, int m, int r){ int n1 = m - l + 1; int n2 = r - m; int L[n1], R[n2]; for (int i = 0; i < n1; i++) L[i] = arr[l + i]; for (int j = 0; j < n2; j++) R[j] = arr[m + 1 + j]; int i = 0; int j = 0; int k = l; while (i < n1 && j < n2) { if (L[i] <= R[j]) { arr[k] = L[i]; i++; } else { arr[k] = R[j]; j++; } k++; } while (i < n1) { arr[k] = L[i]; i++; k++; } while (j < n2) { arr[k] = R[j]; j++; k++; }} void mergeSort(int arr[],int l,int r){ if(l>=r){ return; } int m =l+ (r-l)/2; mergeSort(arr,l,m); mergeSort(arr,m+1,r); merge(arr,l,m,r);} int main(){ srand(time(0)); long int n; cout<<"Enter the number of…
In C programming. How do I find the max and min values of the corressponding columns. #include <stdio.h>#include <math.h>#include <stdlib.h>#define NROWS 5#define NCOLS 5 int main(void){ int i,j, max, min, m, n; float M[NROWS][NCOLS], Mt[NROWS][NCOLS]; char key_hit; //Input the sizes printf("ROW size(1-5) : ");scanf("%d",&m); printf("Column size(1-5): ");scanf("%d",&n); //Size Check while(m>NROWS || n>NCOLS) { printf("Please re-enter the sizes. \n"); printf("Row size(1-5) : ");scanf("%d", &m); printf("Column size(1-5) : ");scanf("%d", &n); } //Input the Matrix Data for(i=0; i<m; i++) for(j=0; j<n; j++) { printf("M[%d][%d] = ", i,j); scanf("%f", &M[i][j]); } //Print the Matrix Data for(i=0; i<m; i++) { for(j=0; j<n; j++) { printf("%1.2f\t", M[i][j]); }…
C++ A matrix is a rectangular array of numbers that is arranged in a two-dimensional table. Matrices have numerous applications in computer systems. Matrix structures are examined in computer memory, graphics, and cryptography. The Hill cipher, for example, makes use of matrix inversions to encrypt and decrypt data. The intent of this problem is to develop a C++ program that computes and displays the inversion of a 2 x 2 matrix. A matrix is said to have the dimensions m x n if it has m rows and n columns. A square matrix has the same number of rows as columns, and is therefore said to have m x m dimensions. Matrix M shown below is an example of a 2 x 2 matrix. The inverse of a square matrix, M-1, is defined by the equation M(M-1) = I, where I is called the identity matrix. I is a square matrix that is all zeros except for ones along the main diagonal from the upper left corner to the lower right corner. I for a 2 x 2 matrix is: Multiplying a square matrix by its inverse will always…
//main.cpp #include<iostream>#include<cmath>#include<string>#include<cstring>#include<algorithm>#include<list>using namespace std; #include "Dog.h" void popDogs(list<Dog>&); /** Change NOTHING above this line **/ //TODO, overload << operator//here's a startostream& operator<<(ostream& os, Dog& d){ //Insert code here so that when a Dog is output, it is done as: //dogName weighs weight pounds. //Like: //Spot weighs 28 pounds. //Don't forget the period at the end. Do NOT include an endl at the end of the line. os<< d.dogName<< " weighs " << d.weight << " pounds."; return os; } int main(){ //TODO, instantiate list of Dog variable called kennel. list<Dog> kennel; //TODO, call the popDogs function passing the kennel variable declared above popDogs(kennel); //This code will sort the list of Dog using the less-than operator kennel.sort();…
#include <stdio.h>#include <limits.h> int findMissingUtil(int arr[], int low, int high, int diff){ if (high <= low)return INT_MAX; int mid = low + (high - low)/2; if (arr[mid+1] - arr[mid] != diff)return (arr[mid] + diff); if (mid > 0 && arr[mid] - arr[mid-1] != diff)return (arr[mid-1] + diff); if (arr[mid] == arr[0] + mid*diff)return findMissingUtil(arr, mid+1, high, diff); return findMissingUtil(arr, low, mid-1, diff);} int findMissing(int arr[], int n){int diff = (arr[n-1] - arr[0])/n; return findMissingUtil(arr, 0, n-1,diff);} int main(){int arr[] = {120001, 120013, 120025, 120037, 120049, 120061,120085,120097,120109,120121};int n = sizeof(arr)/sizeof(arr[0]);printf("The missing element is %d", findMissing(arr, n));return 0;} ______________________________________________________________________________ Convert the code above into Pseudocode