Q3: What the output of the following program: static void Main(string[] args) } I int i =2 m = 15, n = 2, s = 6, h = 2, k = 3; while (i <= m) { } if { } (i >= n && i <= s) int j =i - h; while (j <= i + k) Console.Write(" ({0}, {1}): {2}=>", i, j,i*j++); Console.WriteLine("*****"); i += 2; Console.ReadLine();

Q3: What the output of the following program: static void Main(string[] args) } I int i =2 m = 15, n = 2, s = 6, h = 2, k = 3; while (i <= m) { } if { } (i >= n && i <= s) int j =i - h; while (j <= i + k) Console.Write(" ({0}, {1}): {2}=>", i, j,i*j++); Console.WriteLine("*****"); i += 2; Console.ReadLine();

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

#include <stdio.h> int arrC[10] = {0}; int bSearch(int arr[], int l, int h, int key); int *joinArray(int arrA[], int arrB[]) { int j = 0; if ((arrB[0] + arrB[4]) % 5 == 0) { arrB[0] = 0; arrB[4] = 0; } for (int i = 0; i < 5; i++) { arrC[j++] = arrA[i]; if (arrB[i] == 0 || (bSearch(arrA, 0, 5, arrB[i]) != -1)) { continue; } else arrC[j++] = arrB[i]; } for (int i = 0; i < j; i++) { int temp; for (int k = i + 1; k < j; k++) { if (arrC[i] > arrC[k]) { temp = arrC[i]; arrC[i] = arrC[k]; arrC[k] = temp; } } } for (int i = 0; i < j; i++) { printf("%d ", arrC[i]); } return arrC; } int bSearch(int arr[], int l, int h, int key) { if (h >= l) { int mid = l + (h - l) / 2; if…
#include <stdio.h>#include <string.h> int findRepeat(char* s){int p , i , j; p = -1; for (i = 0 ; i < strlen(s) ; i++){for (j = i + 1; j < strlen(s); j++){if (s[i] == s[j]){p = i;break;}}if (p != -1)break;}return p;} int main(){char str[] = "Hello World";int pos = findRepeat(str);if (pos == -1)printf("Not found");elseprintf("%c", str[pos]);return 0;}can you please explain this code for me
What does the below do? #include <stdio.h>#include <string.h>int main(void) { char fnameArray[50] [50]; int i; for (i = 0; i <=5; i++) { scanf("%s", fnameArray[i] ); } for (i = 0; i <=5; i++) { printf("\n%s\n", fnameArray[i] ); } return 0;}
#include <stdio.h> #include <string.h> int IsPasswordOkay(char* pass) { char Password[12]; strcpy(Password, pass); if (!strcmp(Password, "goodpass")) return(1); else return(0); } int main(int argc, char **argv) { int PwStatus; if (argc < 2) { printf("Input your password\n"); return(-1); } PwStatus = IsPasswordOkay(argv[1]); if (PwStatus == 0) { printf("Acces denied"); return(-1); } else { printf("Access granted"); return(1); } } Write a function to conduct input validation to secure the smallest buffer. You may call this function void SecurePasswordBuffer(const char *arg).
Refer to the code segment in Program (A), Identify the value oftemp. Program (A) int a[6] int *p {5,2,7,4,9,3}; &a[3]; = int temp; (а + 4); (p + 2); *p; *p++; *++p; * temp temp temp temp temp *
#include <stdio.h>#include <limits.h> int findMissingUtil(int arr[], int low, int high, int diff){ if (high <= low)return INT_MAX; int mid = low + (high - low)/2; if (arr[mid+1] - arr[mid] != diff)return (arr[mid] + diff); if (mid > 0 && arr[mid] - arr[mid-1] != diff)return (arr[mid-1] + diff); if (arr[mid] == arr[0] + mid*diff)return findMissingUtil(arr, mid+1, high, diff); return findMissingUtil(arr, low, mid-1, diff);} int findMissing(int arr[], int n){int diff = (arr[n-1] - arr[0])/n; return findMissingUtil(arr, 0, n-1,diff);} int main(){int arr[] = {120001, 120013, 120025, 120037, 120049, 120061,120085,120097,120109,120121};int n = sizeof(arr)/sizeof(arr[0]);printf("The missing element is %d", findMissing(arr, n));return 0;} ______________________________________________________________________________ Convert the code above into Pseudocode