A distance meter has been programmed Meet: a) What is the problem with this code b) Implement a new feasible code in ARDUINO const int pingPin = 5; #include const int ledPin = LED_BUILTIN; void setup() { Serial.begin(9600); pinMode(ledPin, OUTPUT); } void loop() { int cm = ping(pingPin); Serial.println(cm); digitalWrite(ledPin, HIGH); delay(cm * 10); digitalWrite(ledPin, LOW); delay (cm * 10); }

A distance meter has been programmed Meet: a) What is the problem with this code b) Implement a new feasible code in ARDUINO const int pingPin = 5; #include const int ledPin = LED_BUILTIN; void setup() { Serial.begin(9600); pinMode(ledPin, OUTPUT); } void loop() { int cm = ping(pingPin); Serial.println(cm); digitalWrite(ledPin, HIGH); delay(cm * 10); digitalWrite(ledPin, LOW); delay (cm * 10); }

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

The word "cat" can be spelled from the period table element symbols by using the sequence of elements carbon and astatine in that order. Since the symbol for carbon is "C" and the symbol for astatine is "At", which together makes [C][At]; thus, "cat" is an elemental phrase. To determine which elements can be used all combinations of 1 and 2 letter element symbols must be tested. Write a java program to determine if a lowercase word can be made with any combination of 1 or 2 letter element symbols from the periodic table. The list elements will come from a text file containing all the atomic elements and their symbols. The user will enter a lowercase word to check for from the keyboard. Assume the word is properly spelled but check for all lowercase letters. Output to the screen the list of chemical elements if it can be made from the element symbols following the format as seen below, if not output: "No element phrase possible." Output all possible solutions if applicable. Finally, ask…
explain these python codes with comments , explain briefly >>> import numpy as np >>> example_input = [1, .2, .1, .05, .2] >>> example_weights = [.2, .12, .4, .6, .90] >>> input_vector = np.array(example_input) >>> weights = np.array(example_weights) >>> bias_weight = .2 >>> activation_level = np.dot(input_vector, weights) +\ ... (bias_weight * 1) >>> activation_level 0.674 With that, if you use a simple threshold activation function and choose a threshold of .5, your next step is the following: >>> threshold = 0.5 >>> if activation_level >= threshold: ... perceptron_output = 1 ... else: ... perceptron_output = 0 >>> perceptron_
C++ Given an integer num, repeatedly add all its digits until the result has only one digit, and return it. Example 1: Input: num = 38 Output: 2 Explanation: The process is 38 --> 3 + 8 --> 11 11 --> 1 + 1 --> 2 Since 2 has only one digit, return it. Example 2: Input: num = 0 Output: 0 Constraints: 0 <= num <= 231 - 1 Follow up: Could you do it without any loop/recursion in O(1) runtime? //code here class Solution {public: int addDigits(int num) { }}; //
write a Java Netbeans codes and provide output screenshots of the Netbeans Designs. check bellow codes required to be followed in the question. GrossSalary=BASICPAY+HRA+TA+DA+BONUS+MEDICAL+EDUCATION ALLOWANCE 5000 TAX=30% of Grosssal 30/100*Gross =1500 ro Netsal= grosssalary-Tax 5000-1500=3500 If(gross>=5000) Tax=(0.3)*gross Else If (gross>=3000 && gross<5000) Tax=20% of gross If(gross>=1500 && gross <3000) Tax=5* of gross Else Tax=0.0
my code is getting errors and i cant figiure out why , can you check my code and help me fix the errors . written in c code. It needs to print out a maze and as you hit enter you go through the maze. #include <stdio.h>#include <stdlib.h> #define XSTART 2#define YSTART 0 #define DOWN 0#define RIGHT 1 #define UP 2#define LEFT 3 void mazeTraverse(char maze [12][12],int xCor,int yCor,int dir);int checkForEdge(int x , int y);int correctMoves (char maze[][12],int r , int c );void displayMaze (char maze [][12]); int main (void){ char maze [12] [12] ={{'#','#','#','#','#','#','#','#','#','#','#','#'}, {'#','.','.','.','#','.','.','.','.','.','.','#'}, {'.','.','#','.','#','.','#','#','#','#','.','#'}, {'#','#','#','.','#','.','.','.','.','#','.','#'}, {'#','.','.','.','.','#','#','#','.','#','.','.'}, {'#','#','#','#','.','#','.','#','.','#','.','#'}, {'#','.','.','#','.','#','.','#','.','#','.','#'}, {'#','#','.','#','.','#','.','#','.','#','.','#'},…
write in C for a STM32F446RE microcontroller Write a source library that contains the with the following public functions: void keypadInit(void); /Initiallized the GPIO to read the keypad. uint16_t readKeypad(void); //Returns the state of all of the keypad buttons in the return value at the moment the function is called. void decodeKeypad(uint16_t, char *); //Takes the state of the keypad and returns (by reference) an array of the key's pressed. The library should work with the following main: int main (void) { uint16_t key; char carray[17]; keypadInit(); while(1) { while(!(key = readKeypad())); /*Get which keys pressed*/ decodeKeypad(key, carray); /*What are those keys*/ printf("%s\n",carray); /*Print those keys to screen*/ while(readKeypad() == key); /*Wait for the keypad to change*/ }} Problem 1: Write a library that works with the following pin assignments Row 0 -> PC0 Row 1 -> PC2 Row…
In java pls! Thank you! In many cryptographic applications the Modular Inverse is a key operation. This programming problem involves finding the modular inverse of a number. Given 0 < x < m, where x and m are integers, the modular inverse of x is the unique integer n, 0 < n < m, such that the remainder upon dividing x × n by m is 1. That is, x × n mod m = 1. Modular inverse is a concept that extends the arithmetic inverse. For example, the inverse of 2 is ½ because 2 x ½ = 1 with decimal operation. Here the inverse number can be a fraction. In modular inverse, we only allow integers, no fraction. So not all integer has an inverse. For example, m = 26, x = 3, the modular inverse of 3 is 9 because 3 x 9 mod 26 = 1. However, m = 26, x = 2, the modular inverse of 2 does not exist because you cannot find a number y so that 2 x y mod 26 = 1. Here is another example, m = 17, 4 x 13 = 52 = 17 x 3 + 1, so the remainder when 52 is divided by 17 is 1, and thus 13 is the inverse…
Problem Statement: Consider a permutation of numbers from 1 to N written on a paper. Let’s denote the product of its element as ‘prod’ and the sum of its elements as ‘sum’. Given a positive integer N, your task is to determine whether ‘prod’ is divisible by ‘sum’ or not. Input Format: First input will be an integer T. It depicts a number of test cases. Followed by the value for each test case. Each test case will contain an integer N (1<= N <=10^9). It is nothing but the length of the permutation. Output Format: For each test case, print “YEAH” if ‘prod’ is divisible by ‘sum’, otherwise print “NAH”..
Please written by computer source Question 1: Suppose we wish to write a procedure that computes the inner product of two vectors u and v. An abstract version of the function has a CPE of 14–18 with x86- 64 for different types of integer and floating-point data. By doing the same sort of transformations we did to transform the abstract program combine1 into the more efficient combine4, we get the following code: Our measurements show that this function has CPEs of 1.50 for integer data and 3.00 for floating-point data. For data type double, the x86-64 assembly code for the inner loop is as follows: Assume that the functional units have the characteristics listed in Figure 5.12. **See last page for figures A. Diagram how this instruction sequence would be decoded into operations and show how the data dependencies between them would create a critical path of operations, in the style of textbook Figures 5.13 and 5.14. vmovsd vmovsd vmulsd vaddsd | | | |…
I need to write a recursive Java program to count the number of muck-free regions in a lagoon. The Lagoon is represented by a rectangle of N x M squares. Each square contains either muck ('M') or sand ('.'). A region is defined as a connected set of one of more squares with sand in it, where a square is considered to connect to all eight of its adjacent squares. Sample input/output is shown in picture attached
Question 2: You are given a grid of size N x N where each cell contains a non-negative integer. You need to find the maximum sum of a path from the top-left corner to the bottom-right corner. You can only move to the right or down from each cell. Apply a dynamic programming algorithm to solve this problem and explain your approach 1. Write a text explanation of your solution in a step by step. 2. Provide a Java solution code of your proposed solution and run it on the following input int grid={(1, 3, 1}, {1, 5, 1}, {4, 2, 1}};
1: |R|←|P| Reserve space for |P| = 13 values.2: x ← n3: for i ← 0 ...(|P| − 1) do4: c ← x div Pi Number of multiplicands Pi in x.5: Ri ← c6: x ← x − c · Pi7: end for8: return RA Java programmer could implement Algorithm by first modelling the primitivenumbers with the enumeration type RomanNumeral. Each enum constant (I, IV, ..., M) is declared with its decimal value, which can be accessed with the function getValue().