Project #5 The purpose of this project is to get familiar with the programming language C to be able to leam the next lectures. The following Java program makes a list of integers, divides the list into a number of segments, and displays each segment in reverse order. Convert the program to a C program. Use the built-in function: malloc to dynamically allocate locations for variables: a and b. import java.util.Bandon; public class Main { public static void main(String[] aces){ int[) a; int[] b; Random r= new Random(Systen.CuCcentIimettiLLis()); int alsnsth - CextInt(10) + 90; 1/9; int blength - GDRxtInt(10) + 10; //2; while(alensth X blength !- e) alengthe+; Making aleosth divisible by bleosth a- new int[alsosth); b- new int(blengtb]; for(int i- e; &< dedeoeth: ++) a[4) - GDextint(10); ecintferwaod(a); for(int index = e; index < adegth: { for(int i- e;i < Budeorths ++) b[1] - a[indexei); Bcinteackwand( b); index + bulength: private static void gcinteackoard(int[] x) { for(int i = Kadength - 1; i >= e; i--) Sxsten.out.prins(*[3) + ", "); Susten.out.orintln(); private static void gcintfeoard(int[] x) { for(int i- e; i Kdength: i++) Sxsten.out.Rcint (x[A) +, "); Susten.out.println(); Answer:
Project #5 The purpose of this project is to get familiar with the programming language C to be able to leam the next lectures. The following Java program makes a list of integers, divides the list into a number of segments, and displays each segment in reverse order. Convert the program to a C program. Use the built-in function: malloc to dynamically allocate locations for variables: a and b. import java.util.Bandon; public class Main { public static void main(String[] aces){ int[) a; int[] b; Random r= new Random(Systen.CuCcentIimettiLLis()); int alsnsth - CextInt(10) + 90; 1/9; int blength - GDRxtInt(10) + 10; //2; while(alensth X blength !- e) alengthe+; Making aleosth divisible by bleosth a- new int[alsosth); b- new int(blengtb]; for(int i- e; &< dedeoeth: ++) a[4) - GDextint(10); ecintferwaod(a); for(int index = e; index < adegth: { for(int i- e;i < Budeorths ++) b[1] - a[indexei); Bcinteackwand( b); index + bulength: private static void gcinteackoard(int[] x) { for(int i = Kadength - 1; i >= e; i--) Sxsten.out.prins(*[3) + ", "); Susten.out.orintln(); private static void gcintfeoard(int[] x) { for(int i- e; i Kdength: i++) Sxsten.out.Rcint (x[A) +, "); Susten.out.println(); Answer:
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
100%
I am learning C for a class I am taking and a homework assignment asks us to makes a list of integers, divides the list into a number of segments, and displays each segment in reverse order. We need to use the function malloc to dynamically allocate locations for variables a and b. The full assignment is below. I am not too familiar with C and I don't know how to split the list into two arrays.
![AutoSave
Project 5
Compatibility Mode
OFF
Home
Insert
Draw
Design
Layout
References
Mailings
Review
View
Tell me
2 Share
O Comments
Times New... v
14
A A
Аa v
A
AaBbCcDdEe AaBbCcD AaBbCcDdE
AaBbCcDdF
AaBbCcD
AaBbCcDdEe
>
ev A v
No Spacing
Paste
Emphasis
Normal
Strong
Subtitle
Title
Styles
Pane
B
U
v ab x,
A
Heading 1
Dictate
Project #5
The purpose of this project is to get familiar with the programming language C to be able
to learn the next lectures. The following Java program makes a list of integers, divides
the list into a number of segments, and displays each segment in reverse order. Convert
the program to a C program. Use the built-in function: malloc to dynamically allocate
locations for variables: a and b.
import java.til.Bandem;
public class Main {
public static void main(String[] args){
int[] a;
int[] b;
Random r = new Random(Şystem.curcenttieMillis());
int alength = CiextInt(10) + 90;
int blength = aoextInt(10) + 10;
while(alength % blength != 0)
alengtb++;
a = new int[alenstb];
b = new int[blengtb];
for(int i = 0; i < audength; i++)
a[i] = aextInt(10);
erintterwacd(a);
for (int index = 0; index < andength; ){
for(int į = 0; i < bedensth; i++)
b[i] = a[indexti];
Brintkaskward(b);
index += bulength;
}
}
//9;
//2;
//Making alength divisible by blength
private static void printBaskward(int[] x) {
for(int i = Xength
Sxsten.Qut.Rcint(x[¿] + ".
Susten Qut.Brintla();
}
1; i >= 0; j--)
");
-
private static void printforward(int[] x) {
for(int i = 0; i < Xulength; i++)
Sustem.Qut RCint(x[i] +
Sustem.autuRrintla();
}
}
", ");
Answer:
Page 1 of 1
204 words
E English (United States)
E3 Focus
107%](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd25d0f0a-7593-4c06-a2e8-6386a145fe28%2Fc00cb04b-eae5-4271-9fe3-e0310daa4df9%2Febimri_processed.png&w=3840&q=75)
Transcribed Image Text:AutoSave
Project 5
Compatibility Mode
OFF
Home
Insert
Draw
Design
Layout
References
Mailings
Review
View
Tell me
2 Share
O Comments
Times New... v
14
A A
Аa v
A
AaBbCcDdEe AaBbCcD AaBbCcDdE
AaBbCcDdF
AaBbCcD
AaBbCcDdEe
>
ev A v
No Spacing
Paste
Emphasis
Normal
Strong
Subtitle
Title
Styles
Pane
B
U
v ab x,
A
Heading 1
Dictate
Project #5
The purpose of this project is to get familiar with the programming language C to be able
to learn the next lectures. The following Java program makes a list of integers, divides
the list into a number of segments, and displays each segment in reverse order. Convert
the program to a C program. Use the built-in function: malloc to dynamically allocate
locations for variables: a and b.
import java.til.Bandem;
public class Main {
public static void main(String[] args){
int[] a;
int[] b;
Random r = new Random(Şystem.curcenttieMillis());
int alength = CiextInt(10) + 90;
int blength = aoextInt(10) + 10;
while(alength % blength != 0)
alengtb++;
a = new int[alenstb];
b = new int[blengtb];
for(int i = 0; i < audength; i++)
a[i] = aextInt(10);
erintterwacd(a);
for (int index = 0; index < andength; ){
for(int į = 0; i < bedensth; i++)
b[i] = a[indexti];
Brintkaskward(b);
index += bulength;
}
}
//9;
//2;
//Making alength divisible by blength
private static void printBaskward(int[] x) {
for(int i = Xength
Sxsten.Qut.Rcint(x[¿] + ".
Susten Qut.Brintla();
}
1; i >= 0; j--)
");
-
private static void printforward(int[] x) {
for(int i = 0; i < Xulength; i++)
Sustem.Qut RCint(x[i] +
Sustem.autuRrintla();
}
}
", ");
Answer:
Page 1 of 1
204 words
E English (United States)
E3 Focus
107%
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education