LeeLee

Are there any base-building games along the lines of "State of Decay" or "Dead State" where there's some action (so it's not a Sims type of game), but there aren't any zombies/horror elements? PC games only, please!

I'm trying to figure out the floating point representation for 213 and 2^(-130)...

Now, I think I have it for 213:

0 10000110 10101010000000000000000

But I'm not sure how to find it for 2^(-130), although I'm sure it will be obvious once I see it.

I'm working on the classic knight's tour (open solution) game, and I've gotten my program to solve for the tour. The tour is stored as an int[], in (row1, col1, row2, col2, ...) format -- each row,col pair associates to a move by the knight.

However, I need to have a

public String printTour(int startRow, int startCol)

method.

The test method is

public final void testPrintTour5b() {

final int dimension = 5;

Tour t = createTour();

t.setDimension(dimension);

String result = t.printTour(0, 1);

// perform a trivial test if a string output has been computed

// empty string signals that there is no solution

assertTrue("".equalsIgnoreCase(result));

// allow for a visual inspection of layout

// System.out.println("Computed result for a 5 x 5 matrix "

// +"and initial position (0,0)");

// System.out.println(result);

}

Nothing I do seems to pass this test...(it fails when it gets to the String result = ... section).

Even if I just have the print method return a, when I've set String a ="abc"

So what should I be doing to have an appropriate string return at the end of the printTour() method?

The string should be "" if the tour does not exist.

Given the following abstract syntax:

Expr = Value | Binary | Unary

Value = Integer intValue

Binary = Operator op; Expr term1, term2

Unary = UnaryOp op; Expr term

Assuming the usual precedence and associativty, draw abstract syntax trees for:

1) 5 + 4 + 3 * 2

2) 5 * 4 + 3 + 2

I know an abstract syntax tree looks something like:

............................+

.........................../..\

..........................-....3

........................./..\

........................6..7

But I don't get how to find it in these cases...like, how do I know which branches are higher/lower on the tree?

Any help?

I'm trying to find out how far back a hospital would have to be able to produce audits of activity in patient records, per HIPAA (ie, the number of years). This isn't the same thing as producing an accounting of disclosures, which is what I originially thought.

It would be really helpful if you could also include the section number from HIPAA/HITECH for this rule.

Thanks!

I'm studying for my DS final, and one of the notes I wrote to myself in class said to "Know the 4 ways of proving that the cardinality of P(S) with |S|=n is equal to 2^n."

The problem is that that's just something the professor hinted that we might want to know, not something that our notes or textbook discusses, and I can't seem to find the 4 proofs online.

Anyone know how to prove this in 4 different ways? Or even just 1 or 2?

Hi all,

I'm writing a program that will translate Morse code into text by using a binary tree (as opposed to a look-up table). The first part of that obviously entails that the program create the binary tree. So I've written this chunk of code (see below), but it's not building the tree properly. The final output after a run an in-order traversal (just as a check) looks like this:

S

V

I

U

E

None

T

So clearly some things are missing. I'm not sure if they're just not getting linked properly, or if they're getting lost somehow, and running the program step by step didn't reveal the mistake.

Can anyone take a look and tell me if they see where I've screwed up and/or give me a hint on how to fix it? I've over-commented so that you can see what I've done more clearly (hopefully).

(Yahoo doesn't seem to like spaces at the start of a line, so 1 / means indented once, 2 // means twice, etc.

class MorseCodeTree:

/ def __init__(self):

// self._root = _Node(None) # root has to be None in final tree

// alphabet = (('A', '.-'),('B', '-...'),('C', '-.-.'),('D', '-..'),('E', '.')\

,('F', '..-.'),('G', '--.'),('H', '....'),('I', '..'),\

('J', '.---'),('K', '-.-'),('L', '.-..'),('M','--'),('N','-.'),\

('O','---'),('P','.--.'),('Q','--.-'),('R','.-.'),('S','...'),\

('T','-'),('U','..-'),('V','...-'),('W','.--'),('X','-..-'),\

('Y','-.--'),('Z','--..'),('.','.-.-.-'),("'",".----."))

// for letter in alphabet:

/// self._insert(letter, self._root)

/ # Add one letter to the appropriate place in the binary tree.

/ def _insert(self, data, root):

// letter = data[0]

// morse = data[1]

// # If passing through an empty node, set it's data value to None

// # so that you don't loose the link

// try:

/// root.data

// except AttributeError:

/// root = _Node(None)

// if morse[0] == '.' :

/// if len(morse) == 1: #You're at the end of the code, so there's the letter.

//// root.left = _Node(letter)

/// else:

//// self._insert((letter, morse[1:]), root.left) #Recursive function.

// else: # morse[0] == '-'

/// if len(morse) == 1: #You're at the end of the code, so there's the letter.

//// root.right = _Node(letter)

/// else:

//// self._insert((letter, morse[1:]), root.right) #Recursive function.

// # REMOVE IN FINAL VERSION. Checking that the tree has been built properly.

// self._inorderTrav(self._root)

// print('--------------')

/ # REMOVE IN FINAL VERSION. Prints each node in order to see if the tree is built properly.

/ def _inorderTrav(self, subtree):

// if subtree is not None:

/// self._inorderTrav(subtree.left)

/// print(subtree.data)

/// self._inorderTrav(subtree.right)

# Storage class for constructing nodes.

class _Node:

/def __init__(self, data):

// self.left = None

// self.right = None

// self.data = data

Assume n = 4^k (i.e., k = log_4 n) for some k. Solve the following recurrence relation by iteration.

f(n) = {1 if n =1

{3f(n/4) + n if n >= 2

(log_4 n = log base 4 of n)

Any help? I'm not at all sure how to do this...

The algorithm is:

sum = 0

for i = 0 to n-1

for j = 0 to i

for k = 1 to (n/(2^j))

sum ++

So I know I need to do a nested summation (using the 'for' loops), but I have no idea how to do that because of that bottom loop.

Any help?

f(n) = (n^1.5) * log^2 (n), where log is in base 2.

g(n) = n^2

Which is faster asymptotically?

Is it faster for small n?

Find the minimum problem size n needed so that the fastest asymptotic algorithm becomes faster than the other.

I'm pretty sure that g(n) has a faster growth rate, but i don't know how that relates to the rest of it.

Any help or advice? I've been pouring through my textbook and my notes and the rest of the internet, but I guess I have some kind of mental block :/

Can anyone help with this?

I need to find n, if:

n! <= 3600* (10^8)

(where n! = n factorial, and <= is 'less than or equal to.')

Thanks!

We're doing a student play in class, and my character has a panic attack at one point. When I have real panic attacks, I'm very contained and keep my freaking out inward--like, there might be tears, but it's not terribly dramatic. At rehearsal, though, I was told to make it more "expressive" and to do it like a "real person having a panic attack would," which is what I thought I was doing, but okay...I can get why in theater we would want to be more dramatic / obvious about it.

But since I've apparently been having panic attacks wrong all these years (*eye roll*), can someone tell me what a "proper" panic attack looks like? As in, not how it feels inwardly, but how it would look externally.

Thanks for any help!

What would the decimal value of 10111101 be if the bit pattern were interpreted as a two's complement number?

It's either -189 or -67, I think, but I don't know which one...

For as long as I can remember, every time I stand up after lying down, my vision gets a little gray and I feel like passing out (but I rarely do). This past year, my doctor said that that was caused by orthostatic hypotension. But lately I've gotten some more symptoms (within the past month or so) and it's getting to be nearly constant...but I can't afford to go to the doctor just to get told it's the same thing (no, there's not a free clinic nearby), and I can't find anything about these symptoms being related to hypotension.

Basically, when I stand up now, my vision grays out just like before but now my fingers get "tingly" (like my hand is falling asleep, but only in my fingers not the palm or wrist), and my legs feel *really* heavy. They aren't exactly numb because I can feel them and they support my weight just fine, it just gets hard to actually move them so I can walk. And if I don't walk through the dizziness, i will pass out, so this is a problem for me.

Those feelings only last as long as the dizziness (maybe 30 seconds)which makes me think it *is* to do with my low blood pressure, but it just seems weird that after years of one specific symptom I'd suddenly get a couple new ones.

I'm not on any medication, don't do drugs or drink, not pregnant, and have no family history of this that I know of...my grandfather had MS, but after getting told by a friend to check it out, I don't think the symptoms match. I'm a 19yr old girl, healthy weight, etc.

Anyone have any ideas about what could be up with this? Does it sound like a new aspect of hypotension, or is it more probably something else?

Thanks guys.

I know you use quantitative genetics when the relationship between genotype and phenotype is complicated to find the mean and variation of quantitative characteristics in population; it explains how much phenotypic variation can be explained by genetics.

And I know you use population genetics when the relationship between phenotype and genotype is straightforward; can use it to see how selection acts in a situation with two alleles and one has selective advantage with random mating.

But I need to be able to describe a (basic) experimental design for both of them, and I have absolutely no idea...if anyone could help, that would be incredible!

The equation reads

E = (RT/zF) * ln([x]2/[x]1) = (58/z) + log([x]2/[x]1)

and I know how to get all the variables except for z. Is it just the charge of the ion? So, like, if i were working with K+, would I just plug in +1?

What are some of the more controversial claims (specifics) made by Richard Dawkins in his book the Selfish Gene?

In The Problems of Philosophy, Russell talks about the Self and the not-Self. I'm not sure what, exactly, he means by "not-self." Does he mean everything that's not part of the person, or something less obvious?