I studied scheme at university for a semester and I don't remember much besides lots and lots of brackets. Most of the problems I had with it all boiled down to the fact that I had unbalanced...

1/2 is 0 remainder 1 because you have 0 whole divisions into 2. You are correct in saying that it is 0.5, but when doing a conversion between bases we deal only in whole numbers.

There are a few different types of SQL, but http://www.w3schools.com/sql/default.asp is a good site for general SQL knowledge. http://www.sql.org/sql-database/sql-tutorial/ is a good beginner's...

Read up on arctan. It might give you a few ideas...

Hi Patrick,

Unfortunately it is not as simple as that. Different languages are better at different tasks. Most are designed to perform specific tasks at first and grow from there. Really what you...

So how would you go about creating the messenger and its authorisation system? I think that's all you need to do, 50 pages would include diagrams (UML for example) I would suggest...



Cheats...

Hi martyulrich and welcome to DaniWeb,

Do you know what is meant by theta notation? If you show us that you understand the top-level theory we might be inclined to help you with the specifics...

The most basic program requires some form of planning, even if it is just a few notes on some scrap paper. It is always a good habit to plan, you will make fewer mistakes and write more manageable...

Hi Steph,

The Oracle forum can be found here:
http://www.daniweb.com/forums/forum129.html

The people that frequent that forum might not necessarily come to the CS one, so might be worthwhile...

Hi zoroman,

Sorry but we aren't allowed to just do your homework for you. Perhaps you could show us what you've tried or discuss how you think the problem should be tackled. We would love to help,...

I'm sorry sbv but I don't understand your question. Are you asking how to determine the score as a percentage if you have an average mark for someone?

I would suggest using Java since your main concern seems to be portability. Java is a cross-platform object oriented language and provides several API's for GUI development. The swing package in...

Hi naiad08 and welcome to Daniweb,

We have some pretty strict rules here in that we can't just do the work for you, we need to see some effort and then we can guide you. What have you done so far?...

Actually I am trying to help you discover the answer without just giving it to you.



This question was a bit misleading sorry.

What I meant was, how does the "j *= 5" part of the loop...

Ah yes you are correct. The loop is not linear.

Actually I think that loop is linear, so it should be O(n).

How do you think the "j *= 5" part of the for loop affects the number of operations performed as the input size (n) gets very large?

Hi there aishaahmad and welcome to Daniweb,

Sorry but we aren't allowed to just do your homework for you. Do you know what is meant by O(N) and why that loop is O(N)? Do you understand what the...

Ah ok, now I see your confusion...

If I have a variable called kev that is a type BankAccount and I write kev.debit(), the program looks in the class BankAccount for the debit() function to run....

Hi gauravdott and welcome to DaniWeb,

For number 1, I would use the mathematical proof by iteration - ie prove the statement true for n=2 then assume true for n=k and prove true for n=k+1.
...

Hi chapelhoffer and welcome to DaniWeb,

This question should probably go in the C++ forum, but now that we are here I will try to help you out.

Let's take for example your member function...

http://en.wikipedia.org/wiki/Red_black_tree describes the difference in fairly good detail. The main difference between the two is in the worst case, where a BST can be as bad as O(n) for insertion,...

The print function is O(n), so you were right the first time. Although n changes each call to print, it is still O(n) since each time print is called it takes roughly n steps to compute.

I'm not...

for (int i=0; i<n; i++)


int i=0;
(while i<n)


These two pieces of code are equivalent loops. But the while loop needs n steps to execute because the initialisation of i occurs outside the...

Hi there fm_hyudin and welcome to Daniweb,

We are not allowed to help you until you show us that you have made an effort to answer the question yourself. What have you done so far?

Hi there santhi1986 and welcome to Daniweb :)

We have a few rules here at Daniweb that you might want to read. Probably the most important one is that we can't do your homework for you, we need to...

Certainly maths knowledge is an advantage (particularly algebra) and physics can be helpful (although I never studied physics after year 10 at school). There are actually a few philosophy subjects at...

Hey there kafil03,

Sorry but that's against the DaniWeb rules. We can only show you the door; it is up to you to step through it. That is, try doing some yourself and if you come across some...

Hi bramu and welcome to Daniweb.

What DVD Burner do you have? What blank DVD's are you using? What software are you using? What errors do you get when you try to burn?

I agree with jbennet but would like to add that perhaps your best bet would be to contact the GIMP community administrators and just double check with them. They may have specific requirements that...

Hi tomthehun,

Welcome to daniweb. I don't mean to be rude, but this thread was last used over 4 years ago, so I am not sure that you will get an answer to your question. Please check the date of...

Hi Ginwah,

Sorry but you have to do a little better than that. Do you know what CPI is?

Hi anshads,

Just a word of warning - it is very dangerous to post your personal phone number, address, passport number, credit card number or PIN number on a forum. You can send a private message...

Hi xraaz,

What are your thoughts on how to proceed? Please show that you have at least thought about the solution and maybe we can see where you are headed and help you along the way...

a -> 1 step
For i = 1 to n -> takes n steps -> n+1 steps so far -> the 1 is negligible as n gets big so approx n steps so far
For j = 1 to i -> takes i steps for each n -> i*n so far -> approx n*n...