This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.
Messages - Happybobjr
16
« on: January 26, 2015, 03:51:58 am »
Thank you. I think I slightly understand. Shouldn't there be factorial in there?
So I need to use a PDF function?
What does M stand for? Exponential?
17
« on: January 26, 2015, 03:43:47 am »
Could you tell me how to do it both ways then?
thank you, and sorry for the trouble.
18
« on: January 26, 2015, 03:27:31 am »
I don't really understand these, nor how to utilize google for help so if any of you have an idea where to start, I would appreciate it  Q1. If an array holding a queue is not considered circular, then each remove operation must shift down every remaining element of a queue. An alternative method is to postpone shifting until rear equals the last index of the array. When that situation occurs and an attempt is made to insert an element into the queue, the entire queue is shifted down, so that the first element of the queue is in position 0 of the array. What are the advantages of this method over performing a shift at each remove operation? What are the disadvantages? Q2. Given that jobs are serviced at a rate of 30 jobs per hour, determine the arrival rate in jobs per hour which will achieve the expected queue length to be 9.
Q3. Jobs arrive at the rate of 20 jobs per minute, and each job requires 2 seconds of service time, on the average. Determine the average waiting time in the queue. What is the probability that at a given time the system is not empty?
Q 4. Given that on the average 2 customers can be serviced per minute, determine the average arrival rate of the customers that achieves the average waiting time in the system (including the service time) to be 5 minutes per customer.
19
« on: January 11, 2015, 10:09:29 pm »
I think I recall a thread like this a couple years ago? Or de ja vu
20
« on: January 01, 2015, 06:54:35 pm »
To get the courage to break up with my gf Sabrina, I really want to upgrade to a colored model.
21
« on: December 10, 2014, 11:19:38 pm »
Mine is Walrein. I want to go with the flow and be popular with all the walrus stuff, but I also want to stand out and be a rebel 
22
« on: December 10, 2014, 11:18:37 pm »
Well said, (Street)Walrus
23
« on: December 08, 2014, 06:45:24 pm »
I was so scared  . You owe me for the emotional trauma you put me through.
24
« on: December 01, 2014, 05:18:48 am »
Wat is going on :O
25
« on: November 24, 2014, 03:47:03 am »
Ya! Feel free to send suggestions. (we get half a point extra cred for corrections etc ) Remember this is class specific though, so a suggestion, rather than correction, may not be applicable.
26
« on: November 24, 2014, 02:58:52 am »
Hey guys, my professor wrote his own textbook for C and I find it very good for beginning/intermediate C programmers. Some chapters are lacking, but it does an extremely good job compared to other books I've seen. https://drive.google.com/file/d/0B9EzLx4Z9geMWEZMdUNrZDhzck0On Page 437, it talks about Huffman Compression, and i thought it was cool and applicable
27
« on: November 21, 2014, 09:50:50 pm »
I don't know a ton but I will do my best.
asm (assembly): basically, the absolutely lowest level programming you can get (other than stabbing it with a needle). Because of this, it isn't exactly 'user friendly'. However, with the costs come great benefits. Assembly can be used for just about anything, limited to the power of the hardware and your imagination. This will be the absolutely fastest for a program to run. (Compiled)
Ti-Basic: Pretty much molded on the BASIC language. There are high limitations including major loss of speed. Best for math, and games made from it are hackish in general. (run-time)
Ion: Not quite sure. Pretty sure it is just an extra library for you to use (compiled)
Axe: Extremely fast and user friendly language. It is only one level higher than asm, so there is little loss in speed if any. Axe is mainly only for games, BUT you can include asm code inside it, so you can use it to structure your asm. (compiled)
28
« on: November 20, 2014, 05:06:01 am »
I could be wrong, but you might be able to do something similar to axe and do:
function name(input)
input
!if -1 then
code
else!if -1 then
code
else!if -1 then
code
...
end
end
29
« on: November 19, 2014, 01:32:58 am »
I'm back to this project.
I'm currently taking a c programming class, and I realized I could make some serious optimizations to this program. Now it is (in the long run) much smaller in size. Additionally, any lag from rotation is pretty much undetectable.
Thinking about adding some low AI monsters
30
« on: November 10, 2014, 10:57:23 pm »
7025: After over a year, unable to resist coming back (and reading all these new signs i'm addicted)
|
Show Posts