No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
11 Posted Topics
 | For those who get similar problems, it is easy as this DataView dw = myDataTable.DefaultView; DataTable distinctDataTable = dw.ToTable(true, "someColumn"); |
| | In the main method of a program we always use the code as a parameter: String[] args What does it mean? In the tutorial of java sun, there is a code following [code]public static void main(String[] args) { //this program requires two arguments on the command line if (args.length == … |
| | Hello, I develop a forum like site and I need a page just like this. (this page, you are looking it now :) ) I need a [U]post template[/U] like this, is this a text area? if it is, how can I determine this background? as I see it is …  |
| | Hello, I am newbie at ASP.net. I got stuck at a point that hopefully you can help me. I use mssql as database and fetch all my records and images from there by using <asp:SqlDataSource>. I also use [CODE]<asp:Repeater>[/CODE] to show data at every iteration. After fetching data from database, … |
| | This is also 2 dimensional, pointers of pointers [code=cplusplus] float **grades; int *examNo, studentNo, i, j; cout << "No of students: "; cin >> studentNo; grades = new float *[studentNo]; examNo = new int [studentNo]; for (i = 0; i < studentNo; i++){ cout << "No of exams for " … |
| | We can convert any kind of numbers to binary string. For example 20501487 can be converted into binary String format as 1001110001101001111101111. However I cannot reconvert this binary String into any number format, even long or float numbers due to NumberFormatException, where the numbers are very big to convert. I … |
| | Haha good example:) But viron, you should ask an exact question to get a reply. |
| | Narue is doing it right. You can resize the array by creating a new array which its size is different. And you can pass the datas, delete the old array. Thats all. As narue did it. |
| | shortestPath(in theGraph, in weight:WeightArray) { // Finds the minimum-cost paths between an origin vertex (vertex 0) // and all other vertices in a weighted directed graph theGraph; // theGraph’s weights are nonnegative Create a set vertexSet that contains only vertex 0; n = number of vertices in the Graph; // … |
| | i want to implement a binary tree code but i encountered a problem. after i insert some numbers to tree, i couldn't print my numbers except first one or i couldn't insert the numbers except first one. As a result my binary tree doesn't work, it only shows the first(root) … |
| | i just want to know how to write a circular linked list destructor. anybody help?  |
The End.