Please explain the code!!

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 send me answer within 10 min!! I will rate you good for sure!! Please explain the code!!
Can you please explain this C code beside every code on each line:
#include <bits/stdc++.h>
int Segments = -1;
int Obstacle = 0;
void Loopings() {
if(Obstacle > Segments) {
Segments Obstacle;
}
Obstacle = 0;
}
int main() {
int RoadSegments;
int u, j, k;
scanf("%d", &RoadSegments);
int Course [RoadSegments + 3];
for(u= 0; u < RoadSegments; u++) {
scanf("%d", &Course[u]);
}
for(j = 0; j< Road Segments; j++){
if(Course[j] == 0) {
if(j+1 < RoadSegments) {
if(abs (Courselj - 1] - Course[j+1]) == 0 || abs (Courselj - 1] - Course[j+1]) == 2) {
Obstacle++;
Transcribed Image Text:Can you please explain this C code beside every code on each line: #include <bits/stdc++.h> int Segments = -1; int Obstacle = 0; void Loopings() { if(Obstacle > Segments) { Segments Obstacle; } Obstacle = 0; } int main() { int RoadSegments; int u, j, k; scanf("%d", &RoadSegments); int Course [RoadSegments + 3]; for(u= 0; u < RoadSegments; u++) { scanf("%d", &Course[u]); } for(j = 0; j< Road Segments; j++){ if(Course[j] == 0) { if(j+1 < RoadSegments) { if(abs (Courselj - 1] - Course[j+1]) == 0 || abs (Courselj - 1] - Course[j+1]) == 2) { Obstacle++;
if(abs (Courselj - 1] - Coursej +1]) == 0 || abs (Courselj - 1] - Courselj + 1]) == 2) {
Obstacle++;
}
else {
}
}
Obstacle++;
Loopings();
Obstacle++;
else {
Obstacle++;
else {
if(u + 2 < RoadSegments) {
if(abs (Course[u] - Course[u + 2]) == 0 || abs (Course[u] - Course[u + 2]) == 2) {
Obstacle++;
continue;
}
else {
Obstacle += 2;
Loopings();
}
else {
Obstacle++;
continue;
Loopings();
printf("%d\n", Segments);
}
Thank you !!
Transcribed Image Text:if(abs (Courselj - 1] - Coursej +1]) == 0 || abs (Courselj - 1] - Courselj + 1]) == 2) { Obstacle++; } else { } } Obstacle++; Loopings(); Obstacle++; else { Obstacle++; else { if(u + 2 < RoadSegments) { if(abs (Course[u] - Course[u + 2]) == 0 || abs (Course[u] - Course[u + 2]) == 2) { Obstacle++; continue; } else { Obstacle += 2; Loopings(); } else { Obstacle++; continue; Loopings(); printf("%d\n", Segments); } Thank you !!
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