3. Consider the following C code fragment, which makes use of the strcpy version that truncates a copy after n bytes (i.e., strncpy): 1 int 2 main (int argc, char **arg v) 3 { return bar (argv [1]); 5 } 4 7 int 8 bar(char *arg) 9 { 11 char bar[512]; 12 13 if (sizeof ( bar) <= 512) strncpy (bar, arg, strlen (arg)); 14 15 exit (1); 16 17 } a. Does the program suffer from a memory corruption vulnerability? If not, explain the reasons. If yes, is it possible to successfully exploit this vulnerability? In other words, is it possible to provide specific input to such a program to take advantage of its vulnerability and thus execute arbitrary code (for instance, spawning a shell), on x86-32 architectures? If yes, explain how you would exploit it (high-level steps). If not, explain why and what you would change in the code to make it exploitable.

3. Consider the following C code fragment, which makes use of the strcpy version that truncates a copy after n bytes (i.e., strncpy): 1 int 2 main (int argc, char **arg v) 3 { return bar (argv [1]); 5 } 4 7 int 8 bar(char *arg) 9 { 11 char bar[512]; 12 13 if (sizeof ( bar) <= 512) strncpy (bar, arg, strlen (arg)); 14 15 exit (1); 16 17 } a. Does the program suffer from a memory corruption vulnerability? If not, explain the reasons. If yes, is it possible to successfully exploit this vulnerability? In other words, is it possible to provide specific input to such a program to take advantage of its vulnerability and thus execute arbitrary code (for instance, spawning a shell), on x86-32 architectures? If yes, explain how you would exploit it (high-level steps). If not, explain why and what you would change in the code to make it exploitable.

Name: 3. Consider the following C code fragment, which makes use of the str
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: 3. Consider the following C code fragment, which makes use of the strcpyversion that truncates a copy after n bytes (i.e., strncpy):1 int2 main (int argc, char **argv)3 {return bar(argv [1]);5 }47 int8 bar (char *arg)9 {1011char bar[512];12if (sizeo

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

Consider the following code chunk:x <- 0while(x < 4) {x <- sample(1:3, 1)print(x)}It is not a good idea to run these lines because...a) x is an invalid argument to print().b) the condition x < 4 is never violated.c) the function sample() does not exist.d) x is initialised with the wrong type.
The following data fragment appears in the midst of a data stream that employs the byte-stuffing mechanism described in the text:A B ESC C ESC FLAG FLAG D ESC FLAG FLAG D ESC FLAG FLAG D ESC FLAG FLWhat is the result of stuffing?
4) Answer the question in C++ A) What is wrong with the following code segment? enum CarType {GM, FORD, BMW}; int main() { CartType = BMW; return 0; } B) Assume that the addresses of x and y is 0x61feb8 and 0x61feb0, respectively. What will be the values of x, y, p, and q, respectively, when the following code runs successfully? int main() { int x; double y; int* p = &x; double* q = &y; *p = 3; *q = 3.14; increaseByOne(p, q); cout << x << " " << y << endl; cout << p << " " << q << endl; return 0; }void increaseByOne(int*& p1, double* q1){ (*p1)++; (*q1)++; p1++; q1++;} The four value:
Write a C program to solve the following problems: 1. Write a program that implements the binary search for a set of integers stored in a data file. (Note that the data set in sorted in an ascending order).
Write a C++ program that does the following: Read and input file xycoordinates.txt containing the following: PersonName X Y where the coordinates of PersonName is provided as X, Y in a 100 by 100 room Use square root function in cmath sqrt() to calculate the shortest distance between two coordinates (Remember the Pythagorean Theorem?) Write a program tracing.cpp that should load the xycoordinates.txt file into an 3 parallel arrays consisting of person[ ], x[ ], y[ ]. You can use either subscript notation or pointer arithmetic to access the data in the arrays. Optionally, you can use an struct array if you want to read-ahead about the next module. (10 points bonus). The program should use the arrays to calculate the distance between every pair in the room. The program should use a function call that returns the distance. If the distance is less than 6 feet, report the case giving the names and the calculated distance in a cout statement: Example: Apple and Barry is 4 feet apart…
Write a C++ program that does the following: Read and input file xycoordinates.txt containing the following: PersonName X Y where the coordinates of PersonName is provided as X, Y in a 100 by 100 room Use square root function in cmath sqrt() to calculate the shortest distance between two coordinates (Remember the Pythagorean Theorem?) Write a program tracing.cpp that should load the xycoordinates.txt file into an 3 parallel arrays consisting of person[ ], x[ ], y[ ]. You can use either subscript notation or pointer arithmetic to access the data in the arrays. Optionally, you can use an struct array if you want to read-ahead about the next module. (10 points bonus). The program should use the arrays to calculate the distance between every pair in the room. The program should use a function call that returns the distance. If the distance is less than 6 feet, report the case giving the names and the calculated distance in a cout statement: Example: Apple and Barry is 4 feet apart…
Q) Write a program in assembly language to compares the elements of two arrays, A(1) and B(1), each array contains 100 16-bit signed number. Assume that the arrays start in the current data segment at offset addresses A000H and B000H respectively. If the two arrays are found to be unequal, save the address of the first unequal element of A(1) in the memory location with offset F00011. Otherwise, if the two arrays are found to be equal, write all O's into this location.
Someone tries to fix the stack based buffer overflow problem as follows, is it secure now? why? Are there any other issues within the function's implementation below? Explain your reasoning. int bof(char *str, int size) { char *buffer = (char *) malloc(size); strcpy(buffer, str); return 1; }
Q2: Write a Assembly language program that copies the BYTES from array V1 to array V2 using indexed addressing, PTR Operator and LOOP such that after execution of your code the elements of V2 will become [78h, 56h, 34h, 12h, 21h, 43h, 65h, 87h]. The data is given in the data segment below .data v1 DWORD 12345678h, 87654321h
Write a program in C++ that reads data from a file. Create dynamic memory according to the data. Now your task is to perform the following task. Row wise Sum Column wise Sum Diagonal wise Sum Example data.txt 4 5 1.6 10.2 33.7 99 20.5 3 44 50 96.1 2 8 9 4 74 50 99 19.1 Output: Sum row wise: 165, 191, 17, 242.1 Sum col wise: 127.6, 120.1, 228.8, 118.1, 20.5 Sum diagonal wise: Not Possible Note: You are restricted to use pointers and your function should be generic as we discussed in class. Avoid memory wastage, memory leakage, dangling pointer. Use regrow or shrink concepts if required.
Consider the following C++ code: int* length = new int; int* height = new int; *height = 12; *length = *height; Length = Height; delete height; Provide detailed explanations of the effect of each statement. After this code has completed, there is an inaccessible object on the heap and a dangling pointer. What is the inaccessible object and how did it become inaccessible? What is the dangling pointer in this example? Briefly explain the danger associated with dangling pointers?
What is the address of (int) m[i][j] in terms of the base address and COLS? What are potential problems with <code>strcpy()</code> and <code>strcat</code> Why does <code>scanf()</code> take a pointer?