AuburnMathTutor

[QUOTE=satish06;1287587]i am doing mca .i want develop a application software in programming language using java. and iam not getting ideas.so plse give me some title related to project.[/QUOTE] Yeah, not a CS question. What Daniweb needs is a "Software Development" subforum entitled "Poorly-written pleas by lazy unimaginative students looking for …

[quote] My question is: does the diff function above always return 0 for every floating value of x on any computer, and is there something in the implementation of the builtin round function which guarantees stability for int(round(x)) ? This does not seem to be documented in the official doc. …

Pointers are used for exactly what you say: referring to something (data) by its location rather than by the name you choose to call it. It's a subtle difference but an important one. There are lots of ways to use this one simple principle to accomplish lots of powerful things …

[code] #include <iostream> using namespace std; int main(int argc, char* argv[]) { char Ans; cout << "Keep Going? "; cin >> Ans; if(Ans=='y' || Ans=='y') main(argc, argv); } [/code] An idea, anyway. Otherwise, a do-while will work fine. [code] #include <iostream> using namespace std; int main(int argc, char* argv[]) { …

IQ tests probably contain very good examples of questions which could be used to assess the potential of a programmer. What kinds of questions you include and which you discard will be an interesting decision, but a few come to mind... All blargs are toogs, and some toogs are larts, …

Jeez this is pretty weak. If you can't come up with your own completely arbitrary name for a system, how in the world can you hope to make such a system, or have any original idea ever? I don't know. AutoSchool, RoboSchool, SchoolTool, SchoolSystemDeluxe, E-SchoolMonitor, AClockworkSchool, MS Office School 2010, …

[quote] Concurrency Deadlock functional programming cloud computing parallel computing distributed computing p vs np problem algorithm design communication protocols recursion. [/quote] For my money, the following are the more promising ideas. [quote] Concurrency cloud computing parallel computing distributed computing communication protocols [/quote] The others are too vague, beaten to death, …

Perhaps a fully-automated comprehensive Computer Science tutor program? Program in all the ABET subjects and a few programming languages with practice tests, quizzes, vocabulary, etc. Make it extensible too so people can add on new features (flashcards, networked tests/quizzes, etc.) and information (maybe computer security, or real-time systems). You could …

A pretty sweet method is the Master Method (or the Master Theorem). Given a recurrence relation in a particular common form, it can often tell you immediately what the time complexity will be. Otherwise, the general method to prove a time complexity from a recurrence is going to be to …

... I'll give it a shot, but I'm no expert at scripting language lambda expressions. Lambda expressions are simply a way of defining a function without assigning a name to the function. They're sort of like function literals, in the same sense "cat" is a string literal and animalName might …

These are to be construed as hints; you must still show the work involved in actually solving the problem. [quote] 1) Show that the set of regular languages is closed under reversal. That is,if L is the regular, then so is { x R :x € L} where x R …

^ Ninja'd me.

[quote] I thought C/C++ would offer a few benifits beyond pure assembler. Apparently I was wrong. [/quote] Languages that don't have this behavior make a great many common programming tasks harder, not easier.

One particularly neat solution is to put the code in a function... [code] def getYN(prompt='> ', errormsg='This option is not available.'): result = raw_input(prompt) if result == 'y' or result == 'n': return result else: print errormsg return getYN(prompt, errormsg) [/code] This has the added benefit of crashing the program …

^ Good point. An alternative: can you find where to insert elements of the small list inside the big list in less than O(n)? (HINT: The big list is sorted.)

There is a balance between making programming languages look like natural languages and having them be as unambiguous as possible. A lot of Lewis Carrol's work should make it obvious that slight differences in English syntax can lead to quite different semantics. In fact English is not as forgiving as …

Sure. You know the definition of an NFA, correct? You will need a structure that corresponds as closely as possible to this. In particular, you're going to need the concepts of: - NFA - State - Transition - Symbol Java's OOP framework will make it easy to define each of …

Depends on your interests, but here are some ideas. Make up an interesting theoretical problem and try to solve it, giving any results you find. This is easier than you'd think. Here's a link to a problem I came up with, and you're free to use it provided (a) you …

^ Rephrasing part of what he said, if you can make algorithm X run faster in VB by making some change to X producing X', odds are - if you changed something fundamental - X' will run faster than X in other languages, too.

This is not a CS question, right?

Well in my methodology sections I usually explain the approach (i.e. how I decided to do it before I did it and why) as well as the experimentation (i.e. how I actually did it after I decided how I was going to do it). You want people in theory at …

^ That's actually a very well presented description.

Pseudocode is just free-form language that you use in a precise way to mimic some conventional programming language. Generally the only requirement is that it should be clear what you intend to do, all your symbols should be defined, and you shouldn't do anything "magical" (like have a line that …

c3: will do (j+1) assignments (i) times. Therefore you only need to solve the double summation (sum of i from 1 to n of (sum of j from 1 to i of ((j+1)i)). c4: will do j additions by two and j assignments. Therefore you only need to solve the …

There are different degrees of portability. Probably the best you can hope for in terms of portability is a language that either runs on a virtual machine (then your code is as portable as there are virtual machines for different computers) or in an interpreter (ditto, for interpreters) and even …

Well, at some point you're going to need to do the following... - define syntax - define semantics - write a formal grammar - write a compiler/interpreter Also, if you want your language to actually be used, - port to a variety of popular systems - have a genuinely good …

Well, technically, that code is Big-Oh of N^2 since T(N) is certainly bounded by some quadratic. Of course, if M is less than a linear function of N (i.e. it is constant or polylogarithmic) then the bound will simply be the simplest form of O(MN) upon replacing M with its …

Looks good to me.

The latter analysis is correct; work from the inside out. The summation for k will not contain k in any of its summands, so it is easy to reduce. Ditto for the summation in j; the closed form of that summation will include only i and whatever you're using for …

^ Right you are, invisal. The big-Oh time complexity of (1) is in fact O(n). It would be O(nlogn) if it were the following: [code] m := n while n > 0 do L(m); n := n / 2 [/code] And the answers for (2) and (3) are right on …