|
Hi! I am working on a graphing application which plots math functions (for example sin(x)). At this stage the program works but in some cases the graph isn't correct. The program calculates the points of the graph and finds the point (x,f(x)). But some calculations return very small numbers an the graph is not correct. In order to fix this I decided also to calculate the limits of the function in the non defined points (for example lim 1/x, x->0). If someone has stumbled upon some articles or knows something about the problem, let me know. (Google only showed me the math definition of the limit, but I couldn't find an algorithm). Thanks!
Still learning...
|
|
|
|
|
It might be a good idea to identify which inputs return wrong answers, then try to find a pattern in the errors. Fixing the underlying bug will produce a more reliable program than adding a patch involving limits.
|
|
|
|
|
Hi......i need help in ASP.NET for vs 2005 to develop an e commerce website for my final year B.Tech. project....plz guide me...........specially how to develop credit cart verification transaction and shopping cart module??????????
|
|
|
|
|
Well, you'd normally start out by defining your requirements. Possibly you'll want to draw some high level use cases out of these, and then you'll want to break these down into a more detailed design. From there, you can pull together your basic code.
|
|
|
|
|
Pete O'Hanlon wrote: Well, you'd normally start out by defining your requirements. Possibly you'll want to draw some high level use cases out of these, and then you'll want to break these down into a more detailed design. From there, you can pull together your basic code.
Very good advise...
If you want to try doing some Data Flow Diagrams(DFD's). Could help with how you want to the project to flow.
|
|
|
|
|
My objective is to made an online shopping website based on ASP.NET 2.0 ,for which i m using visual studion IDE and prograaming in C#............i need a good ebook on ASP.NET which includes session management as well as database handling......I have made modules.......I m facing difficulty in shopping cart implementation and credit card verification modules..........
|
|
|
|
|
Dear shriyangika,
First of all you should be knowing how the data is flowing.take paper and pencil note down everything what ever coming in your mind about the project ..
as you told
shriyangika wrote: I have made modules.......I m facing difficulty in shopping cart implementation and credit card verification modules..........
whats the module.. how it looks like...and what exact problem you are facing... if you can tell all these it will helpful for the one who is trying to help you here..
vikas da
|
|
|
|
|
You're tackling the problem from the wrong side here. You're talking the technology end when, what you should be doing, is actually working out what the problem really is.
|
|
|
|
|
i explained technology and tools which i m using to implmnt my project...actuall y i m facing problem in database handling and database management in ASP.NET......i have already decided for modules and.....rest of the things.......but how to use database through ASP.NET controls.......i mean dataset and datagrid view control....
Designing of pages i hv done..........but database handling i m nt able to do...
|
|
|
|
|
I am a student of final year MCA doing a project on intelligent tutoring systems ,i dont know which algorithm to use that will suit best to my project.... help me!
|
|
|
|
|
I'd say you should design a data structure that models what the student knows, and how well they know it. Then use this data to select tutorial topics. Then give quizzes and use the results to update the data structure.
|
|
|
|
|
I have binary tree
And I want to traverse this tree level by level
that's mean print the level zero then level one ....etc
how can I do that
|
|
|
|
|
where you get the binary tree from?
as far as i know there is not one included in .Net framework (or whatever your using)(I may be wrong).
But basically you would need to know how it works before you can move through it.
If you made your own then you should know this answer.
|
|
|
|
|
thanks so much
I am study data structure specially non linear data structure
and I need algorithm to solve my problem I know about BFS but I think
this used in graph only my be my teacher Will Not accept this BFS in binary tree
thanks another time
|
|
|
|
|
A binary tree IS a graph. You can use a BFS quite easily on a binary tree.
|
|
|
|
|
|
You need to find out about 'recursion' techniques
|
|
|
|
|
I'm sure there must be a reasonably simple way to do this.....probably something recursive.
I have X apples and want to split them into groups with a maximum M apples in each group. I want to have the minimum number of groups, but for each group to be 'as equal as possible'.
I think the min number of groups is simply CEILING(X/M, 1)
e.g.,
X = 9, M = 4, groups would be 3, 3, 3 (not 4, 4, 1)
X = 137, M = 25 :: (23, 23, 23, 23, 23, 22)
X = 23, M = 5 :: (5, 5, 5, 4, 4)
etc.
|
|
|
|
|
Kyudos wrote: I want to have the minimum number of groups, but for each group to be 'as equal as possible'.
That is two requirements, they may (and will) be conflicting at times.
X=5 and M=2, now what is best: 2+2+1 or 1+1+1+1+1 ???
when the first requirement is dominant, then #groups=CEIL(X/M)
when the second requirement is dominant, then #groups=X/largest factor of X lessequal M
when a more complex optimum is defined, it will be somewhere in between...
|
|
|
|
|
Well, because groups are 'expensive' (I'm not actually using apples ) minimising the number of groups trumps 'evenness'.
I think this works:
Min Number of groups G = CEIL(X/M)
Lower Bound LB = FLOOR(X/G)
Upper Bound UB = CEIL(X/G)
No. UB = (X/G - LB) * G
No. LB = (G - No. UB)
|
|
|
|
|
Correct, although I would write that as #UB=X%G
|
|
|
|
|
Suppose I have some number (say between 100 and 1000) of lines of fixed text, each containing 13 pairs of characters; each character pair will be rendered in hardware as a single glyph. The hardware supports multiple character sets of 250 glyphs each, but any particular line is restricted to using one character set.
How would one go about packing things as efficiently as possible so as to minimize the number of glyphs that have to be duplicated in multiple character sets?
Note that I am well aware that using rigid character pairs is not the optimal means of compressing text, but the display hardware that will render the text is sufficiently feeble that it can't handle much else.
|
|
|
|
|
|
hello all,
I don't seem to understand how free space is calculated in NTFS.
I have a 512MB Drive (NTFS)
Cluster size = 4k (512b per sector, 8 sectors per cluster)
$BITMAP file has 4 clusters (Last Cluster is 4032 bytes)
so the total bytes would be 3*4*1024 + 4032 = 16320
so the total clusters it can address 16320*8 = 130560
now 130560*4096 = 510MB (total usable disk space i am guessing)
now if i calculate the total bits that are 0 in $Bitmap that should
give me the total free space
But total 0 bits are only 424.. that means only 424 clusters are free i.e.1696KB
But the disk is 441MB full and 68.6MB free.
(i have really checked my free 0's code it looks ok)
Can anyone please explain this to me?
|
|
|
|
|
This is only a guess, I don't know much at all about NTFS. Is the free-space calculation also including the as-yet-unused space in the allocated clusters as well?
|
|
|
|