Welcome, Guest
You have to register before you can post on our site.



Search Forums

(Advanced Search)

Forum Statistics
» Members: 150
» Latest member: Spooky Boogie
» Forum threads: 112
» Forum posts: 361

Full Statistics

Online Users
There are currently 10 online users.
» 2 Member(s) | 8 Guest(s)
fplux, sammaryland

Latest Threads
log log n Interpretation
Forum: Exam 1
Last Post: sammaryland
1 hour ago
» Replies: 1
» Views: 7
MRT Question
Forum: Exam 1
Last Post: sammaryland
9 hours ago
» Replies: 2
» Views: 37
freeing strings and token...
Forum: Project 1
Last Post: NiceHam
Yesterday, 03:57 PM
» Replies: 2
» Views: 107
Review Session
Forum: Study Groups
Last Post: kamadson
Yesterday, 03:19 AM
» Replies: 0
» Views: 12
Tokens or quoted strings
Forum: Project 1
Last Post: sbcarp
02-17-2018, 05:26 PM
» Replies: 2
» Views: 83
Forum: Project 1
Last Post: chibbluffy
02-17-2018, 05:50 AM
» Replies: 2
» Views: 103
What was it I said I woul...
Forum: Miscellany
Last Post: sammaryland
02-16-2018, 08:07 PM
» Replies: 1
» Views: 46
Is root node a leaf node?
Forum: Project 1
Last Post: lusth
02-16-2018, 03:36 PM
» Replies: 2
» Views: 109
Max or min heap
Forum: Project 1
Last Post: chibbluffy
02-16-2018, 08:01 AM
» Replies: 1
» Views: 121
Heap test
Forum: Project 1
Last Post: chibbluffy
02-16-2018, 03:50 AM
» Replies: 4
» Views: 144

  insertHEAP and extractHEAP
Posted by: grayson - 02-09-2018, 03:11 AM - Forum: Project 1 - Replies (5)

What kinds of properties are our heaps supposed to maintain? The logarithmic runtime extractHEAP function is supposed to rebuild the heap somehow, but assuming buildHEAP runs in linear time, it must do this without calling buildHEAP. In this case, what kind of ordering is expected? Is the heap supposed to be rebuilt maintaining the order of insertion? Since insertHEAP doesn't do any fixing up on insert according to the spec, there are no guaranteed properties (like min or max) about our heap other than its completeness. I'm not understanding from where extractHEAP's logarithmic runtime arises.

Print this item

  Websites to checkout
Posted by: ccatwater - 02-08-2018, 06:29 PM - Forum: Self Balancing Search Trees - No Replies

Here are a few good videos I found on self balancing trees:

Rotations and Red black trees, provides really good and quick summary of the basics - https://www.youtube.com/watch?v=95s3ndZRGbk

Short video on rbt insertion rules - https://www.youtube.com/watch?v=tJ7niBAhDQI

Avl trees - https://www.youtube.com/watch?v=5C8bLQBjcDI

Also this site is a great interactive tool for almost every data structure in 201- https://www.cs.usfca.edu/~galles/visuali...ithms.html

Print this item

Posted by: sammaryland - 02-08-2018, 04:28 PM - Forum: Project 1 - Replies (3)

For the displayHEAPdebug function, the spec says to call the display debug method of the underlying data structure, but without a parameter of a file pointer, should we just pass stdout to displayBSTdebug?

Print this item

  Recursive implementations?
Posted by: magarwal - 02-08-2018, 05:51 AM - Forum: Project 1 - Replies (1)

After looking at the project spec, it is my understanding that the insert, find, delete and display functions are not to be implemented recursively because they don't have a BSTNODE *root parameter. Am I correctly understanding this?

I'm just confused about the entire BST spec because the BSTNODE and BST are separate entities here, and there appear to be no subtrees. Shouldn't every node be its own subtree? Huh

Print this item

  Makefile problems when uploading to server
Posted by: mcoram - 02-08-2018, 03:48 AM - Forum: Project 0 - Replies (2)

After submitting to the Dropbox, I get the following errors with my makefile. I'm confused (especially with the response "no makefile found") because everything in my makefile works fine in my terminal window.

Running your tests
make: *** No rule to make target 'clean'.  Stop.
make: *** No targets specified and no makefile found.  Stop.
You are alloted 10 seconds for testing
make: *** No rule to make target 'test'.  Stop.

Print this item

  Resubmission #2
Posted by: sammaryland - 02-08-2018, 02:55 AM - Forum: Project 0 - Replies (1)

When will resubmission 2 be graded?

Print this item

  Notes from class
Posted by: meganw - 02-08-2018, 12:04 AM - Forum: Notes - No Replies

Here is a google drive folder of my notes. Please let me know if I should update anything or have copied something down incorrectly. 


Print this item

  Valgrind on Cygwin
Posted by: Nathaniel Wade - 02-07-2018, 08:32 PM - Forum: Project 0 - Replies (1)

How do I install Valgrind on Cygwin? I'm running Windows 10.

Print this item

  Notes on Google Drive
Posted by: hajames - 02-07-2018, 05:01 PM - Forum: Notes - No Replies

The notes I take during class are all in this folder: Notes Folder (or https://drive.google.com/open?id=1Lx_Af9...AcRwgwCR6n)

They aren't guaranteed to include everything that is mentioned in class (some things are easier to handwrite than type), but if you miss class they should help you get caught up.

Good luck!

**UPDATE: In order to access you must be logged into a crimson.ua.edu email address. If I know you (or your non-crimson email) then I can grant you access, but I've had some spam addresses already attempt to get in so I can't approve anyone I don't know. Thanks!

Print this item

  Swapper/Comparer Functions
Posted by: cranderson2 - 02-07-2018, 05:10 AM - Forum: Project 1 - Replies (2)

I'm a little confused by the spec. In swapToLeafBST it says that the BST's swapper function will be called to do the actual swapping. But in the first page of the spec, it says that we will pass NULL to the comparator and the swapper function. How will we do the comparisons (for functions like insert) and swaps then? I may just be misunderstanding the spec. 

Can you give us an example of a swapper method? the Integer Module has a compare function that I have been using for comparisons of the values, but there is no swapper method to base it on. For now, I wrote my own and added it to the Integer module. 


Print this item