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 | ||

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 | ||

hello, i just set goal of mastering algorith and i just get started i have an algorhtm for insert sort and i when i write it in c it is not sorting this is the algorith for j D 2 to A_length key = A[j] // Insert A[j] into the sorted sequence A[1..j-1] i = j-1 while i > 0 and A[i] > key A[i+1] = A[i] i = i-1 end while A[i+1]= key end for and here is the c code #include <stdio.h> #define LENGHT 6 int main(void){ int j,i, key; int arr[LENGHT]; for(j=0; j < LENGHT; j++){ printf("enter … |
+0 forum
4 | ||

I have an outcome (O) which could have three states: octal 4, octal 2 or octal 1. With three such outcomes I have 27 combinations. The challenge is to find an algorithm which gives me the minimum number of combinations (NK) which always gives me minimum 2 of 3 states correct. An example: The combinations 4-4-4 covers the following combinations: 4-4-4, 4-4-2, 4-2-4, 2-4-4, 4-4-1, 4-1-4, 1-4-4 given this requirement. Mathematically this could be done with only 4 combinations, but how do I find them ??? (The total challenge covers 2-3 states and up til 12 outcomes). |
+0 forum
12 | ||

I want to do a software project regarding barcode scanning. Basically I want to take an image of a 1D barcode then process the picture file and Decode the barcode.I am not a great programmer but I know the basics. I want to develop my skills through it. I want to use java or c++ for this project. I am not sure where to start or should I even start. How complex might it be? Can anyone help me suggesting where to start or what should I learn to make this possible? And how much time might it take to … |
+1 forum
5 | ||

Hi all, I have to solve a tripple sudoku. The program is supposed to solve the enlarged sudoku. We load 21 rows, each with 9 integers in the range <0.9>. Rows 1-9 (numbered so that the first line is numbered 1, etc.), 7-15 and 13-21 are to create a classic sudoku. We remind you of the classic sudoku rules: * The classic sudoku has a size of 9x9, * Each row of numbers can not repeat itself, * In each column the numbers can not be repeated, * In each of the nine squares 3x3 numbers can not repeat. We … |
+0 forum
6 | ||

How to calculate time complexity of any algorithm or program .... need help on this.. |
+2 forum
114 | ||

I was just wondering if there are any books to learn how to analyze and debugging code of any programming language in general Thanks in advance for the help |
+0 forum
3 | ||

Hi there, I am stuck with a problem, and don't know where to start. I need to calculate the closest pair of points on the Earth using a divide and conquer method. I know I should calculate the orthodromic distance (or in other words the great-circle distance) but I don't know what to do. This calculation has to last at most nlog(n). I found this: "The problem can be solved in O(n log n) time using the recursive divide and conquer approach, e.g., as follows:[1] Sort points according to their x-coordinates. Split the set of points into two equal-sized subsets … |
+0 forum
11 | ||

Below is my code: #include <stdio.h> #include <stdlib.h> #include <string.h> #include <iostream> using namespace std; ///////////////////////////////////////////////////////////////////////// /* // struct Edge // Represent one edge in the graph. Fields contain // two vertex numbers and a weight. */ struct Edge { int vertex_1, vertex_2, weight; }; //////////////////////////////////////////////////////////////////////// /* // struct Graph // Represents a weighted graph. Fields contain the # of vertices, // edges,an array of edges, along with it's physical size. */ struct Graph { // V-> Number of vertices, E-> Number of edges int V, E; // graph is represented as an array of edges. Since the graph is … |
+0 forum
6 | ||

Hi everyone!, I had this confusion about the the Bucket Sort Algorithm. I just wanna know why mostly bucket sort use the range of element in between 0 and 1 or [0,1). [ .78, .23, .45, .95, .25 ,.19 and so on] Just wondering why? :) |
+0 forum
4 | ||

How to implement bucket sort in C using Linkedlist.. Or any weblinks please share... |
+0 forum
1 | ||

short program |
+0 forum
2 | ||

Hi, I would like to know if it is technically possible to develop an automated internet search algorithm. Let me give you a random example of what I have in mind. For example, let’s say I am the largest disaster relief organization in the world and I want to run an automated google search every single day to see if there is any crisis/disaster happening anywhere around the world. The reason I want an automated search (not manual) because I may have many different key word combinations that I want to use (let’s say 1000 different key word combinations) and … |
+0 forum
9 | ||

I have a problem with my pseudocode: Declare Integer p1 Declare Integer p2 Declare Integer p3 For p1 = 1 To 3 For p2 = 65 To 66 For p3 = 6 To 8 Display p1, p2, p3 End For End For End For This would display 18 combinations. But, I want to convert and display the character code (in this case 65 and 66) to the character. So instead of "1658", I want it to be "1A8". How can I fix this? I've tried putting ToChar with p2 (Display p1, p2, ToChar(65), ToChar(66), p3), but no avail. Please help! … |
+0 forum
6 |

The End.