• 0

Java: Generate the alphabet in random order, no duplicates


Question

Hi guys,

I am taking an introductory programming course and need a bit of help. The assignment is to have the Java program read a message (I am assuming from a .dat file, not quite sure). The program creates substitutes each random letter with a different letter chosen at random by the computer. If the letter M is chosen to replace the letter P in the message, then M replaces P in every instance of the message.

Right now, I just need help with generating a set of the 26 letters ordered randomly without duplicates. Here is what I have:

import java.util.Random;

public class encrypt {

public static void main(String[] args) {

char [] alphabet =

{'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};

char [] substitute =

{'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};

boolean done=false;

Random generator = new Random();

int i, j, k, random;

while(done==false) {

for(i=0; i<=25; i++) {

random = generator.nextInt(25);

substitute=alphabet[random];

for(j=0; j<=i; j++) {

while(substitute[j]==substitute) {

random = generator.nextInt(25);

if(substitute[j]!=substitute) {

substitute=alphabet[random];

}

}

}

}

for(k=0; k<=25; k++) {

System.out.print(substitute[k] + ", ");

}

done=true;

}

}

}

Right now the program does nothing. If I remove the last for loop with j as the counter and everything within that for loop, I get an output of 26 letters randomly chosen, but there are duplicates. The last for loop is supposed to say something like, "If the randomly generated letter (substitute) has appeared before in substitute[], then generate a new random number until it is no longer a duplicate of a previous number, at which point the letter which corresponds to the random number is stored in substitute.

So if you could give me some suggestions it would be much appreciated. If I am overcomplicating things and there is a much easier way to do this, please guide me in the right direction.

Thanks,

Noah

EDIT: Spacing in the program code isn't working. Looks fine while I'm editing it though. What's wrong?

EDIT 2: See here for my code, correctly formatted.

Edited by -Noah-

Recommended Posts

  • 0

Your way seems a little strange unless I am missing something. Why don't you just have an array for the alphabet and then just pick a letter at random when you need it. From what I understood you don't actually need an entire randomised alphabet.

  • 0
Your way seems a little strange unless I am missing something. Why don't you just have an array for the alphabet and then just pick a letter at random when you need it. From what I understood you don't actually need an entire randomised alphabet.

Thanks for the response.

How would I make sure that I do not pick the same letter from the alphabet array more than once?

  • 0

You could always switch to using a LinkedList instead of an array, when you choose a letter, you just remove it from the list.

The size of the list would decrease each time, so you'd need to generate a random number using the variable linkedlist.size() instead of 25.

  • 0

I would stick to the array personally and have another with the letters already used so that when a new random letter is picked it is checked against those in the already used array.

LinkedLists - /covers eyes and shrieks

Sorry, personal disposition :)

  • 0
I would stick to the array personally and have another with the letters already used so that when a new random letter is picked it is checked against those in the already used array.

LinkedLists - /covers eyes and shrieks

Sorry, personal disposition :)

why would you want to maintain 2 arrays versus a single shrinking array that will only ever have letters you can use?

not to mention random doesn't mean true random, you could (however unlikely this is) end up randomizing the same already used letter multiple times in a row

  • 0
why would you want to maintain 2 arrays versus a single shrinking array that will only ever have letters you can use?

not to mention random doesn't mean true random, you could (however unlikely this is) end up randomizing the same already used letter multiple times in a row

I can see what you are saying, and it is true, but I am compelled to say, so?

  • 0

That was my problem: I knew there would be a chance that it could generate the same letter again. That's why I made my code the way I did. Also, I don't see how creating a "used letters" array would be any better than my method.

The only problem is, why doesn't my code work!?!?

How would I go about creating a linked list in Java? I looked online and unless I am missing something, it looks pretty complicated.

  • 0

import java.util.Random;
import java.io.*;
import java.lang.*;
import java.lang.String.*;



public class encrypt {

public static void main(String[] args) {

char [] alphabet =
{'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
char [] substitute =
{'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
char [] used =
{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0'};
boolean done=false;
Random generator = new Random();
int i, j, k, random, count;

count = 0;

System.out.print("Enter a string: ");

	  //  open up standard input
	  BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

	  String input = null;

	  //  read the username from the command-line; need to use try/catch with the
	  //  readLine() method
	  try {
		 input = br.readLine();
	  } catch (IOException ioe) {
		 System.out.println("IO error");
		 System.exit(1);
	  }

	  //loop
	  for (int l = 0; l &lt; input.length(); l++)	{
		  count++;

  }
		  System.out.println(count);

		for(int p = 0; p &lt;count; p++)	{

			int result = 0 + (int) ( Math.random()*(26) );

			char temp = alphabet[result];

			char temp2 = '1';
			int o = 0;
			while(temp2 != '0')	{
			//for(int o = 0; o &lt; used.length(); o++)	{

				temp2 = used[o];

				if(temp == temp2) {					
					result = 0 + (int) ( Math.random()*(26) );
				}
				o++;
			}
			char temp3;
			temp3 = input.chatAt(count); // No idea why this doesn't work
			alphabet[result] = temp3;


			count++;
		}


	  System.out.println(input);


while(done==false) {
for(i=0; i&lt;=25; i++) {
random = generator.nextInt(25);
substitute[i]=alphabet[random];
for(j=0; j&lt;=i; j++) {
while(substitute[j]==substitute[i]) {
random = generator.nextInt(25);
if(substitute[j]!=substitute[i]) {
substitute[i]=alphabet[random];
}
}
}
}
for(k=0; k&lt;=25; k++) {
System.out.print(substitute[k] + ", ");
}
done=true;
}
}
}

Something like that, only charAt doesn't work, sorry I'm tired so if you can fix that part I can check the rest of the code.

Oh and this way you have all the letters you have used in an array for printing/whatever.

So... then you don't have to compare and try the operation again...

All it is, is a for loop running through used array in case you pick a letter that has been already used you just pick a new random letter.

Edit: Actually, it only checks once and if it picks a letter that already occured again it proceeds when it shouldn't.

Also not accounting for spaces... /sigh there is actually quite a lot, hope it helps though.

Edited by Zapadlo
  • 0
why would you want to maintain 2 arrays versus a single shrinking array that will only ever have letters you can use?

not to mention random doesn't mean true random, you could (however unlikely this is) end up randomizing the same already used letter multiple times in a row

Because LinkedLists seem a bit advanced for someone doing basic stuff like this in an introduction to a java course. Anyway:

Seems pretty sloppy (but it's 12:35am), but here it is. It's commented and stuff so you actually have a clue on what's going on. BTW, did you know you can declare variables while in for-loops? You don't need to declare "int i" as a member variable if you're just going to use it for for loops. Java should also just destroy the integer once you're out of the for loop, meaning you can reuse int i in another for loop if you so wish.

import java.util.Random;

public class encrypt {
  public static void main(String[] args) {
	char [] alphabet =  {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
	char [] substitute = {'.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.'};  //this should be 26 dots, please check
	int [] numbers = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};  //this should be 26 zeros, please check to see if this correct!!

	for (int i=0; i&lt;=25; i++) {
	  random = generator.nextInt(25);
	  //keep running this if-else until we find a number we haven't used before
	  do {
		//if we find a number we haven't used before
		if (numbers[random] == 0) { 
		  numbers[random] = random; //then assign that position in the array that number (i.e. position 10 in the array will now have the number 10)
		  substitute[i] = alphabet[random];  //assign the current position of the substitute alphabet array the random letter from the real alphabet
		}
		else {
		  random = generator.nextInt(25); //if we hit a number we've already used, get another one
		}
	  } while (numbers[random] != 0)
	}
	for(int i=0; i&lt;=25; i++) {
	  System.out.print(substitute[i] + ", "); //print out your brand new randomised alphabet!
	}
  }
}

I'll admit, I have no idea if this works or not, as I don't have the java compiler on my computer any more (haven't done java in about a couple of years), but this should work. There's no harm in compiling it yourself though, just shout out any errors if there are any.

  • 0

heres my attempt, not compiled but i don't imagine its too far off (could be wrong tho)

private String jumble(String[] original) {
	Random gen = new Random();
	String[] alphabet = {"a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "x", "y", "z", " "};
	ArrayList alphabetaGenList = new ArrayList(Arrays.asList(alphabet));
	Hashtable newAlphabet = new Hashtable();
	StringBuffer jumbled = new StringBuffer();
		int randomAlphabetLetter = 27;

		//oops made a mistake with the random, 2nd edit
	for (int i = 0; i &lt; 27; i++) {
				int r = gen.nextInt(randomAlphabetLetter--);
		newAlphabet.put(alphabet[i], alphabetGenList.get(r));
		alphabetGenList.remove(r);
	}

	for (int i = 0; i &lt; original.length; i++) {
				jumbled.append(newAlphabet.get(original[i]));
	}	

	return jumbled.toString();
}

edit...

i guess thats a bit overkill since it converts the string too, but not many changes just to do the alphabet

Edited by ecstasis
  • 0

Thanks guys for all the replies.

Zapadlo: I don't know if you realized this, but you have chatAt instead of charAt. :p Even with that change, it throws an error:

Exception in thread "main" java.lang.StringIndexOutOfBoundsException: String index out of range: 5

at java.lang.String.charAt(Unknown Source)

at encrypt.main(encrypt.java:66)

The string index out of range value is always the number of characters that I have typed for the string. I'm guessing my code at the bottom was not supposed to be there. No problem, though. I live in the US, so it's quarter of 10 now. Didn't mean to give you guys Java code problems in the middle of the night! Is Neowin UK based?

-Noah

  • 0

Teej: I added a semicolon after the while statement. No errors, but here are some examples of the output:

Output 1. W, C, U, H, E, D, F, Q, A, ., T, K, ., ., J, ., X, ., L, ., R, ., O, ., ., .,

Output 2. V, ., P, ., H, K, Q, ., D, S, ., ., G, J, R, F, N, ., M, B, ., Y, ., ., W, U,

Output 3. X, O, W, I, P, ., U, G, Q, R, F, ., ., V, A, B, ., ., K, ., Y, H, ., E, T, M,

I cant figure out what is wrong, most likely because I don't exactly know what is going on with the do while. Does the while statement at the end tell the program to go through the do again under the specified conditions? If you have any more ideas for fixing this, they are welcome!

About the int within the for-loop, my teacher says that it wastes memory and that you should define those variables first, out of the for-loop (?). I'm guessing she's wrong. :laugh:

  • 0
About the int within the for-loop, my teacher says that it wastes memory and that you should define those variables first, out of the for-loop (?). I'm guessing she's wrong. :laugh:

i'm not sure it would make a difference either way since those variables would go to the garbage collector once they are out of scope (i don't know exactly how java deals with).

  • 0

These solutions are all overkill...

- Make an ArrayList containing all 26 letters.

- generate random number from 0 to List.size()-1.

- List.get(randomNumber)

- List.remove(randomNumber)

loop and restart at step 2 until List.size() returns 0.

import java.util.*;

class alphaRandom {

	public static void main(String[] args) {

	ArrayList&lt;Character&gt; al = new ArrayList&lt;Character&gt;();
	Random gen = new Random();
	int num;

	for(int i = 65; i &lt;= 90; i++) {
		al.add((char)i);
	}

	while(al.size() &gt; 0) {
		num = gen.nextInt(al.size());
		System.out.print(al.get(num));
		al.remove(num);
	}
 }
}

Edited by Tech God
  • 0

I had to do this for school too.

Stick to your method of arrays. LinkedLists are a pain for this.

I say keep 1 array list(alphabet).

Then create a random number from 0 - array.length()-1

after that just loop thru and remove the letter that your random number is. Havent done java in a few months so I dont know the EXACT array command to say "array.get? or etc".

Idk, but logically I would do it this way. Easier.

  • 0
These solutions are all overkill...

- Make an ArrayList containing all 26 letters.

- generate random number from 0 to List.size()-1.

- List.get(randomNumber)

- List.remove(randomNumber)

loop and restart at step 2 until List.size() returns 0.

import java.util.*;

class alphaRandom {

	public static void main(String[] args) {

	ArrayList&lt;Character&gt; al = new ArrayList&lt;Character&gt;();
	Random gen = new Random();
	int num;

	for(int i = 65; i &lt;= 90; i++) {
		al.add((char)i);
	}

	while(al.size() &gt; 0) {
		num = gen.nextInt(al.size());
		System.out.print(al.get(num));
		al.remove(num);
	}
 }
}

If you want to same some programming time, al.remove(num) will also return the object it's removing - so System.out.print(al.remove(num)) should work.

  • 0
Teej: I added a semicolon after the while statement. No errors, but here are some examples of the output:

Output 1. W, C, U, H, E, D, F, Q, A, ., T, K, ., ., J, ., X, ., L, ., R, ., O, ., ., .,

Output 2. V, ., P, ., H, K, Q, ., D, S, ., ., G, J, R, F, N, ., M, B, ., Y, ., ., W, U,

Output 3. X, O, W, I, P, ., U, G, Q, R, F, ., ., V, A, B, ., ., K, ., Y, H, ., E, T, M,

I cant figure out what is wrong, most likely because I don't exactly know what is going on with the do while. Does the while statement at the end tell the program to go through the do again under the specified conditions? If you have any more ideas for fixing this, they are welcome!

About the int within the for-loop, my teacher says that it wastes memory and that you should define those variables first, out of the for-loop (?). I'm guessing she's wrong. :laugh:

Haha, I am a complete prat. I've made a couple of changes. Basically, the do-while loop was running the code within the loop while the random number isn't zero, meaning, if the position was being used, then it would generate a random letter until it wasn't being used, hence why you get the odd gaps. This new code does the opposite of this (runs the code within the loop until we get a random letter which isn't being used). I also changed all of the numbers to -1 because we would run into an infinite loop as position 0 would never be allowed.

There are three arrays: the alphabet array, the number array and the substitute alphabet array.

The number array is filled with -1s at the beginning, but as the for loop progresses, the number array gets filled up with numbers between 0-25.

Each time the code goes through the loop, it checks to see if that position in the array isn't -1 (i.e. isn't used), and if it isn't -1, then fill that position in the array with the random number, and then take whatever letter is in that position in the alphabet array, and apply it to the next space in the substitute alphabet array.

If the position in the number array ISN'T -1, then we generate a random number and the do-while loop returns to the beginning and we do the process again.

The do-while keeps doing this until we find a number which isn't -1, at which point, the for loop increments i and we start at the beginning of the code within the for-loop.

import java.util.Random;

public class encrypt {
  public static void main(String[] args) {
	char [] alphabet =  {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
	char [] substitute = {'.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.','.'};  //this should be 26 dots, please check
	int [] numbers = {-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1};  //this should be 26 -1s, please check to see if this correct!!

	for (int i=0; i&lt;=25; i++) {
	  random = generator.nextInt(25);
	  //keep running this do-while until we find a number we haven't used before
	  do {
		//if we find a number we haven't used before
		if (numbers[random] == -1) { 
		  numbers[random] = random; //then assign that position in the array that number (i.e. position 10 in the array will now have the number 10), so it's considered to be used
		  substitute[i] = alphabet[random];  //assign the current position of the substitute alphabet array the random letter from the real alphabet
		}
		else {
		  random = generator.nextInt(25); //if we hit a number we've already used, get another one
		}
	  } while (numbers[random] == -1);
	}
	for(int i=0; i&lt;=25; i++) {
	  System.out.print(substitute[i] + ", "); //print out your brand new randomised alphabet!
	}
  }
}

Also, as for what your teacher says, what the hell? Forgive me if I'm wrong, but I'm really certain Java's automatic trashing would destroy the integer as soon as we get outside of the for loop, as opposed to at program termination, meaning it's more efficient to do it that way in this particular instance. Unless you need to use that specific integer value for another task outside of the for loop, declaring it outside of there is pointless.

Regardless of whether it trashes it or not after the for loop, though, it just makes the code neater to actually create the integer for a for-loop in the for-loop, instead of at the beginning, when it may not be needed at all. This is especially true if you have a for-loop within an if-else (as the for-loop may never be executed, meaning you've just wasted memory on declaring an integer which won't be used), or if you're using for-loops in object oriented code, which may not be called very often. Also, if you're using quite a few for loops, you don't want to have to do something like:

int i = 0;	//this integer is for a for loop that does this
int j = 0;		 //this integer is for a for-loop that does that
...
int l = 0;	//this integer is for yet another for-loop that does this thing somewhere in the code, I forget where it is now

Edited by The Teej
  • 0

int variables are primitive types, not Objects and are not created on the heap or garbage collected. They are allocated on the stack when coming into scope and thus released then they go out of scope. Teacher is talking rubbish - an int occupies the same space on the stack wherever it is defined, it just occupies that space for less time when its scope is smaller. And is anyone seriously worrying about 4 bytes of memory in 2009?

  • 0

Obviously the teacher is thinking about :

for (blabla) {
	Object o = new Object();
}

vs

Object o = new Object();
for (blabla) {
}

Here the latter is more efficient since Object() is allocated and constructed only once. If you can move any initialization out of a loop, it's always more efficient to do so. However, doing :

Object o;
for (blabla) {
	o = new Object();
}

is no performance improvement as the object still needs reallocation and construction each time through the loop. The reference o itself is statically allocated, i.e. it's merely a stack pointer increment at the beginning of the method and a decrement at the end, it makes no difference where you declare it in the method.

As for primitive types like int, there is no allocation and no construction involved, so from a performance standpoint it doesn't matter where they are declared within a method. Actually one should try to reduce the scope of variables as much as possible, so here declaring it inside the loop is what makes the most sense since that's the only place where it's supposed to be accessible.

In C++ the question might be different (and I'm unsure about the details), but here we're talking about Java not C++.

Show this to your teacher. :p

This topic is now closed to further replies.
  • Recently Browsing   0 members

    • No registered users viewing this page.
  • Posts

    • BleachBit 6.0.1 Beta by Razvan Serea When your computer is getting full, BleachBit quickly frees disk space. When your information is only your business, BleachBit guards your privacy. With BleachBit you can free cache, delete cookies, clear Internet history, shred temporary files, delete logs, and discard junk you didn't know was there. Designed for Linux and Windows systems, it wipes clean thousands of applications including Firefox, Microsoft Edge, Google Chrome, Opera, Safari, and more. Beyond simply deleting files, BleachBit includes advanced features such as shredding files to prevent recovery, wiping free disk space to hide traces of files deleted by other applications, and vacuuming Firefox to make it faster. Better than free, BleachBit is open source. BleachBit has many useful features: Delete your private files so completely that "even God can't read them" according to South Carolina Representative Trey Gowdy. Simple operation: read the descriptions, check the boxes you want, click preview, and click delete. Multi-platform: Linux and Windows Free of charge and no money trail Free to share, learn, and modify (open source) No adware, spyware, malware, browser toolbars, or "value-added software" Translated to 64 languages besides American English Shred files to hide their contents and prevent data recovery Shred any file (such as a spreadsheet on your desktop) Overwrite free disk space to hide previously deleted files Portable app for Windows: run without installation Command line interface for scripting and automation CleanerML allows anyone to write a new cleaner using XML Automatically import and update winapp2.ini cleaner files (a separate download) giving Windows users access to 2500+ additional cleaners Frequent software updates with new features Going beyond standard deletion of files, BleachBit has several advanced cleaners: Clear the memory and swap on Linux Delete broken shortcuts on Linux Delete the Firefox URL history without deleting the whole file—with optional shredding Delete Linux localizations: delete languages you don't use. More powerful than localepurge and available on more Linux distributions. Clean APT for Debian, Ubuntu, Kubuntu, Xubuntu, and Linux Mint Find widely-scattered junk such as Thumbs.db and .DS_Store files. Execute yum clean for CentOS, Fedora, and Red Hat to remove cached package data Delete Windows registry keys—often where MRU (most recently used) lists are stored Delete the OpenOffice.org recent documents list without deleting the whole Common.xcu file Overwrite free disk space to hide previously files Vacuum Firefox, Google Chrome, Liferea, Thunderbird, and Yum databases: shrink files without removing data to save space and improve speed Surgically remove private information from .ini and JSON configuration files and SQLite3 databases without deleting the whole file Overwrite data in SQLite3 before deleting it to prevent recovery (optional) BleachBit 6.0.1 Beta release notes: BleachBit 6.0.1 beta is now available for testing. This maintenance-focused release includes bug fixes, updated translations, and a range of safe enhancements. This release fixes a Windows security issue that could allow arbitrary file deletion during privileged cleaning (reported by Zeze with TeamT5). It also adds new cleaners (including a DNS cache cleaner, Claude Code, and Visual Studio Code forks), support for multiple Chrome and Edge profiles, new deep scan options for developer directories like node_modules and venv, and safer, faster file shredding. All Platforms Added cleaners for Claude Code, DNS cache, and many Visual Studio Code forks. Added support for multiple Chrome and Edge profiles. Chrome can now clean downloaded AI models. Deep Scan can optionally remove venv, __pycache__, node_modules, and .angular directories. Deep Scan is faster by skipping directories on the keep list. File shredding is safer, faster, and leaves fewer recoverable traces. Improved handling of cookies, symlinks, Unicode filenames, external processes, and configuration files. Improved Expert Mode warnings and long warning dialogs. Fixed crashes related to cleaner detection, invalid Unicode, and malformed cleaner data. Clipboard is now cleared automatically after shredding files via paste operations. Linux Added AppImage support. Added cleaners for Visual Studio Code, Codeium, Librewolf (.deb), Transmission (Flatpak), and Profanity. Improved Linux trash detection, including Snap-installed applications and mounted drives. Fixed Wayland root CLI issues and several Snap-related problems. Improved package dependencies, AppStream metadata, and desktop file handling. Fixed startup crashes when Python Requests is unavailable. Windows Fixed a security vulnerability that could allow arbitrary file deletion when cleaning with elevated privileges. Added %WindowsSystem% variable support. Improved clipboard clearing using native Windows APIs. Improved installer experience on unsupported Windows versions. Reduced installer size and improved application robustness. Fixed Unicode handling, filename anonymization, Git revision reporting, and splash screen stability. [full release notes] Download: BleachBit 6.0 | Portable | ~20.0 MB (Open Source) View: BleachBit Home page | Screenshot Get alerted to all of our Software updates on Twitter at @NeowinSoftware
    • DriversCloud 12.1.6 by Razvan Serea With DriversCloud (formerly My-Config.com), you can explore your computer easily, safely and free. The application quickly scans your PC and identifies the hardware and software components. DriversCloud then establishes a list of the different drivers compatible with your OS and hardware. Download the drivers needed for the proper functioning of your computer. To detect your drivers, DriversCloud also displays a detailed summary of your hardware and software configuration, analyzes your BSOD, monitors in real-time your PC voltages and temperatures and lets you share your configuration online. Once the hardware components have been detected, you will be able to obtain with just a few clicks the latest drivers corresponding to the identified hardware. You can record your configuration on the site for free, and can get the corresponding URL to post the configuration to technical forums, e-mail and social networks. You can also download the detection result (the configuration) as a PDF file. To protect the user's privacy and data confidentiality, a 4-level confidentiality system was created that filters the XML marks and gives control to the user. The default level can be modified in the preferences. Using the maximum level will prevent the user from publishing his configuration and generating a corresponding PDF file. In non-connected mode, each XML configuration is stored on the server for one day (for practical reasons). However, you are given the opportunity to manually delete it. Created in 2004, and continually improved, My-Config.com has established itself on the web as a free service to PC users running Windows and Linux operating systems. The service is designed to work with the most common Internet browsers (Edge, Firefox, Chrome, Safari). Download: DriversCloud 64-bit | 20.0 MB (Freeware) Download: DriversCloud 32-bit | 18.9 MB Link: DriversCloud Home Page | Screenshot Get alerted to all of our Software updates on Twitter at @NeowinSoftware
    • Ocenaudio 3.19.3 by Razvan Serea  Ocenaudio is a full featured, fast and easy to use audio and music editor. It is the ideal software for people who need to edit and analyze audio files without complications. Ocenaudio also has powerful features that will please more advanced users. To assist ocenaudio development, a powerful toolset of audio editing, analysis and manipulation called Ocen Framework was created. ocenaudio is also based on Qt framework, a well known library for cross-platform development. Cross-platform support ocenaudio is available for all major operating systems: Microsoft Windows, Mac OS X and Linux. Native applications are generated for each platform from a common source, in order to achieve excelent performance and seamless integration with the operating system. All versions of ocenaudio have a uniform set of features and the same graphical interface, so the skills you learn in one platform can be used in the others. VST plugins support Ocenaudio supports VST (Virtual Studio Technology) plugins, giving its users access to numerous effects. Like the native effects, VST effects can use real-time preview to aide configuration. Real-time preview of effects Applying effects such as EQ, gain and filtering is an important part of audio editing. However, it is very tricky to get the desired result by adjusting the controls configuration alone: you must listen the processed audio. To ease the configuration of audio effects, ocenaudio has a real time preview feature: you hear the processed signal while adjusting the controls. The effect configuration window also includes a miniature view of the selected audio signal. You can navigate on this miniature view in the same way as you do on the main interface, selecting parts that interest you and listening to the effect result in real time. Multiselection for delicate editions To speed up complex audio files editing, ocenaudio includes multi-selection. With this amazing tool, you can simultaneously select different portions of an audio file and listen, edit or even apply an effect to them. For example, if you want to normalize only the excerpts of an interview where the interviewee is talking, just select them and apply the effect. Eficient edition of large files With ocenaudio, there is no limit to the length or the quantity of the audio files you can edit. Using an advanced memory management system, the application keeps your files open without wasting any of your computer's memory. Even in files several hours long, common editing operations such as copy, cut or paste happen almost instantly. Fully featured spectrogram Besides offering an incredible waveform view of your audio files, ocenaudio has a powerful and complete spectrogram view. In this view, you can analyze the spectral content of your audio signal with maximum clarity. Advanced users will be surprised to find that the spectrogram settings are applied in real time. The display is updated immediately when altering features such as the number of frequency bands, window type and size and dynamic range of the display. Ocenaudio 3.19.3 changelog: Fixes issues with MP4 files with more than 8 channels Fixes incorrect VBR detection for some CBR MP3 files Other bug fixes and improvements Download: Ocenaudio 64-bit | Portable | ~40.0 MB (Freeware) Download: Ocenaudio for Linux and Mac OS View: Ocenaudio Homepage | Screenshot Get alerted to all of our Software updates on Twitter at @NeowinSoftware
  • Recent Achievements

    • Week One Done
      agatameier earned a badge
      Week One Done
    • One Month Later
      agatameier earned a badge
      One Month Later
    • Week One Done
      ssd21345 earned a badge
      Week One Done
    • Contributor
      MarkHughes4096 went up a rank
      Contributor
    • Dedicated
      jordanspringer earned a badge
      Dedicated
  • Popular Contributors

    1. 1
      +primortal
      513
    2. 2
      +Edouard
      185
    3. 3
      PsYcHoKiLLa
      144
    4. 4
      ATLien_0
      95
    5. 5
      Steven P.
      75
  • Tell a friend

    Love Neowin? Tell a friend!