1. What is the output of this code? int x=3, y=8: Y = y<>2; cout << x-y: (a) 64 (b) -64 2. What will the following code will print? (c) 11 (d) 12 int n, k=5; n= (100k ? k+1: k-1): cout <3) ( for (i=1; i<5; it+) j++; } (a) 0 (b) 3 (c) 5 (d) 15 4. What is purpose of the following code segment? int n, m, t, a[7]=(3,2,-1,0,1,7,-4); for ( n=0; for ( m-n+1;m<7; m++) { if (a[n] < a [m]) t = a[n]: n<7; n++) a[n] = a [m]; a [m] = t: } sort array a in ascending order rotating the array sort array a in descending order (d) swap the adjacent numbers in the array

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
ver:
1. What is the output of this code?
int x=3, y=8%:
y = y<<x;
x = x>>2;
cout << x-y;
(a) 64
(b) -64
(c) 11
2. What will the following code will print?
(d) 12
int n, k=5;
n= (100%k ? k+1 : k-1);
cout << n;
(a) 4
(b) 5
(c) 6
(d) 100
3. How many times will the following nested loop run?
int i, j=3;
while (j>3) (
for (i=1; i<5; i++)
j++; }
(a) 0
(b) 3
(c) 5
(d) 15
4. What is purpose of the following code segment?
int n, m, t, a[7]=(3,2,-1,0,1,7,-4);
for ( n=0;
for ( m=n+1;m<7; m++) {
if (a[n] < a[m]) {t = a[n];
n<7; n++)
aln] = a[m];
a [m] = t; }
sort array a in ascending order
rotating the array
(b) sort array a in descending order
(d) swap the adjacent numbers in the array
Transcribed Image Text:ver: 1. What is the output of this code? int x=3, y=8%: y = y<<x; x = x>>2; cout << x-y; (a) 64 (b) -64 (c) 11 2. What will the following code will print? (d) 12 int n, k=5; n= (100%k ? k+1 : k-1); cout << n; (a) 4 (b) 5 (c) 6 (d) 100 3. How many times will the following nested loop run? int i, j=3; while (j>3) ( for (i=1; i<5; i++) j++; } (a) 0 (b) 3 (c) 5 (d) 15 4. What is purpose of the following code segment? int n, m, t, a[7]=(3,2,-1,0,1,7,-4); for ( n=0; for ( m=n+1;m<7; m++) { if (a[n] < a[m]) {t = a[n]; n<7; n++) aln] = a[m]; a [m] = t; } sort array a in ascending order rotating the array (b) sort array a in descending order (d) swap the adjacent numbers in the array
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