(Software Coli) How was your Algorithms class? .....going back after sitting out Covid.

[videogamestashbox.com]

Currently enrolled in...

• Senior design project
• Probability & statistics for engineers I
• Intro to Algorithms
• Software Process

Depending on how intensive the Senior design project is I might cut one of these other classes loose.
The good thing about the math classes are that I can find lectures & books online and learn the class material prior to the first day.

Software classes typically have a project attached that I wouldn't know the details of prior to it being given.







EDIT:
I'd rather be taking "software quality assurance" right now instead of "Senior design project".
I wanted to take "Software Process" and "software quality assurance" at the same time because they are both linked in terms of the creation of efficient software instead of just "hacking out code" that simply works.
Hell, come to think of it "Intro to Algorithms" sits along side those other two classes as well in terms of the topic of software efficiency.

 

[Renkz]

Algorithms are not bad at all as long as you put in in the time learning heap sort, quick sort, mergesort link list, big o notation, and knowing how to implement, YouTube guides were a big help.

 

[Neo. The Only. The One.]

subbing

 

[videogamestashbox.com]

Algorithms are not bad at all as long as you put in in the time learning heap sort, quick sort, mergesort link list, big o notation, and knowing how to implement, YouTube guides were a big help.

I remember some of that from prior classes.
Big o notation - software construction (C++) class was ran by a grad student who had us writing pseudo code with big o notation for all class projects. We didn't have to make the code efficient, only be aware of it's current state of efficiency.
[X]sort - Database (Java) class went over various types of sorts.




I'm using these Coursera classes to knockout the course material before hand so it'll all be review when I get to class in the spring.

Algorithms:
Coursera | Online Courses & Credentials From Top Educators. Join for Free | Coursera
Coursera | Online Courses & Credentials From Top Educators. Join for Free | Coursera
Coursera | Online Courses & Credentials From Top Educators. Join for Free | Coursera

Probability & Statistics 1:
Coursera | Online Courses & Credentials From Top Educators. Join for Free | Coursera










Hopefully a "Software quality assurance" seat opens up so I can drop this "Senior design project" class I don't want to take just yet.

 

[Secure Da Bag]

Hopefully a "Software quality assurance" seat opens up so I can drop this "Senior design project" class I don't want to take just yet.

That answers that question. I hope you can drop that project class too.

 

[videogamestashbox.com]

That answers that question. I hope you can drop that project class too.

Answers what question bruh bruh?
I assume the "Senior design project" is more or less a rehash of our "Software modeling and design" class in some form.
I.E. we use our combined "tool kit"/"knowledgebase" to Design & Develop software in a group setting of 2 to 6 students.








Completing the Senior design project wouldn't be the big issue ...I just still have nightmares of the time investment I put in as "Software modeling and design" project leader/manager.
I don't want to do anywhere near all that after being out of University for over a year. I'd also like some extra "tools" from Algorithms, Software Process, and Software quality assurance to play with also.

 

[Mr. Togo]

Not hard until I got to Dynamic Programming and Greedy Algorithms

 

[videogamestashbox.com]

Not hard until I got to Dynamic Programming and Greedy Algorithms

Greedy Algorithms sounds vaguely familiar ...like something from our database class.
Dynamic Programming ...IDK WTF that is

 

[Mr. Togo]

Greedy Algorithms sounds vaguely familiar ...like something from our database class.
Dynamic Programming ...IDK WTF that is

A greedy algorithm is an algorithm that makes the best choice at a particular step hence it being greedy, it might not give you the best answer but a good approximation near the best answer.

Dijkstra's algorithm for finding shortest paths in a graph is greedy.

Dynamic Programming is a bit more complicated in short it's used where you have a problem that when broken down is a smaller version of the original problem, what Dynamic Programming does is breaks the problem down, keeps solutions to all the smaller problems through something called memoization and forms the optimal solution to the original problem using those small solutions.

You can get better performance through DP instead of brute force with such things as Matrix Multiplication /w multiple matrices

 

[Obreh Winfrey]

Failed the first time because I wasn't a fan of evening classes, eventually stopped showing up. Ended up with a C the second time. My biggest problem was wrapping my head around the visualizations. I couldn't figure that out and apply it to the code. On top of that, the pseudocode we got was kinda shyt too. I recommend giving that class full attention because you need that knowledge to get hired.

 

[Black Nate Grey]

Is it algorithms as in programming with data structures? Shouldn't be too, too bad. Tons online resources for that

If it's one where you have to do proofs. fukk me, I did not enjoy that course.

 

[Serious]

@Secure Da Bag