Answered: ': The output of the following program…

': The output of the following program is for k=1:5 If (rem(k,3) #0 && floor (k/2 # k/2 && floor (k/5 # k/5) disp(k) end 24 1 135 O Other:

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

Analyze the following code. int x = 13B while (0 < x) && (x < 100) System.out .printin(x++); The numbers 2 to 100 are displayed. The code does not compile because the loop body is not in the braces. O The loop runs forever. The code does not compile because (0 < x) && (x < 100) is not enclosed in a pair of parentheses. The numbers 1 to 99 are displayed.
Change this code into a program that receives a number and prints its divisors.( C language) #include <stdio.h> int main() { unsigned guess; /* current guess for prime */ unsigned factor; /* possible factor of guess */ unsigned limit; /* find primes up to this value */ printf("Find primes up to: "); scanf("%u", &limit); printf("2\n"); /* treat first two primes as special case */ printf("3\n"); guess = 5; /* initial guess */ while ( guess <= limit ) { /* look for a factor of guess */ factor = 3; while ( factor*factor < guess && guess % factor != 0 ) factor += 2;if ( guess % factor != 0 ) printf("%d\n", guess); guess += 2; /* only look at odd numbers */ } return 0; }
@@@
python help Q1: Over or Under Define a procedure over-or-under which takes in a number x and a number y and returns the following: -1 if x is less than y 0 if x is equal to y 1 if x is greater than y *Hint: You can use cond (define (over-or-under x y) 'YOUR-CODE-HERE ) ;;; Tests (over-or-under 1 2) ; expect -1 (over-or-under 2 1) ; expect 1 (over-or-under 1 1) ; expect 0 Q2: Filter Write a procedure filter-lst, which takes a predicate f and a list lst, and returns a new list containing only elements of the list that satisfy the predicate. The output should contain the elements in the same order that they appeared in the original list. (define (filter-lst f lst) 'YOUR-CODE-HERE ) ;;; Tests (define (even? x) (= (modulo x 2) 0)) (filter-lst even? '(0 1 1 2 3 5 8)) ; expect (0 2 8)
7) What is the value of r after the following code executes? mySet (2, 3, 5, 7, 11) yourSet = (5, 7, 2, 11, 3) r = yourSet == mySet a. (5,7,2, 11, 3) b. [2, 3, 5, 7, 11) c. True d. error 13) How can the following algorithm be described? position = 0 while position < len(lyst): if target == lyst[position]: return position position += 1 return -1 a. sequential search b. bubble sort c. binary search d. selection sort
9. a) Draw a DFA of strings where the 2nd last symbol is a. Σ= {a,b} Or, b) Draw a DFA of strings where the 3rd last symbol is 1. Σ= {0,1} [You may draw the NFA for this problem if you find it difficult to solve using DFA]
Practicing Loops. Einstein Private Elementary school has three classes in each of its 9 grades. 27 classes in total. It has kindergarten (grade 0) though 8th grade. The school allows parents to pay tuition over the nine-month school year. Tuition for kindergarten is $90 dollars every month. Tuition for the other grades is $50 times the grade level every month. (1st grade is $50 a month, second grade is $100 a month, etc.) Design a programming solution that outputs nine tuition payment bills for each of the 27 classrooms. Each bill must contain the grade number (0 through 8), the classroom number (1 through 3), the month (1 through 9) and the amount of the tuition due. Your output should look something like: Grade Classroom Month Tuition 0 1 1 90 0 1 2 90 0 1 3 90 0 1 4 90 ... 8 3 7 400 8 3…
Use For loop please C++ given code /* Cipher Lab using C strings */ /* Running the program looks like:Enter some lower-case text: helloShifting 0 gives: helloShifting 1 gives: ifmmpShifting 2 gives: jgnnqShifting 3 gives: khoorShifting 4 gives: lippsShifting 5 gives: mjqqtShifting 6 gives: nkrruShifting 7 gives: olssvShifting 8 gives: pmttwShifting 9 gives: qnuuxShifting 10 gives: rovvyShifting 11 gives: spwwzShifting 12 gives: tqxxaShifting 13 gives: uryybShifting 14 gives: vszzcShifting 15 gives: wtaadShifting 16 gives: xubbeShifting 17 gives: yvccfShifting 18 gives: zwddgShifting 19 gives: axeehShifting 20 gives: byffiShifting 21 gives: czggjShifting 22 gives: dahhkShifting 23 gives: ebiilShifting 24 gives: fcjjmShifting 25 gives: gdkkn*/ #include <iostream>#include <iomanip>#include <cctype> using namespace std; // Global constantsconst int MaxWordSize = 81; // 80 characters + 1 for NULL // Given an array of characters and a shift value:// shift each character…
Allowed languages с Problem Statement Write a C Program that will compute for npr (n taken r permutations). Input Input starts with a number N and is followed by N pairs of numbers n and r. Output Output n.Pr Limits 1 < N < 20 1 \le r \le n \le 1000000 Notes Problems will have test cases that are not listed in their specification. Your solution must produce the right output for these hidden test cases. Sample Input #1 5 4 1 43 9 3 22 9 10 Sample Output #1 4 24 504 2 not valid Copy Copy
/* Find the sub of numbers crom N to */ /* Equivalent C code function would bet FINDSUB (int N) int ( int sub 15T while (N 1-0) sub Sub N-N- return Subs