What is printed by the following code segment?for (int myVariable = 1; myariable <= 8; myVariable++)switch (myVariable){pow?"; break;wow?"; break;low?"; break;case 5: cout <« " row?"; break;cow?"; break;now?"; break;case 2: cout « " How?"; break;case 1: cout <« " brown?"; break;case 8: cout <<%3Dcase 7: cout <<%3Dcase 6: cout <<%3Dcase 4: cout <<%3Dcase 3: cout <<}A. brown? How? now? cow?B. brown? How? now? cow? row? low? wow? pow?C. pow? wow ? low? row? cow? now? How? brown?D. cow? now? How? brown?

The correct is ("cow?now?how?brown?") Option("D") Explanation If the break statement is located…

Answered: What is printed by the following code…

Engineering

Computer Science

What is printed by the following code segment?

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

In Java code: In Java code: In a game of Tic Tac Toe, two players take turns making an available cell in a 3 x 3 grid with their respective tokens (either X or O). When one player has placed three tokens in a horizontal, vertical, or diagonal row on the grid, the game is over and that player has won. A stalemate occurs when all the cells on the grid have been filled with tokens and neither player has achieved a win. Code a program that emulates a Tic Tac Toe game. When you are done, a typical session will look like this: Welcome to tic-tac-toe. Enter coordinates for your move following the X and O prompts. 1 2 3A | | -----B | | -----C | |X:A2 1 2 3A |X| -----B | | -----C | |O:B3 1 2 3A |X| -----B | |O -----C | | And so on. Illegal moves will prompt the user again for a new move. A win or a stalemate will be announced, mentioning the winning side if any. The program will terminate whenever a single game is complete. For this lab, you will be…
In the Happy Valley School System, children are classified by age as follows: less than 2, ineligible2, toddler3-5, early childhood6-7, young reader8-10, elementary11 and 12, middle13, impossible14-16, high school17-18, scholargreater than 18, ineligible Given an int variable age , write a switch statement that prints out the appropriate label from the above list based on age
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].
In a game of tic-tac-toe, two players take turnsmarking an available cell in a 3 x 3 grid with their respective tokens (either Xor O). When one player has placed three tokens in a horizontal, vertical, or diagonalrow on the grid, the game is over and that player has won. A draw (no winner)occurs when all the cells on the grid have been filled with tokens and neitherplayer has achieved a win. Create a program for playing a tic-tac-toe game.The program prompts two players to alternately enter an X token and O token.Whenever a token is entered, the program redisplays the board on the console anddetermines the status of the game (win, draw, or continue). Here is a sample run:
You have a fence post located at the point (x,y) where a goat is tethered by a rope. You also have a house, which is a rectangle with diagonally opposite corners at the points bottom-left: (x1,y1) and top-right: (x2,y2). You want to pick a length of rope that guarantees the goat cannot reach the house. Determine the minimum distance from the fence post to the house, so that you can make sure to use a shorter rope. Recall that the distance formula is: sqrt( (x2−x1)^2+(y2−y1)^2 ) The input consists of a single line containing six space-separated integer values: x, y, x1, y1, x2, and y2. You are guaranteed that x1<x2 and y1<y2, and that (x,y) is strictly outside the axis-aligned rectangle with corners at (x1,y1) and (x2,y2). Return the minimum distance from the goat’s post to the house as a floating-point value from main(). Learning Objectives Be able to create a program with a lesser template. Be able to calculate the min/max of integers. Be able to write a mathematical…
Use the following code to perform the following tasks: Show all variables that are visible at POSITION #1 only. Provide their nesting level and offset, using the activation record layout discussed in class.S2how the contents of the call stack at the time when control reaches POSITION #1. Use the layout defined in chapter 10 and used in class for statically scoped languages that allow nested functions. Show values and links. function main() {int w = 1, x = 2; function a(bool flag) {int x = 3; function b() { c(4); } function c(int x) {// POSITION #1 } b(); } a(true); } Provide a leftmost derivation for the string aaabb using the following grammar:<S> → <A><B> <A> → a<A> | a <B> → b<B> | b Identify the shortest possible legal program: <program> → program <ident> ( <ident> { , <ident> } ) <block> <ident> → A | B<block> → begin <stmts> end <stmts> → <ident> = <ident> |…
Using the program shown below, explain what will be output at Line A. Assume that fork() completes successfully. #include <sys/types.h> #include <stdio.h> #include <unistd.h> int value = 40; int main() { pid_t pid; pid = fork(); if (pid == 0) { value += 30; } else if (pid > 0) { wait(NULL); printf(“PARENT: value = %d”, value); //Line A exit(0); } }
Do in C++ programming A game to collecting coins. In level # 1, whenever the player takes a coin, the next coin is automatically blocked with an iron brick. Which coins should the player take in order to maximize his gains? EXAMPLE: COINS IN ORDER 3$ 9$ 2$ 7$ 3$ 6$ 9$ 1$ START COLLECTING COINS = (SKIP 3$) (TAKE 9$) (AUTOMATICALLY BLOCKED 2$) (TAKE 7$) (AUTOMATICALLY BLOCKED 3$) (SKIP 6$) (TAKE 9$) (AUTOMATICALLY BLOCKED 1$) = TOTAL COINS WILL BE 25$ (max coins) In level # 2, the same rules of level 1 apply, but with a twist: the player have a bag that can take only a limited number of coins. Which coins can the player take in order to maximize his gains (provided that the coins fit inside his bag)? fill the code: #include #include using namespace std; unsigned max_coins(vector coins, unsigned capacity) { //code here } int main() { vector coins = {3, 9, 2, 7, 3, 6, 9, 1}; unsigned capacity = 3; cout << max_coins(coins, capacity) << endl;…
Do in C++ programming A game to collecting coins. In level # 1, whenever the player takes a coin, the next coin is automatically blocked with an iron brick. Which coins should the player take in order to maximize his gains? EXAMPLE:COINS IN ORDER 3$ 9$ 2$ 7$ 3$ 6$ 9$ 1$ START COLLECTING COINS = (SKIP 3$) (TAKE 9$) (AUTOMATICALLY BLOCKED 2$) (TAKE 7$) (AUTOMATICALLY BLOCKED 3$) (SKIP 6$) (TAKE 9$) (AUTOMATICALLY BLOCKED 1$) = TOTAL COINS WILL BE 25$ (max coins) In level # 2, the same rules of level 1 apply, but with a twist: the player have a bag that can take only a limited number of coins. Which coins can the player take in order to maximize his gains (provided that the coins fit inside his bag)? Implement the following function for level# 2 using C++: unsigned max_coins(vector<unsigned> coins, unsigned capacity)
IN HASKELL PROGRAMMING LANGUAGE PLEASE In case you do not know it: the game is played on a 3x3 grid that is initially empty. Two players are playing, by alternatingly making moves. A move by a player places their token (an X for player 1, an O for player 2) into a cell that was empty. We are using algebraic notations for indexing the positions in the board, with A,B,C indexing the columns and 1,2,3 the rows. Specifically, these coordinates would be used in the implementation for moves made by a human player. If the X X O Figure 1: Sample board position same token appears 3 times in any of the three columns, three rows or two main diagonals the game is over and that player wins. If the grid is filled without that happening the game is a draw. For the depicted board, we have Xs in positions C3 and A2, and an O in position B1. It would be O’s turn to make a move; a legal move would be C2, but it is not a good move, because X can force a win by responding A1. O cannot force a win, but…
What are the effects, if any, of each of the following C++ statements? a. trail = temp->link;trail->link = nullptr;delete last;last = trail;b. temp->link = last;c. first->info = 58;d. q = current->link;current->link = temp;delete q;e. q = p->link->link->link;q->info = 60;f. p->link = temp;
197. ___________________ frees the space occupied by a block as soon as the final tuple of that block has been processed. a. Replacement strategy b. Forced strategy c. Toss immediate strategy d. Most recently used