1. What will be the output of the following Turbo C program? Write your answer in the box provided. #include main () { int a[5]= { 5, 10, 15, 20, 25}; int x, temp, size; size =5; for (x-0; x<= size/2; x++) { temp= a[x]; a[x] = a[ (size-1)-x)]; a[ (size -1)-x)] = temp; } for (x=0; x<=4; x++) printf (" Element %d is %d", x, a[x]); getch ();

1. What will be the output of the following Turbo C program? Write your answer in the box provided. #include main () { int a[5]= { 5, 10, 15, 20, 25}; int x, temp, size; size =5; for (x-0; x<= size/2; x++) { temp= a[x]; a[x] = a[ (size-1)-x)]; a[ (size -1)-x)] = temp; } for (x=0; x<=4; x++) printf (" Element %d is %d", x, a[x]); getch ();

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

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".
Consider the following function: public void bSearch(int[] A, int value, int start, int end) { if (end value) { return bSearch(A, value, start, mid); } else if (value > A[mid]) { return bSearch(A, value, mid+1, end); } else { return mid; } } The mutation program P' changes the part as shown below. } else if (value > A[mid]) { return bSearch(A, value, mid+2, end); } else { return mid; } A test input is given t1: {A = [2, 3, 5, 7, 10, 11], value = 6, start=0, end=5}. Which statement below best describes the mutant with regards to the test input? O a. t1 resolves mutant P O b. The mutant P' with regards to test input t1 is live.
! B{ using namespace std; int main() ... int i, m=0,n=4; float arr[100]={55,66,88,1}; for(i=0; i using namespace std; 14 + 个 ۹:۱۲ G ↑
please can this code be converted to c++ or Java. Thank you Code is as follows: location = [] size = [] rover = 0 def displayInitialList(location, size): global rover print("FSB# location Size") for i in range(len(location)): print(i," ",location[i]," ",size[i]) if rover<len(size)-1: print("Rover is at ",location[rover+1]) else: print("Rover is at ",location[rover]) def allocateMemory(location,size,blockSize): global rover if rover<len(size): while size[rover]<blockSize: rover+=1 if i==len(size): return False location[rover] += blockSize size[rover] -= blockSize rover+=1 return True else: return False def deallocateMemory(location,size,delLocation,delSize): i=0 while delLocation>location[i]: i+=1 location[i]-=delSize size[i]+=delSize while True: print("1. Define Initital memory\n2. Display initial FSB list\n3. Allocate memory\n4. Deallocate memory\n5. Exit")…
Given the following C code: int a[10] = {0,1,2,3,4,5,6,7,8,9};int *m = &a[0];int *p = &a[5];int *q = &a[1]; p = (int) m + (int) p - (int) q; What is the value of *p?
#Write your class code here using python print("Box 1")b1 = box([10,10,10])print("=========================")print("Height:", b1.height)print("Width:", b1.width)print("Breadth:", b1.breadth)print("-------------------------")print("Box 2")b2 = box((30,10,10))print("=========================")print("Height:", b2.height)print("Width:", b2.width)print("Breadth:", b2.breadth)b2.height = 300print("Updating Box 2!")print("Height:", b2.height)print("Width:", b2.width)print("Breadth:", b2.breadth)print("-------------------------")print("Box 3")b3 = b2print("Height:", b3.height)print("Width:", b3.width)print("Breadth:", b3.breadth)
Consider the following code fragment: static int f(int[ ] arr, int x ) { int start = 0; int end - arr.length -13; int mid; while(start x) { end - mid-1; } else { return mid; } } return -1; } Give the worst case big-O cost where the length of the array is N. O O(N^2) O (1) O 0(2^N) O O(logN) O(N)
Given the following: #includ int a[] ={4, 6}, i = 0, y =3, z =1; void f(int x){ int z = 2; g (); X = x + y; z = z +X; i++; return x + a[ i ]+y; } void g(){ z += 3; y = a[i] + z; } void main(){ printf("%d", y + f( a[i] ) - y); } State the output assuming the following: A) Call by reference, dynamic scoping, operands are evaluated right to left. B) Call by name, static scoping; operands are evaluated left to right.
I am learning Java, but i am a pythonista. So please write this code below in python. Code: public class ABC{ /* Function to reverse arr[] from start to end*/ static void rvereseArray(int arr[], int start, int end) { int temp; while (start < end) { temp = arr[start]; arr[start] = arr[end]; arr[end] = temp; start++; end--; } } /* Utility that prints out an array on a line */ static void printArray(int arr[], int size) { for (int i = 0; i < size; i++) System.out.print(arr[i] + " "); System.out.println(); } // Driver code public static void main(String args[]) { int arr[] = {1, 2, 3, 4, 5, 6}; printArray(arr, 6); rvereseArray(arr, 0, 5); System.out.print("Reversed array is \n"); printArray(arr, 6); }}
public static void main(String[] args) { int a; int b; int c; c = quad(0,1, 2); b = quad(1, 2, 3); a = quad(5, 6, 7); c = c +b+ a; } private static int quad(int a, int b, int c) { int r; r= a +b+ c; return r; } For the code above, how many entries does the activation record for method quad have? During the execution of main, at most how many activation records are existent on the run-time stack?
Write these in Pseudocode #1a – In pseudocode, write a call to a function that passes 1 Integer variable and 1 Integer array, and saves a Boolean value in return. #1b – In pseudocode, write the function that accepts 1 Integer and 1 Integer array and returns a Boolean. In the function, search the Integer array with a for-loop, and if the Integer parameter is found in the array, return false. If the Integer parameter is not found, return true. #2a – In pseudocode, write a call to a module that passes 1 Integer variable, 1 Real variable, 1 String constant, and 1 String literal as arguments. #2b – In pseudocode, write the module header that accepts 1 Integer, 1 Real, and 2 Strings as parameters. #3 – This pseudocode has multiple problems. Fix the calling statement and the definition below so that the routine accepts 3 grades as parameters and returns the average into a variable.…
PROGRAMMING LANGUAGE: C++ SUBJECT: OOP Task: Find errors in the following code and rewrite a correct version of code with outputs. #include <iostream> using namespace std; class CRectangle { int width. height; public: void set_values (int, int); int area () {return (width * height);} }; void CRectangle::set_values (int a, int b) { width = a; height = b; } int main () { CRectangle a,*b,*c; c= a; a.set_values (1,2); b= new CRectangle; c=&b; c->set_values (3,4); cout << "a area: " << c->area() << endl;// cout << "*b area: " << a.area() << endl;// c->set_values (5,6); cout << "*b area: " << b.area() << endl;// delete b; return 0; }