1.2 Write some bad code! #include 2 #include int main(int argc, char** argv){ 'int *s = malloc(sizeof(int) * 5); 69. for(int i = 0; i < 6; i++){ s[i] = i; } free(s); return 0; 12 13 Compile the code using gsg with -Wall -pedantic -g flags https://man7.org/linux/man-pages/man1/gcc.1.html -(kali© kali)-[~/Documents] gcc -Wall -pedantic -g test.c -o test –(kali© kali)-[~/Documents] Lsis test test.c Question 1: What do the -Wall and -pedantic flags do? 1.2.1 Run the program with Valgrind –(kali© kali)-[~/Documents] valgrind ./test Question 2: Take a screenshot of the results Question 3: what and Where was the problem in the program? 1234 5678 6012

1.2 Write some bad code! #include 2 #include int main(int argc, char** argv){ 'int s = malloc(sizeof(int) 5); 69. for(int i = 0; i < 6; i++){ s[i] = i; } free(s); return 0; 12 13 Compile the code using gsg with -Wall -pedantic -g flags https://man7.org/linux/man-pages/man1/gcc.1.html -(kali© kali)-[~/Documents] gcc -Wall -pedantic -g test.c -o test –(kali© kali)-[~/Documents] Lsis test test.c Question 1: What do the -Wall and -pedantic flags do? 1.2.1 Run the program with Valgrind –(kali© kali)-[~/Documents] valgrind ./test Question 2: Take a screenshot of the results Question 3: what and Where was the problem in the program? 1234 5678 6012

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

3, Consider the code #define row 3 #define col 4 main() int z[row][col] {1,2,3,4,5,6,7,8,9,10,11,12}; int a.b.c; for (a-0;a
PLEASE TYPE IF NOT TYPE THAN DO NOT DO IT*** DO ALL 3 (B VIA D)**** Exercise 8.4.1: Composition of relations expressed as a set of pairs. Here are two relations defined on the set {a, b, c, d}: S = { (a, b), (a, c), (c, d), (c, a) } R = { (b, c), (c, b), (a, d), (d, b) } Write each relation as a set of ordered pairs. (b) R ο S (c) S ο S (d) R ο R
3 6. 9 12 15 ListB 1 2 3 Based on above memory illustrations. Complete these following fragment code: (i), (ii), (iii) Hint : Array ListB is the manipulation of array ListA. int ListA[5] = // (i) initialization of array ListA int ListB[5]; for( int i = 0; i++){ //(ii) control expression for maximum index ListB[i] = ;//(ii) manipulate elements ListA to save in ListB cost }
Code: #!/usr/bin/env python2.7 import sys def verify(submission): processed = [ ] if len(submission) % 2 != 0: return False for i in range(0, len(submission) / 2): processed.append(int(submission[i * 2] + submission[(i * 2) + 1], 16)) ekc = [ 0x53, 75, 0x59, 0x2D, 0110, 0x45, 88, 81, 0x2D, 0x39, 0x35, 0x36, 0x30 ] if len(processed) != len(ekc): return False for i in range(len(processed)): if ekc[i] != processed[i]: return False return True if len(sys.argv) != 1: print "Usage: python bytes.pyc" exit(1) submission = raw_input("What is the password? ") if verify(submission): print "That is correct" exit(0)else: print "That is incorrect" exit(2) Question: What is the password that will successfully pass the verify function?
3 Linker Assigned Symbol Strength · The C-code below is one file, symbol.c. For each of the 10 symbols present (s0, s1, it is internal, weak external, or strong external. s9), tell whether .... int s0(int s1, int s2); double s2 = 0, s3; int s4; void s5(long s6) { float s7 = 2.0, s8 = 4; }
// Program 4.3.1#include <iostream>using namespace std;int main (){int a[3][4] = { {0, 1, 2, 3} , // initializers for row indexed by 0 {4, 5, 6, 7} , // initializers for row indexed by 1 {8, 9, 10, 11} // initializers for row indexed by 2 };for ( int i = 0; i < 3; i++ ) // output each array element's value for ( int j = 0; j < 4; j++ ){ cout << "a[" << i << "][" << j << "]: "; cout << a[i][j]<< endl;}return 0;} TASK 1. Explain in details what the Program 4.3.1 does? 2. What is the output.
) Consider the following C code snippet. void swap(int *xp, int *yp) { int temp = *xp; *xp = *yp; *yp = temp; } int findMinimum(int arr[], int N) { // variable to store the index of minimum element int min_idx = 0; int min_E = arr[min_idx]; // Traverse the given array for (int i = 1; i < N; i++) { // If current element is smaller than min_idx then update it if (arr[i] < min_E) { min_idx = i; min_E = arr[min_idx]; } } return min_idx; } /* Function to sort an array using selection sort*/ void selectionSort(int arr[], int n) { int i, min_idx; // One by one move boundary of unsorted subarray for (i = 0; i < n-1; i++) { // Find the minimum element in unsorted array min_idx = findMinimum(&arr[i], n-i); // Swap the found minimum element with the first element if(min_idx != 0) swap(&arr[min_idx+i], &arr[i]); } }…
Course: Reconfigurable Computing (Using Vivado ML Edition or Previous Version) Lab requirements: 1) Implement a 2-D convolution using HLS C. 2) Optimize the HLS with directives. Kindly provode the Source code + Experimental report.
Translate C program to Pep/9 assembly language. /C code for 6.19a#include <stdio.h>char myChar;char toLower(char ch) { if ((ch >= ’A’) && (ch <= ’Z’)) { return ch + ’a’ - ’A’; } else { return ch; }}int main () { scanf(”%c”, &myChar); printf(”%c\n”, toLower(myChar)); return 0;}
#include <bits/stdc++.h>using namespace std;#define numVl 3 struct thNde { thNde* parent; int mat[numVl][numVl]; int x, y; int cost; int level;}; int thPrntMtrx(int mat[numVl][numVl]) { for (int q = 0; q < numVl; q++) { for (int j = 0; j < numVl; j++) printf("%d ", mat[q][j]); printf("\n"); }} thNde* newNode(int mat[numVl][numVl], int x, int y, int newX, int newY, int level, thNde* parent) { thNde* node = new thNde; node->parent = parent; memcpy(node->mat, mat, sizeof node->mat); swap(node->mat[x][y], node->mat[newX][newY]); node->cost = INT_MAX; node->level = level; node->x = newX; node->y = newY; return node;} int row[] = { 1, 0, -1, 0 };int col[] = { 0, -1, 0, 1 }; int calculateCost(int starting[numVl][numVl], int resltng[numVl][numVl]) { int count = 0; for (int q = 0; q < numVl; q++) for (int j = 0; j < numVl; j++) if (starting[q][j] && starting[q][j] != resltng[q][j]) count++; return count;} int isSafe(int x, int y) {…
Implement in C Programming 8.2.2: Printing with pointers. If the input is negative, make numItemsPointer be null. Otherwise, make numItemsPointer point to numItems and multiply the value to which numItemsPointer points by 10. Ex: If the user enters 99, the output should be:Items: 990 #include <stdio.h> int main(void) { int* numItemsPointer; int numItems; scanf("%d", &numItems); /* Your solution goes here */ if (numItemsPointer == NULL) { printf("Items is negative\n"); } else { printf("Items: %d\n", *numItemsPointer); } return 0;}
In questions 4-10 estimate the Big O value by analyzing the code. Note the algorithms are written in English. Hint: you are interested in the number of operations for each algorithm.