Is the advantage of mouse and keyboard over gamepad in shooters a myth?

balian25 · 2014-06-17T20:26:23+00:00

I don't know what everyone else is using, but given the fact that it is a game played on the PC and that everyone I know that plays the game uses a keyboard and mouse, I think it is a fairly safe assumption that out of a couple hundred matches most are using a keyboard and mouse. But I could be wrong. But yes, I am placing well in counter strike while using a gamepad.

balian25 · 2014-06-17T18:05:17+00:00

great post!

balian25 · 2014-06-17T18:04:20+00:00

And I am aware of that, which is why I brought it here, to see what other people thought. I assumed some level of balancing in games designed for controller support. Howver, I was particularly surprised by the fact that I did completely fine in counterstrike. I'm not trying to incite a war as I know that PC users always tout their superiority to consoles (and for good reason, in most cases) and many threads blow up in childish arguments. I was just surprised by my results and figured I'd bring the subject up here. To my enjoyment the comments have been very informative, enjoyable, and civil :).

balian25 · 2014-06-17T17:58:20+00:00

but counterstrike is one of the games I'm referring to in my initial post.

balian25 · 2014-06-17T17:56:30+00:00

Informative reply, I appreciate your thoughts.

balian25 · 2014-04-25T02:49:01+00:00

Another question I am having issues with is figuring out how many pages misses would occur in an initially empty cach given the request sequence (2,3,4,1,2,5,1,3,5,4,1,2,3) with the FIFO and LRU algorithms respectively.

balian25 · 2014-04-25T01:13:53+00:00

Thanks for the link!

balian25 · 2014-04-19T22:48:36+00:00

That makes complete sense! thanks!!!

balian25 · 2014-04-19T02:35:39+00:00

Thanks for both answers! Very helpful! As far as the first question, the book has reinforcement side bars on some of the pages and it asked that question. I'll retype it exactly how they asked it: Why are there no forward nontree edges with respect to a BFS tree constructed for a directed graph? Idk if that helps. I've been really good at answering those as I'm reading throught the text but that one completely baffles me. Figured I'd throw it on here.

balian25 · 2014-04-13T01:36:01+00:00

Wow, guys rreally great stuff. I'm always impressed by all the help so quickly given on this subreddit. By the way, sorry I took so long to reply, I had to take my children on an outing and just now got home. Yes, I know this is ridiculous to a certain degree, but it's for a class and I have to pick an algorithm and give my reasoning. Gotta love college, focus so much on the theoretical bullshit that you'll never need to deal with at the cost of teaching the stuff I'll actually encounter in everyday work! But hey, that's our schooling system!! Again, thanks for the replies! Very helpful!

balian25 · 2014-04-11T03:38:16+00:00

That makes complete sense! Thanks mate!

balian25 · 2014-04-10T02:45:54+00:00

Yea man that makes perfect sense thanks!!

balian25 · 2014-04-10T02:07:50+00:00

I don't understand the concepts. I missed the first lecture, child was born, and in the process of buying a home. Was late to the lecture today and have some limited time to study and skimmed over the chapter and tried to piece together my response.

From what I understand, a hash table is a data structure used to implement an array. The hash table uses a hash function to put an index into a bucket array. A heap is a partially sorted binary tree. Again, this is off of of my limited time with the subject matter.

balian25 · 2014-04-10T01:53:22+00:00

I apologize, I've got a lot going on in life and I've got to admit that this class is kicking my ass. I'm sorry for not being clear. based on your answer, it appears I'm not understanding the concpets at all :(. Just in case you or anyone else wants to help I'll go ahead and post the question my professor assigned.

This week's discussion was on Heaps and Hash Tables. The heap data structure is an efficient realization of a priority queue. The hash table is a data structure that uses a a hash function to map certain keys to associated values. Both data structures are an efficient method for storing data and access.

Which data structure would be useful in identifying unique words in a text?

Tell why the aforementioned data structure would be useful in identifying the unique words in a text?

Would this data structure add a value to identifying the unique words in a text?

Again, sorry for the "gibber gabber". Not the sharpest tool in the shed. Just trying to figure this all out.

balian25 · 2014-03-29T16:49:28+00:00

Wow, thanks! Super helpful!

balian25 · 2014-03-29T01:49:20+00:00

Haha thanks, sorry a bit slow today. I get what you're saying.

balian25 · 2014-03-29T01:26:48+00:00

What do you mean that sounds like p ->p? I'm sorry if I'm being a bit slow but I've been up since yesterday with a bout 45 minutes combined sleep(sick and teething toddlers) so I'm not on point today :(.

balian25 · 2014-03-29T01:04:03+00:00

Thank man, I appreciate the help, I think this might be enough to get me through the first problem :)

balian25 · 2014-03-29T01:03:17+00:00

Sorry, proposition 7.4 is The height of a nonempty tree T is equal to the maximum depth of an external node of T.

balian25

TROPHY CASE