Answered: s1 = "List or Tuple?" s2 =…

s1 = "List or Tuple?" s2 = "Dictionary!" What are the results of the following statements? (each statement is independent of the rest) s1= = s2 s1+ s2 2*s2 s1 s2 s1!=s2 s1.append(s2) W

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

#include <iostream>#include <string.h>using namespace std;int index1(char *T,char *P){int t=0,p=0,i,j,r;t = strlen(T);p = strlen(P);i=0;int max = t - p + 1;while(i<max){for(j=0;j<p;j++){if(P[j]==T[i+j]){r = i;break;}else r = -1;}i++;}return r;} int main(){ int l;char c[100];char d[100];cout<<"Enter First String\n"; cin>>c;cout<<"Enter Second String\n";cin>>d;l = index1(c,d);cout<<l; return 0;} Note: Remove Funcation
/*Line 1:*/ doublevalues[6] = {10, 20, 30, 40, 50, 60}; /*Line 2:*/ double* yalptr= values; /*Line 3:*/ cout << 3*values[1] + yalptr[3] + *(valptr + 2); A. What is 3*values[1] equal to in Line 3? (Explain) B. What is yalptr[3] equal to in Line 3? (Explain)
public List<String> getLikes(String user) This will take a String representing a user (like “Mike”) and return a unique List containing all of the users that have liked the user “Mike.” public List<String> getLikedBy(String user) This will take a String representing a user (like “Tony”) and return a unique List containing each user that “Tony” has liked. create a Main to test your work. import java.io.BufferedReader;import java.io.FileReader;import java.io.IOException;import java.util.ArrayList;import java.util.Arrays;import java.util.HashMap;import java.util.HashSet;import java.util.List;import java.util.Map;import java.util.Set; public class FacebookLikeManager { public List<String> facebookMap; private Set<String> likesSets; public FacebookLikeManager() { facebookMap = new ArrayList<>(); likesSets = new HashSet<>(Arrays.asList("Mike","Kristen","Bill","Sara")); } public void buildMap(String filePath) {…
*Coding language is Python Write a program that opens the productsales.txt file and reads the sales into a list. The program should output the following information, in this order: The total of all sales in the list The average of all sales in the list The lowest sale in the list The highest sale in the list NOTE: Your program should include at least one user-defined function, in addition to the main function. 4147 1594 2235 8433 10000 129 5555 7030 9764 7465 1111 4444 8954 2243 2895 1436 4978 5486 1436 9846 4789 8456 2497 2280 6375
INT_MIN = -32767 def cut_rod(price): """ Returns the best obtainable price for a rod of length n and price[] as prices of different pieces """ n = len(price) val = [0]*(n+1) # Build the table val[] in bottom up manner and return # the last entry from the table for i in range(1, n+1): max_val = INT_MIN for j in range(i): max_val = max(max_val, price[j] + val[i-j-1]) val[i] = max_val return val[n] # Driver program to test above functionsarr = [1, 5, 8, 9, 10, 17, 17, 20].
zain IQ لا توجد خدمة docs.google.com Q #includeusing namespace std; int main (){ int a[100]; int i, n „large ;cout>a[i]; }large =a[0];for (i=O ; i<=99 ; i++)if (larg < a[i])larg = ali] ;cout<<" largest value in the array = "<< larg ;return 0;} true False The general form of (One- Dimensional Arrays) is:Type Array Name [number of elements] * True False Char a[5][6]; *
What will the following code display?names = ['Jim', 'Jill', 'John', 'Jasmine']if 'Jasmine' not in names:print('Cannot find Jasmine.')else:print("Jasmine's family:")print(names)
C++ Code: The chef gives you an A sequence of N's length. Let X mean MEX for A sequence. The cook is interested in calculating the correct values k, so that, if the whole part of Ai A is replaced by max (Ai – k, 0), the MEX sequence remains X.. Find calculations for such values. If there are such endless numbers, print - 1 instead. As a friendly reminder, MEX sequence is the smallest non-negative number non-sequential. Input 1 4 1235 Output
Analyze the following code and fill in the output. ## Employee List name = ["Joe", "Janice", "Ahmed", "Maria"] ## create dictionaries for wages and hours ## Use variable names. as keys dWage = {"Joe":17.55, "Janice":12.35, "Ahmed":22.95, "Maria":18.75} dHours = {"Joe":40, "Janice":42, "Ahmed":37, "Maria":45} ## Caluculate gross pay for each employee if dHours [name [0]]>40: dGPO = dWage [name [0]] *40 + 1.5 * dWage [name [0]]* (dHours [name [0]]-40) dGPO = dWage [name [0] ] *dHours [name [0]] else: if dHours [name [1]]>40: dGP1 = dWage [name [1]] *40 + 1.5 * dWage [name [1]]* (dHours [name [1]]-40) dGP1 = dWage [name [1]] *dHours [name [1]] if dHours [name [2]]>40: dGP2 = dWage [name [2]]*40 + 1.5 * dWage [name [2]]* (dHours [name [2]]-40) dGP2 = dWage [name [2]] *dHours [name [2]] if dHours [name [3]]>40: dGP3= dWage [name [3]]*40 + 1.5 * dWage [name [3]]* (dHours [name [3]]-40) dGP3= dWage [name [3]] *dHours [name [3]] ## Display variable and results print (name [0], 'worked', dHours…
#include using namespace std; void scanPrice (string [], double []); // Do not modify the code double printReceipt(string [], double[]); // Do not modify the code int main () { double sum; string item [3] = {"Vegetable","Egg", "Meat"}; double price [3];| %3D scanPrice (item,price); sum = RrintReceipt (item,price); cout Price: 10 The price of Vegetable is RM 2 The price of Egg is RM 3 The price of Meat is RM 10 Your total expenses is RM 15
Q5: Declare a data structure student t for the record of a student as follows: string name //the name of the student int class //1,2,3,4 char group //a,b, c,d,. string subject // e.g. computer programming 3 marks_t notes // the notes of this subject
#include <iostream> using namespace std; int main(){ int a[100],n,i,item,loc=0; cout<<"Enter number of elements: "; cin>>n; cout<<"\nEnter numbers:\n"; for(i=1;i<=n;i++) { cin>>a[i]; } cout<<"\nEnter number to search:"; cin>>item; for(i=1;i<=n;i++) { if(item==a[i]) { loc=i; break; } } if(loc>0) { cout<<loc<<" is the location of item"; } else cout<<"\nno. not found";} Q: edit the code that shows after how many number of iteration searched value is found