QUESTION 1Findthe minand max based on the array list given.slopes[SIZEJ={17.24,25.63,5.94,33.92,3.71,32.84,35.93,18.24,6.92);Example solution:#indlude using namespace std;int main(){constint SIZE = 93;double slopes[SIZE]={17.24,25.63,5.94,33.92,3.71,32.84,35.93,18.24,6.92};double max, min%3;inti;max = slopes[0];min = slopes[0];for (i = 1; i< SIZE; i++){if (max < slopes[])max = slopes[i];if (min > slopes[i])min = slopes[i);}cout << "The maximum value is "<< max << endl;cout << "The minimum value is"« min<< endl;retum 0;}

QUESTION 1 Findthe minand max based on the array list given. slopes[SIZEJ-{17.24,25.63,5.94,33.92,3.71,32.84,35.93,18.24,6.92); Example solution: #indude . using namespace std; int maino { const int SIZE = 9; double slopes[SIZEJ-{17.24,25.63,5.94,33.92,3.71,32.84,36.93,18.24,6.92); double max, min; inti; max = slopes(0): min - slopes[0]: for (i = 1; i< SIZE; i++) { if (max < slopes(]) max - slopes[): if (min > slopes[i]) min = slopes[); cout <« The maximum value is"<« max << endl; cout <« The minimum value is" << min<< endl; retum 0;

QUESTION 1 Findthe minand max based on the array list given. slopes[SIZEJ-{17.24,25.63,5.94,33.92,3.71,32.84,35.93,18.24,6.92); Example solution: #indude . using namespace std; int maino { const int SIZE = 9; double slopes[SIZEJ-{17.24,25.63,5.94,33.92,3.71,32.84,36.93,18.24,6.92); double max, min; inti; max = slopes(0): min - slopes[0]: for (i = 1; i< SIZE; i++) { if (max < slopes(]) max - slopes[): if (min > slopes[i]) min = slopes[); cout <« The maximum value is"<« max << endl; cout <« The minimum value is" << min<< endl; retum 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

(a) Print the following List in the reversed order using lambda / arrow operator. var array = new List <int>{ 8,2,2,24,5,7,5,3,2,10}; (b) Print minimum, maximum and average values of the following List (5 points). var array = new List <int>{ 8,2,2,24,5,7,5,3,2,10 }; Please use Visual studio
For any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, 1 #include 2 3 int main(void) { const int SIZE_LIST = 4; int keysList[SIZE_LIST]; int itemsList[SIZE_LIST]; int i; 4 6 7 8 scanf("%d", &keysList[0]); scanf ("%d", &keysList[1]); scanf("%d", &keysList[2]); scanf("%d", &keysList[3]); 10 11 12 13 scanf ("%d", &itemsList[0]); scanf ("%d", &itemsList[1]); scanf("%d", &itemsList[2]); scanf ("%d", &itemsList[3]); 14 15 16 17 18 19 /* Your code goes here */ 20 21 printf("\n"); 22 23 return 0; 24 }
narmts Save Answer Write a Java program that uses ArrayList and Iterator. It should input from user the names and ages of your few friends in a loop and add into ArrayList. Finally, it should use Iterator to display the data in a proper format. (Hint- Lecture 02: Slide 8) Sample output: List of my Friends Enter name and age [friend# oj Khalid Al-shamri 22.5 Do you want to add another friend (y/n)? y Enter name and age [friend# 1] Rahsed Al-anazi 21.1 Do you want to add another friend (y/n)? y Enter name and age [friend# 2] Salem Al-mutairi 23.7 Do you want to add another friend (y/n)? n Here is the data you entered: 0. Khalid Al-shamri, 22.5 1. Rahsed Al-anazi, 21.1 2. Salem Al-mutairi, 23.7
char zetta[10] = {'B','A','D','G','U','Y','H','E',’L’,’P’}; Write a C programing code that will display the list of vowels and consonantsposition in the array, zetta.
Use iterators to print each element of v separted by spaces. #include <iostream>#include <vector> using namespace std; int main(){vector<int> v = {1, 3, 5}; (.....) }
6.Code for- an array of meeting time intervals consisting ofstart and end times [[s1,e1],[s2,e2],...] (si < ei),determine if a person could attend all meetings. For example,Given [[0, 30],[5, 10],[15, 20]],return false.""".
Q2. Write a java program to perform the following task: a) Create a collection ArrayList<String> for Customer class b) Add 5 elements into ArrayList c) Display the element at index 4 d) Display all the elements in the ArrayList using for-each loop e) Remove the values at index 2 f) Add “cst2” in location 2. g) Check if st2 existing inside the collection.
Using C++ Language Need help on below code, I have the code but need to compute maximum of the array. Code: #include<iostream> using namespace std; int main() { int size; cout<<" Enter array size: "; cin>>size; int *numList=new int[size]; cout<<"Enter "<<size<<" elements: "; for(int i=0;i<size;i++) { cin>> *(numList+i); } delete numList; return 0; }
İn C Language pls help #include <stdio.h>#include <stdlib.h>#include <string.h> typedef struct ArrayList_s{ void **list; int size; int capacity; int delta_capacity;} ArrayList_t, *ArrayList; ArrayList arraylist_create(int capacity, int delta_capacity){ ArrayList l; l = (ArrayList)malloc(sizeof(ArrayList_t)); if (l != NULL) { l->list = (void **)malloc(capacity * sizeof(void *)); if (l->list != NULL) { l->size = 0; l->capacity = capacity; l->delta_capacity = delta_capacity; } else { free(l); l = NULL; } } return l;} void arraylist_destroy(ArrayList l){ free(l->list); free(l);} int arraylist_isempty(ArrayList l){ return l->size == 0;} int arraylist_isfull(ArrayList l){ return l->size == l->capacity;} int arraylist_set(ArrayList l, void *e, int index, void **replaced){ if (!arraylist_isfull(l)) {…
#include #include using namespace std; void PrintSize(vector numsList) { cout intList (3); PrintSize(intList); cin >> currval; while (currval >= 0) { } Type the program's output intList.push_back(currval); cin >> currVal; PrintSize(intList); intList.clear(); PrintSize(intList); return 0; 1 se mice with camScanner Check Next Input 1234-1 Output
Q: Convert this to sorted array #include<iostream> #include"Student.cpp" class StudentList { private: struct ListNode { Student astudent; ListNode *next; }; ListNode *head; public: StudentList(); ~StudentList(); int IsEmpty(); void Add(Student newstudent); void Remove(); void DisplayList(); }; StudentList::StudentList() { head=NULL; }; StudentList::~StudentList() { cout <<"\nDestructing the objects..\n"; while(IsEmpty()!=0) Remove(); if(IsEmpty()==0) cout <<"All students have been deleted from a list\n"; }; int StudentList::IsEmpty() { if(head==NULL) return 0; else return 1; }; void StudentList::Add(Student newstudent) { ListNode *newPtr=new ListNode; if(newPtr==NULL) cout <<"Cannot allocate memory"; else { newPtr->astudent=newstudent; newPtr->next=head; head=newPtr; } }; void StudentList::Remove() { if(IsEmpty()==0) cout <<"List empty on remove"; else { ListNode *temp=head;…
#include using namespace std; struct ListNode { string data; ListNode *next; }; int main() { ListNode *p, *list; list = new ListNode; list->data = "New York"; p new ListNode; p->data = "Boston"; list->next = p; p->next = new ListNode; p->next->data = "Houston"; p->next->next = nullptr; // new code goes here Which of the following code correctly deletes the node with value "Boston" from the list when added at point of insertion indicated above? O list->next = p; delete p; O p = list->next; %3D list->next = p->next; delete p; p = list->next; list = p->next; delete p; O None of these O p = list->next; %3D list->next = p; %3D delete p;