Study.com Data Structures and Algorithms

[armstrongsubero]

Its actually pretty straight forward, if you have any experience coding. I did both assignments and final exam in one evening...just put your mind to it.

Here's a tip. A bubble sort is of complexity O(n^2) what does it say about the number of loops?

I though that course was actually extremely easy for a data strucutres course, especially the final assignment, way too easy for a data structures course.

The material is actually more challenging than the assignment.

---

You can do it man! Dont give up. If I did it you surely can. Here's more hints, start by creating a two dimensional array of the US stated and capitals, create methods to print the two dimensional array and also to comprare elements in the two dimensional array for equality.

Initially order your array by states alphabetically, then in your bubble sort focus on sorting by capital and a little trick I used is to convert the user input to lower case before searching the array and having all the captials as lower case.

I basically spelled it out for you...lol, read the book 'Algorithms' by Robert Sedgewick, it was actually very insightful for the SDC course.

As for the computer architecture class I had a thread on it somewhere, building the 'Ben Eater CPU' video series helped a lot, maybe pick up basic VHDL or Verilog and the book 'digital electronics' by Anil Kumar Maini also helps a lot.

---

And also the language is irrevalent, focus on the problem at hand. Its not about 'coding' aka cutting and pasting code together. Its about algorithmic programming. Write out the algorithm on paper. Actually program and forget that 'coding' non-sense.

You can do it. Don't let this course come between you and your degree.