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

Username
  

Password
  





Search Forums

(Advanced Search)

Forum Statistics
» Members: 160
» Latest member: zezima
» Forum threads: 439
» Forum posts: 1,391

Full Statistics

Online Users
There are currently 6 online users.
» 1 Member(s) | 5 Guest(s)
dzung

Latest Threads
Will the vertex not be a ...
Forum: Project 3
Last Post: ACCD
7 hours ago
» Replies: 0
» Views: 12
Accessing Test Cases
Forum: Project 2
Last Post: rshowe
Yesterday, 08:03 AM
» Replies: 0
» Views: 13
Minimum Depth Test #2
Forum: Project 2
Last Post: rshowe
Yesterday, 08:01 AM
» Replies: 0
» Views: 15
Method to get last submis...
Forum: Project 2
Last Post: rcfrederick
11-23-2017, 07:52 PM
» Replies: 1
» Views: 26
A lot of new test cases
Forum: Project 3
Last Post: rcfrederick
11-23-2017, 07:50 PM
» Replies: 0
» Views: 26
Test files
Forum: Project 2
Last Post: ianbway
11-23-2017, 04:48 AM
» Replies: 5
» Views: 252
Finishing extremely effic...
Forum: Project 2
Last Post: stvnengineer
11-20-2017, 03:30 PM
» Replies: 4
» Views: 139
Exam Date/Time
Forum: Final Exam
Last Post: ianbway
11-19-2017, 08:00 PM
» Replies: 1
» Views: 57
Some large input test cas...
Forum: Project 3
Last Post: ZachWassynger
11-18-2017, 09:59 PM
» Replies: 3
» Views: 121
Inconsistencies between t...
Forum: Project 3
Last Post: radagast
11-18-2017, 09:22 PM
» Replies: 1
» Views: 66

 
  return type of displaySET
Posted by: kjbrawner - 11-16-2017, 01:34 AM - Forum: Project 3 - Replies (1)

Should we be returning an integer here, or should it be a void return?

Print this item

  test 48 #words was wrong
Posted by: ACCD - 11-15-2017, 11:33 PM - Forum: Project 2 - Replies (7)

His output:
Words/Phrases: 702138
Nodes: 25098

My output:
Words/Phrases: 701856
Nodes: 25089

Really don't know how to debug this one, don't know what kind of situation I didn't get the Words. Also I assume "" will not be inserted right?

Print this item

  Final Google Doc
Posted by: ianbway - 11-15-2017, 05:25 PM - Forum: Final Exam - No Replies

Reposting link to the google doc for the final:

https://docs.google.com/document/d/1dJt6...sp=sharing

Print this item

  where to define the swapper function
Posted by: Enigmatic - 11-14-2017, 10:33 PM - Forum: Project 2 - Replies (1)

I'm having trouble figuring out where to define the rbt swapper function. Do I define it in trees.c, or rbt.c? Either way I'm not sure how to pass it as a parameter when creating a green tree or a red-black tree.

Print this item

  Tests 24/25 Discrepancy
Posted by: njvanhaute - 11-14-2017, 10:18 PM - Forum: Project 2 - Replies (2)

Tests 24/25 involve reading in a corpus and then displaying the resulting search tree and its statistics report to the screen. The final lines of the corpus are as follows:
[Image: bdSv8Fd.png]

My implementation of assign2 ignores the 3 occurences of '1234' and reads in 'hello' and 'world' separately, since they are not enclosed in double quotes. However, the expected output for tests 24/25 shows 'hello world' being stored in one node in the tree:
[Image: Tm7Amkt.png]

As a result, my node count and my words/phrases count are both one greater than those of the expected output. Am I missing something or is the expected output incorrect?

Print this item

  Comparing edges
Posted by: Logand064 - 11-14-2017, 10:14 PM - Forum: Project 3 - Replies (1)

Is this the appropriate logic to compare two edges?

compare Edge(a,b)
    If weights a.weight != b.weight return a.weight - b.weight
    Else
        if a.small != b.small return a.small - b.small
        else return a.large - b.large

Print this item

  Using GTVALUE, RBTVALUE
Posted by: ianbway - 11-14-2017, 09:48 PM - Forum: Project 2 - Replies (2)

Can I pass a GTVALUE or RBTVALUE type as the second parameter of findBST? Or do I reference the value within the struct?

Print this item

  "Predecessor" and "Successor"
Posted by: jaw653 - 11-14-2017, 09:34 AM - Forum: Project 2 - Replies (7)

To be clear, my understanding of a true in-order predecessor is the largest node smaller than the node which it proceeds. For instance, it is the node one to the left of x, then as far right as you can go.

But for this project, we are defining predecessor on a node-by-node basis, correct? An example would be starting at node x which has two children. You "move" left. Your new x (the left node of the former x) has only a left node. My understanding is that for this project, the predecessor is that left node (ie the node->left->left of the original x node).

Is my understanding correct?

Print this item

  Time complexity of double queue display function
Posted by: jaw653 - 11-14-2017, 06:53 AM - Forum: Project 2 - Replies (1)

I'm currently using a single queue implementation for displayBST, and it's working great, except for one very weird edge case. Would it be alright in terms of time complexity to use the double queue implementation? Or would this take too long?

Print this item

  When is Last project Due date?
Posted by: ACCD - 11-14-2017, 01:23 AM - Forum: Project 2 - Replies (2)

When is Last project first submission Due date?

Print this item