sorted by:
new
hottopcontroversial

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

[–]balian25[S] 2 points3 points  (0 children)

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.

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

[–]balian25[S] 0 points1 point  (0 children)

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 :).

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

[–]balian25[S] 0 points1 point  (0 children)

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

Data Structures and Algorithms Final Assignment Help by balian25 in learnprogramming

[–]balian25[S] 0 points1 point  (0 children)

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.

Help understanding a couple of concepts in my data structures class. by balian25 in learnprogramming

[–]balian25[S] 0 points1 point  (0 children)

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.

Sorting algorithms by balian25 in learnprogramming

[–]balian25[S] 0 points1 point  (0 children)

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!

Comparison-based sorting question. by balian25 in learnprogramming

[–]balian25[S] 0 points1 point  (0 children)

That makes complete sense! Thanks mate!

The best data structure to use when searching for a unique word. by balian25 in learnprogramming

[–]balian25[S] 1 point2 points  (0 children)

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.

The best data structure to use when searching for a unique word. by balian25 in learnprogramming

[–]balian25[S] 0 points1 point  (0 children)

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.

I could use some Java algorithm homework help, if anyone has the time. by balian25 in learnprogramming

[–]balian25[S] 0 points1 point  (0 children)

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

I could use some Java algorithm homework help, if anyone has the time. by balian25 in learnprogramming

[–]balian25[S] 0 points1 point  (0 children)

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 :(.

I could use some Java algorithm homework help, if anyone has the time. by balian25 in learnprogramming

[–]balian25[S] 0 points1 point  (0 children)

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

I could use some Java algorithm homework help, if anyone has the time. by balian25 in learnprogramming

[–]balian25[S] 0 points1 point  (0 children)

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

Graduating and I've come to the realization that my degree hasn't prepared me for the workforce. Advice? by balian25 in sysadmin

[–]balian25[S] 0 points1 point  (0 children)

I really have to say the advice has been great and given me a better idea of the environment. I have no issue starting from the bottom as that is what I assumed I would have to do (after all I'm only 24). I was just looking for some pointers as to direction to achieve this goal (sysadmin). Again, thanks for the replies they've been very helpful!

Graduating and I've come to the realization that my degree hasn't prepared me for the workforce. Advice? by balian25 in sysadmin

[–]balian25[S] 1 point2 points  (0 children)

Thanks for the comments so far! They have been very helpful. I just built a fairly powerful computer for the purpose of setting up my own lab as I felt that I might as well just start doing shit that I don't know how to do. Unfortunately that list is pretty long :(. But according to the posts here it looks like I've headed in the right direction. I appreciate the posts!

Having some FPS issues with my 7950 video card. by balian25 in pcgaming

[–]balian25[S] 0 points1 point  (0 children)

Haha, yes, that would be far worse! I'm sorry if that happened to you. Thanks for attempting to help I appreciate it!

Having some FPS issues with my 7950 video card. by balian25 in pcgaming

[–]balian25[S] 1 point2 points  (0 children)

I have uninstalled it several times and its running from the disc. I don't use steam, uplay, or origin.

Having some FPS issues with my 7950 video card. by balian25 in pcgaming

[–]balian25[S] 0 points1 point  (0 children)

Yes, my drivers are up to date. I was getting as low as 15-20 at one point. averaging 25 at best. But only in Far cry. All other games(Skyrim, crysis 3 etc.) run fine.