Consider 3 ,5, 8 , 10 , 5, 2,1,7,3, 13 as an input to the list of n integers. Dry run the following piece of code and find out the answer. procedure func(al, a2,..., an: integers) k:= 0 for i:= 1 to n if i is odd then k: = ktai+i return k

Consider 3 ,5, 8 , 10 , 5, 2,1,7,3, 13 as an input to the list of n integers. Dry run the following piece of code and find out the answer. procedure func(al, a2,..., an: integers) k:= 0 for i:= 1 to n if i is odd then k: = ktai+i return k

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

Related questions

Q: 3. Using a simulation of three decimal digit arithmetic on a com- puter, find the sum of the…

A: Note: Since your question contain multiple sub-parts but e can answer only first 3-sub parts at a…

Q: The sum of the reciprocals 1 + 1/2 + 1/3 + 1/4 + ... is infinite. Write a program that reads in a…

A: #include <iostream> using namespace std; int main(){ double sum = 0; int n = 1;…

Q: cci series begins with the terms 0 and 1 and has the property that each succeeding term is the sum…

A: Start Now declare variables i, b, c, fib we will initialize the variables b=0, c=1 and fib=0 Enter…

Q: Consider the first number, say m. See how many times this number is repeated consecu- tively. If it…

A: Task :- Write a python program to convert given list into a read aloud list of number. Python…

Q: Given a positive integer, N, the "3N+l' sequence starting from N is defined as follows: If N is an…

A: #include <bits/stdc++.h> using namespace std; int sequence(n) { if(n<1) return 0;…

Q: Given a list of integers, we want to know whether it is possible to choose a subset of some of the…

A: For Problem Statement, We have to find subset sum from the list in Java. Given non-negative…

Q: Given two arrays X and Y of positive integers, find the number of pairs such that xy > yx (raised to…

A: long long countPairsBruteForce(long long X[], long long Y[], long…

Q: Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows: If N is an…

A: The main objective of the C++ program, main. cpp is to prompt the user to enter a value and read a…

Q: 10. Given is an ordered deck of n cards numbered 1 to n with card I at the top and card n at the…

A: Given: Use: You have to use C/C++ language Must Try to use Matrix, queue,stack,linklist, graph, tree…

Q: Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows: If N is an…

A: I have coded in Javascript because programing language was not mentioned. You can use the concept…

Q: (b). write an algorithm for Given a set of distinct, positive integers x1, x2, x3, ...xn, where n is…

A: (b). write an algorithm for Given a set of distinct, positive integers xl, x2, x3, ...xn, where n is…

Q: Write a python program that generates permutations from a given set taken "r" at a time. Sample…

A: The answer is

Q: Suppose a = 3 (mod 12) and b = 8 (mod 12) where a and b are integers. Find the integer c with 0 < c…

A: Congruent modulo For n>=2, if any two integers say 'p' and 'q' are divided by 'n' then they gave…

Q: using c++ Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows:…

A: Below is the required C++ code. Program Approach: Including iostream for input and output streams…

Q: as Y . Thus, if X = GAXTYAWBGTAUGBTABGRGTAXB and Y = GTAB, then the answer is 3 as shown by the red…

A: pretender codification is a constituent which is oftentimes used in scheduling and deliberation…

Q: Q.No.2. Consider 3 , 5 , 8 , 10 , 5 , 2 , 1 ,7, 3, 13 as an input to the list of n integers. Dry run…

A: CODE: /******************************************************************************…

Q: Given a list of integers, we want to know whether it is possible to choose a subset of some of the…

A: public static boolean canMakeSum(ArrayList<Integer> list, int sum) { if(sum==0)…

Q: Solve using JAVA only Given a square chess board of size N, solve the N queens problem.…

A: The Java Code for the given problem is provided below: We are using multi-dimensional array to…

Q: Build a minheap using the following sequence of numbers: 69, 88, 6, 63, 35, 67, 15, 36, 30, 91, 79,…

A: I have Provided this answer with full description in step-2.

Q: The Fibonacci function f is usually defined as follows. f (0) = 0; ƒ(1) = 1; for every n e N>1, f(n)…

A: Solution: Given, f(0) = 0 f(1) = 1

Q: Traverse your two way list for forward and backward, must write separate algorithm f both. TEST FORW…

A: Traversal of a two-way linked list can be done in both the ways, i.e., in forward direction as well…

Q: Show that the given argument is either valid or invalid using resolution. If Sally does her…

A: Let the predicate be Sally does her homework: p people call Sally a wimp : q Let the premise be

Q: os) jagwnu example with enrolment number 001054321, you would take a = 3, b = 2 and c = 1) and then…

A: cyclic code is a block code , where the circular of each codeword gives another word that belongs to…

Q: (Poor Person's Logarithm) For this question, we will be given a number x and a base b and will find…

A: Below is the code in C++ and sample output:

Q: Please me solve this erro in the below coder: Error Message -> IndexError: list assignment index…

A: The above error is occurring because you have declared the list answer = [ ] of 0 length but we…

Q: Write an algorithm that inputs a number n followed by an array of n numbers and outputs the number…

A: an algorithm that inputs a number n followed by an array of n numbers and outputs the number of…

Q: 1. Consider the following two loops: / Loop A for (i - 1; i n; i+4) for (j - 1; j« 10000; j++) sum -…

A: 1. In the Loop A, outer for loop is executing n times and each time the inner for loop is executing…

Q: Given a positive integer, N, the '3N+1' sequence starting from N is defined as follows: If N is an…

A: Introduction of the Program: The C++ program takes the number from the user as input and then the…

Q: Consider the following algorithm. (It doesn't do anything, but it sure wastes a bunch of time doing…

A: a) lower bound on the number of iterations of Loop 1 For the base case scenario, the loop control…

Q: Benford’s Law involves looking at the first digit of a series of numbers. For example, suppose that…

A: Actually given information: Benford’s Law involves looking at the first digit of a series of…

Q: Let x1[n], x2[n] and x3[m] are three sequences, each of length N, whose DFTS are given as X1(k),…

A: Answer B

Q: Start with any positive number n. If n is even divide it by 2, if n is odd multiply by 3 and add 1.…

A: We need to write a code for the given scenario. *Language used is C++.

Q: F'ind / (1), S(2), S (3), and f (4) if s(n) is defined recur- sively by f(0) =1 and for n 0, 1, 2,…

A: As per Bartleby guidelines “Since you have asked multiple question, we will solve the first question…

Q: n-17 .. n. For example, if n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3], [1,2], [1,3],…

A: Machine independent language :- > the language which does not depend on the computer or its parts…

Q: Exercise III: Catalan numbers For n e N, denote by c, to be the number of ways to form a "mountain…

A: Answer: Our guidelines is answer the first three question from the first question. I have given…

Q: A set of integers are relatively prime to each other if there is no integer greater than 1 that…

A: If n is Prime then φ(n)=n-1 In then Given options Options A and E have n as Prime. So…

Q: Given a list of integers, we want to know whether it is possible to choose a subset of some of the…

A: Coded using Java.

Q: Suppose a genetic algorithm uses chromosomes of the form x = abcdefgh with a fixed length of eight…

A: In case of questions with multiple questions, we are required to answer the first 1.

Q: can you please fix the AssertionError in this: (please don't use try and except or break/continue or…

A: The correct Python code along with the screenshot of code and output is given below:

Q: What are the complexities of the following code segments in terms of n? Give an upper bound. a) int…

A: Let's understand step by step : Answer (a) : int i=1;while (i<= n) { int j = i; while (j…

Q: tart with a pile of n stones and successively split a pile into two smaller piles until each pile…

A: Solution: Assume true for all n≤k. Now suppose you have k+1 stone. You split them into 2 groups of s…

Q: Write a program that takes an integer N and uses the function “np.random.randint(low = 0, high = N)”…

A: As n increases the absolute difference decreases, which is proved by induction over multiple…

Q: If P(x) is a polynomial in x with integer coefficients, let W(P(x)) = number of odd %3D coefficients…

A: Procedure: We have the 2 input Input1 and Input2 from the user use these input defines on the…

Q: Write a program in python that solves the following exercise, need an explanation of the solution:…

A: Since, the first values in Fibonacci series are 1 and 2, so we assigned 1 and 2 firstly, Inside…

Q: Given an input string, a non-empty substring subs, and a non-negative number n, compute recursively…

A: Code works perfectly. I am providing code in java. Please use proper indentation for no error.…

Q: The distance between two points in a grid is based on a strictly horizontal and/or vertical path…

A: from numpy.testing import assert_equal# defining function which consumes 4 parametersdef…

Q: Loop(M,x) is the problem of trying to decide if algorithm M goes into an infinite loop when given x…

A: Below is the pseudocode reduction of Accept(M,x) using Loop(M,x) as subroutine. Accept(M,x)

Concept explainers

Counting sort

The counting sort algorithm sorts an array’s contents by counting the repetition of each element that occurs in the array. A counting sort algorithm is a stable algorithm that works the best when the range of elements in the array is small, say for example from 0 to 9. The count which is the number of repetitions of an element in the array is mapped to an index of an auxiliary array, which is then saved in an auxiliary array. The counting sort algorithm has a stable time complexity of the order of O(size of array + size of auxiliary array). Let’s discuss the algorithm in detail as follows.

Question

100%

Consider 3 ,5, 8 , 10 , 5, 2,1,7,3, 13 as an input to the list of n integers. Dry run
the following piece of code and find out the answer.
procedure func(al, a2,..., an: integers)
k:= 0
for i:=1 to n
if i is odd then k: = k+ai+i
return k

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

n and n+1 are integers with the same number of positive divisions. Find the integers n from 1<n<107. For example, the positive divisors of 14 are 1, 2, 7, 14, and 15 are 1, 3, 5, 15. (P.s.: You have to done it by C++.)
The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the fibonacci() function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1 Ex: If the input is: 7 the output is: fibonacci (7) is l3 Note: Use recursion and DO NOT use any loops.
Computer Science A code C runs T seconds to obtain results for an input of size S. How to find the order of runtime for the code Cfor given pairs. Hint the answer is a formula that uses logarithm.(a) (S1,T1), (S2,T2)?(b) (S1,T1), (S2,T2), (S3, T3)?
mplement a Java program that applies the Newton-Raphson's method xn+1 = xn – f(xn) / f '(xn) to search the roots for this polynomial function ax6 – bx5 + cx4 – dx3+ ex2 – fx + g = 0. Fill out a, b, c, d, e, f, and g using the first 7 digits of your ID, respectively. For example, if ID is 4759284, the polynomial function would be 4x6 – 7x5 + 5x4 – 9x3+ 2x2 – 8x + 4 = 0. The program terminates when the difference between the new solution and the previous one is smaller than 0.00001 within 2000 iterations. Otherwise, it shows Not Found as the final solution.
The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which has an index, n, as parameter and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci(7) is 13 Note: Use a for loop and DO NOT use recursion.
solve in java Integer arrays originalArr and filterArr are read from input, each containing two elements. If an element in originalArr is not a multiple of the corresponding element in filterArr, replace the element in originalArr with the corresponding element in filterArr times 2. Ex: If the input is: 16 9 8 4 then the output is: 16 8 Note: Given integers A and B, A is a multiple of B only if A % B == 0. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 import java.util.Scanner; public class ReplaceNumbers { publicstaticvoidmain(String[] args) { Scannerscnr=newScanner(System.in); finalintNUM_VALS=2; int[] originalArr=newint[NUM_VALS]; int[] filterArr=newint[NUM_VALS]; inti; for (i=0; i<NUM_VALS; ++i) { originalArr[i] =scnr.nextInt(); } for (i=0; i<NUM_VALS; ++i) { filterArr[i] =scnr.nextInt(); } /* Your code goes here */ for (i = 0; i < originalArr.length; ++i) { System.out.print(originalArr[i] + " "); } System.out.println();…
A={L,M,N,P,Q} and B={L,R,S,P,T} , Find the output of A-B ?
Your main task is to write a recursive function sierpinski() that plots a Sierpinski triangle of order n to standard drawing. Think recursively: sierpinski() should draw one filled equilateral triangle (pointed downwards) and then call itself recursively three times (with an appropriate stopping condition). It should draw 1 filled triangle for n = 1; 4 filled triangles for n = 2; and 13 filled triangles for n = 3; and so forth. Sierpinski.java When writing your program, exercise modular design by organizing it into four functions, as specified in the following API: public class Sierpinski { // Height of an equilateral triangle with the specified side length. public static double height(double length) // Draws a filled equilateral triangle with the specified side length // whose bottom vertex is (x, y). public static void filledTriangle(double x, double y, double length) // Draws a Sierpinski triangle of order n, such that the largest filled //…
The following is a implementation of the Ackermann function: public static long Ackermann(int m, int n){ 0) return n + 1; if (m == else if (n == return Ackermann(m 1, 1); else return Ackermann(m 1, Ackermann(m, n - 1));
Let A = {a, b, c} and B = {u, v}. Write a. A × B b. B × A
The Fibonacci sequence begins with O and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which has an index n as a parameter and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci (7) is 13 Note: Use a for loop and DO NOT use recursion. 1 #include NM in N 2 3 int Fibonacci(int n) { 4 /* Type your code here. */ 5} 6 7 int main(void) { 8 int startNum; 9 scanf("%d", &startNum); main.c 10 11 printf("Fibonacci (%d) is %d", startNum, Fibonacci (startNum)); return 0; 12 13 14
Java, I am not displaying my results correct. It should add up the digits in the string. input string |result for the sumIt Recursion functions and a findMax function that finds the largest number in a string "1d2d3d" | 6 total "55" |10 total "xx" | 0 total "12x8" |12 Max number "012x88" |88 Max Number "012x88ttttt9xe33ppp100" |100 Max Number public class Finder { //Write two recursive functions, both of which will parse any length string that consists of digits and numbers. Both functions //should be…