program in java: topic: selection port The Input must be: ["apple", "avocado", "orange", "banana", "strawberry", "pineapple", "plum", "mango"] The assumptions and conditions Sorted partition is on the right side. The order is decreasing based on the number of letters which is found after letter "j" inclusive. The result or output must be: ['strawberry', 'pineapple', 'plum', 'mango', 'orange', 'avocado', 'apple', 'banana'

change this code to C++ #include <stdio.h> #include <stdlib.h> /** * structure to hold each point */ struct Point3D { float x; float y; float z; }; /** * Parses all the vertices from the path. * @param path The input file path. * @param points The points storage. * @param numPoints The number of points. * @return points Dynamically allocated array of points. * @return The center of mass. */ struct Point3D parseInput(const char *path, struct Point3D **points, int *numPoints) { // to hold each record char f_or_v; float x; float y; float z; // to store the file pointer FILE *inFile; // to iterate the points array int it; // structure to store the center of mass struct Point3D centerOfMass; // opening the file inFile = fopen(path, "r"); // counting the number of points *numPoints = 0; while(!feof(inFile)) { fscanf(inFile, "%c %f %f %f\n", &f_or_v, &x, &y, &z); *numPoints += f_or_v == 'v'; } // dynamically allocating space // for the points *points =…

Computer Science Course: Reconfigurable Computing   Content: Make an Experimental report on Implement a 2-D convolution using HLS C and Optimize the HLS with directives.   Please include images of the task in the report.

Transcribed Image Text Develop a C++ code to computer the queries in X Y z format where you are given a list of size m. For computing queries, you have to perform the task to find the number which is occurring one after another in the sub-list [X Y] greater than or similar to z times. If there doesn't exist no number satisfying the given criteria then output “Not possible" other than that output the answer computed to the given queries. Test Case Result 4 1 2133 121

Data structure/ C language /  Graph /  Dijkstra’s algorithm implement a solution of a very common issue: howto get from one town to another using the shortest route.* design a solution that will let you find the shortest paths betweentwo input points in a graph, representing cities and towns, using Dijkstra’salgorithm. Your program should allow the user to enter the input filecontaining information of roads connecting cities/towns. The programshould then construct a graph based on the information provided from thefile. The user should then be able to enter pairs of cities/towns and thealgorithm should compute the shortest path between the two cities/townsentered.Attached a file containing a list of cities/towns with the following data:Field 1: Vertex ID of the 1st end of the segmentField 2: Vertex ID of the 2nd of the segmentField 3: Name of the townField 4: Distance in KilometerPlease note that all roads are two-ways. Meaning, a record may representboth the roads from feild1 to field2…

Code in C Code in the file IO: /*************************************************************    This program prints a degree-to-radian table using a for-    loop structure. The results are printed to a file and the    the screen.  *************************************************************/   #include <stdio.h> #define PI 3.141593 #define FILENAME "tableD2R.dat"   int main(void) {     /*  Declare variables.  */     double radians;    FILE *fileout;    /*  Open file.  */    fileout = fopen(FILENAME,"w");    if (fileout == NULL)       printf("Error opening input file.  \n");    else    {     /*  Print radians and degrees in a loop.  */     printf("Degrees to Radians \n");        for (int degrees=0; degrees<=360; degrees+=10)        {           radians = degrees*PI/180;           printf("%6i %9.6f \n",degrees,radians);           fprintf(fileout,"%6i %9.6f \n",degrees,radians);        }     /*  Exit program.  */     }

C++ Code:  Write a program that finds word differences between two sentences. The input begins with an integer indicating the number of words in each sentence. The next input line is the first sentence and the following input line is the second sentence. Assume that the two sentences have the same number of words and no more than 20 words each. The program displays word pairs that differ between the two sentences. One pair is displayed per line. Ex: If the input is: 6 Smaller cars get better gas mileage Tiny cars get great fuel economy then the output is: Smaller Tiny better great gas fuel mileage economy Add a function named ReadSentences to read the input sentences into two string vectors. void ReadSentences(vector<string>& sentence1Words, vector<string>& sentence2Words, int wordCount) main() already contains code to read the word count and call ReadSentences(). Complete main() to display differing word pairs.

3 Linker Assigned Symbol Strength · The C-code below is one file, symbol.c. For each of the 10 symbols present (s0, s1, it is internal, weak external, or strong external. s9), tell whether .... int s0(int s1, int s2); double s2 = 0, s3; int s4; void s5(long s6) { float s7 = 2.0, s8 = 4; }

Use the following code to perform the following tasks: Show all variables that are visible at POSITION #1 only. Provide their nesting level and offset, using the activation record layout discussed in class.S2how the contents of the call stack at the time when control reaches POSITION #1. Use the layout defined in chapter 10 and used in class for statically scoped languages that allow nested functions. Show values and links. function main() {int w = 1, x = 2; function a(bool flag) {int x = 3; function b() { c(4); } function c(int x) {// POSITION #1 } b(); } a(true); } Provide a leftmost derivation for the string aaabb using the following grammar:<S> → <A><B> <A> → a<A> | a <B> → b<B> | b Identify the shortest possible legal program: <program> → program <ident> ( <ident> { , <ident> } ) <block> <ident> → A | B<block> → begin <stmts> end <stmts> → <ident> = <ident> |…

Would it be possible to use unique, shared or weak pointers in the code?