Hi guys, I'm reading Algorithms by Robert Sedgewick (especially Analysis of algorithms chapter) and trying to understand how all this mathematical stuff applicable to analysis but cannot due to shortages of mathematical knowledge. Maybe you have some references with more details about how logarithm works and why they fit for showing complexity of algorithms and other related stuff to the analysis of algorithms.
I am really struggling in this class. I can understand ths concepts such as shortest path, mst, topological sorting...etc but when a question is asked I have no idea how to do it.
For example I was given the classic class prerequisite problem during an exam but I just could not see that the solution invovles a topological sort.
Any advice and are there problem sets that I can use just to solidify my understanding of the concepts? My prof doesnt really.give a lot of practice material, just gives lectures.
Hi CS majors,
I have a bachelors in Mechanical Engineering but trying to get into the Comp Sci Masters program. I just took Prob & Stats I , Discrete Structures I, and Comp I this Fall. For this Spring I had a couple professors recommend I take "Intro to Operating Systems" and "Analysis of Algorithms" this Spring so I can apply to the Masters program ASAP.
I know both of these are typically ranked as some of the most difficult CS classes and wanted to get an idea of what knowledge I might be missing without the pre-reqs. Are there any online or campus resources I can use to help me start preparing over Winter break? Realistically are either of these possible for someone without the needed pre-reqs or are those more of just a formality for the Undergrad students?
Thanks in advance for any advice!
In general, is it possible to look up video lectures for prerequisites of a course on canvas?
Last Spring, Design & Analysis of Algorithms was offered both as a CSCI-6020 as well as CSCI-4020.
Now, is it now only being offered as CSCI-4020?
Is that true, or am I missing something? And if it's true, why did that happen?
Hello, I experimented with different deep learning architectures with different word embeddings for text classification. From the results, how a good error analysis can be done. What does it mean? Can you anyone suggest some papers related to error analysis of the machine learning models or give some idea of how to explain? I am new to machine learning please help me.
I'm interested in learning Algorithms but slightly confused with this newer course available on Coursera at: Analysis of Algorithms (https://www.coursera.org/learn/analysis-of-algorithms/home/info)
I see that the courses most popular for learning algorithms via MOOCs are the Princeton Algorithms 1 and the Standford Analysis of Algorithms. Both seem to be highly regarded.
With that said, what's this new course about? Is it a pre-requisite to either of these courses, is it meant to be a similar offering as the Stanford course?
Hello CS folks,
I recently graduated from college with a degree in CS. I am currently looking for jobs, and I found one that interests me. It is a Front End Designer position, and one of the requirements for applying is to submit my college transcript. I feel a little reluctant on applying for this job because I know my GPA is not the greatest. I graduated with a cumulative 3.12, and I have three D's. One D was in Biology and the other two were in Data Structures and Algorithm Design and Analysis. I don't have a great excuse as to why my grades were poor. The only excuse I will admit to is to not being a great student. I would like some insight and feedback on how I can move forward with my life and not let my grades impact my career.
Is there anyone that has been in a similar situation? How did you practice overcoming this fear of unemployment and self-doubt?
Hey VT Reddit,
I am looking to taking a CS 41x4 theory class next semester and I was wondering which one is the most manageable to take considering I am also taking Systems and Comp Lang as well. Thanks!
Idk what it is called exactly but you measure how long a code takes to complete using an equation......n....n^2 .......... log n.....etc
The thing is.....none of it clicks...I tried everything and am trying to look up info on it as we speak but honestly was hoping you guys could help me understand what helped you guys make it click as well.
Its really late and I just wanna get this over with already and not have horrible explanations of it done. Like I have been getting everywhere i go
Can someone recommend which professor's course to take
- Ramaswamy Chandrasekaran
- Benjamin Raichel
- Sergey Bereg
- Dung Huynh
Thank you!
Hello, can anyone please give me any resources to the above question? I have been searching in every article but found none.
I get that Empirical analysis is analysis based on results where as Theoretical analysis is based on the theoretical outcome. How would for example a theoretical analysis be more advantageous over an empirical analysis and vice versa. Sorry for the really weird question but I wasn't sure how to ask it properly.
I work for a well-known cryptocurrency data provider. Liquidity if fragmented and still at an overall low level in cryptocurrency markets. We are interested in learning more about the fields of transaction cost analysis and how large market participants utilize trading algorithms for the purposes of minimizing price impact and optimizing for trade execution. Are there any canonical resources?
