No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
10 Posted Topics
Hello mates i am having a problem designing a new DTD over the existing one found at: [url]http://dblp.uni-trier.de/xml/dblp.dtd[/url] This is the DTD over their original XML file. I used a SAX parser to store specific data from the original file into my relational database. Now i have to do the …
Greetings i have created the above class to create rooms and exits of the rooms. That way every room is linked to another room and i can move between them. Now what i want to do is to add an image to every room that is stored inside the class. …
[CODE]public String expandTemplateTopic(String remark) { String random_word = findKeyWord(remark); String str=" "; String kok2=" "; int num1=0; int num2=0; int num3=0; //find a random template int number = generator.nextInt(sentenceList.size()); String argument=sentenceList.get(number).getTemplate(); //split it into words using space as delimiter List ls=new LinkedList(); String[] array =argument.split (" "); //find if there …
Hello guys i am solving last years exams for practice when i stepped over this quiz. I have been fighting it for 2 hours but cant solve it. I must fill in the blanks so the program makes sense and i know its an interface , a class and a …
Hello guys under a project i have to complete for this semester i have to think and implement a shortest path algorithm other than the ones i have already coded so far for this course , which are: - Bellman Ford - Floyd - Kruskal The whole project is a …
int quickSort(int a[],int left,int right) { comparisons++; if (left>=right) return(0); int q=partition(a,left,right); quickSort(a,left,q); quickSort(a,q+1,right); return(0);} You must have a left and a right or low-top call it as you like. That is needed becasue the first partition runs from low until q (or split as you named it) and one …
If you want those 1000 numbers to have a limit use this: for (int i=0;i<arraySize;i++) { a=1 + rand() % limit; } } dont forget to use `#include <cstdlib>`
Just came and i am delighted about this place. This is my new home
Ok i'll try to be brief. As part of one of my essays i thought of creating source code for implementation of a binary tree and its basic functions. My code is both from books,lecture notes and googling but for some reason on the printing of the nodes using inOrder …
The End.