9 10 11 13 14 15 16 ******* * Complete th * The funct 17 * The funct 1. INTE 2. STRI 4 3. INT 18 ★ 4. IN 19 *1 20 21 vector int m ALL 1. Get the Groups As new students begin to arrive at college, each receives a unique ID number, 7 to n. Initially, the students do not know one another, and each has a different circle of friends. As the semester progresses, other groups of friends begin to form randomly. There will be three arrays, each aligned by an index. The first array will contain a queryType which will be either Friend or Total. The next two arrays, students 1 and students2, will each contain a student ID. If the query type is Friend, the two students become friends. If the query type is Total, report the sum of the sizes of each group of friends for the two students. Example n = 4 12 >

9 10 11 13 14 15 16 ******* * Complete th * The funct 17 * The funct 1. INTE 2. STRI 4 3. INT 18 ★ 4. IN 19 *1 20 21 vector int m ALL 1. Get the Groups As new students begin to arrive at college, each receives a unique ID number, 7 to n. Initially, the students do not know one another, and each has a different circle of friends. As the semester progresses, other groups of friends begin to form randomly. There will be three arrays, each aligned by an index. The first array will contain a queryType which will be either Friend or Total. The next two arrays, students 1 and students2, will each contain a student ID. If the query type is Friend, the two students become friends. If the query type is Total, report the sum of the sizes of each group of friends for the two students. Example n = 4 12 >

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

Code for an algorithm to: We begin with two pointers, keeping a low and a high -> finding the midpoint and comparing it to the number we want to discover. If the goal number is greater, we move to the right because the array is sorted. If it's less than that, we shift to the left because it can't be on the right side, where all the numbers are greater than the midpoint.
Q6/ A: Write a program that reads three issues and arranges them in a differential order? B: Write Chain-Generating Program: 0,1,1,2,3,5,8,13,21,34,55,89,144,233,.. The user determines the chain length? Q7: A: Proof that the next matrix is vertical: 1 2 2 -1 4 10 -1 B: Write a program that provides the user with the possibility to draw one of the following functions as chosen: Sin, cos, log, exp, tan, 1/x, 1/log(x), 1/x Q8: A: what is data? What is a data network? What is a converged. B: Describe network- supported technologies that impact how people learn „work,and play. Q9: A: Compare and contrast the layers of the OSI model with the TCP/IP protocol stack.
R5
Jupyter Notebook Fixed Income - Certicificate of Deposit (CD) - Compound Interest Schedule An interest-at-maturity CD earns interest at a compounding frequency, and pays principal plus all earned interest at maturity. Write a function, called CompoundInterestSchedule, that creates and returns a pandas DataFrame, where each row has: time (in years, an integer starting at 1), starting balance, interest earned, and ending balance, for an investment earning compoundedinterest. Use a for(or while) loop to create this table. The equation for theith year's ending balance is given by: Ei =Bi (1+r/f)f where: Ei is year i's ending balance Bi is year i's beginning balance (note: B1 is the amount of the initial investment (principal) r is the annual rate of interest (in decimal, e.g., 5% is .05) f is the number of times the interest rate compounds (times per year) The interest earned for a given year is Ei - Bi Note the term of the investment (in years) is not in the above equation; it is used…
Code in C. Solve the code below. write a function that receives a vector of integers already sorted in ascending order, an integer n represents the number of elements in this vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The binary search works as follows: you must look for the element in the position exactly in the half of the vector, if for the searched it returns the number of tests done so far, if not for the searched, calculate the midpoint of the half of the vector after assess whether the searched value is greater or less than the value at the middle position. Not finding the value searched, the function must return 0. The name of the function will be called "busca_bin". int busca_bin (int vetor [ ], int n, int b){ #include <stdio.h> int busca_bin(int vetor[] , int n , int a) { int s1 = 0; int s2 = n-1; int pass = 0; int s3; while(s1<s2) { s3 = (s1+s2)/2; pass++;…
Code in C. Solve the code below. Write a function that takes a vector of integers, an integer n representing the number of elements in that vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The sequential search works as follows: you must look at all the elements of the vector until you find the b, from the first to the last. The function must return an integer representing how many elements the function tested until it found b. If it does not find the function, it must return 0. The name of the function must be called "busca_seq". int busca_seq(int vetor[], int n, int b) { //your code } My Code #include<stdio.h> int busca_seq(int vetor[], int n, int b) { int i; for(i = 0; i < n; i++){ if(vetor[i] == b) return (i+1); } { int vet[5],n = 5,b,x; vet[0] = 1; vet[1] = 2; vet[2] = 3; vet[3] = 4; vet[4] = 5; scanf("%d",&b); x = busca_seq(vet,n,b); printf("%d",x); return 0; } }
You are developing program to control operations of small bus transport companies. You should design and develop a class that will be used to create objects that hold information about their routes. The information kept about each route includes: • Route number • Departure time • Bus type • Seat capacity • Seats sold • Route departure town (i.e. the starting point) Route destination town (i.e. the other end point) • Additional information Behaviour - Functions of this class: • Constructor - default constructor, all data members initialised to default values. • Constructor - takes the route number, seat capacity, departure and destination as input parameters. A check_available_seats function that returns the number of unsold (still available) seats on the route; • A sell_seats function that takes as a parameter the number of seats a customer requires. If there are sufficient seats available the seats sold is increased by that amount. If there are
numStudents is read from input as the number of input values in the vector that follow. Use two for loops to output all numStudents elements of vector walkingLogs that are: even integers • odd integers ● For both loops, follow each element with a space, including the last element, and end with a newline. Ex: If the input is 8 11 30 70 39 69 29 138 162, then the output is: 30 70 138 162 11 39 69 29 3 using namespace std; 4 5 int main() { 6 7 8 9 10 11 12 13 14 15 16 17 18 19} int numStudents; int i; cin >> numStudents; vector walkingLogs (numStudents); for (i = 0; i > walkingLogs.at(i); } * Your code goes here */ return 0; ►
Write a function named cumulative that accepts as a parameter a reference to a vectorof integers, and modifies it so that each element contains the cumulative sum of the elements up through that index. For example, if the vector passed contains {1, 1, 2, 3, 5}, your function should modify it to store {1, 2, 4, 7, 12}.
Code in C. Solve the code below. Write a function that takes a vector of integers, an integer n representing the number of elements in that vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The sequential search works as follows: you must look at all the elements of the vector until you find the b, from the first to the last. The function must return an integer representing how many elements the function tested until it found b. If it does not find the function, it must return 0. The name of the function must be called "busca_seq". int busca_seq(int vetor[], int n, int b) { //your code } My Code #include<stdio.h> int busca_seq(int vetor[], int n, int b) { int i; for(i = 0; i < n; i++){ if(vetor[i] == b) return (i+1); } { int vet[5],n = 5,b,x; vet[0] = 1; vet[1] = 2; vet[2] = 3; vet[3] = 4; vet[4] = 5; scanf("%d",&b); x = busca_seq(vet,n,b); printf("%d",x); return 0; } }
Task 1. Area between two curves Consider the graphs of the functions f(x) = m-x and g(x) = 2x². - n where m and n are the maximum and mean values of the digits in your student-ID number. student-ID number=201904598 a) Create a vector v whose elements are the digits of your student-ID number. b) Create a variable m and assign the maximum digit in v to it. c) Create a variable n and assign the mean value of the digits in v to it. d) Define the function f(x) and g(x) above as anonymous functions. e) Plot the graphs of f(x) and g(x) on the same figure using the MATLAB function ezplot. f) Find the exact values of the x-coordinates of the intersection points between the two graphs using the MATLAB function solve. g) Find the area bounded by the two graphs.
Transcribed Image Text Q} Code the given problem using python programming language Sereja has an array consisting of n integers a1 < a2 <... < an. Based on this array, he has to answer m queries represented by pairs integers t and d. The answer for a query is the smallest integer i for which there exist some k ( i < k) such that a; + d > a;+1, a; +1 + d2 a;+2, ..., ar – 1 + d> ak, ak <t and ar+1 > t (if it exists).