CHALLENGE 2.7.2: Alphabetic detect. ACTIVITY Write code to print the location of any alphabetic character in the 2-character string passCode. Each alphabetic character detected should print a separate statement followed by a newline. Ex: If passCode is "9a", output is: Alphabetic at 1 Hint: Use two if statements to check each of the two characters in the string, using Character.isLetter(). 422784.2543518.qx3zqy7 1 import java.util.Scanner; 2 3 public class FindAlpha { 4 5 6 7 8 9 10 11 12 13} Run public static void main (String [] args) { Scanner scnr = new Scanner(System.in); String passCode; passCode = scnr.next(); if | } Doll 1 test passed All tests passed

CHALLENGE 2.7.2: Alphabetic detect. ACTIVITY Write code to print the location of any alphabetic character in the 2-character string passCode. Each alphabetic character detected should print a separate statement followed by a newline. Ex: If passCode is "9a", output is: Alphabetic at 1 Hint: Use two if statements to check each of the two characters in the string, using Character.isLetter(). 422784.2543518.qx3zqy7 1 import java.util.Scanner; 2 3 public class FindAlpha { 4 5 6 7 8 9 10 11 12 13} Run public static void main (String [] args) { Scanner scnr = new Scanner(System.in); String passCode; passCode = scnr.next(); if | } Doll 1 test passed All tests passed

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 <stdio.h>#include <stdlib.h>#include <unistd.h>#include <sys/types.h>#include <sys/wait.h> int main(){ int i, s; int a[] = {23,4,8,33,25,7,12,6,49,50,11,20,21,24,35}; pid_t pid; pid = fork(); if (pid == 0) { printf("I'm a child, I'll be printing the even numbers:\n"); for(i=0;i<(sizeof(a)/sizeof(int));i++) if(a[i]%2 == 0) printf("%d ",a[i]); } else { printf("I'm the parent, I'll be printing the odd numbers:\n"); if (pid > 0) pid = waitpid(pid, &s, 0); for(i=0;i<(sizeof(a)/sizeof(int));i++) if(a[i]%2 != 0) printf("%d ",a[i]); } return 0;} the output seem to have some error whereby it cannot output the number for the first if
8) Write a Java code segment to sum (total) only the positive (greater than zero) values contained in a one dimensional array of integers named intArr that has already been filled with a variety of values (from -250 to +250, for example) and print the final total of the positive contents with an appropriate message.
9.5.1: Use the addChoice method to add any needed instance variables. Provide a different implementation of ChoiceQuestion. Instead of storing the choices in an array list, the addChoice method should add the choice to the question text. For this purpose, an addLine method has been added to the Question class. ChoiceQuestion.java: /** A question with multiple choices.*/public class ChoiceQuestion extends Question{ // Add any needed instance variables, but don't store the choices // The choices should be added to the text of the superclass /* Your code goes here */ /** Constructs a choice question with a given text and no choices. @param questionText the text of this question */ public ChoiceQuestion(String questionText) { /* Your code goes here */ } /** Adds an answer choice to this question. @param choice the choice to add @param correct true if this is the correct choice, false otherwise */ public void…
6.28 In Python, Write a program that replaces words in a sentence. The input begins with word replacement pairs (original and replacement). The next line of input is the sentence where any word on the original list is replaced. Ex: If the input is: automobile car manufacturer maker children kids The automobile manufacturer recommends car seats for children if the automobile doesn't already have one. the output is: The car maker recommends car seats for kids if the car doesn't already have one. You can assume the original words are unique.
6.28 In Python, Write a program that replaces words in a sentence. The input begins with word replacement pairs (original and replacement). The next line of input is the sentence where any word on the original list is replaced. Ex: If the input is: automobile car manufacturer maker children kids The automobile manufacturer recommends car seats for children if the automobile doesn't already have one. the output is: The car maker recommends car seats for kids if the car doesn't already have one. You can assume the original words are unique. END WITH A NEW LINE
13. Implement function triangleArea(a,b,c) that takes as input the lengths of the 3 sides of a triangle and returns the area of the triangle. By Heron's formula, the area of atriangle with side lengths a, b, and c is √ s ( s−a )( s−b)( s−c ) , where s=(a+b+ c )/ 2 .>>> triangleArea(2,2,2)1.7320508075688772
5.18 C++ Write a program that reads a list of integers, and outputs those integers in reverse. The input begins with an integer indicating the number of integers that follow. For coding simplicity, follow each output integer by a comma, including the last one. Ex: If the input is: 5 2 4 6 8 10 the output is: 10,8,6,4,2,
Answer in java code a) Given this: int [][] tda = new int [12][25];Write a loop to print the fourth row of this two-dimensional array tda {assume the array is filled with data..}b) Write Java code (only the loop) to find the maximum value in the array Ab of type integer (use enhancedfor-loop): c) Write the output of this code:int [][] tda = {{5,99,88,2},{22,76,12,87,77,66},{34,88,13,4},{9,76,77,11}};tda[1][4] = -22;for(int q=0; q<tda[3].length; q++) System.out.print(tda[2][q] + " ");
iv) Write a JAVA program to merge two sorted arrays into a single sorted array. Take the sample arrays given below and print the result in the output. The time complexity of the program should be O(N+M) where N and M are the sizes of both the arrays. int []arr1 = {1, 6, 10, 14} int []arr2 = {2, 4, 5, 11, 16, 19} Print the merged array in the output.
bubblesort.h is in second picture This is bublesort.c int compare(Entry a, Entry b) {// IMPLEMENT}/*TEST: ./mergesort < test.inOUTPUT:1 lsdfjl2 ghijk3 ksdljf5 abc6 def*/int main(void) {// IMPLEMENT} this is test.in 55 abc6 def2 ghijk3 ksdljf1 lsdfjl
PYTHON CODE: In order to beat AlphaZero, Grandmaster Hikaru is improving her chess calculation skills.Today, Hikaru took a big chessboard with N rows (numbered 1 through N) and N columns (numbered 1 through N). Let's denote the square in row r and column c of the chessboard by (r,c). Hikaru wants to place some rooks on the chessboard in such a way that the following conditions are satisfied:• Each square of the board contains at most one rook.• There are no four rooks forming a rectangle. Formally, there should not be any four valid integers r1, c1, r2, c2 (≠r2,c1≠c2) such that there are rooks on squares (r1,c1), (r1,c2 (r2,c1)and (r2,c2).• The number of rooks is at least 8N.Help Hikaru find a possible distribution of rooks. If there are multiple solutions, you may find any one. It is guaranteed that under the given constraints, a solution always exists.InputThe first line of the input contains a single integer T denoting the number of test cases. The first and only line of each test…
Python code Here are n posts at particular directions on a plane. It is ensured that no three fence posts lie on a similar line. There are a limitless number of cows on the plane, one at each point with whole number directions. Gregor is an individual from the Illuminati, and needs to construct a three-sided fence, interfacing 3 unmistakable existing wall posts. A cow stringently inside the fence is supposed to be encased. In case there are an odd number of encased cows and the space of the fence is a whole number, the fence is supposed to be intriguing. Track down the quantity of intriguing wall. Information : The primary line contains the whole number n (3≤n≤6000), the quantity of fence posts which Gregor can decide to shape the vertices of a fence. Every one of the following n line contains two whole numbers x and y (0≤x,y≤107, x and y are even), where (x,y) is the arrange of a fence post. All fence posts lie at unmistakable directions. No three fence posts are on a similar…