I have tried to get the standard deviation, but it doesn't work. int[]scores = { 52, 69, 85, 98, 95, 76, 82, 83, 92, 87, 94, 68, 77, 45, 70, 71, 59, 60, 74, 84, 83, 73, 75, 78, 80, 92, 91, 97, 62, 84 }; void standardDeviation() { float average; for (int x=0; x<scores.length; x++) { float total = 0; for (int i=0; i<scores.length; i++) { total += scores[i]; } noLoop(); float stdDeviation=0; average=total/scores.length; float differences = (scores[x]-average); float squaredDifferences= differences*differences; float variance=squaredDifferences/scores.length; stdDeviation=+ sqrt(variance); textFont(createFont("consolas", 20)); text("Standard Deviation: "+ stdDeviation, 20, 170); println(stdDeviation); noLoop(); } } |
+0 forum
1 | ||

I created a calculator only using the scripting commands in the video game Counter-Strike, bind (for input) echo (for output) and alias (for the logic). Bind is to connect keys to a command or string of specified commands, echo is to output text to the console, and alias is a command that allows you to create a new command out of a string of specified commands. Basically, I can do math without using math. This is pure connectionism, where there are no values, no logic operators and no measurements in the logic. It is purely making, breaking and using connections … |
+0 forum
1 | ||

Design a function named max that accepts two integer values as arguments and returns the value that is the greater of the two. For example, if 7 and 12 are passed as arguments to the function, the function should return 12. Use the function in a program that prompts the user to enter two integer values. The program should display the value that is the greater of the two. NEED HELP WITH >>>>>>>>>>>>>>>>> variable lists, IPO Chart, pseudocode, Flowchart |
+0 forum
3 | ||

Hey all, What’s up?? Recently I came across InterviewBit Academy Course. Link - [InterviewBit Academy](http://www.interviewbit.com/academy/) It's is a 6 Months immersive online program that helps you develop your tech skills and gets you your dream job at no upfront cost It comes with a promise of guaranteed salary in the range of $75K - $120K once we finish the course. This line caught my attention > "If you don’t get a job, you don’t need to pay a penny". > Plus, it seems they have a lot of positive reviews - https://www.quora.com/What-is-your-review-of-InterviewBit I’m aware of lambda school which also guarantees … |
+0 forum
7 | ||

I have this Question , I want the answer and show me how to solve it Please : Analyze the running time of the following algorithm using Big-Oh notation maxerea =0; maxpt1 =maxpt2 = maxpt3 =0; for(i =1;i<=n;i++) for(j =i+1;j<=n;j++) for(k =j+1;k<=n;k++){ empty = True; for(l =1;l<=n;l++){ if((l != i) && (l != j) && (l != k)) if insideTriangle(i,j,k,l) then empty = False; } area = TriangleArea(i,j,k); if (area < maxarea) { maxarea =area; maxpt1 = i; maxpt2 = j; maxpt3 = k; } } print, maxpt1, maxpt2, maxpt3 |
+0 forum
1 | ||

Why Big-Oh is not a good scale for comparing algorithms? |
+0 forum
2 | ||

I see this Question in a diploma in computer science Exam in Algorithm , and i need help to solve it : Algorithm A1 takes n^2 days to solve a problem of size n . Algorithm A2 takes 2^n seconds on the same problem . Detrmine how large of a problem instance is required before algirithm A1 becomes faster than algorithm A2 . How much time do the two aldorithms take on that instance ? |
+0 forum
3 | ||

Can any one give me snippt code for single, double and single circular linked list. |
+0 forum
1 | ||

I try to evaluate working time of Tjuring machine, but I really don't know how to do it. I try to evaluate working time of Turing machine. I understand, I have to calculate number of steps used in every stage. My problem is: how can I know, how many steps used in every stage, for example, n, n/2, n^2... Computational problem L: L(x)=1, if input date x is in the form y#z, where y and z are strings of the same length. The strings consist of the symbols a and b. This Tjuring machine works as follows: Repeats the sequence … |
+0 forum
1 | ||

Need help modifying this code to add to my code. My code creates a grid but does not check if a word exists or not yet. Also, it should be user interface, user types in word, and computer outputs yes or no. // C++ program to check if the word // exists in the grid or not #include <bits/stdc++.h> using namespace std; #define r 4 #define c 5 // Function to check if a word exists in a grid // starting from the first match in the grid // level: index till which pattern is matched // x, y: current … |
+0 forum
2 | ||

Hello. I have a question: I have a portable harddisc, with files on it. Now I want to encrypt a certain folder on it. It contains a couple of files which take some megs. What's the best way to do this? Thanks in advance, Leon |
+0 forum
3 | ||

I couldn't install the tensorflow framework in my laptop.can anyone help me out in installing tensorflow for doing my project on deep learning techniques. |
+0 forum
1 | ||

plz someone help me with this problem. i have uploaded the code file down Make a class fraction () with a numerator and a denominator. Create a constructor and overload some operators so that the code below can run on |
+0 forum
1 | ||

Hello everyone. I have been trying to get desired output since last 4 days and so far very near to it. I am really stucked in the logic. Please help me or help me in writing proper logic. Open the attached zip file for whole eclipse project. No need to touch any file except **com.designimplementation.elevator.controllers.ElevatorController** So far I am able to get **Average cycles per customer trip: 42.35841100754549** But I must be **Average cycles per customer trip: 30** Please help me asap. Thank in advance. |
-4 forum
1 | ||

I am trying to implement a MIPS code that preforms unsigned integer divide but i couldn't figure out how. if D == 0, report an error and terminate. Q = 0 # Q is the quotient, initialized to zero R = 0 # R is the remainder, also initialized to zero n = the number of bits in the numerator N # That is, the number 3710 is 1001012 has 6 bits. # Shift through the bits of N to find the # position of its most significant 1 bit. # Write a separate function to determine “n”. for i … |
+0 forum
1 | ||

You know the Pareto Principle? The 80/20 rule? That 80% of the work gets done by 20% of the people? Or 80% of the money belongs to 20% of the people? And so on? Well it is 'recursive' inasmuch as it can be applied again to the 20% first recognised. i.e. if 20% do 80% of the work then 20% of the 20% do 80% of they work THEY do. And so on. While I can get my head around recursion generally and can fully comprehend the standard recursive algorithm for calculating factorial - I'm not smart enough to put … |
+1 forum
1 | ||

Please i need your suggestions on how to design a system that will diagnose malaria or typhoid by accessing a number of symptoms. |
+0 forum
8 | ||

I am trying to understand leader clustering algorithm and overlapping clustering algorithm , but not able to get proper documents and explanations. Can someone please help me understand these clustering algorithms that what are the key differences between both (leader clustering and overlapping clustering) algorithms, and if applicable, which algorithm provides the best result with large datasets. |
+0 forum
1 | ||

How to solve monkey and banana problem using best-first search algorithm? Anyone having ideas? I know we have to choose a heuristic function 'h(n)' for performing distance related calculations. But can anyone elaborate this problem ? (algorithm and complexity analysis much appreciated) |
+0 forum
6 | ||

Im not really familiar with this kind stuff I really need help with this: develop an algorithm pseudo-code that will accept the names of each sales staff members and their total sales for the month. The algorithm must calculate the commission at 4 % of their total sales amount. It should display only the name, total sales and commission of the member with the highest commission and the number of persons without commission. |
+0 forum
2 | ||

I have an assignment and don't have any clue what software to use to solve it. It asked to make algorithm as I have to sort students GPA and the highest rank will get a scholarship. |
+0 forum
1 | ||

Hi everyone! Please help me to find a thesis title that should be related in computer science about the theory. Your suggestion is very helpful for me since I will be graduating in senior highschool PS: any suggestions would do :) |
-2 forum
1 | ||

please help me, create an algorithm that can be used to spell out a positive number worth less than 1,000,000 and create a c ++ program for the algorithm |
+0 forum
1 | ||

i need help |
+0 forum
2 | ||

Hi...! In Design of Algorithm. I think it is used to calculate the time complexity.... What is meant by STEP-COUNT METHOD? What is the procedure in that to calculate? I want brief explination. .... |
+1 forum
5 | ||

Is it possible to integrate Perfect Circles of the Golden ratio geometry in designing logo based on these link ( https://goo.gl/images/7eYZoG ) to recognize flower.. What do you think guys? Im planning to have a research on this. |
+0 forum
1 | ||

Hey Everyone, I would like to know can you calculate the absolute speed of this algorithm below and if the the time it takes to execute a memory access is 100 nanoseconds and that all other operations (arithmetic, register accesses, etc.) take 10 nanoseconds: [Click Here](null) |
+0 forum
19 | ||

Hey so I am trying to finish up a lab that I did not finish during a class this summer. The goal is to have the computer navigate an ASCII maze on its own. We use left/right hand rule to find our way through the maze. IE. you have your hands out to your side and if it is open we take a turn down that hallway. We leave breadcrumbs behind us to mark our taken path. In this version of the lab we are to have it recall its path between different trail runs, and use the best path … |
+0 forum
9 | ||

Code Snippet
Simple Example of a Genetic Algorithm A while back I came across an article that mentioned genetic algorithms. For those unfamiliar with the term, simply put, rather than finding a solution to a problem by iterating over all possible cases, a genetic algorithm attempts to find a solution by starting with a guess, then generating a next guess by applying numerous random changes to the current guess and picking the guess that best fits the solution as the next best guess. Rinse and repeat. Unfortunately, most of the articles and examples I came across involved far too much tech speak and math for a brain long … |
+2 forum
4 | ||

I would like to know Which are the python data structures uses divide and concur algorithm? Please explain me? |
+0 forum
3 |

The End.