Programming Brush Up

[TheMissxu]

Hey guys,

 

I'm going to take a proficiency exam in 5 weeks, what resources can I use to practice and brush up on topics like

• algorithmic analysis of iterative and recursive functions
• conceptual and programming details of quicksort, mergesort and selection sort. Including worst and best case running times and space requirements
• recursive programming problems based on linked-lists, trees and mazes
• performing a mergesort or quicksort partition on a given integer data array
• and general object orientated programming.

I've taken courses about these topics in the past, but it's been a while. There are sample tests available, so I will, of course, take advantage of those. Additionally, there are lecture notes for this specific course. But I'm still wondering if there are any outside tools I can use.

 

Anyone have an idea of what I might need?

[MrBucket101]

@TheMissxu

 

Here's some old tests of mine. I took a class on Data Structures, and another on Algorithms. Looks like you're taking a class on both of them at the same time? The wiki pages for the respective sorting algorithms were a huge help to me. https://en.wikipedia.org/wiki/Sorting_algorithm

 

https://www.dropbox.com/s/ra2g0ul69ahwpnp/Algorithms_and_Data_Structures.rar?dl=0

 

The final.pdf, is what I submitted, I never got back my grade on the final, but I got an A in the class.

 

archive password is "linustechtips"

[madknight3]

I've taken courses about these topics in the past, but it's been a while.

 

Didn't keep your textbooks?

[TheMissxu]

Didn't keep your textbooks?

I did. I suppose I could do some practice problems from there as well. It also has better explanation for said problems compared to the lecture notes.