CM an Links https://learn.zybooks.com/zybook/CUNYCMP167Spring2024/chapter/4/section/2 CUNY Links Books My library > CMP 167: Programming Methods 1 - Spring '24 home > 4.2: Detecting equal values with branches Jump to level 1 Write an if-else statement for the following: If userTickets is equal to 8, execute award Points 1. Else, execute award Points= userTickets. Ex: If userTickets is 3, then award Points = 3. 1 import java.util.Scanner; 2 3 public class TicketCounter { 4 5 6 18 Review Submission History: PDI X zy Section 4.2-CMP 167: Program X 11 12 $22 public static void main (String [] args) { } int awardpoints; int userTickets; E Scanner scnr = new Scanner (System.in); userTickets = scnr.nextInt (); // Program will be tested with values: 6, 7, 8, 9. /* Your code goes here *A I System.out.println(awardpoints);

CM an Links https://learn.zybooks.com/zybook/CUNYCMP167Spring2024/chapter/4/section/2 CUNY Links Books My library > CMP 167: Programming Methods 1 - Spring '24 home > 4.2: Detecting equal values with branches Jump to level 1 Write an if-else statement for the following: If userTickets is equal to 8, execute award Points 1. Else, execute award Points= userTickets. Ex: If userTickets is 3, then award Points = 3. 1 import java.util.Scanner; 2 3 public class TicketCounter { 4 5 6 18 Review Submission History: PDI X zy Section 4.2-CMP 167: Program X 11 12 $22 public static void main (String [] args) { } int awardpoints; int userTickets; E Scanner scnr = new Scanner (System.in); userTickets = scnr.nextInt (); // Program will be tested with values: 6, 7, 8, 9. /* Your code goes here *A I System.out.println(awardpoints);

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

Lab Assignment 1: Vigenere Cipher Overview: You are required to implement the Vigenere Cipher using any programming language of your choice. Your program should be able to encrypt any given message written in text. Your program should allow the user to submit a message for encryption (the message must use text only). You should use the following message to demonstrate the encryption: “Party on the Quad." Your program should allow the user to input the key for performing the encryption. Please use the following key to demonstrate the encryption process: "Homecoming."
bool isSubsetOf(const IntSet& otherIntSet) const// Pre: (none)// Post: True is returned if all elements of the invoking IntSet// are also elements of otherIntSet, otherwise false is// returned.// By definition, true is returned if the invoking IntSet// is empty (i.e., an empty IntSet is always isSubsetOf// another IntSet, even if the other IntSet is also empty). bool isSubsetOf(const IntSet& otherIntSet) const; bool IntSet::isSubsetOf(const IntSet& otherIntSet) const{ cout << "isSubsetOf() is not implemented yet..." << endl; return false; // dummy value returned}
C++ in visual studio: Implement it completely with copy constructor, overloaded assignment operator and destructor. Then, in main, type an application that creates 2 numbers, sums them, and assigns the result to a new number. for example ; Number 1 (18,32) Number 2 (15.09) - - - - - - - - - - - + Number 3 ( 33,41)
C++ A robot is initially located at position (0; 0) in a grid [?5; 5] [?5; 5]. The robot can move randomly in any of the directions: up, down, left, right. The robot can only move one step at a time. For each move, print the direction of the move and the current position of the robot. If the robot makes a circle, which means it moves back to the original place, print "Back to the origin!" to the console and stop the program. If it reaches the boundary of the grid, print \Hit the boundary!" to the console and stop the program. A successful run of your code may look like:Down (0,-1)Down (0,-2)Up (0,-1)Left (-1,-1)Left (-2,-1)Up (-2,0)Left (-3,0)Left (-4,0)Left (-5,0)Hit the boundary! or Left (-1,0)Down (-1,-1)Right (0,-1)Up (0,0)Back to the origin! About: This program is to give you practice using the control ow, the random number generator, and output formatting. You may use <iomanip> to format your output. You may NOT use #include "stdafx.h".
3. Card Flipper: You walk into a room, and see a row of n cards. Each one has a number x; written on it, where i ranges from 1 to n. However, initially all the cards are face down. Your goal is to find a local minimum: that is, a card i whose number is less than or equal to those of its neighbors, xj-1 = X; <= Xj+1. The first and last cards can also be local minima, and they only have one neighbor to compare to. There can be many local minima, but you are only responsible for finding one of them. Obviously you can solve this problem by turning over all n cards, and scanning through them. However, show that you can find such a minimum by turning over only O(log n) cards.
Python Assignment: Tests if the BCFile class can properly handle initiate -> append -> close -> open -> read (iacor) cases
// Assume all libraries are included void QQ(int n); // int main () { // Random questions QQ (5) ; 3 4 6. 7 8. 9. 10 return 0; 11 } // void QQ(int n) 12 13 14 { if(n >= 1) { 15 16 17 cout << n; QQ (--n); } else 18 19 20 21 cout << n; 22 } // 23
Computer Science using java The program has to evaluate arithmetic expressions using a BST for thatpurpose. The rules are the following:The program asks the user to enter an arithmetic expression in the infixformat. Then the program builds a BST for that expression. After buildingthe BST, a menu will be present to the user allowing him to: traverse the BST in inorder, traverse the BST in postorder, traverse the BST in preorder.Users will choose among the options present. The result will be thedisplay of the original arithmetic expression and the new one thatdepends on the option chosen. The program should repeat as long as theuser wants.
Computer Engineering HandsOn Lab: The Government of United States of America has decided to issue new currency notes with special protection features to so as to commemorate a great mathematician. They have decided to issue notes summing up to N and all the sums from 1 to N should only made by selecting some of the notes in only one unique way. With n = 5 the sets {1,1,1,1,1}, {1,2,2}, {1,1,3} are valid. Your task is to design a C++ code that output the solution in one line. Sample Input - 100 Sample Output - 3
Knight's Tour: The Knight's Tour is a mathematical problem involving a knight on a chessboard. The knight is placed on the empty board and, moving according to the rules of chess, must visit each square exactly once. There are several billion solutions to the problem, of which about 122,000,000 have the knight finishing on the same square on which it begins. When this occurs the tour is said to be closed. Your assignment is to write a program that gives a solution to the Knight's Tour problem recursively. You must hand in a solution in C++ AND Java. The name of the C++ file should be "main.cc" and the name of the Java file should be "Main.java". Write C++ only with a file name of main.cc Please run in IDE and check to ensure that there are no errors occuring Output should look similar to: 1 34 3 18 49 32 13 16 4 19 56 33 14 17 50 31 57 2 35 48 55 52 15 12 20 5 60 53 36 47 30 51 41 58 37 46 61 54 11 26 6 21 42 59 38 27 64 29 43 40 23 8 45 62 25 10 22 7 44 39 24 9 28 63
void traceMe(double x, double y) { double z; z = (pow(x, y)); cout « fixed « showpoint <« setprecision(2)<« x « ", " « y « ", " « z « endl; int main() double one=2, two=6; traceMe(two, one); 2.00 , 6,00 , 36.00 6.00 , 2.00 , 36.00 6.00 , 2,00 , 64.00 O 6.00, 2.00, 4,00
bool validPassword=true; cin >> passPhrase;} if (passPhrase.length() <= 4) { validPassword = false; } else { int digitCount=0; for (int i = 0; i < passPhrase.length(); i++) { if (isdigit(passPhrase.at(i))) digitCount++; } if (digitCount > 4) { validPassword=false; } if (validPassword) { cout << "Valid" << endl; } else { cout << "Invalid" << endl; } return 0;} // it still comes up with these errors. Not sure what it is telling me. main.cpp:9:7: error: expected unqualified-id before ‘if’ 9 | if (passPhrase.length() <= 4) { | ^~ main.cpp:13:7: error: expected unqualified-id before ‘else’ 13 | else { | ^~~~