#include "stdafx.h" #include using namespace std; int main(int argc, _TCHAR* argv[]) t char buff[100] int i strcpy(buff,"abc"); strcat(buff,"def"); strcpy(buff, "ghi"); strcat(buff,"jk1"); cout < "total buf "<< buff; for (i-0;i< strlen (buff) ; i++) cout << "partial buff "<

#include "stdafx.h" #include using namespace std; int main(int argc, _TCHAR* argv[]) t char buff[100] int i strcpy(buff,"abc"); strcat(buff,"def"); strcpy(buff, "ghi"); strcat(buff,"jk1"); cout < "total buf "<< buff; for (i-0;i< strlen (buff) ; i++) cout << "partial buff "<

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

C++ Given header is in image main.cpp #include "IntList.h" #include <iostream>using namespace std; int main(){cout << "Enter a test number(1-5): ";int test;cin >> test;cout << endl;//tests constructor, destructor, push_front, pop_front, displayif (test == 1) {cout << "\nlist1 constructor called";IntList list1;cout << "\npushfront 10";list1.push_front( 10 );cout << "\npushfront 20";list1.push_front( 20 );cout << "\npushfront 30";list1.push_front( 30 );cout << "\nlist1: ";list1.display();cout << "\npop";list1.pop_front();cout << "\nlist1: ";list1.display();cout << "\npop";list1.pop_front();cout << "\nlist1: ";list1.display();cout << "\npop";list1.pop_front();cout << "\nlist1: ";list1.display();cout << endl;}if (test == 1) {cout << "list1 destructor called" << endl;} //tests push_backif (test == 2) {cout << "\nlist2 constructor called";IntList list2;cout << "\npushback…
In C++ struct myGrades { string class; char grade; }; Declare myGrades as an array that can hold 5 sets of data and then set a class string in each position as follows: “Math” “Computers” “Science” “English” “History” and give each class a letter grade
Supplied code Document / Ch13_Ex11_MainProgram.cpp - given code below // Ch13_Ex11_MainProgram.cpp - given code below // #include "stdafx.h" may uncomment this if Visual Studios requires #include <iostream> #include "myArray.h" using namespace std; int main() { // Creates list1 and list2 myArray list1(5); myArray list2(5); // Zeroing (initializing) first array int i; cout << "list1 : "; for (i = 0; i < 5; i++) cout << list1[i] << " "; cout << endl; // Prompt to enter five numbers into list1 cout << "Enter 5 integers: "; for (i = 0; i < 5; i++) cin >> list1[i]; cout << endl; // show contents list1 cout << "After filling list1: "; for (i = 0; i < 5; i++) cout << list1[i] << " "; cout << endl; // Transfer five elements from list1 to list2, Print list2 list2 = list1; cout << "list2 : "; for (i = 0; i < 5; i++) cout << list2[i] << " "; cout << endl; // Write three…
#include <stdio.h>#include<stdlib.h>struct Distance{int feet;float inch;} dist1, dist2, sum;int main(){struct Distance* distance1 = NULL; struct Distance* distance2 = NULL; struct Distance* distance3 = NULL; distance1 = (struct Distance*)malloc(sizeof(struct Distance*));distance2 = (struct Distance*)malloc(sizeof(struct Distance*));distance3 = (struct Distance*)malloc(sizeof(struct Distance*));printf("input feet for distance no.1:");scanf("%d", &distance1->feet); printf("input inch for distance no.1:");scanf("%f", &distance1->inch); printf("input feet for distance no.2:");scanf("%d", &distance2->feet); printf("input inch for distance no.2:");scanf("%f", &distance2->inch); printf("input feet for distance no.3:");scanf("%d", &distance3->feet); printf("input inch for distance no.3:");scanf("%f", &distance3->inch); printf("1st distance\n");printf("Enter feet: ");scanf("%d", &dist1.feet); printf("Enter inch: ");scanf("%f",…
#include <stdio.h>#include <string.h>#define SIZE 6struct Student{char name[50];int id;float mark;};int Search1(char input[], struct Student data[]);int Search2(int input, struct Student data[]);int main() {char search_name[30];int search_id;int result1, result2;struct Student list[SIZE] = {{"Amylia", 544199, 75.4},{"Cheong", 143566, 92.3},{"Harry", 109774, 65.5},{"Krishnan", 334514, 86.7},{"Melissa", 257890, 55.4},{"Timothy",144656, 77.8}};printf("Enter Student Name: ");gets(search_name);result1 = Search1(search_name, list);//Answer for part (a)(ii) – Display the matching index of result1printf("Enter Student ID: ");scanf("%d",&search_id);result2 = Search2(search_id,list);//Answer for part (a)(iii)- Display the matching index of result2return 0;}//Answer for part (a)(i) – function definition for Search1//Answer for part (a)(iii) – function definition for Search2
C++ program complete the code here tasks. main.cc file #include <iostream> int main() { // =================== YOUR CODE HERE =================== // 1. Create a vector Pet objects called `pets`. // Don't forget to #include <vector> and "pet.h" // ====================================================== std::string name; std::string breed_name; std::string species; std::string color; double weight = 0.0; do { std::cout << "Please enter the pet's name (q to quit): "; std::getline(std::cin, name); if (name != "q") { std::cout << "Please enter the pet's species: "; std::getline(std::cin, species); std::cout << "Please enter the pet's breed: "; std::getline(std::cin, breed_name); std::cout << "Please enter the pet's color: "; std::getline(std::cin, color); std::cout << "Please enter the pet's weight (lbs): "; std::cin >> weight; std::cin.ignore(); // ===================…
What is the size of following following structure? struct S { char a; double b; char *c; char d[20]; int e; char f; short *g; short h; float *i;} my_struct; ___________________ Rearrange the above structure to preserve the memory. What is the optimal size of the new structure? ___________________________
Subtract each element in origList with the corresponding value in offsetAmount. Print each difference followed by a space. Ex: If origList = {4, 5, 10, 12} and offsetAmount = {2, 4, 7, 3}, print: 2 1 3 9 #include <iostream>#include <string.h>using namespace std; int main() { const int NUM_VALS = 4; int origList[NUM_VALS]; int offsetAmount[NUM_VALS]; int i; cin >> origList[0]; cin >> origList[1]; cin >> origList[2]; cin >> origList[3]; cin >> offsetAmount[0]; cin >> offsetAmount[1]; cin >> offsetAmount[2]; cin >> offsetAmount[3]; /* Your code goes here */ cout << endl; return 0;}
#include <stdio.h> #include<iostream> using namespace std; int array1[] = {1200, 200, 2300, 1230, 1543}; int array2[] = {12, 14, 16, 18, 20}; int temp, result = 0; int main() { for (temp = 0; temp < 5; temp++) { result += array1[temp]; } for (temp = 0; temp < 4; temp++) { result += array2[temp]; } cout << result; return 0; } What is the output of about C++ code?
T/F Suffix array can be created in O(nlogn) time.
#include <iostream>#include<iomanip>using namespace std; int main(){ const int ROW_HOURS=6; //declare variables const int CL_PAYRATE=2; double total_payout=0; double hours[ROW_HOURS][CL_PAYRATE]={ //declare array {0,12.85}, {0,12.85}, {0,12.85}, {0,11.75}, {0,11.75}, {0,11.15} }; cout<<fixed; cout<<setprecision(2); //setprecision of double values upto 2 decimal point for(int i=0;i<6;i++) //using loop get input from user { cout<<"Enter the hours worked by employee "<<i+1<<": "; cin>>hours[i][0]; //store values into hours } for(int i=0;i<6;i++) { double payout=hours[i][0]*hours[i][1]; //calculate payout of emplyee total_payout=total_payout+payout;…
#include <stdio.h>#include <stdlib.h>#include <time.h> struct treeNode { struct treeNode *leftPtr; int data; struct treeNode *rightPtr;}; typedef struct treeNode TreeNode;typedef TreeNode *TreeNodePtr; void insertNode(TreeNodePtr *treePtr, int value);void inOrder(TreeNodePtr treePtr);void preOrder(TreeNodePtr treePtr);void postOrder(TreeNodePtr treePtr); int main(void) { TreeNodePtr rootPtr = NULL; srand(time(NULL)); puts("The numbers being placed in the tree are:"); for (unsigned int i = 1; i <= 10; ++i) { int item = rand() % 15; printf("%3d", item); insertNode(&rootPtr, item); } puts("\n\nThe preOrder traversal is: "); preOrder(rootPtr); puts("\n\nThe inOrder traversal is: "); inOrder(rootPtr); puts("\n\nThe postOrder traversal is: "); postOrder(rootPtr);} void insertNode(TreeNodePtr *treePtr, int value) { if (*treePtr == NULL) { *treePtr = malloc(sizeof(TreeNode)); if (*treePtr != NULL) { (*treePtr)->data = value;…