Showing results 1 to 8 of 8
Search took 0.01 seconds.
Posts Made By: Gotcha
Forum: Computer Science and Software Design Oct 26th, 2005
Replies: 4
Views: 1,606
Posted By Gotcha
Forum: Computer Science and Software Design Oct 26th, 2005
Replies: 4
Views: 1,606
Posted By Gotcha
Help Is it posible to write an algorithm using VB:

If someone could help me doing a code in VB to do the following:

The output should be a list of all posible ways in which (m) different Males
and (f) different female could be line up if no two...
Forum: Computer Science and Software Design Oct 20th, 2005
Replies: 1
Views: 1,684
Posted By Gotcha
Help help finding a recurrent relation, Discrete Math

Hello,

anyone knows how to solve this.

this is what i have to find:

find a recurrent relation, its initial conditions and explain as it obtained this relation

A carpenter needs to cover n ...
Forum: Computer Science and Software Design Oct 20th, 2005
Replies: 1
Views: 1,216
Posted By Gotcha
Help Help solving the explicit solution for the following recursive expression:

Hello,

here i need to find the explicit solution for the following recursive expression: (Thanks for any suggestions)


A diagonal in a polygon it is a line of a vertex to another vertex that is...
Forum: Computer Science and Software Design Oct 19th, 2005
Replies: 2
Views: 1,310
Posted By Gotcha
Help doubt finding the recurrent relation

Does anyone knows how to solve this?

Thanks for suggestions.


Find a recurrent relation, its initial conditions and explain how is obtained this relation.



A Driver pays in a station of toll...
Forum: Computer Science and Software Design Sep 8th, 2005
Replies: 4
Views: 2,272
Posted By Gotcha
Help Need help finding the Big Oh.

Instructions:

Find the Big Oh for the times of excecution of X: = x + 1. You should justify the answer:


I : = N
WHILE I >= 1 DO
BEGIN
FOR J : = 1 TO N DO
X : = X + 1
Forum: Computer Science and Software Design Sep 8th, 2005
Replies: 2
Views: 2,342
Posted By Gotcha
Help Finding the Big Oh for these Math.functions

I would like to know if anyone could teach me how to solve this type of Mathematical functions: Finding the Big Oh for the following two.
Thanks for any suggestions.



f(n) = 2 + 4 + 8 + . . . +...
Forum: Computer Science and Software Design Sep 8th, 2005
Replies: 57
Views: 69,167
Posted By Gotcha
Help Re: Time complexity of algorithm

Verifying if anyone could give me a hand solving this excersices:

Instructions:
Find the Big Oh for the times which is excecuted x : = x + 1. You should justify your answer:

I : = N
WHILE ...
Showing results 1 to 8 of 8

 
Forums | Blogs | Tutorials | Code Snippets | Whitepapers | RSS Feeds | Advertising
All times are GMT -4. The time now is 1:02 am.
Newsletter Archive - Sitemap - Privacy Statement - Acceptable Use Policy - Contact Us
Forum system based on vBulletin Copyright ©2000 - 2008, Jelsoft Enterprises Ltd.
©2003 - 2008 DaniWeb® LLC