Why do entry level jobs demand 3-4 years of experience ? Ask Programming |
- Why do entry level jobs demand 3-4 years of experience ?
- Is there a more optimized way to represent (bin & 0xF0F0F0) | (bin & 0xF0F0F0) >> 4? ...Or, alternatively, a question about manipulating pixel colors.
- What resources are available to learn network protocol programming?
- optimal shapes in container tool?
- Does anyone want to start a business for some experience?
- Javascript library for creating physics simulations
- Self-Signed code signing certificate vs standard one issued by CA? (Not an EV)
- Sample Question Semaphore
- Slow transfer speeds on project files
- What implementations are there for the subset sum problem?
- pls explain 4th line of this simple python code
| Why do entry level jobs demand 3-4 years of experience ? Posted: 30 Oct 2021 11:44 AM PDT About to graduate next year with a CS Degree and almost all entry level jobs on every possible platform i could find (like linkedin , angellist , indeed etc) demand 3-4 years of experience while paying the shittiest of salaries they possibly could . Any advice on where to look for a mern stack developer job that doesn't demands experience from a fresher rather focuses on projects and skills to hire people ? [link] [comments]  |
| Posted: 30 Oct 2021 02:04 PM PDT Hi, I don't ever do bitwise math, so I don't know whether they can be optimized like if statements or not. I was trying to figure out how take a series of bytes and make the first byte and every second byte after it be copied one space forward. like 0x1A2B3C should become 0x112233, and 0xA2B74E should become 0xAABB44. I was in reality trying to come up with the fastest way to approximately convert an RGB from representing a 8bits per channel to 4bits per channel just by having each color have it's 2nd byte become it's first byte, so if there's a really fast way to do that, that would also be cool. From looking up shaders for the problem people seem to do vector math instead, is that really faster than bitwise math? [link] [comments]  |
| What resources are available to learn network protocol programming? Posted: 30 Oct 2021 07:54 AM PDT I have about 10 years experience in ISP configuring and operating network gear. Recently in the past 5 I've focused heavily on API's, some data science, and network automation. My days mostly consist of maintaining and adding features to medium sized Python projects (1-10k loc) running in Kubernetes. What I'm really interested in what it takes to program the actual services for various protocols on the network devices I work with - things like BGP, OSPF, PIM, MPLS, etc. I'd like to branch out and learn other languages that are required to build these things, I just don't know what makes the most sense. I cannot seem to find what resources people study to learn this. There's not really a book titled "write an implementation of the OSPF protocol in C", for example. So my question is what books, languages, and areas of study are required to get a job working in this area? What's my path if I want to pursue learning this? [link] [comments]  |
| optimal shapes in container tool? Posted: 30 Oct 2021 04:47 PM PDT Hi all, Theres a game I play where you unlock 5x5 spaces and then put buildings of different sizes in them. Could be 2x1 or 1x2 or 4x4 etc. etc. I want to be able to plug in the number of buildings for each size, give it a layout and have it find the most efficient use of that space. ie. the least amount of unused space. This feels like an AI learning tool rather than some basic programming thing. I don't know AI/machine learning though. Anyone know of a resource to help get this done? I can picture what needs to happen, but have no idea how to accomplish it and no idea where to start. Thank you for any thoughts you may have. [link] [comments]  |
| Does anyone want to start a business for some experience? Posted: 30 Oct 2021 05:43 PM PDT I'm a 3rd year in Uni. and all of the internships I've seen are requiring previous experience, so I'm deciding to start my own business.
I'm not sure what kind of service to provide but i am leaning towards websites, webapps or games made with Unity.
Obously you're not going to be paid by hours and just by a split of whatever the clients pays and its going to be pretty dry at first but i'm only in it for the exprience.
So if you are intrested and know how to do any of the things i've mentiond hit my dm's with your github and if I like what I see i'll let you know. I'm not looking for big projects or anything, I just want to see you know how to code so school projects are perfectly fine! [link] [comments]  |
| Javascript library for creating physics simulations Posted: 30 Oct 2021 03:52 PM PDT Hello. I'm planning on working on a project over winter break and would like to know what the best Javascript library would be for creating a website which does physics-type simulations. I'm probably going to start with electricity & magnetism (circuits, fields, etc). Thanks a bunch. [link] [comments]  |
| Self-Signed code signing certificate vs standard one issued by CA? (Not an EV) Posted: 30 Oct 2021 01:52 PM PDT So I've decided I don't want to go through the hassle of getting an extended verification code signing certificate. Instead, I've been self-signing my programs. As far as Microsoft's Smartscreen reputation goes, does it build reputation the same / similarly whether you have a certificate you generated yourself, vs one you get issued by a CA (a standard certificate, not an EV)?
From my understanding, unless it's an EV, a standard code signing certificate even from a trusted CA still will produce a warning on Windows until it gets reputation. Therefore, is there any reason to pay the cash to get one issued from a CA instead of making one myself? Especially considering most CAs only offer certificates up to about 3 years. My understanding is after it expires, you have to start your reputation over again. But if you make your own certificate, you can have it expire whenever you want, not after 3 years. So if they work the same that would be a huge advantage. [link] [comments]  |
| Posted: 30 Oct 2021 10:00 AM PDT Assume that the global variable, var, is initialized to 2; that the binary semaphore, guard_sem, is initialized to 1, and that we have two threads, both running the following code: Is it true to say that once the two threads have ended, var will always have the value 0? Moreover, would this also be true if we removed the semaphore from the code? Motivate your answers. My incomplete answer: A semaphore initialized with 1 is used to protect shared memory is a mutex semaphore. "wait(guard_sem)" will decrement guard_sem by 1. If the value of a semaphore is currently 0, then "wait(guard_sem)" operation will block until the value becomes greater than zero. So yes I would that once the two threads have ended, var will always have the value 0. I don't think this would always be true if we removed the semaphores. What could happen I am unsure about. Anyone got anything to add? [link] [comments]  |
| Slow transfer speeds on project files Posted: 30 Oct 2021 12:30 AM PDT When I try to delete coding projects or transfer them to an external drive, the process is far more slow than with any other type of files. Right now I'm transferring 7 GB of project files at an average speed of 50 to 200 KB/s, with an estimated of 4 hours. But if I transfer movie or music files, 7 GB would take a few minutes. Is there something about React/Java/Python projects that causes this? Most of them are just websites and web apps. I'm not sure what other details about my computer or the projects in question could help clarify things, so let me know what you would need to know to help me answer my question. Windows 10 Intel(R) Core(TM) i7-8550U CPU @ 1.80GHz 1.99 GHz 20.0 GB RAM Acer Aspire A515-51G [link] [comments]  |
| What implementations are there for the subset sum problem? Posted: 30 Oct 2021 07:57 AM PDT I have N integers in the range -X < N_i < X. I want generate all subsets that add to some value M (with -X < M < X). E.g. The subset sum problem is NP-hard: naive solutions are impractical. O(2^ N/4) solutions exist, and you can get additional speed-ups for small X. https://github.com/parthnan/SubsetSum-BacktrackAlgorithm Asking another way, how do I modify the above code to work for negative numbers? For background, I work in financial audit where you can solve the problem by emailing your client to ask what their accountants did. However the exchange will look something like: 'Hi is this £20 PPE or Inventory?' 'We disclose our inventory balance in £'000, I'm not checking. Why do you care?' 'I'm trying to tie your ledger to your accounts and without knowing this, the problem is not just NP-hard, it's also poorly-defined' 'What is an NP-hard please?' Therefore when N and X are small it's nice to be able to do it yourself. Typically 6 < N < 400 and £100,000.00 < X < £100,000,000.00. [link] [comments]  |
| pls explain 4th line of this simple python code Posted: 29 Oct 2021 10:20 PM PDT
[link] [comments]  |
| You are subscribed to email updates from AskProgramming. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States | |
No comments:
Post a Comment