Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Related questions
Question
Fill in the code for problem.
![#include<stdio.h>
int main(){
int n; // number of elements in the list
scanf("%i", &n);
?? list[??]; // list with duplicated elements
// Input the elements
for (int i =
0; i < ??; i++){
scanf("%??", &list[i]);
}
// Remove duplicates
1; // index
1; // index
//why do we need two indeces?
list[??];
int i
int j
int ref =
int L[??]; // list without duplicated elements
L[??]
while (i<?? ) {
list[??]; // Which will value be always in L?
%3D
if (list[i] ?? ref){
L[ ??]
ref = list[??];
??;
list[??];
}
??;
}
// Printing results
printf("BEFORE\n");
for (int i=0; i < ??; i++){
printf("%??", list[i]);
}
printf("\NAFTER\n");
for (int i= 0; i<??; i++){
printf("%??", L[i]);
}
printf("\n") ;
return 0;
}](https://content.bartleby.com/qna-images/question/b4fbdee7-4dd6-4b70-b473-f3d2f2c3fe84/22e28217-6744-44ec-90e5-fe1ed82f7192/uhs7lmr_processed.png)
Transcribed Image Text:#include<stdio.h>
int main(){
int n; // number of elements in the list
scanf("%i", &n);
?? list[??]; // list with duplicated elements
// Input the elements
for (int i =
0; i < ??; i++){
scanf("%??", &list[i]);
}
// Remove duplicates
1; // index
1; // index
//why do we need two indeces?
list[??];
int i
int j
int ref =
int L[??]; // list without duplicated elements
L[??]
while (i<?? ) {
list[??]; // Which will value be always in L?
%3D
if (list[i] ?? ref){
L[ ??]
ref = list[??];
??;
list[??];
}
??;
}
// Printing results
printf("BEFORE\n");
for (int i=0; i < ??; i++){
printf("%??", list[i]);
}
printf("\NAFTER\n");
for (int i= 0; i<??; i++){
printf("%??", L[i]);
}
printf("\n") ;
return 0;
}
Transcribed Image Text:You will receive an array whose size is variable. The user will give you the size of the array at the
beginning. It will contain integers numbers in ascending order; however, it contains duplicates.
Your job is to create a new array that does not contain duplicated elements. Then, you will print
the input array and the new array.
|(base) sebasjr@sebasjr-ubuntu:~$ ./a.out
10
0 1 1 2 2 3 3 4 5 5
BEFORE
0 1 1 2 2 3 3 4 5 5
AFTER
0 1 2 3 4 5
(base) sebasjr@sebasjr-ubuntu:~$ ./a.out
8
|-4 -3 -2 -1 0 1 2 3
BEFORE
|-4 -3 -2 -1 0 1 2 3
AFTER
|-4 -3 -2 -1 0 1 2 3
Expert Solution
arrow_forward
Step 1
Required corresponding code is filled according to comment in the code.
Step by stepSolved in 3 steps with 1 images
Knowledge Booster
Similar questions
- CODE WORKS IN CENGAGE BUT, NOT SHOWING AS CORRECT WHEN YOU RUN CHECKSarrow_forwardWhat is a "foreach" loop?arrow_forward2. Identify invalid variables names from the following lists. Justify your answer. i) Student nameii) AVERAGEiii) doubleiv) _numberv) 2numbervi) number2vii) 3456viii) totalVALUEix) side_lengthx) currency$arrow_forward
- please code in pythonRead in and return a list of review dates. The function should ask the user to enter some review dates This should be entered in the format mm/dd/yyyy (same as that in the file) where dd is two-digit day, mm is two digit month and yyyy is a four digit year e.g. 01/22/2020 The function should return a list containing the specified review dates. :return: a list of review datesYou can take any review date as sample examplearrow_forwardPlease code this in C++. Do not use namespace std. Please use basic code. Thank you for your time. Common Elements Write a program that prompts the user to enter two arrays of 10 integers and displays the common elements that appear in both arrays. Here is a sample run. Enter list1: 8 5 10 1 6 16 61 9 11 2 Enter list2: 4 2 3 10 3 34 35 67 3 1 The common elements are 10 1 2arrow_forwardWhat does the colon prompt imply?arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSON
Computer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier Science
Network+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning 
Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage Learning
Prelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson Education
Sc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY
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 Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
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
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY