Profile cover photo
Profile photo
Hamid Sheikh
About
Hamid's posts

Post has attachment
Week 12
I know I don't have a post for week 11, but I pretty much did week 10 and 11 in a single post. This was the last week of class of CSC148 and pretty much an entrance into the summer of 2014. Learned some new tricks while learned to use old tricks better this...

Post has attachment
Awesome and very informative post for those who had trouble understanding the tour problem in assignment 1, which is including me!

Post has attachment
Week 10
This week we learned about sorting algorithms. There are a lot of sorting algorithms out there and we learned a few of them like bubble sort, quick sort, merge sort and insertion sort. My favourite one is Bubble sort because it sounds like I'm saying "Bulba...

Post has attachment

Post has attachment
I had a heck of a time figuring out part B of E3. I actually prefer using Stacks instead of recursive code (except in some rare cases) because they are so simple but they can be used in so many ways with Linked Lists and BSTs.

Post has attachment

Post has attachment
Week 9
This week we learned about complexity. We were introduced to Big-Oh notation which help us understand the efficiency of our code based on many how steps the code takes. The lecture started with working on creating a program that finds all of the words that ...

Post has attachment
Week 8
Binary Search Trees was the topic of week 8. BSTs are like an extended version of a basic binary tree, except you've got your insert() and find() method as well some specially designed classes called nodes with their own unique methods as well. Nodes are th...

Post has attachment
Week 7
This week we learned about Linked Lists. A Linked List is kind of like a list of lists, except in a Linked List, you've got the item (can be any object) and the next item (can be None or another Linked List). This week's lab was learning to re-create Queue ...

Post has attachment
Week 6
This week we learned about Binary Trees and just Trees in general. Even though this data structure is called a Tree, it has nothing to do with a real tree, except some of its characteristics that match a real tree. Of course, you don't need to know about a ...
Wait while more posts are being loaded