Here is selection filepublic class Selection { public static in.pdf
•
0 likes•4 views
Here is selection file: public class Selection { public static int select(int[] array, int n, int k) { return select(array, 0, n - 1, k); } private static int select(int[] array, int left, int right, int k) { // complete this function } } here is MedianOfMedians file: public class MedianOfMedians { private static void insertionSort(int[] arr, int left, int right) { for (int i = left + 1; i <= right; i++) { int j = i, temp = arr[j]; while (j > left && temp < arr[j - 1]) { arr[j] = arr[j - 1]; j--; } arr[j] = temp; } } public static int select(int[] array, int n, int k) { return select(array, 0, n - 1, k); } private static int select(int[] array, int left, int right, int k) { // complete this function } } here is Partition file needed to code this correctly public class Partition { static Random rand = new Random(System.currentTimeMillis()); protected static void swap(int[] array, int x, int y) { int temp = array[x]; array[x] = array[y]; array[y] = temp; } public static int generateRandomPivot(int[] array, int left, int right) { return left + rand.nextInt(right - left + 1); } public static int generateMedianOf3Pivot(int[] array, int left, int right) { int mid = left + (right - left) / 2; if (array[left] > array[mid]) swap(array, left, mid); if (array[left] > array[right]) swap(array, left, right); if (array[mid] > array[right]) swap(array, mid, right); return mid; } public static int[] partition(int[] array, int left, int right, int pivotIndex) { // complete this function } } 1.2 Part 2: Selection Algorithms In the second part, you are going to implement the Selection algorithm for finding the kth smallest number in an array. For the pivot, you are going to use a random one. Your task is to implement the following: - Quick-Selection Algorithm (File: Selection) Implement select(int [] array, int left, int right, int k). For pivot generation, call the function generateRandomPivot(int [] array, int left, int right). Since partition returns two indexes, you must the appropriate quick-select algorithm from the notes that utilizes both the indexes. - Median of Medians Algorithm (File: MedianOfMedians) Implement select(int [] array, int left, int right, int k). Since partition returns two indexes, you must modify the median of medians quick-select algorithm from the notes to utilize both the indexes - this modification is simple (essentially copy and paste the final recursive part) if you have completed the randomized quick- select. - Partition Algorithm (File: Partition) Implement partition(int [] array, int left, int right, int pivotIndex) using the partition method in notes that returns two indexes lower PartitionIndex and upper PartitionIndex. Your code must satisfy all the criteria of a partition - linear time and in- place. Additionally, it must scan the array no more than once. Otherwise, no credits will be given..
Report
Share
Report
Share
Download to read offline
![Here is selection file:
public class Selection { public static int select(int[] array, int n, int k)
{ return select(array, 0, n - 1, k); }
private static int select(int[] array, int left, int right, int k) { // complete this function } }
here is MedianOfMedians file:
public class MedianOfMedians { private static void insertionSort(int[] arr, int left, int right)
{ for (int i = left + 1; i <= right; i++) {
int j = i, temp = arr[j];
while (j > left && temp < arr[j - 1])
{ arr[j] = arr[j - 1];
j--; }
arr[j] = temp;
}
}
public static int select(int[] array, int n, int k) { return select(array, 0, n - 1, k); }
private static int select(int[] array, int left, int right, int k) { // complete this function
} }
here is Partition file needed to code this correctly
public class Partition {
static Random rand = new Random(System.currentTimeMillis());
protected static void swap(int[] array, int x, int y) { int temp = array[x];
array[x] = array[y];
array[y] = temp; }
public static int generateRandomPivot(int[] array, int left, int right)
{ return left + rand.nextInt(right - left + 1); }
public static int generateMedianOf3Pivot(int[] array, int left, int right) {
int mid = left + (right - left) / 2;
if (array[left] > array[mid]) swap(array, left, mid);
if (array[left] > array[right]) swap(array, left, right);
if (array[mid] > array[right]) swap(array, mid, right); return mid; }
public static int[] partition(int[] array, int left, int right, int pivotIndex) { // complete this
function } } 1.2 Part 2: Selection Algorithms In the second part, you are going to implement the
Selection algorithm for finding the kth smallest number in an array. For the pivot, you are going
to use a random one. Your task is to implement the following: - Quick-Selection Algorithm (File:
Selection) Implement select(int [] array, int left, int right, int k). For pivot generation, call the](https://image.slidesharecdn.com/hereisselectionfilepublicclassselectionpublicstaticin-231007090404-21cee20b/85/Here-is-selection-filepublic-class-Selection-public-static-in-pdf-1-320.jpg)
![function generateRandomPivot(int [] array, int left, int right). Since partition returns two indexes,
you must the appropriate quick-select algorithm from the notes that utilizes both the indexes. -
Median of Medians Algorithm (File: MedianOfMedians) Implement select(int [] array, int left,
int right, int k). Since partition returns two indexes, you must modify the median of medians
quick-select algorithm from the notes to utilize both the indexes - this modification is simple
(essentially copy and paste the final recursive part) if you have completed the randomized quick-
select.
- Partition Algorithm (File: Partition) Implement partition(int [] array, int left, int right, int
pivotIndex) using the partition method in notes that returns two indexes lower PartitionIndex and
upper PartitionIndex. Your code must satisfy all the criteria of a partition - linear time and in-
place. Additionally, it must scan the array no more than once. Otherwise, no credits will be
given.](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
I need to find run time analysis and description of the algo.pdf
I need to find run time analysis and description of the algorithm complexity (i.e., BigO)
Thank you!
///////////////////////////////////////////////////////////////////////////////////////////////
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Scanner;
public class Sorting {
private static int n;
public static void main(String[] args) {
int[] arr = readFile("Data.txt");
// Bubble sort
long startTime = System.nanoTime();
bubbleSort(arr);
long endTime = System.nanoTime();
System.out.println("Bubble sort time: " + (endTime - startTime) + " nanoseconds");
// Selection sort
startTime = System.nanoTime();
selectionSort(arr);
endTime = System.nanoTime();
System.out.println("Selection sort time: " + (endTime - startTime) + " nanoseconds");
// Insertion sort
startTime = System.nanoTime();
insertionSort(arr);
endTime = System.nanoTime();
System.out.println("Insertion sort time: " + (endTime - startTime) + " nanoseconds");
// Merge sort
startTime = System.nanoTime();
mergeSort(arr);
endTime = System.nanoTime();
System.out.println("Merge sort time: " + (endTime - startTime) + " nanoseconds");
// Quick sort
startTime = System.nanoTime();
quickSortTime = quickSort(arr, 0, arr.length-1);
endTime = System.nanoTime();
System.out.println("Quick sort time: " + (endTime - startTime) + " nanoseconds");
}
private static int[] readFile(String filename) {
int[] arr = null;
try {
File file = new File(filename);
Scanner scanner = new Scanner(file);
n = scanner.nextInt();
arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = scanner.nextInt();
}
scanner.close();
} catch (FileNotFoundException e) {
System.out.println("File not found: " + filename);
System.exit(0);
}
return arr;
}
private static void bubbleSort(int[] arr) {
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
private static void selectionSort(int[] arr) {
for (int i = 0; i < n - 1; i++) {
int minIndex = i;
for (int j = i + 1; j < n; j++) {
if (arr[j] < arr[minIndex]) {
minIndex = j;
}
}
int temp = arr[i];
arr[i] = arr[minIndex];
arr[minIndex] = temp;
}
}
private static void insertionSort(int[] arr) {
for (int i = 1; i < n; i++) {
int key = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = key;
}
}
private static void mergeSortHelper(int[] arr, int left, int right) {
if (left < right) {
int mid = (left + right) / 2;
mergeSortHelper(arr, left, mid);
mergeSortHelper(arr, mid+1, right);
merge(arr, left, mid, right);
}
}
private static void merge(int[] arr, int left, int mid, int right) {
int[] temp = new int[right-left+1];
int i = left, j = mid+1, k = 0;
while (i <= mid && j <= right) {
if (arr[i] <= arr[j]) {
temp[k++] = arr[i++];
} else {
temp[k++] = arr[j++];
}
}
while (i <= mid) {
temp[k++] = arr[i++];
}
while (j <= right) {
temp[k++] = arr[j++];
}
for (i = left, k = 0; i <= right; i++, k++).
Use Applicative where applicable!
Most Scala developers are familiar with monadic precessing. Monads provide flatMap and hence for-comprehensions (syntactic sugar for map and flatMap).
Often we don't need Monads. Applicatives are sufficient in many cases.
In this talk I examine the differences between monadic and applicative processing and give some guide lines when to use which.
After a closer look to the Applicative trait I will contrast the gist of Either and cats.data.Validated (the latter being an Applicative but not a Monad).
I will also look at traversing and sequencing which harness Applicatives as well.
Recommended
I need to find run time analysis and description of the algo.pdf
I need to find run time analysis and description of the algorithm complexity (i.e., BigO)
Thank you!
///////////////////////////////////////////////////////////////////////////////////////////////
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;
import java.util.Scanner;
public class Sorting {
private static int n;
public static void main(String[] args) {
int[] arr = readFile("Data.txt");
// Bubble sort
long startTime = System.nanoTime();
bubbleSort(arr);
long endTime = System.nanoTime();
System.out.println("Bubble sort time: " + (endTime - startTime) + " nanoseconds");
// Selection sort
startTime = System.nanoTime();
selectionSort(arr);
endTime = System.nanoTime();
System.out.println("Selection sort time: " + (endTime - startTime) + " nanoseconds");
// Insertion sort
startTime = System.nanoTime();
insertionSort(arr);
endTime = System.nanoTime();
System.out.println("Insertion sort time: " + (endTime - startTime) + " nanoseconds");
// Merge sort
startTime = System.nanoTime();
mergeSort(arr);
endTime = System.nanoTime();
System.out.println("Merge sort time: " + (endTime - startTime) + " nanoseconds");
// Quick sort
startTime = System.nanoTime();
quickSortTime = quickSort(arr, 0, arr.length-1);
endTime = System.nanoTime();
System.out.println("Quick sort time: " + (endTime - startTime) + " nanoseconds");
}
private static int[] readFile(String filename) {
int[] arr = null;
try {
File file = new File(filename);
Scanner scanner = new Scanner(file);
n = scanner.nextInt();
arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = scanner.nextInt();
}
scanner.close();
} catch (FileNotFoundException e) {
System.out.println("File not found: " + filename);
System.exit(0);
}
return arr;
}
private static void bubbleSort(int[] arr) {
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
private static void selectionSort(int[] arr) {
for (int i = 0; i < n - 1; i++) {
int minIndex = i;
for (int j = i + 1; j < n; j++) {
if (arr[j] < arr[minIndex]) {
minIndex = j;
}
}
int temp = arr[i];
arr[i] = arr[minIndex];
arr[minIndex] = temp;
}
}
private static void insertionSort(int[] arr) {
for (int i = 1; i < n; i++) {
int key = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = key;
}
}
private static void mergeSortHelper(int[] arr, int left, int right) {
if (left < right) {
int mid = (left + right) / 2;
mergeSortHelper(arr, left, mid);
mergeSortHelper(arr, mid+1, right);
merge(arr, left, mid, right);
}
}
private static void merge(int[] arr, int left, int mid, int right) {
int[] temp = new int[right-left+1];
int i = left, j = mid+1, k = 0;
while (i <= mid && j <= right) {
if (arr[i] <= arr[j]) {
temp[k++] = arr[i++];
} else {
temp[k++] = arr[j++];
}
}
while (i <= mid) {
temp[k++] = arr[i++];
}
while (j <= right) {
temp[k++] = arr[j++];
}
for (i = left, k = 0; i <= right; i++, k++).
Use Applicative where applicable!
Most Scala developers are familiar with monadic precessing. Monads provide flatMap and hence for-comprehensions (syntactic sugar for map and flatMap).
Often we don't need Monads. Applicatives are sufficient in many cases.
In this talk I examine the differences between monadic and applicative processing and give some guide lines when to use which.
After a closer look to the Applicative trait I will contrast the gist of Either and cats.data.Validated (the latter being an Applicative but not a Monad).
I will also look at traversing and sequencing which harness Applicatives as well.
Problem 1 Show the comparison of runtime of linear search and binar.pdf
Problem 1: Show the comparison of runtime of linear search and binary search using line chart
and table. Execute both algorithms 6 times on same data(use random integer generators), where
input data size are: 50000, 100000, 150000, 200000, 250000, and 300000. Please report worst
case runtimes so that the search item is not found in the input data.
Problem 2: Show the comparison of runtime of bubble sort and merge sort using line chart and
table. Execute both algorithms 6 times on same data(use random integer generators), where data
size are: 50000, 100000, 150000, 200000, 250000, and 300000. In each execution, sort the data
in ascending order.
Solution
Search & sort comparison for differnt sort & search algorithms.
Problem1: Java Code:
import java.util.Random;
public class SearchComparison {
public static void main(String[] args) {
//Compare linear & binary search for
//random data 6 times & print its execution time
System.out.println(\"--------------------------------\");
//50000
searchComparison(50000);
System.out.println(\"--------------------------------\");
//100000
searchComparison(100000);
System.out.println(\"--------------------------------\");
//150000
searchComparison(150000);
System.out.println(\"--------------------------------\");
//200000
searchComparison(200000);
System.out.println(\"--------------------------------\");
//250000
searchComparison(250000);
System.out.println(\"--------------------------------\");
//and 300000
searchComparison(300000);
System.out.println(\"--------------------------------\");
}
/**
* searchComparison
* @param size
*/
public static void searchComparison(int size){
System.out.println(\"Input size:\"+size);
//Generate random numbers list for given size
Random randomGenerator = new Random();
int list[]=new int[size];
for (int index = 0; index < size; ++index){
list[index]=randomGenerator.nextInt(size);
}
//For worst case key must be last number list[size-1]
long startTime=System.nanoTime();
linearSearch(list, list[size-1]);
long endTime=System.nanoTime();
long totalTime=(endTime-startTime); //time in nanoseconds
System.out.println(\"Linear search: input size=\"+size+\" - time=\"+totalTime);
startTime=System.nanoTime();
binarySearch(list, list[size-1]);
endTime=System.nanoTime();
totalTime=(endTime-startTime); //time in milliseconds
System.out.println(\"Binary search: input size=\"+size+\" - time=\"+totalTime);
}
/**
* Linearly search key in list[]. If key is present then return the index,
* otherwise return -1
*
* @param list
* @param key
* @return
*/
public static int linearSearch(int list[], int key) {
for (int index = 0; index < list.length; index++) {
if (list[index] == key)
return index;
}
return -1;
}
/**
* BinarySearch search key in list[]. If key is present then return the
* index, otherwise return -1
*
* @param list
* @param key
* @return
*/
public static int binarySearch(int list[], int key) {
int lo = 0;
int hi = list.length - 1;
while (lo <= hi) {
// Key is in list[lo..hi] or not present..
New Functional Features of Java 8
On March 2014, Java 8 was released. These informal slides describe the new elements of the programming languages, focusing on those taken from the functional paradigm.
Objective Min-heap queue with customized comparatorHospital emerg.pdf
Objective: Min-heap queue with customized comparator
Hospital emergency room assign patient priority base on symptom of the patient. Each patient
receives an identity number which prioritizes the order of emergency for the patient. The lower
the number is, the higher the emergency will be.
Use java.util.PriorityQueue to write a java program to create the emergency room registration
database. The patient.txt is the input file for patient record. Download patient.txt, Patient.java to
perform following specifications:
(a)Load all records from the input file.
(b)At the end, print the list in assigned priority order.
Given Code:
//*******************************************************************
// Patient.java
//*******************************************************************
public class Patient
{
private int id;
private String name;
private String emergencyCase;
//----------------------------------------------------------------
// Creates a customer with the specified id number.
//----------------------------------------------------------------
public Patient (int number, String custName,String er )
{
id = number;
name = custName;
emergencyCase = er;
}
//----------------------------------------------------------------
// Returns a string description of this customer.
//----------------------------------------------------------------
public String toString()
{
return \"Patient priority id: \" + id+\" Patient name: \"+name+\" Symptom: \"+emergencyCase;
}
public String getName()
{
return name;
}
public int getId()
{
return id;
}
public String getCase()
{
return emergencyCase;
}
}
/** Source code example for \"A Practical Introduction to Data
Structures and Algorithm Analysis, 3rd Edition (Java)\"
by Clifford A. Shaffer
Copyright 2008-2011 by Clifford A. Shaffer
*/
import java.util.*;
import java.math.*;
/** A bunch of utility functions. */
class DSutil {
/** Swap two Objects in an array
@param A The array
@param p1 Index of one Object in A
@param p2 Index of another Object A
*/
public static void swap(E[] A, int p1, int p2) {
E temp = A[p1];
A[p1] = A[p2];
A[p2] = temp;
}
/** Randomly permute the Objects in an array.
@param A The array
*/
// int version
// Randomly permute the values of array \"A\"
static void permute(int[] A) {
for (int i = A.length; i > 0; i--) // for each i
swap(A, i-1, DSutil.random(i)); // swap A[i-1] with
} // a random element
public static void swap(int[] A, int p1, int p2) {
int temp = A[p1];
A[p1] = A[p2];
A[p2] = temp;
}
/** Randomly permute the values in array A */
static void permute(E[] A) {
for (int i = A.length; i > 0; i--) // for each i
swap(A, i-1, DSutil.random(i)); // swap A[i-1] with
} // a random element
/** Initialize the random variable */
static private Random value = new Random(); // Hold the Random class object
/** Create a random number function from the standard Java Random
class. Turn it into a uniformly distributed value within the
range 0 to n-1 by taking the value mod n.
@param n The upper boun.
Practical cats
Sharing what i've learnt about Cats at the Scala meetup in Singapore. Link to video ⇒ https://engineers.sg/v/1871
To write a program that implements the following C++ concepts 1. Dat.pdf
To write a program that implements the following C++ concepts 1. Data Encapsulation 2.
Instantiate classes 3. Composition Class 4. Aggregation Class 5. Dynamic Memory 6. File
Stream Make a program that reads a file and can generate reports. Each file will have phone calls
records (see section 4). The program will process the data gathering all minutes and total amount
for each report. The program should have a menu (see section 1): 1. New Report – this option
will ask a file name (TE??????.tel). This option will instantiate an object of Report class, loading
the whole file into memory. 2. Delete a report – this option will display all reports available in
memory and ask which one you would like to delete. 3. Display a report – this option will
display all reports available in memory and ask you which one you would like to generate a
report. 4. Exit – Program ends. For option 1, you do not know how many reports are, meaning
that you will create dynamically the reports. For long distance calls the formula will be (minutes
call x $1.50). For local phone calls the formula will be (minutes call x $0.25)
--------------------------------------------------------------------------------------------------------------------
----------------------------
//Main.cpp
*#define between(x,y,z) ((x>=y && x<=z)? true:false)
#include
#include
#include
#include \"Data.h\"
#include \"Report.h\"
#include \"Menu.h\"
using namespace std;
//uses class Report to create reports
//uses class Menu to display a menu to choose
int main() {
int idx = 0;
int count = idx;
Menu menu(\"Reports\");
Data temp;
string fileName;
Report* phoneCompany;
Report* newReport(Report*, int&);
Report* deleteReport(Report*, int&, int);
int displayReport(Report*, int);
bool fileNameExists(string);
menu.addMenuItem(\"New Report\");
menu.addMenuItem(\"Delete a Report\");
menu.addMenuItem(\"Display a Report\");
ofstream openFile;
phoneCompany = NULL;
phoneCompany = new Report[count];
do {
cout << menu;
cin >> menu;
switch (menu.getChoice()) {
case \'1\':
cout << \"\ \\tEnter report name (TE??????): \";
cin >> fileName;
openFile.open(fileName + \".tel\");
if (openFile.good()) {
cout << \"\ \\tReport succesfully created.\ \";
phoneCompany[count].setFileName(fileName);
count++;
}
else {
cout << \"\ \\terror: Could not create report.\ \";
}
break;
case \'2\':
if (count != 0) {
do {
system(\"cls\");
cout << \"\ \ \\tDelete a Report:\ \ \";
idx = displayReport(phoneCompany, count);
if (between(idx, 0, count - 1)) {
phoneCompany = deleteReport(phoneCompany, count, idx);
idx = 0;
}
else
cout << \"\ \\terror: Report could not be deleted.\ \";
} while (idx != count);
}
else {
cout << \"\ \ \\tNo reports to delete.\ \ \";
system(\"pause\");
}
break;
case \'3\':
if (count != 0) {
do {
system(\"cls\");
cout << \"Display a Report:\ \ \";
idx = displayReport(phoneCompany, count);
system(\"cls\");
cout << \"\ \\t\" << phoneCompany[idx].getFileName();
cout << \"\ \ \\tWould you like to edit the report?\";
cout << \.
Write a program that obtains the execution time of selection sort, bu.pdf
Write a java program called Question39 that does the following: Gets input for temperature
Utilizing a branching statement: If temperature is 76-100, call method outputHot passing the
temperature input as an argument. If temperature is 0-39, call method outputCold passing the
temperature input as an argument. If temperature is 40 to 75, call method outputJustRight
passing the temperature input as an argument. If temperature is outside these ranges, output
“Temperature outside range” to the screen. Be precise, import modules, include comments,
prologue, etc. as needed.
Solution
Question39.java
import java.util.Scanner;
public class Question39 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter temperature: \");
int temp = scan.nextInt();
if(temp >=76 && temp <=100){
outputHot(temp);
}
else if(temp >=0 && temp <=39){
outputCold(temp);
}
else if(temp >=40 && temp <=75){
outputJustRight(temp);
}
else{
System.out.println(\"Temperature outside range\");
}
}
public static void outputHot(int temp){
System.out.println(\"Temperature \"+temp+\" Hot \");
}
public static void outputCold(int temp){
System.out.println(\"Temperature \"+temp+\" Cold \");
}
public static void outputJustRight(int temp){
System.out.println(\"Temperature \"+temp+\" Just Right \");
}
}
Output:
Enter temperature:
45
Temperature 45 Just Right.
Modify before asshignment so that we can check input errors, etc.. P.pdf
Modify before asshignment so that we can check input errors, etc.. Please refer to the following
Java code.
You should add switch, run your programing untill you choose figure==0 (using while loop),
cheak input error.
import java.util.*;
public class AreaTestt {
public static void main (String[] args)
{
int choice1 = menu(1);
int choice2 = menu(2)
}
// get user choice
public static int menu(int n)
{
int choice = 0;
Scanner scanner = new Scanner(System.in);
if(n == 1)
{
System.out.print(\"Information for figure 1: Type 1) rectangle 2) triangle 3) circle: \");
choice = scanner.nextInt();
}
else if(n == 2)
{
System.out.print(\"Information for figure 2: Type 1) rectangle 2) triangle 3) circle: \");
choice = scanner.nextInt();
}
return choice;
}
}
Solution
import java.util.*;
public class AreaTestt {
public static void main(String[] args) {
menu();
}
// get user choice
public static void menu() {
int choice = 0;
Scanner scanner = new Scanner(System.in);
do {
choice = scanner.nextInt();
switch (choice) {
case 1:
System.out
.print(\"Information for figure 1: Type 1) rectangle 2) triangle 3) circle: \");
break;
case 2:
System.out
.print(\"Information for figure 2: Type 1) rectangle 2) triangle 3) circle: \");
break;
default:
break;
}
} while (choice != 0);
}
}
OUTPUT:
2
Information for figure 2: Type 1) rectangle 2) triangle 3) circle: 3
1
Information for figure 1: Type 1) rectangle 2) triangle 3) circle: 0.
Extractors & Implicit conversions
This presentation explains few features of advance scala. The topics I have covered here are the Implementations of extractors, Implicit conversions, parameters and implicit context and update function with the code snippet.
Help me with these multiple-choice questions. Please dont use chat .pdf
Help me with these multiple-choice questions. Please don't use chat GPT. 8) Which of the
following are properties of relations? A) Each attribute has the same name. B) No two rows in a
relation are identical. C) There are multivalued attributes in a relation. D) All columns are
numeric. 9) The entity integrity rule states that: A) no primary key attribute can be null. B)
referential integrity must be maintained across all entities. C) each entity must have a primary
key. D) a primary key must have only one attribute. 10) The states that no primary key attribute
may be null. A) referential integrity constraint B) entity integrity rule C) partial specialization
rule D) range domain rule
11) An Internal schema describes the A) high-level description of the whole database B) views
of different user groups C) physical storage structures of the database D) none of the above 12)
A data manipulation language is used for A) specifying how primary and candidate keys should
be created B) specifying database retrievals and updates C) specifying database conceptual
schemas D) specifying user views and storage structures E) none of the above 13) In
Client/Server architecture, the middle tier is used to A) run application programs and storing
business rules B) implement graphical user interfaces of a web application C) access data from
the databases D) none of the above.
Hello I am stuck in my code I know is everything is goid but I think.pdf
Hello I am stuck in my code I know is everything is goid but I think I am doing something wrong
with the numbers. Help please. It's written in Coral Coding language.
Here's the question:
On a piano, a key has a frequency, say f0. Each higher key (black or white) has a frequency of
f0 * rn, where n is the distance (number of keys) from that key, and r is 2(1.0/12.0). Given an
initial key frequency, output that frequency and the next 4 higher key frequencies.
Output all frequencies with five digits after the decimal point, which can be achieved as follows:
Put frequency to output with 5 decimal places
Ex: If the input is:
440.0
(which is the A key near the middle of a piano keyboard), the output is:
440.00000 466.16376 493.88330 523.25113 554.36526
Note: Use one statement to compute r = 2(1.0/12.0) using the RaiseToPower() function. Then
use that r in subsequent statements that use the formula fn = f0 * rn with n being 1, 2, 3, and
finally 4.
Here's my code:
float r
float f0
float f1
float f2
float f3
float f4
f0 = 440.0
r = RaiseToPower(2, 1.0 / 12.0)
f1 = f0 * r
f2 = f1 * r
f3 = f2 * r
f4 = f3 * r
Put f0 to output with 5 decimal places
Put " " to output
Put f1 to output with 5 decimal places
Put " " to output
Put f2 to output with 5 decimal places
Put " " to output
Put f3 to output with 5 decimal places
Put " " to output
Put f4 to output with 5 decimal places
I know if I put 44.0 in input I get the answer my only problem is for example if I put 22. 0 I get
440.00000 466.16376 493.88330 523.25113 554.36526 but the expected output is 220.00000
233.08188 246.94165 261.62557 277.18263..
More Related Content
Similar to Here is selection filepublic class Selection { public static in.pdf
Problem 1 Show the comparison of runtime of linear search and binar.pdf
Problem 1: Show the comparison of runtime of linear search and binary search using line chart
and table. Execute both algorithms 6 times on same data(use random integer generators), where
input data size are: 50000, 100000, 150000, 200000, 250000, and 300000. Please report worst
case runtimes so that the search item is not found in the input data.
Problem 2: Show the comparison of runtime of bubble sort and merge sort using line chart and
table. Execute both algorithms 6 times on same data(use random integer generators), where data
size are: 50000, 100000, 150000, 200000, 250000, and 300000. In each execution, sort the data
in ascending order.
Solution
Search & sort comparison for differnt sort & search algorithms.
Problem1: Java Code:
import java.util.Random;
public class SearchComparison {
public static void main(String[] args) {
//Compare linear & binary search for
//random data 6 times & print its execution time
System.out.println(\"--------------------------------\");
//50000
searchComparison(50000);
System.out.println(\"--------------------------------\");
//100000
searchComparison(100000);
System.out.println(\"--------------------------------\");
//150000
searchComparison(150000);
System.out.println(\"--------------------------------\");
//200000
searchComparison(200000);
System.out.println(\"--------------------------------\");
//250000
searchComparison(250000);
System.out.println(\"--------------------------------\");
//and 300000
searchComparison(300000);
System.out.println(\"--------------------------------\");
}
/**
* searchComparison
* @param size
*/
public static void searchComparison(int size){
System.out.println(\"Input size:\"+size);
//Generate random numbers list for given size
Random randomGenerator = new Random();
int list[]=new int[size];
for (int index = 0; index < size; ++index){
list[index]=randomGenerator.nextInt(size);
}
//For worst case key must be last number list[size-1]
long startTime=System.nanoTime();
linearSearch(list, list[size-1]);
long endTime=System.nanoTime();
long totalTime=(endTime-startTime); //time in nanoseconds
System.out.println(\"Linear search: input size=\"+size+\" - time=\"+totalTime);
startTime=System.nanoTime();
binarySearch(list, list[size-1]);
endTime=System.nanoTime();
totalTime=(endTime-startTime); //time in milliseconds
System.out.println(\"Binary search: input size=\"+size+\" - time=\"+totalTime);
}
/**
* Linearly search key in list[]. If key is present then return the index,
* otherwise return -1
*
* @param list
* @param key
* @return
*/
public static int linearSearch(int list[], int key) {
for (int index = 0; index < list.length; index++) {
if (list[index] == key)
return index;
}
return -1;
}
/**
* BinarySearch search key in list[]. If key is present then return the
* index, otherwise return -1
*
* @param list
* @param key
* @return
*/
public static int binarySearch(int list[], int key) {
int lo = 0;
int hi = list.length - 1;
while (lo <= hi) {
// Key is in list[lo..hi] or not present..
New Functional Features of Java 8
On March 2014, Java 8 was released. These informal slides describe the new elements of the programming languages, focusing on those taken from the functional paradigm.
Objective Min-heap queue with customized comparatorHospital emerg.pdf
Objective: Min-heap queue with customized comparator
Hospital emergency room assign patient priority base on symptom of the patient. Each patient
receives an identity number which prioritizes the order of emergency for the patient. The lower
the number is, the higher the emergency will be.
Use java.util.PriorityQueue to write a java program to create the emergency room registration
database. The patient.txt is the input file for patient record. Download patient.txt, Patient.java to
perform following specifications:
(a)Load all records from the input file.
(b)At the end, print the list in assigned priority order.
Given Code:
//*******************************************************************
// Patient.java
//*******************************************************************
public class Patient
{
private int id;
private String name;
private String emergencyCase;
//----------------------------------------------------------------
// Creates a customer with the specified id number.
//----------------------------------------------------------------
public Patient (int number, String custName,String er )
{
id = number;
name = custName;
emergencyCase = er;
}
//----------------------------------------------------------------
// Returns a string description of this customer.
//----------------------------------------------------------------
public String toString()
{
return \"Patient priority id: \" + id+\" Patient name: \"+name+\" Symptom: \"+emergencyCase;
}
public String getName()
{
return name;
}
public int getId()
{
return id;
}
public String getCase()
{
return emergencyCase;
}
}
/** Source code example for \"A Practical Introduction to Data
Structures and Algorithm Analysis, 3rd Edition (Java)\"
by Clifford A. Shaffer
Copyright 2008-2011 by Clifford A. Shaffer
*/
import java.util.*;
import java.math.*;
/** A bunch of utility functions. */
class DSutil {
/** Swap two Objects in an array
@param A The array
@param p1 Index of one Object in A
@param p2 Index of another Object A
*/
public static void swap(E[] A, int p1, int p2) {
E temp = A[p1];
A[p1] = A[p2];
A[p2] = temp;
}
/** Randomly permute the Objects in an array.
@param A The array
*/
// int version
// Randomly permute the values of array \"A\"
static void permute(int[] A) {
for (int i = A.length; i > 0; i--) // for each i
swap(A, i-1, DSutil.random(i)); // swap A[i-1] with
} // a random element
public static void swap(int[] A, int p1, int p2) {
int temp = A[p1];
A[p1] = A[p2];
A[p2] = temp;
}
/** Randomly permute the values in array A */
static void permute(E[] A) {
for (int i = A.length; i > 0; i--) // for each i
swap(A, i-1, DSutil.random(i)); // swap A[i-1] with
} // a random element
/** Initialize the random variable */
static private Random value = new Random(); // Hold the Random class object
/** Create a random number function from the standard Java Random
class. Turn it into a uniformly distributed value within the
range 0 to n-1 by taking the value mod n.
@param n The upper boun.
Practical cats
Sharing what i've learnt about Cats at the Scala meetup in Singapore. Link to video ⇒ https://engineers.sg/v/1871
To write a program that implements the following C++ concepts 1. Dat.pdf
To write a program that implements the following C++ concepts 1. Data Encapsulation 2.
Instantiate classes 3. Composition Class 4. Aggregation Class 5. Dynamic Memory 6. File
Stream Make a program that reads a file and can generate reports. Each file will have phone calls
records (see section 4). The program will process the data gathering all minutes and total amount
for each report. The program should have a menu (see section 1): 1. New Report – this option
will ask a file name (TE??????.tel). This option will instantiate an object of Report class, loading
the whole file into memory. 2. Delete a report – this option will display all reports available in
memory and ask which one you would like to delete. 3. Display a report – this option will
display all reports available in memory and ask you which one you would like to generate a
report. 4. Exit – Program ends. For option 1, you do not know how many reports are, meaning
that you will create dynamically the reports. For long distance calls the formula will be (minutes
call x $1.50). For local phone calls the formula will be (minutes call x $0.25)
--------------------------------------------------------------------------------------------------------------------
----------------------------
//Main.cpp
*#define between(x,y,z) ((x>=y && x<=z)? true:false)
#include
#include
#include
#include \"Data.h\"
#include \"Report.h\"
#include \"Menu.h\"
using namespace std;
//uses class Report to create reports
//uses class Menu to display a menu to choose
int main() {
int idx = 0;
int count = idx;
Menu menu(\"Reports\");
Data temp;
string fileName;
Report* phoneCompany;
Report* newReport(Report*, int&);
Report* deleteReport(Report*, int&, int);
int displayReport(Report*, int);
bool fileNameExists(string);
menu.addMenuItem(\"New Report\");
menu.addMenuItem(\"Delete a Report\");
menu.addMenuItem(\"Display a Report\");
ofstream openFile;
phoneCompany = NULL;
phoneCompany = new Report[count];
do {
cout << menu;
cin >> menu;
switch (menu.getChoice()) {
case \'1\':
cout << \"\ \\tEnter report name (TE??????): \";
cin >> fileName;
openFile.open(fileName + \".tel\");
if (openFile.good()) {
cout << \"\ \\tReport succesfully created.\ \";
phoneCompany[count].setFileName(fileName);
count++;
}
else {
cout << \"\ \\terror: Could not create report.\ \";
}
break;
case \'2\':
if (count != 0) {
do {
system(\"cls\");
cout << \"\ \ \\tDelete a Report:\ \ \";
idx = displayReport(phoneCompany, count);
if (between(idx, 0, count - 1)) {
phoneCompany = deleteReport(phoneCompany, count, idx);
idx = 0;
}
else
cout << \"\ \\terror: Report could not be deleted.\ \";
} while (idx != count);
}
else {
cout << \"\ \ \\tNo reports to delete.\ \ \";
system(\"pause\");
}
break;
case \'3\':
if (count != 0) {
do {
system(\"cls\");
cout << \"Display a Report:\ \ \";
idx = displayReport(phoneCompany, count);
system(\"cls\");
cout << \"\ \\t\" << phoneCompany[idx].getFileName();
cout << \"\ \ \\tWould you like to edit the report?\";
cout << \.
Write a program that obtains the execution time of selection sort, bu.pdf
Write a java program called Question39 that does the following: Gets input for temperature
Utilizing a branching statement: If temperature is 76-100, call method outputHot passing the
temperature input as an argument. If temperature is 0-39, call method outputCold passing the
temperature input as an argument. If temperature is 40 to 75, call method outputJustRight
passing the temperature input as an argument. If temperature is outside these ranges, output
“Temperature outside range” to the screen. Be precise, import modules, include comments,
prologue, etc. as needed.
Solution
Question39.java
import java.util.Scanner;
public class Question39 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter temperature: \");
int temp = scan.nextInt();
if(temp >=76 && temp <=100){
outputHot(temp);
}
else if(temp >=0 && temp <=39){
outputCold(temp);
}
else if(temp >=40 && temp <=75){
outputJustRight(temp);
}
else{
System.out.println(\"Temperature outside range\");
}
}
public static void outputHot(int temp){
System.out.println(\"Temperature \"+temp+\" Hot \");
}
public static void outputCold(int temp){
System.out.println(\"Temperature \"+temp+\" Cold \");
}
public static void outputJustRight(int temp){
System.out.println(\"Temperature \"+temp+\" Just Right \");
}
}
Output:
Enter temperature:
45
Temperature 45 Just Right.
Modify before asshignment so that we can check input errors, etc.. P.pdf
Modify before asshignment so that we can check input errors, etc.. Please refer to the following
Java code.
You should add switch, run your programing untill you choose figure==0 (using while loop),
cheak input error.
import java.util.*;
public class AreaTestt {
public static void main (String[] args)
{
int choice1 = menu(1);
int choice2 = menu(2)
}
// get user choice
public static int menu(int n)
{
int choice = 0;
Scanner scanner = new Scanner(System.in);
if(n == 1)
{
System.out.print(\"Information for figure 1: Type 1) rectangle 2) triangle 3) circle: \");
choice = scanner.nextInt();
}
else if(n == 2)
{
System.out.print(\"Information for figure 2: Type 1) rectangle 2) triangle 3) circle: \");
choice = scanner.nextInt();
}
return choice;
}
}
Solution
import java.util.*;
public class AreaTestt {
public static void main(String[] args) {
menu();
}
// get user choice
public static void menu() {
int choice = 0;
Scanner scanner = new Scanner(System.in);
do {
choice = scanner.nextInt();
switch (choice) {
case 1:
System.out
.print(\"Information for figure 1: Type 1) rectangle 2) triangle 3) circle: \");
break;
case 2:
System.out
.print(\"Information for figure 2: Type 1) rectangle 2) triangle 3) circle: \");
break;
default:
break;
}
} while (choice != 0);
}
}
OUTPUT:
2
Information for figure 2: Type 1) rectangle 2) triangle 3) circle: 3
1
Information for figure 1: Type 1) rectangle 2) triangle 3) circle: 0.
Extractors & Implicit conversions
This presentation explains few features of advance scala. The topics I have covered here are the Implementations of extractors, Implicit conversions, parameters and implicit context and update function with the code snippet.
Similar to Here is selection filepublic class Selection { public static in.pdf (20)
Problem 1 Show the comparison of runtime of linear search and binar.pdf
Problem 1 Show the comparison of runtime of linear search and binar.pdf
Objective Min-heap queue with customized comparatorHospital emerg.pdf
Objective Min-heap queue with customized comparatorHospital emerg.pdf
To write a program that implements the following C++ concepts 1. Dat.pdf
To write a program that implements the following C++ concepts 1. Dat.pdf
Write a program that obtains the execution time of selection sort, bu.pdf
Write a program that obtains the execution time of selection sort, bu.pdf
Modify before asshignment so that we can check input errors, etc.. P.pdf
Modify before asshignment so that we can check input errors, etc.. P.pdf
MATLAB-Cheat-Sheet-for-Data-Science_LondonSchoolofEconomics (1).pdf
MATLAB-Cheat-Sheet-for-Data-Science_LondonSchoolofEconomics (1).pdf
More from arkmuzikllc
Help me with these multiple-choice questions. Please dont use chat .pdf
Help me with these multiple-choice questions. Please don't use chat GPT. 8) Which of the
following are properties of relations? A) Each attribute has the same name. B) No two rows in a
relation are identical. C) There are multivalued attributes in a relation. D) All columns are
numeric. 9) The entity integrity rule states that: A) no primary key attribute can be null. B)
referential integrity must be maintained across all entities. C) each entity must have a primary
key. D) a primary key must have only one attribute. 10) The states that no primary key attribute
may be null. A) referential integrity constraint B) entity integrity rule C) partial specialization
rule D) range domain rule
11) An Internal schema describes the A) high-level description of the whole database B) views
of different user groups C) physical storage structures of the database D) none of the above 12)
A data manipulation language is used for A) specifying how primary and candidate keys should
be created B) specifying database retrievals and updates C) specifying database conceptual
schemas D) specifying user views and storage structures E) none of the above 13) In
Client/Server architecture, the middle tier is used to A) run application programs and storing
business rules B) implement graphical user interfaces of a web application C) access data from
the databases D) none of the above.
Hello I am stuck in my code I know is everything is goid but I think.pdf
Hello I am stuck in my code I know is everything is goid but I think I am doing something wrong
with the numbers. Help please. It's written in Coral Coding language.
Here's the question:
On a piano, a key has a frequency, say f0. Each higher key (black or white) has a frequency of
f0 * rn, where n is the distance (number of keys) from that key, and r is 2(1.0/12.0). Given an
initial key frequency, output that frequency and the next 4 higher key frequencies.
Output all frequencies with five digits after the decimal point, which can be achieved as follows:
Put frequency to output with 5 decimal places
Ex: If the input is:
440.0
(which is the A key near the middle of a piano keyboard), the output is:
440.00000 466.16376 493.88330 523.25113 554.36526
Note: Use one statement to compute r = 2(1.0/12.0) using the RaiseToPower() function. Then
use that r in subsequent statements that use the formula fn = f0 * rn with n being 1, 2, 3, and
finally 4.
Here's my code:
float r
float f0
float f1
float f2
float f3
float f4
f0 = 440.0
r = RaiseToPower(2, 1.0 / 12.0)
f1 = f0 * r
f2 = f1 * r
f3 = f2 * r
f4 = f3 * r
Put f0 to output with 5 decimal places
Put " " to output
Put f1 to output with 5 decimal places
Put " " to output
Put f2 to output with 5 decimal places
Put " " to output
Put f3 to output with 5 decimal places
Put " " to output
Put f4 to output with 5 decimal places
I know if I put 44.0 in input I get the answer my only problem is for example if I put 22. 0 I get
440.00000 466.16376 493.88330 523.25113 554.36526 but the expected output is 220.00000
233.08188 246.94165 261.62557 277.18263..
HeadWallRam Inc. has expanded its reach globally and needs to re-lay.pdf
HeadWallRam Inc. has expanded its reach globally and needs to re-layout it is IP architecture.
The executive team has hired you as a consultant to propose a greenfield network design.
Follow all the same guidlines, restrictions and provisions from Lab Report writing. Include the
following information:
Full IP documentation (not just an IP Grid).
Network Diagram from Draw.io
VyOS route configuration (i.e the "set protocols static" commands) that would be used to
impliment all route entries in all routers. ONLY include the route commands
ISP provides a single DHCP public IP address
Plan for ONE connection to the internet connected to the US site
Interior IP ranges that the company uses (172.18.128.0/17)
Plan a STAR topology for the network core between sites
Plan for networks needed for connections between sites
Plan for all pieces of equipment to be located at one of the Head-Wall-Ram sites (No routers in
space)
Think about WHY you were called in and plan for that too!
US site has five subdivisions: Sales (40 hosts), Technical (600 hosts), Support (300 hosts), Local
Management (150 hosts), Global Management (300 hosts)
China site has six subdivisions: Manufacturing (800 hosts), Sales (20 hosts), Technical (1200
hosts), Support (50 hosts), Legal (40 hosts), R&D (200 hosts)
Europe site has seven subdivisions: Manufacturing (80 hosts), Sales (20 hosts), Technical (400
hosts), Support (40 hosts), Legal (30 hosts), R&D (200 hosts), Management (10 hosts).
HINT For i = 1 , . . . ,n, let S[i] be the max sum ending with A[i].pdf
HINT: For i = 1 , . . . ,n, let S[i] be the max sum ending with A[i] while allowing size-1 gaps.
Derive a recurrence for S[i] Problem 4. Max sum with 1-gaps Given a length- n array of integers
A[1n], we would like to find maximum sum which could be obtained by adding elements in a
subsequence of A if we are allowed to start anywhere in A but once we start, we can either take
the element after the previously selected element or the one after, i.e, gaps of length at most 1 are
allowed in the subsequence. More formally, given A find the maximum S such that there is an
integer 0mn and indices 1i1<.
Hi, I need some assistance with this UML use case diagram. I manage .pdf
Hi, I need some assistance with this UML use case diagram. I manage to brainstorm on what
needs to be in diagram, but I'm unsure if what I started off with is correct. Below is an image of
what I have so far using the template:
My notes:
Actors:
Customer (Student)
- Represents the individuals who are taking driving lessons and using the DriverPass system
for online training, reservations, and interactions.
Administrator (IT Officer)
- Represents the IT officer, Ian, who has administrative privileges to manage and maintain the
system.
Secretary
- Represents the secretary responsible for managing appointments and customer interactions.
DMV (External System) - Is this a stick figure ?
- Represents the external DMV system, which provides updates and notifications related to
driving rules and policies.
Use Cases:
Login
- Allows customers, administrators, and the secretary to log into the system with their
respective credentials.
- Actors: Customer, Administrator, Secretary
Access Training Resources
- Enables customers to access online driver training resources and practice tests.
- Actors: Customer
Schedule Driving Lesson
- Allows customers to schedule on-the-go driving lessons, specifying date, time, and driver
preferences.
- Actors: Customer
Manage Appointments
- Allows customers to view, modify, or cancel their scheduled driving lesson appointments.
- Actors: Customer
Remote System Management
- Enables the administrator (IT Officer, Ian) to remotely access the system for maintenance,
updates, and adjustments.
- Actors: Administrator
Track User Activity
- Tracks user interactions and activities within the system, including reservations, changes, and
cancellations.
- Actors: Administrator
Connect to DMV - How do I show the connection between DMV and Administrator?
- Establishes a connection to the DMV external system to receive updates, notifications, and
compliance information.
- Actors: Administrator
User Registration
- Allows new customers to register on the system by providing their personal information.
- Actors: Customer
Password Reset
- Allows users (customers) to reset their password in case they forget it, using their registered
email address.
- Actors: Customer
System Reporting
- Provides access to system reports, including activity logs, reservation history, and user
statistics.
- Actors: Administrator
Do I need to show the relationships?.
Give an NFA that recognizes the language (10 + 110 + 101) and then .pdf
Give an NFA that recognizes the language (10 + 110 + 101)* and then convert it to an equivalent
DFA
A solution I had in mind was making an NFA for each subtopic, and what I had was essentially:
For 10: q0 on a 1 moves to q1, which epsilon transitions to q2, and q2 transitions to accepting
state 3 on a 1
For 110: q0 on a 1 moves to q1, which epsilon transitions to 2, and q2 transitions to q4 on input
1, q4 goes to q5 on epsilon, and q5 goes to q6 on input 0
For 101: q0 goes to q1 on 1, q1 to q2 on epsilon, q2 to q3 on input 0, q4 to q5 on input epsilon,
q5 to q6 on input 1.
How would I go about linking these seperate NFA's together? My instinct was that they should
just flow into one another, maybe with just epsilon transitions?.
IN JAVA BJP5 Exercise 6.19 leetSpeak LanguageType Java file pr.pdf
IN JAVA
BJP5 Exercise 6.19: leetSpeak Language/Type: Java file processing Scanner Author: Marty
Stepp (on 2019/09/19) Write a method leetSpeak that accepts two parameters: a Scanner
representing an input file, and a PrintStream representing an output file. Your method should
convert the input file's text to "leet speak" (aka 1337 speak), an internet dialect where various
letters are replaced by other letters/numbers. Output the leet version of the text to the given
output file. Preserve the original line breaks from the input. Also wrap each word of input in
parentheses. Perform the following replacements: For example, if the input file lincoln.txt
contains the following text: four score and seven years ago our fathers brought forth on this
continent a new nation And your method is called in the following way: Scanner input = new
Scanner(new File("lincoln.txt")); PrintStream output = new PrintStream(new File("leet.txt"));
leetSpeak(input, output); Then after the call, the output file leet.txt should contain the following
text: (four) (scor3) (4nd) (s3v3n)(y34rz)(4g) (Our) (f47h3rz) (brough7) (for7h) (0n) (7hiz)
(c0n7in3n7) (4) (n3w) (n47ion) You may assume that each token from the input file is separated
by exactly one space. Hint: You may want to use the String object's replace method, which is
used as follows: String str = "mississippi"; str = str.replace("s", "*"); // str = "mi**i**ippi" Type
your solution here:.
Goal Create a hypothetical threat assessment based on vulnerabilities.pdf
Goal: Create a hypothetical threat assessment based on vulnerabilities you expect to find when
you perform your actual scans against the clients network. Procedure: Assume the scenarios
below are what you are most likely to encounter when you begin your actual work. Deliverable:
Provide a spreadsheet or document showing the following items. Make sure you factor in the
appropriate context. For example, if you think you might be able to penetrate the APOLLO
system, evaluate those risks according to that systems sensitivity and criticality. Description of
the vulnerability Operating systems/versions affected Risks of attempting to exploit (e.g., might
crash the host or lock out an account) Risk (what could you or a threat actor do upon successful
exploitation)? Identify as many attack vectors as you can. Examples: launch an attack on
internal systems, obtain password hashes, crack passwords, access other systems, move laterally,
and so on). Identify potential blocking mechanisms such as AV software or IDS/IPS, and how
you might try to bypass them. Document how you plan on cracking passwords. This will depend
on the source systems course, but you should be ready for whatever you run into. Include online
tools as well. Remediation action CVSS score Scenario 5: Web server is exposing sensitive
data Scenario 6: Web application has broken access control Scenario 7: Oracle WebLogic Server
vulnerable to CVE-2020-14882 Scenario 8: Misconfigured cloud storage (AWS security group
misconfiguration, lack of access restrictions) Scenario 9: Microsoft Exchange Server vulnerable
to CVE-2021-26855.
import React, { useEffect } from react;import { BrowserRouter as.pdf
import React, { useEffect } from 'react';
import { BrowserRouter as Router, Route, Routes, Link, useLocation, Outlet, Navigate } from
'react-router-dom'; // Added useLocation
import { App } from './App';
import Cookies from 'js-cookie';
import LoginButton from './authentication/LoginButton'; // Import the LoginButton component
import { useAuth0 } from '@auth0/auth0-react';
const isAuthenticated = true;
export default function RouterPage() {
useEffect(() => {
// Fetch the userId from the Flask backend
fetch('http://localhost:5000/callback', {
method: 'GET',
credentials: 'include', // Important for sending cookies across origins
})
.then(response => response.json())
.then(data => {
// Assuming the userId is returned in the data object
const userId = data.userId;
Cookies.set('userId', userId, { expires: 7 });
})
.catch((error) => console.error('Error:', error));
}, []);
// These could be different components for your different pages
const Title = ({ isAuthenticated }) => (
TasktasticTest Environment
{isAuthenticated ? (
Logout
) : (
)}
);
return (.
im solving tha m-puzzel sliding tail problem where m = n^2 - 1 I ha.pdf
i'm solving tha m-puzzel sliding tail problem where m = n^2 - 1 I have made this code using
python using A* with taking into considration the Misplaced, Euclidean, and Manhattan
heuristics to the problem.
however i want it to work for 3*3 and 4*4 and 5*5 and 6*6 matrix it did worked for 3*3 but not
with the rest i couldnot run it ( you can just change the value of n in the code) is the problem
form the code or my device code not run it dou to time and memory considretion
import heapq
import random
class PuzzleNode:
def __init__(self, state, g_cost, heuristic, parent=None):
self.state = state # 2D array representing the puzzle state
self.g_cost = g_cost # cost to reach this state from the initial state
self.heuristic = heuristic # heuristic value
self.parent = parent # reference to the parent node
def f_cost(self):
# The total cost is the sum of g_cost and heuristic value
return self.g_cost + self.heuristic
def __lt__(self, other):
# Comparing nodes based on f_cost and depth for priority queue
if self.f_cost() == other.f_cost():
return self.g_cost > other.g_cost # For tie-breaking, prefer nodes with lower depth
return self.f_cost() < other.f_cost()
def generate_successors(node):
# Generate successor nodes by sliding tiles in four directions
successors = []
empty_x, empty_y = find_empty_space(node.state)
for dx, dy in [(0, 1), (0, -1), (1, 0), (-1, 0)]:
new_x, new_y = empty_x + dx, empty_y + dy
if 0 <= new_x < len(node.state) and 0 <= new_y < len(node.state[0]):
new_state = [row[:] for row in node.state]
new_state[new_x][new_y], new_state[empty_x][empty_y] =
new_state[empty_x][empty_y], new_state[new_x][new_y]
successors.append(PuzzleNode(new_state, node.g_cost + 1, 0)) # The heuristic will be
calculated separately
return successors
def misplaced_tiles_heuristic(current_state, goal_state):
# Calculate the Misplaced Tiles heuristic value
h = 0
for i in range(len(current_state)):
for j in range(len(current_state[0])):
if current_state[i][j] != goal_state[i][j] and current_state[i][j] != 0:
h += 1
return h
def manhattan_distance_heuristic(current_state, goal_state):
# Calculate the Manhattan Distance heuristic value
h = 0
for i in range(len(current_state)):
for j in range(len(current_state[0])):
if current_state[i][j] != 0:
x, y = find_tile_position(current_state[i][j], goal_state)
h += abs(i - x) + abs(j - y)
return h
def euclidean_distance_heuristic(current_state, goal_state):
# Calculate the Euclidean Distance heuristic value
h = 0
for i in range(len(current_state)):
for j in range(len(current_state[0])):
if current_state[i][j] != 0:
x, y = find_tile_position(current_state[i][j], goal_state)
h += ((i - x) ** 2 + (j - y) ** 2) ** 0.5
return h
def find_empty_space(state):
# Helper function to find the position of the empty space (0) in the state
for i in range(len(state)):
for j in range(len(state[0])):
if state[i][j] == 0:
return i, j
def find_tile_position(tile, state):
# Helper function to find the position of a tile in the state
for i in rang.
Im creating a skip list program for my Algorithms and Advanced Data.pdf
I'm creating a skip list program for my Algorithms and Advanced Data Structure class. I was
tasked with implementing a find & add method for the skiplist. Here is my program, I'm running
into a segmentation fault when I add my second value into the skiplist. My first issue that I fixed
was that I wasn't checking the first node in the list to see if it was nullptr, but that was not my
only issue apparently.
Add Method:
void SkipList::add(const ElemType &el) {
// Create a new node with the given element
Node *newNode = new Node(el);
// Get the height of the new node
int newHeight = newNode->nodeHeight;
// If the height of the new node is greater than the current list height,
// update the list height.
if (newHeight > listHeight) {
listHeight = newHeight;
}
// Array to keep track of nodes to update
Node *update[MAX_NUM_LISTS];
// Start from the top level
Node *current = head[listHeight - 1]; // Initialize current correctly
// If the list is empty, assign the first node to head
if (head[0] == nullptr) {
head[0] = newNode;
} else {
// Loop to traverse through list
for (int i = listHeight - 1; i >= 0; i--) {
// Move forward in the current level
while (current->next[i] != nullptr && current->next[i]->elem < el) {
current = current->next[i];
}
// Store the node before which the new node should be inserted
update[i] = current;
}
// Insert the new node at each level
for (int i = 0; i < newHeight; i++) {
newNode->next[i] = update[i]->next[i];
update[i]->next[i] = newNode;
}
}
}
Find Method:
bool SkipList::find(const ElemType &el) const {
// Start from the top level
Node *current = head[listHeight - 1];
bool found = false;
// Iterate through the levels of the skip list
for (int i = listHeight - 1; i >= 0; i--) {
// Move forward in the current level until reaching the end or finding a larger element
while (current->next[i] != nullptr && current->next[i]->elem < el) {
current = current->next[i];
}
// Check if the current node's next node contains the target element
if (current->next[i] != nullptr && current->next[i]->elem == el) {
found = true; // Element found
}
}
return found; // Element not found in the skip list
}
Main:
int main()
{
ElemType inputs[] = {5, 7, 8, 10, 12, 17, 19, 22, 28, 31, 33, 35, 42, 51, 59};
SkipList list1;
cout << "For list1 (same as in the slide 10 of Skip List1 Lecture Note):\n";
// for (int i=0; i(std::size(inputs)); i++)
{
cout << "add " << inputs[i] << endl;
list1.add(inputs[i]);
cout << "list1:\n"
<< list1 << endl;
}
if (list1.find(33))
cout << "33 is found!\n";
else
cout << "33 is not found!!!!\n";
if (list1.find(70))
cout << "70 is found!\n";
else
cout << "70 is not found!!!!\n";
if (list1.find(10))
cout << "10 is found!\n";
else
cout << "10 is not found!!!!\n";
cout << "\n===================================\n";
cout << "For list2:\n";
ElemType inputs2[] = {19, 8, 17, 59, 12, 7, 5, 22, 28, 35, 33, 31, 42, 51, 10};
SkipList list2;
for (int i = 0; i < static_cast(std::size(inputs2)); i++)
{
cout << "add " << inputs2[i] << endl.
if any additional information is required let me know Work through t.pdf
if any additional information is required let me know Work through the tasks sequentially
(implement and test). Only move on to a task when you are positive that the previous one has
been completed correctly, Remember that the names of classes and methods must exactly match
those in this specification (FUNCTION NAMES, PARAMETER TYPES, RETURNS, PRE
AND POST CONDTTIONS MUST MATCH EXACTLY. Remember, you must thoroughly
document your codellt Task 1: Modify the Character class
operator!= epost : displays Character data in the form: "[name_] is a Level [level]] [race_].
InVitality: [vitality_] InMax Armor: [armor_] In [They are / They are not] an enemy. In" +1
isplay
the tally is zero. Nore: no pre-processing of the input string necessary, only uppercase input will
match. / tatlyRace epost: Outputs a report of the characters currently in the tavern in the form:
level is: [x] In [x] are enemies. \n Note that the average level should be rounded to the
NEAREST integer, and the enemy percentage should be rounded to 2 decimal places. Exanple
output: Humans: 3 Elves: 5 Dwarves: 8 Lizards: 6 Undead: The average level 1s: 7 46.67% are
enemies. *1
ereturn: The average level of all the characters in the Tavern epost: Computes the average level
of the Tavern rounded to the NEAREST integer. 1 calculateAvgLevel ereturn: The integer
enemy count of the Tavern getEnemycount ereturn: The percentage (double) of all the enemy
characters in the Tavern epost: Conputes the eneny percentage of the Tavern rounded up to 2
decinal places. **/ calculateEnemyPercentage eparam: A const reference to a string representing
a character Race with value in ["NONE", "HUMAN", "ELF", "DWARF", "LIZARD",
"UNDEAD"] ereturn: An integer tally of the number of characters in the Tavern of the given
race. If the argument string does not match one of the expected race values, the tally is zero.
NOTE: no pre-processing of the input string necessary. only uppercase input will match.
Task 3: Implement the Tavern class as a subclass of ArrayBag The Tavern is subclass of
ArrayBag that stores Character objects Data Types The Tavern class must have the following
pritate member tariables: - An integer sum of the levels of all the characters currently in the
tavern - An integer count of alt the characters currently in the Tavern that are marked as enemies
The Tavern class must have the following public member fiutctions: Constructor Defaute
constructor. Default-initializes all private members.
Work through the tasks sequentially (implement and test). Only move on to a task when you are
positive that the previous one has been completed correctly, Remember that the names of classes
and methods must exactly match those in this specification (FUNCTION NAMES,
PARAMETER TYPES, RETURNS, PRE AND POST CONDTTIONS MUST MATCH
EXACTLY. Remember, you must thoroughly document your codellt Task 1: Modify the
Character class
Task 3: Implement the Tavern class as a subclass of ArrayBag The Tavern is subclass of
ArrayBag .
I need help with providing a 2 page overview of the case study provi.pdf
I need help with providing a 2 page overview of the case study provided in pictures please!
asked that he come to his office. When Jenkins saw the office, he laughed and said, "Well
DeMur-or shall I say Maslick-I must say you have some admirers. As an American with African
roots, you should have expected some lighthearted ribbing about your conversion to that strange
religion of yours. Even you must admit that they do some weird things." Maalick replied, "No, I
must suy that I did not expect this!" Jenkins recognized that Maalick was angry and upset ower
the incident and promised to handle the situation. Over the next several months, Maalick
received a series of notes left on his desk and car referencing black cats, black magic, requests
for paim readings and notices about the disappearance of MarShawn DeMur. Not wanting to
cause any problems or be labeled as a troublemaker, Maalick ignored these incidents, thinking
that people would tire of the pranks and things would die down. However, on one occasion, he
found on his desk several sheets of what appeared to be chants with a title at the top that read -
Prayers for Black Folk:" Next to the pages was a book titled Myrical Practices from the Negro
Experionce. Maalick immediately took the materials to the HR department and met with Ford.
Ford told Maalick, "I have been out of the office a lot helping with the staffing of the new
Northwestern facility and had no idea you were having these kinds of problems. Do you have
any idea who is responsible for these actions?" "No I don't," said Maalick. "This is not the type
of behavior that is condoned at Treton. Don't worry, I will handle this immediately. I am so sorry
ahout all of this," said Ford. After Maalick left her office, Ford called a meeting of all
department heads and informed them of the situation. Ford immediately sent an c-mail to all
facility employees, reminding them of Treton's policies regarding discrimination and harassment
and the penalties associated with such actions. By the end of the day, all department heads met
with their employees with specitic wamings and orders for the behaviors to cease and desist. The
days following were a bit tense in the office but calm. Maalick was relieved to not find any more
notes or messages. Fond visited with Maalick on several oceasions to ensure that he was not
continuing to experience any problems. Maalick was happy to report that, in his opinion, all was
well. On Ford's last visit, Maalick took the opportunity to ask about two new systems manager
openings. Promotion to a systems manager position would assist Maalick's career goals for
advancenent with 'Treton. Fond sent Maalick the position description and encouraged him to
apply. After reviewing the systems manager job requirements, Maalick believed that he had
more than a good chance at a promotion. He spoke with Jenkins about the job duties and
reyuirements and expressed his interest in the position. Maalick was informed that at that time,
.
I keep getting NullPointerExcepetion, can someone help me with spinL.pdf
I keep getting NullPointerExcepetion, can someone help me with spinList(int numMoves) and
LinkedList altLists(LinkedList list)?
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
public LinkedList() {
first = null;
last = null;
length = 0;
iterator = null;
}
public LinkedList(T[] array) {
if (array == null) {
return;
}
if (array.length == 0) {
length = 0;
first = null;
last = null;
iterator = null;
} else {
for (T item : array) {
addLast(item);
}
iterator = null;
}
}
public LinkedList(LinkedList original) {
if (original == null) {
return;
}
if (original.length == 0) {
length = 0;
first = null;
last = null;
iterator = null;
} else {
Node temp = original.first;
while (temp != null) {
addLast(temp.data);
temp = temp.next;
}
iterator = null;
}
}
public T getFirst() throws NoSuchElementException {
if(first == null){
throw new NoSuchElementException("getFirst(): List has no element to access");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (last == null){
throw new NoSuchElementException("getLast(): List has no element to access");
}
return last.data;
}
public T getIterator() throws NullPointerException {
if (iterator == null){
throw new NullPointerException("getIterator(): There is no iterator to access");
}
return iterator.data;
}
public int getLength() {
return length;
}
public boolean isEmpty() {
return length == 0;
}
public boolean offEnd() {
return iterator == null;
}
public void addFirst(T data) {
if (length == 0){
first = last = new Node(data);
} else {
Node fill = new Node(data);
fill.next = first;
first.prev = fill;
first = fill;
}
length++;
}
public void addLast(T data) {
if (length == 0) {
first = last = new Node(data);
} else {
Node fill = new Node (data);
fill.prev = last;
last.next = fill;
last = fill;
}
length++;
}
public void addIterator(T data) throws NullPointerException{
if(iterator == null) {
throw new NullPointerException("addIterator(): Can't add the node because iterator points
to null");
} else if(iterator == last){
addLast(data);
} else{
Node fill = new Node(data);
iterator.next.prev = fill;
fill.prev = iterator;
fill.next = iterator.next;
iterator.next = fill;
length++;
}
}
public void removeFirst() throws NoSuchElementException {
if (length == 0) {
throw new NoSuchElementException("removeFirst(): Cannot remove from an empty
List");
} else if(length == 1) {
first = last = null;
} else {
first = first.next;
first.prev = null;
}
length--;
}
public void removeLast() throws NoSuchElementException {
if (length == 0){
throw new NoSuchElementException("removeLast(): Cannot remove from an empty
List");
} else if (length == 1){
first = last = null;
}else{
last = last.prev;
last.next = null;
}
length--;
}
public void removeIterator() throws NullPointerE.
I have been tasked to write a code for a Singly Linked list that inc.pdf
I have been tasked to write a code for a Singly Linked list that includes the following: Implement
a singly linked list class with the following methods: - `void insertAtBeginning(int value)`:
Inserts a new node with the given value at the beginning of the list. - `void insertAtEnd(int
value)`: Inserts a new node with the given value at the end of the list. - `void deleteNode(int
value)`: Deletes the first occurrence of a node with the given value. - `void display()`: Displays
the elements of the linked list. I have everything EXCEPT for the deleteNode. I have it included,
but it is throwing an error....I just need a little extra help to fix that part. My Code: #
#include
using namespace std;
class Node { //user defined type.
public: // public class modifier to access the class node.
int value;
Node* next;
};
void display(Node *head) {
if(head == NULL){
cout << "NULL" << endl;
}
else {
cout << head->value << endl;
display(head->next);
}
}
void insertAtBeginning(Node**head, int newValue){
// Steps to add a Node to the beginning of the linked list
//1. Prepare a newNode
Node * newNode = new Node();
newNode ->value = newValue;
//2. Put it in front of the current head
newNode->next = *head;
//3. Move head of the list to point to the newNode
*head= newNode;
}
void insertAtEnd(Node**head, int newValue) {
//1.Prepare a newNode
Node* newNode= new Node();
newNode ->value = newValue;
newNode->next = NULL;
//2. If Linked list is empty, newNode will be a head node
if(*head ==NULL){
*head = newNode;
return;
}
//3. Find last node
Node* last= *head;
while(last->next!=NULL){
last=last->next;
}
//4. Insert newNode after last node (at the end of List)
last->next =newNode;
}
void deleteNode(Node**before_del){
Node* temp;
temp = before_del->next;
before_del->next = temp->next;
delete temp;
}
int main()
{
Node* head=new Node();
Node* second=new Node();
Node* third=new Node();
Node* fourth=new Node();
head->value = 7;
head->next = second;
second->value = 12;
second->next = third;
third->value = 15;
third->next = fourth;
fourth->value = 20;
fourth->next = NULL;
insertAtBeginning(&head, 4);
insertAtBeginning(&head, 6);
insertAtEnd(&head, 23);
del(&head(15)->next);
display(head);
}.
I am trying to pass a date to a function in postgres.My function w.pdf
I am trying to pass a date to a function in postgres.
My function was working correctly. But then I had to introduce date as an input parameter. Ever
since I have introduced the date,
the function is giving an empty result set. Here is my code below, with new addition of date
related code highlighted in bold. Am I missing
something? Do I need to declare the date maybe?
CREATE OR REPLACE FUNCTION public.path_optimization(input_date date)
RETURNS TABLE(area_id_ uuid, result_uuids text[])
LANGUAGE plpgsql
AS $function$
DECLARE
r RECORD;
BEGIN
-- Iterate through the records in pma_ranked
FOR r IN SELECT areaid, max_uuid FROM pma_ranked LOOP
--RAISE NOTICE 'Processing areaid: %, max_uuid: %', r.areaid, r.max_uuid;
RETURN QUERY
EXECUTE
'
WITH RECURSIVE
tree AS (
SELECT
g."centerPoint"::GEOMETRY AS vtcs,
NULL::GEOMETRY AS segment,
ARRAY[g.uuid] AS uuids
FROM
potential_missed_areas AS g
WHERE
g."areaID" = $1
AND g.uuid = $2
AND g.status = ''approved''
AND g."createdAt" = $3
UNION ALL
SELECT
ST_Union(t.vtcs, v."centerPoint"),
ST_ShortestLine(t.vtcs, v."centerPoint"),
t.uuids || v.uuid
FROM
tree AS t
CROSS JOIN LATERAL (
SELECT
g.uuid,
g."centerPoint"
FROM
potential_missed_areas AS g
WHERE
g."areaID" = $1
AND g.status = ''approved''
AND g."createdAt" = $3
AND NOT g.uuid = ANY(t.uuids)
ORDER BY
t.vtcs <-> g."centerPoint"
LIMIT
1
) AS v
),
NumberedRows AS (
SELECT
$1,uuids,
ROW_NUMBER() OVER () AS RowNum
FROM tree
WHERE segment IS NOT NULL
)
SELECT
$1,uuids
FROM NumberedRows
WHERE RowNum = (SELECT MAX(RowNum) FROM NumberedRows);
'
USING r.areaid, r.max_uuid,input_date;
END LOOP;
END;
$function$
;
Here is how I am calling the function:
select * from public.path_optimization('2023-10-04'::date).
How can an event such as the terrorist attacks of September 2001 aff.pdf
How can an event such as the terrorist attacks of September 2001 affect consumer and business
confidence and the economy?
10
Respond to 2 classmates
(10 points possible)
How can an event such as the terrorist attacks of September 2001 affect consumer and business
confidence and the economy?
10
Respond to 2 classmates
(10 points possible)0
4 of 1. a thed is being ball 5. morinative +. Tise Cone Dave Ean. 1 bo fone The 5. Sacteriritoe
ably 1. fle miner antal a. a cosonoclen s. a dopentiks. 4. net dor.
8. Jessic, an employee of Kim's Rentarant, believes that ber enployer has violated her rights in
the workplace. Lanoin The tranch of law dealing with the definition and enforterment of all
peivate er public rights in Pars 1 Name: Class Date Evam 1 2. admininerative law. b. civid law.
c. constitusional taw. if foderal law. a. a case docidod by the Finois Supreme Court. b. a nule
creslod by a Hiliness state administrative apeacy. c. a provision in the fllinois constiturion. x. an
equihable remedy. b. an unelococeblic demant. E. a nemody at law. d. beyoed the court's
antherity. 11. The United Sates Supreme Coun does ner have eripinal juridvanen in my case. a.
True b. False 12. Milo files a sait apainst Nick in an Ohio stace court, noceng that Nisk opvrates
a Web sine thoogh which Ohio arives from 2. anythiag an Obio rscident has doee. b. Nikk's Web
site activities. 6. nothing an Otio residen has done. d. something ether than Nick's Web site. 2.
the cave is being heard foet the firat time. b. the coun has a unizue method of dexiding whether
na hear a case. c. the coun has urnetual pescedural niles. 4. tece subjest matoer of the auit is
intertsting and aew. a. has a sudficiem stake in the matter. h. has jurisdicticen. Pave 2 Name
Class Date Evam 1 c. has sefficicus minimum contacts with the partics. A. is a moet coerrenien
locaties to hold the trial.
Name: Class: Date: Exam 1 Indicate whether the statement is true or false. 1. Statutory law does
not include county ordinances. a. True b. False 2. The stability and predictability of the law are
essential to business activities. a. True b. False 3. Statutes are laws enacted by Congress and the
state legislatures and comprise one of the sources of American law. a. True b. False 4. The term
common law refers to law that is common throughout the world. a. True b. False Indicate the
answer choice that best completes the statement or answers the question. 5. In Benny v. City Car
Dealership, a state supreme court held that a minor could cancel a contract for the sale of a car.
Now a trial court in the same state is deciding Dora v. Even Steven Auto Deals, Inc, a case with
similar facts. Under the doctrine of stare decisis, the trial court is likely to a. allow the minor to
cancel the contract. b. disregard the Benny case. c. order the minor to cancel the contract. d.
require the minor to fulfill the contract. 6. Martin Luther King, Jr. played a singular role in the
most significant social movement in the histor.
Hey! Could I possibly get some help with this Its a little confusi.pdf
Hey! Could I possibly get some help with this? It's a little confusing to me about how to write it.
Technical Document
The objective of the technical document is to provide a high-level overview of the chat console
application's design, components, and interactions. It allows developers to understand the
architecture and implement the chat server and client effectively, ensuring smooth
communication between clients.
An outline example of the technical document:
Introduction:
Architecture Overview describing the high-level architecture of the chat server application, and
outlining its components and their interactions.
Components
Class Diagram (if applicable):
Sequence Diagrams:
Error Handling:.
More from arkmuzikllc (18)
Help me with these multiple-choice questions. Please dont use chat .pdf
Help me with these multiple-choice questions. Please dont use chat .pdf
Hello I am stuck in my code I know is everything is goid but I think.pdf
Hello I am stuck in my code I know is everything is goid but I think.pdf
HeadWallRam Inc. has expanded its reach globally and needs to re-lay.pdf
HeadWallRam Inc. has expanded its reach globally and needs to re-lay.pdf
HINT For i = 1 , . . . ,n, let S[i] be the max sum ending with A[i].pdf
HINT For i = 1 , . . . ,n, let S[i] be the max sum ending with A[i].pdf
Hi, I need some assistance with this UML use case diagram. I manage .pdf
Hi, I need some assistance with this UML use case diagram. I manage .pdf
Give an NFA that recognizes the language (10 + 110 + 101) and then .pdf
Give an NFA that recognizes the language (10 + 110 + 101) and then .pdf
IN JAVA BJP5 Exercise 6.19 leetSpeak LanguageType Java file pr.pdf
IN JAVA BJP5 Exercise 6.19 leetSpeak LanguageType Java file pr.pdf
Goal Create a hypothetical threat assessment based on vulnerabilities.pdf
Goal Create a hypothetical threat assessment based on vulnerabilities.pdf
import React, { useEffect } from react;import { BrowserRouter as.pdf
import React, { useEffect } from react;import { BrowserRouter as.pdf
im solving tha m-puzzel sliding tail problem where m = n^2 - 1 I ha.pdf
im solving tha m-puzzel sliding tail problem where m = n^2 - 1 I ha.pdf
Im creating a skip list program for my Algorithms and Advanced Data.pdf
Im creating a skip list program for my Algorithms and Advanced Data.pdf
if any additional information is required let me know Work through t.pdf
if any additional information is required let me know Work through t.pdf
I need help with providing a 2 page overview of the case study provi.pdf
I need help with providing a 2 page overview of the case study provi.pdf
I keep getting NullPointerExcepetion, can someone help me with spinL.pdf
I keep getting NullPointerExcepetion, can someone help me with spinL.pdf
I have been tasked to write a code for a Singly Linked list that inc.pdf
I have been tasked to write a code for a Singly Linked list that inc.pdf
I am trying to pass a date to a function in postgres.My function w.pdf
I am trying to pass a date to a function in postgres.My function w.pdf
How can an event such as the terrorist attacks of September 2001 aff.pdf
How can an event such as the terrorist attacks of September 2001 aff.pdf
Hey! Could I possibly get some help with this Its a little confusi.pdf
Hey! Could I possibly get some help with this Its a little confusi.pdf
Recently uploaded
"Protectable subject matters, Protection in biotechnology, Protection of othe...
Protectable subject matters, Protection in biotechnology, Protection of other biological materials, Ownership and period of protection
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH ANSWERS.
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
The Challenger.pdf DNHS Official Publication
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
CACJapan - GROUP Presentation 1- Wk 4.pdf
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Unit 8 - Information and Communication Technology (Paper I).pdf
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama UniversityAkanksha trivedi rama nursing college kanpur.
Natural birth techniques are various type such as/ water birth , alexender method, hypnosis, bradley method, lamaze method etcNormal Labour/ Stages of Labour/ Mechanism of Labour
Normal labor is also termed spontaneous labor, defined as the natural physiological process through which the fetus, placenta, and membranes are expelled from the uterus through the birth canal at term (37 to 42 weeks
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Pavilions
NGV Architecture Commission Competition
MPavilion Commission Competition
Other Pavilion Designs
Synthetic Fiber Construction in lab .pptx
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Advantages and Disadvantages of CMS from an SEO Perspective
Advantages and Disadvantages of CMS from an SEO Perspective
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is prepared for master's students (MIFB & MIBS) UUM. May it be useful to all.Supporting (UKRI) OA monographs at Salford.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
A Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance
Recently uploaded (20)
"Protectable subject matters, Protection in biotechnology, Protection of othe...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
Multithreading_in_C++ - std::thread, race condition
Multithreading_in_C++ - std::thread, race condition
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal Labour/ Stages of Labour/ Mechanism of Labour
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion Designs
Advantages and Disadvantages of CMS from an SEO Perspective
Advantages and Disadvantages of CMS from an SEO Perspective
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
A Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance.pptx
Here is selection filepublic class Selection { public static in.pdf
- 1. Here is selection file: public class Selection { public static int select(int[] array, int n, int k) { return select(array, 0, n - 1, k); } private static int select(int[] array, int left, int right, int k) { // complete this function } } here is MedianOfMedians file: public class MedianOfMedians { private static void insertionSort(int[] arr, int left, int right) { for (int i = left + 1; i <= right; i++) { int j = i, temp = arr[j]; while (j > left && temp < arr[j - 1]) { arr[j] = arr[j - 1]; j--; } arr[j] = temp; } } public static int select(int[] array, int n, int k) { return select(array, 0, n - 1, k); } private static int select(int[] array, int left, int right, int k) { // complete this function } } here is Partition file needed to code this correctly public class Partition { static Random rand = new Random(System.currentTimeMillis()); protected static void swap(int[] array, int x, int y) { int temp = array[x]; array[x] = array[y]; array[y] = temp; } public static int generateRandomPivot(int[] array, int left, int right) { return left + rand.nextInt(right - left + 1); } public static int generateMedianOf3Pivot(int[] array, int left, int right) { int mid = left + (right - left) / 2; if (array[left] > array[mid]) swap(array, left, mid); if (array[left] > array[right]) swap(array, left, right); if (array[mid] > array[right]) swap(array, mid, right); return mid; } public static int[] partition(int[] array, int left, int right, int pivotIndex) { // complete this function } } 1.2 Part 2: Selection Algorithms In the second part, you are going to implement the Selection algorithm for finding the kth smallest number in an array. For the pivot, you are going to use a random one. Your task is to implement the following: - Quick-Selection Algorithm (File: Selection) Implement select(int [] array, int left, int right, int k). For pivot generation, call the
- 2. function generateRandomPivot(int [] array, int left, int right). Since partition returns two indexes, you must the appropriate quick-select algorithm from the notes that utilizes both the indexes. - Median of Medians Algorithm (File: MedianOfMedians) Implement select(int [] array, int left, int right, int k). Since partition returns two indexes, you must modify the median of medians quick-select algorithm from the notes to utilize both the indexes - this modification is simple (essentially copy and paste the final recursive part) if you have completed the randomized quick- select. - Partition Algorithm (File: Partition) Implement partition(int [] array, int left, int right, int pivotIndex) using the partition method in notes that returns two indexes lower PartitionIndex and upper PartitionIndex. Your code must satisfy all the criteria of a partition - linear time and in- place. Additionally, it must scan the array no more than once. Otherwise, no credits will be given.