int find (int *v, int n, int s) { int i, j; for (i-0; i

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Please solve this asap and this is not a graded question if you don't know how to solve it please leave it for another person to solve this is literally a n exercise.
Given the following function
int find (int *v, int n, int s) {
int i, j;
for (i-0; i<n-4; i++) {
int sum =
0;
for (j-0; j<4; j++) {
sum += v[i+j];
s)
if (sum
return i;
return -1;
Answer the following questions:
A) Which is the worst-case complexity of the function? T(n) = O0(.....) Why?
B) The function searches in a vector an interval of consecutive elements with a
certain characteristic: which one?
C) Suppose that the input vector contains more than one interval that fulfils the
criterium of point B, which one will be returned: the first one, the last one or a
random one?
D) Suppose that there exists a vector int data[N], with N constant. Are the following
function calls correct? Why? (Say yes/no per each of the options, and explain why)
1) nd= find(data,N,8);
2) nd3 find(&data[0],N,N);
3) nd3 find(*data,N,8);
4) nd3 find(data+N/2,N,N);
Transcribed Image Text:Given the following function int find (int *v, int n, int s) { int i, j; for (i-0; i<n-4; i++) { int sum = 0; for (j-0; j<4; j++) { sum += v[i+j]; s) if (sum return i; return -1; Answer the following questions: A) Which is the worst-case complexity of the function? T(n) = O0(.....) Why? B) The function searches in a vector an interval of consecutive elements with a certain characteristic: which one? C) Suppose that the input vector contains more than one interval that fulfils the criterium of point B, which one will be returned: the first one, the last one or a random one? D) Suppose that there exists a vector int data[N], with N constant. Are the following function calls correct? Why? (Say yes/no per each of the options, and explain why) 1) nd= find(data,N,8); 2) nd3 find(&data[0],N,N); 3) nd3 find(*data,N,8); 4) nd3 find(data+N/2,N,N);
Expert Solution
steps

Step by step

Solved in 4 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY