Use C++ #include using namespace std;void deleteRepeats (char[], int&);int main()}char alpha[10];alpha [0] = 'm';alpha[1] = 't¹;alpha [2] = 't';alpha [3]alpha [4]alpha [5] = 'm';'a';'d';alpha [6] = 'c';alpha [7] = 'c';alpha [8] = 'a';Copy the main code and complete delete Repeats function.int size = 9;deleteRepeats (alpha, size);cout << "After deleting repeat" << endl;for (int i = 0; i < size; ++i)cout << alpha[1] << endl;return 0;CSOLARS Problem 2.Write a function called deleteRepeats that has a partially filled array ofcharacters as a formal parameter and that deletes all repeated lettersfrom the array.void deleteRepeats (char A[], int& size)↑Size of array AProblem 2.char alpha[10];alpha [0] = 'a';alpha[1] = 'b';alpha [2] = 'c'; After deleting repeatalpha[3] = 'a';alpha[4] = 'd';alpha [5] = 'a';alpha[6] = 'c';alpha [7] = 'e';int size= 8;HALUTEaCeCS 003 LABSchar alpha[10];alpha [0] = 'm'alpha [1] = 't'alpha [2] = 't'alpha [3] = 'a'alpha [4] = 'd'alpha [5] = 'm'alpha [6] = 'c'alpha [7] = 'c';alpha [8] = 'a';int size= 9;After deleting repeatmt

code- #include <iostream>#include <bits/stdc++.h>using namespace std;void…

#include using namespace std; void deleteRepeats (char[], int&); int main() { char alpha[10]; alpha[0]= 'n'; alpha[1] = 't'; alpha[2] = 't'; alpha[3]= 'a'; alpha[4] 'd'; alpha [5] = 'n'; alpha[6] = 'c'; alpha[7] = 'c'; alpha[8] = 'a'; Copy the main code and complete delete Repeats function int size= 9; deleteRepeats (alpha, size); cout << "After deleting repeat" << endl; for (int i = 0; i < size; ++i) cout << alpha[i] << endl; return 0;

#include using namespace std; void deleteRepeats (char[], int&); int main() { char alpha[10]; alpha[0]= 'n'; alpha[1] = 't'; alpha[2] = 't'; alpha[3]= 'a'; alpha[4] 'd'; alpha [5] = 'n'; alpha[6] = 'c'; alpha[7] = 'c'; alpha[8] = 'a'; Copy the main code and complete delete Repeats function int size= 9; deleteRepeats (alpha, size); cout << "After deleting repeat" << endl; for (int i = 0; i < size; ++i) cout << alpha[i] << endl; 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

None
#include #include #include #define SIZE 5 int nums [SIZE] = [5,0,6,1,2); int main() { int i; pid_t pid; pid= fork(); if (pid == 0) { for (i = 0; i 0) { wait (NULL); } for (i = 0; i < SIZE; i++) printf("PARENT: %d\n", nums [i] + 1); /* LINE Y */ return 0; From the above-given program, please state what will be the output at lines X and Y. Explanation in detail required for output at both lines X and Y.
struct ID { int x; int y; }; struct name { ID r; }; int main() { name a[2]; for (int i=0;i<2;i++) { a[i).r.x=i; a[i].r.y=i+1; } for(int i=0;i<2;i++) cout<
Fill in the blanks
Screen Output #include #include #define MAX 3 typedef struct { char part[20]; int quantity; float price; }partsRecord; void myParts (void); void printBin(partsRecord *recBin); int main(void) { myParts(); return(0); } void myParts (void) { partsRecord Bin[MAX] = { { "Resistor", 300, 0.05 }, { "Capacitor", 250, 1.03 }, { "Inductor", 123, 0.65 }}; int index; for (index { 0; index part, recBin->quantity, recBin->price); return; } 2c) What type of argument is passed to the printBin function?
Write a function getNeighbors which will accept an integer array, size of the array and an index as parameters. This function will return a new array of size 2 which stores the neighbors of the value at index in the original array. If this function would result in returning garbage values the new array should be set to values {0,0} instead of values from the array.
C. #include int main() { char name[20]; printf("\nEnter your name :"); gets (name) ; printf("\nYour name is "); puts(name); }
int main(){ long long int total; long long int init; scanf("%lld %lld", &total, &init); getchar(); long long int max = init; long long int min = init; int i; for (i = 0; i < total; i++) { char op1 = '0'; char op2 = '0'; long long int num1 = 0; long long int num2 = 0; scanf("%c %lld %c %lld", &op1, &num1, &op2, &num2); getchar(); long long int maxr = max; long long int minr = min; if (op1 == '+') { long long int sum = max + num1; maxr = sum; minr = sum; long long int res = min + num1; if (res > maxr) { max = res; } if (res < minr) { minr = res; } } else { long long int sum = max * num1; maxr = sum; minr = sum; long long int res = min * num1;…
#ifndef lab5ExF_h #define lab5ExF_h typedef struct point { char label[10]; double x ; // x coordinate for point in a Cartesian coordinate system double y; // y coordinate for point in a Cartesian coordinate system double z; // z coordinate for point in a Cartesian coordinate system }Point; void reverse (Point *a, int n); /* REQUIRES: Elements a[0] ... a[n-2], a[n-1] exists. * PROMISES: places the existing Point objects in array a, in reverse order. * The new a[0] value is the old a[n-1] value, the new a[1] is the * old a[n-2], etc. */ int search(const Point* struct_array, const char* target, int n); /* REQUIRES: Elements struct-array[0] ... struct_array[n-2], struct_array[n-1] * exists. target points to string to be searched for. * PROMISES: returns the index of the element in the array that contains an * instance of point with a matching label. Otherwise, if there is * no point in the array that its label matches the target-label, * it should return -1. * If there are more than…
#include<stdio.h> #include<stdarg.h> void fun1(int num, ...); void fun2(int num, ...); int main() { fun1(1, "Apple", "Boys", "Cats", "Dogs"); fun2(2, 12, 13, 14); return 0; } void fun1(int num, ...) { char *str; va_list ptr; va_start(ptr, num); str = va_arg(ptr, char *); printf("%s ", str); } void fun2(int num, ...) { va_list ptr; va_start(ptr, num); num = va_arg(ptr, int); printf("%d", num); }.
#include <stdio.h>#include <string.h>#define SIZE 6struct Cake {char name[50];float price;};int searchChoice(char *choice, struct Cake data[]);void displayChoice(int index, struct Cake data[]);int main() {char choice[50];int index;//Answer for Part (i) – Declare and initialise array stockprintf("What is your choice of cake? ");gets(choice);index = searchChoice(choice, stock);displayChoice(index, stock);return 0;}//Answer for Part (ii) – Function definition for searchChoice//Answer for Part (iii) – Function definition for displayChoice
#include using namespace std; int find(int arr[], int value, int left, int right) { int midpt = (left+right)/2; if (left > right) return -1; if ( arr[midpt] return midpt; else if (arr[midpt] < value) == value) return else return find(arr,value, left,midpt-1); } void main(void) { int arr[] ={4,5,6,9,11}; cout<