Ready to improve network connectivity? Watch this webinar to learn how SD-WANs and a one-click instant connect tool can boost provisions, deployment, and management of your cloud connection.

Become a Premium Member and unlock a new, free course in leading technologies each month.

3K

Solutions

10

Articles & Videos

4K

Contributors

An algorithm is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data processing, and automated reasoning. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.

Share tech news, updates, or what's on your mind.

Hey,

I have an audio file, many actually, that are an interview between the interviewer and interviewee. The same person is asking questions in each file, while the people answering are different.

I need to separate the answers out by generating silence over the interview questions. I'm currently doing this by hand with audacity, but it is extremely time consuming.

Any help would be greatly appreciated. I am a software developer, but audio is not my area, so code is am option if there isn't a program available.

Thanks

I have an audio file, many actually, that are an interview between the interviewer and interviewee. The same person is asking questions in each file, while the people answering are different.

I need to separate the answers out by generating silence over the interview questions. I'm currently doing this by hand with audacity, but it is extremely time consuming.

Any help would be greatly appreciated. I am a software developer, but audio is not my area, so code is am option if there isn't a program available.

Thanks

9 Comments

On Demand Webinar: Networking for the Cloud Era
Ready to improve network connectivity? Watch this webinar to learn how SD-WANs and a one-click instant connect tool can boost provisions, deployment, and management of your cloud connection.

I realize that this is only possible when the page width (e.g. 200) can be evenly divided by the rectangle height (e.g., 200 / 20). If the page width is 201, it is impossible to have rectangles all with the same width and at the same time have no gap/margin at the end of the row of rectangles. But if the page width is 210, I can fit 10 rectangles which are 21 units wide. That's fine. I don't mind stretching the rectangles a bit, as long as the rectangle width is never less than the predefined rectangle height constant (in this example, is 20). So, if the page width is 220, that works fine for I can get 10 rectangles of 22 units across the page with no gap/margin at the end of the row. I don't mind the rectangle width growing a bit so as to ensure no right margin/gap results. But there would be a limit to the rectangle width changing from its original desired width (which is equal to the rectangle height constant). So I would need the â€¦

e.g.

array = [{"key1":"group9","key2":[

so sorting gives e.g. (the elements are arranged based on sorting the groupX value of key key1 i.e. the first key:value pair)

array = [{"key1":"group3","key2":[

I've implemented a merge sort and it works fine. But I want to look at what is the most efficient algorithm to use, as my colleagues have suggested bubble sort (I thought this was one of the worst algorithms, but it really depends on how large the dataset is).

Can anyone advise?

I'll (learn to) implement this on a webpage so I'm using Javascript/JQuery/ReactJS

The question is, must a circle had 360 degrees? Or was that a decision that was made so each quarter would have 90 degrees?

So, was Pi "backed into"?

If Euclid had wanted a circle to be 400 degrees, could he have simply used a different formula to generate Pi?

Curious.

And what is that formula to generate Pi, if you have it.

Thanks

I need some help with this code. It works for some Arrays but not for all. Do you see a mistake in the code?

These are the failures of 13 different tests:

There were 3 failures:

1) test3(ads.set2.knapsack.te

java.lang.AssertionError: Checking optimal profit: expected:<3144> but was:<2660>

?at ads.set2.knapsack.test.Eff

?at ads.set2.knapsack.test.Eff

2) test4(ads.set2.knapsack.te

java.lang.AssertionError: Checking optimal profit: expected:<76> but was:<72>

?at ads.set2.knapsack.test.Eff

?at ads.set2.knapsack.test.Eff

3) test8(ads.set2.knapsack.te

org.junit.runners.model.Te

FAILURES!!!

Tests run: 13, Failures: 3

```
public class KnapsackSolver {
/**
* Calculates the maximum profit for the knapsack problem using
* an improved dynamic programming algorithm
*
* @param items
* the items available to be packed into the knapsack.
* @param capacity
* the maximum weight allowed for the knapsack.
* @return the maximum profit possible for the given weight
*/
public static int pack(final Item[] items, final int
```

â€¦
Is what I described considered artificial intelligence?

Or, in order to satisfy the requirement of AI must that model also automatically adjust it's algorithms based on the results of the searches? In my case, the adjustments were manual.

Curious.

Thanks.

Thanks.

void qdelete(int* q.front, int* q.rear)

```
#include<stdio.h>
#include<stdlib.h>
#define size 50
typedef struct queue
{
int a[size];
int front;
int rear;
}ob;
ob q;
void qdelete(int*, int*);
void insert ()
{
int ele;
printf("\nEnter the element to be inserted:\t");
scanf("%d", &ele);
if((q.rear+1)%size==q.front)
// same as this : if((q.front==0)&&(q.rear=size-1)||(q.rear+1==q.front))
{
printf("\nQUEUE IS FULL !!\nNo more elements can be inserted.");
return;
}
else
{
if(q.rear==size-1)
q.rear=0;
else
q.rear++;
}
q.a[q.rear]= ele;
if(q.front==-1)
{
q.front=0;
printf("%d rear = %d front is the first element of the queue.", q.a[q.rear], q.a[q.front]);
}
printf("\n%d Inserted",q.a[q.rear]);
}
void qdelete(int* q.front, int* q.rear)
{
if(q.front==-1)
{
printf("\nQueue empty");
return;
}
else
{
printf("\nElement output %d", q.a[q.front] );
if(q.front==q.rear)
{
q.front=-1;
q.rear=-1;
}
else
{
q.front==(q.front+1)%size;
/* same as this:
if(q.front==size-1)
q.front=0;
else
q.front++; */
}
printf("\nDeleted");
}
}
void display ()
{
int i=q.front, j=q.rear;
printf("\nDISPLAY:\t");
while(i!=j)
{
printf(" %d ", q.a[i++]);
}
printf (" %d", q.a[i]);
printf("\n");
}
void main()
{
int choice;
q.front = -1;
q.rear = -1;
while(1)
{
```

â€¦
Enroll in June's Course of the Month
Juneâ€™s Course of the Month is now available! Experts Exchangeâ€™s Premium Members, Team Accounts, and Qualified Experts have access to a complimentary course each month as part of their membershipâ€”an extra way to sharpen your skills and increase training.

I am trying out the

I get so many notifications, How can I get a workable result ?

Is there some Algorithm to manage these ?

I use Delphi with SQL Lite catering to all Windows OS

```
Results while Creating Excel File
waAdded TestNewFile.xlsx
waRemoved TestNewFile.xlsx
waAdded ~$TestNewFile.xlsx
waModified ~$TestNewFile.xlsx
waModified ~$TestNewFile.xlsx
waAdded 90A4C000
waModified 90A4C000
waModified 90A4C000
waModified 90A4C000
waModified 90A4C000
waModified 90A4C000
waModified 90A4C000
waRenamedOld 90A4C000
waRenamedNew TestNewFile.xlsx
waModified TestNewFile.xlsx
```

```
Results while Creating Notepad File
waAdded TestNewTextFile.txt
waRemoved TestNewTextFile.txt
waAdded TestNewTextFile.txt
waModified TestNewTextFile.txt
waModified TestNewTextFile.txt
```

```
Other Results that keep coming on their own or while using Windows Explorer.
waModified Users\SS Smith\ntuser.dat.LOG1
waModified Users\SS Smith\NTUSER.DAT
waAdded Windows\Prefetch\TASKMGR.EXE-5F5F473D.pf
waModified Windows\Prefetch
waModified Users\SS Smith\AppData\Local\Microsoft\Windows\UsrClass.dat.LOG1
waModified Users\SS Smith\AppData\Local\Microsoft\Windows\UsrClass.dat
waModified Windows\Prefetch\DLLHOST.EXE-5E46FA0D.pf
waModified Windows\System32\wbem\Repository\OBJECTS.DATA
waModified Windows\System32\wbem\Repository\INDEX.BTR
waModified Windows\System32\wbem\Repository\MAPPING2.MAP
waModified Windows\Prefetch\AVWSC.EXE-327FD431.pf
```

Number_of_Ones=bitcount(ar

Number_of_Zeroes=bitcount(

I have a list of numbers in excel that I think might be related to a stock price trend.

There are about 2000 + representing each day along with the comparative stock price at that same time.

I also record whether the stock went up or not from the previous day.

I want to know if the Number column is related to the trend column. It cold be related to the current day, the next day or perhaps days in the future using the number column as the base. The end result would be to say that the

Does anyone have an idea on how I could examine this - whether in excel or in some other method (i'm good in vba, very basic python)?

Sample.xlsx

I would like to input a few parameters/constraints, and obtain a random directed graph that meets those constraints. Every graph has a terminal node. Some examples of constraints are:

1) min/max number of child nodes per node

2) length of shortest path from input to a terminal node

3) max number of nodes in graph

4) (possibly) max length of longest path

I don't know much about graph theory, but are there any algorithms or libraries that can generate random graphs similar to this?

Thanks!

Could you please help me to resolve the following task:

In the text file I have the matrix of connections between points together with the weights for each pair, for instance:

A, B, 10

A, C, 15

B, D, 11

D, C, 12

E, A, 14

Now, I need to convert these data into the graph matrix with zeroes on diagonal (A,A=0, B,B=0, etc.) and x stands for no weight for pair:

[[0, 10, 15, x, 14],

[10, 0, x, 11, x],

[15, x, 0, 12, x],

[x, 11, 12, 0, x],

[14, x, x, x, 0]]

I need to do that in c++ but I believe this is rather matter of an algorithm.

Thanks in advance

Mike

Link of my code: http://codepad.org/vw9km9cy

Free Tool: IP Lookup

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

What would the odds be for selecting 7 winners from the 12 games being played with a single entry? Two entries? Three entries? How would I calculate this?

Now let's say I am submitting multiple entries. I am submitting every combination of picks for 4 games (2^4 = 16 combinations) to ensure at least one of the entries has all 4 picks correct. This would leave only 3 picks to chance. I would submit the same 3 picks with all 16 combinations. Therefore as long as my 3 guesses were correct, one of my 16 entries would have all 7 picks correct. How would I calculate these odds?

I hope this makes sense.

Thanks.

I have an interesting problem I need to solve.

I'm sure that someone has encountered this somewhere

and that an elegant solution exists.

I'm trying to write an method which increments and returns the next

alphanumeric character in a sequence.

These letters are intended to range from 'A' to 'ZZZZ'.

I am only dealing with capital (uppercase letters)

Consider the following examples:

```
INPUT OUTPUT
===================
A B
G H
Z AA
AZ BA
AZZZ BAAA
```

I'm looking for a solution which is more or less portable across

languages (C#, VB.Net, JavaScript/JQuery). This of course rules out

trying something with LINQ.

I've made several attempts at this, but the all are kind of klunky.

Any thoughts, ideas, suggestions or directions to explore would be greatly appreciated.

Thanks,

JohnB

The way it's supposed to work is: Sum (Total_NR) divided by the average of the sum of NR which we should then so a STDEVP on that average.

MGR_NAME EMPL HC Total_NR Avrg Dispersion?

JOSE PH 1027 1 $3,974.00 0.000107

JOSE PH 1233 1 $3,324.00 0.000074

JOSE PH 1354 1 $51.87 0.000012

JOSE PH 1375 1 $2,302.67 0.000049

JOSE PH 1486 1 $1,230.68 0.000045

```
public void toString(NodeImpl<E> node) {
if (node == root) {
treeToString.append(root.key + "(");
}
if (node.left == nil && node.right == nil) {
if (node == node.parent.right) {
}
}
if (node.left != nil) {
if (node.left.left != nil || node.left.right != nil) {
treeToString.append(node.left.key + "(");
toString(node.left);
} else {
if (node.right != nil) {
treeToString.append(node.left.key);
} else {
treeToString.append(node.left.key + ")");
}
toString(node.left);
}
}
if (node.right != nil) {
if (node.right.left != nil || node.right.right != nil) {
if (node.left != nil) {
treeToString.append("," + node.right.key + "(");
} else {
treeToString.append(node.right.key + "(");
}
toString(node.right);
} else {
if (node.left != nil) {
treeToString.append("," + node.right.key);
} else {
treeToString.append(node.right.key);
}
toString(node.right);
}
treeToString.append(")");
}
}
```

I need to implement toString to represent a tree like (also each level can be a separate line):

(n1(n11(n111, n112), n12(n121, n122)))

that corresponds to tree hierarchy:

n1

n11 n12

n111 n112 n121 n122

In addition, the method should be based on the loop. I made the method which is work correctly based on recurion. Could help me to convert this method to loop based.

Thx in advanced dear experts !

Our products could be in multiple locations with multiple quantities. (Generally no but could). I have a table called ProdLocations. It has fields:

ProdLocID (Autonumber)

ProductId(found in the Products Table)

LocID (found in the Locations Table)

QtyLoc (Quantity)

I would like for Access to evaluate all the Locations and Quantity in those locations for that product on the order.

Then decide on a location (LocID) that best fits and place it on the pickers list.

Example:

Customer orders 5 of productID 32

ProdLocations Table

ProdLocID / ProductID / QtyLoc / LocID

__________________________

543. 32. 6. 78

777. 32. 2. 99

198. 32. 4 12

Access would say in this scenario ProductID 32 /Qty 5 / LocID 78

OR IF----

Order was for 8 of ProductID then access would suggest LocID 78 and 99 =8

I am trying to understand and figure out the best way to automatically remove product quantities from exact location when there could be multiple locations for a single product.

When a automatic quantity deduction is made we need to know where so we have accurate records.

Advice, Suggestions, etc......

Thank you all for the help!

3K

Solutions

10

Articles & Videos

4K

Contributors

An algorithm is a self-contained step-by-step set of operations to be performed. Algorithms exist that perform calculation, data processing, and automated reasoning. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.

Top Experts In

Algorithms