This question is in the course of Programming Languages 2, which is the second course in C programming language, My own student number is needed to solve the question, and here it is: 2016710213074. I need the answer ASAP. Thanks!

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

This question is in the course of Programming Languages 2, which is the second course in C programming language,

My own student number is needed to solve the question, and here it is:
2016710213074.

I need the answer ASAP. Thanks!

Assume for the program given below that the elements of array A are your student number.
Assume that Data type of int is stored in 1 byte (8 bits) in memory. According to this
information, write the output of the program given below.
Note: Use the given assumption to get the output, don't run the code in the computer you will
get wrong output.
Örnek Hesaplama (Sample Calculation):
öğrenci No (Student No)
A Dizisi (Array A)
{1,8,1,0,2,0,6,0,3,7}
{2,0,1,5,0,1,0,2,0,6,0,4,7}
1810206037
2015010206047
Transcribed Image Text:Assume for the program given below that the elements of array A are your student number. Assume that Data type of int is stored in 1 byte (8 bits) in memory. According to this information, write the output of the program given below. Note: Use the given assumption to get the output, don't run the code in the computer you will get wrong output. Örnek Hesaplama (Sample Calculation): öğrenci No (Student No) A Dizisi (Array A) {1,8,1,0,2,0,6,0,3,7} {2,0,1,5,0,1,0,2,0,6,0,4,7} 1810206037 2015010206047
#include <stdio.h>
#include <stdlib.h>
int main () (
int A[13] =( your student number);
unsigned int s1=0, s2=0;
for (int i=0; i<13; i++)
if (A[i] *2==0)
s1= s1+A[i]:
else
s2= s2+A[i]:
printf ("Output 1 : *y \n", s1):
printf ("Out put 2 : * \n", s2);
s1=s1>>1;
s2=s2<<2;
printf ("after si>>1 Output 3 u \n", s1):
printf ("after s2<<2 Output 4: u \ n", s2);
printf ("a1|s2 Output 5: *u \n", si|s2);
printf ("s1*s2 Output 6: *u \n", s1 s2);
printf ("s16s2 Output 7: %u \n", s1&s2);
getchar ();
return 0;
Transcribed Image Text:#include <stdio.h> #include <stdlib.h> int main () ( int A[13] =( your student number); unsigned int s1=0, s2=0; for (int i=0; i<13; i++) if (A[i] *2==0) s1= s1+A[i]: else s2= s2+A[i]: printf ("Output 1 : *y \n", s1): printf ("Out put 2 : * \n", s2); s1=s1>>1; s2=s2<<2; printf ("after si>>1 Output 3 u \n", s1): printf ("after s2<<2 Output 4: u \ n", s2); printf ("a1|s2 Output 5: *u \n", si|s2); printf ("s1*s2 Output 6: *u \n", s1 s2); printf ("s16s2 Output 7: %u \n", s1&s2); getchar (); return 0;
Expert Solution
steps

Step by step

Solved in 2 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