Discussion:
Questions
(too old to reply)
Woongbin Kang
2011-03-23 15:58:49 UTC
Permalink
Hello,

I have a few clarification questions about this assignment.

1. the ML part
- datatype node is ill-defined. Did you mean int instead of value
in "Node of value * node * node" ?
- function names bst-insert, bst-search are not valid ML identifiers.
Did you mean bst_insert and bst_search respectively?
- What is the return type of bst-search? Is it a boolean or node option?
Could you annotate the types for us?
2. Are the ML and Scheme code not tested automatically? How should we submit
them?
3. "How to submit Problem 2 in Assignment 4" article is actually identical
to "How to submit Problem 1 in Assignment 4". Could you please
specify the problem 2 again?

Thank you very much,
Woongbin
Bo Hu
2011-03-23 16:50:13 UTC
Permalink
Post by Woongbin Kang
Hello,
I have a few clarification questions about this assignment.
1. the ML part
- datatype node is ill-defined. Did you mean int instead of value
in "Node of value * node * node" ?
Others uploaded that file. I don't know. I guess so. Anyway, we will
only test integers.
Post by Woongbin Kang
- function names bst-insert, bst-search are not valid ML identifiers.
Did you mean bst_insert and bst_search respectively?
I guess so.
Post by Woongbin Kang
- What is the return type of bst-search? Is it a boolean or node option?
Could you annotate the types for us?
I don't know. I will ask others what it should return.
Post by Woongbin Kang
2. Are the ML and Scheme code not tested automatically? How should we
submit them?
marmoset currently only has C-compiler installed, that is why only the C
programming part is available to test right now. We don't have full
access to marmoset, so we are unable to install scheme and ML compiler
right now. I do not know when it would be fixed.

If it is fixed, then we will test on marmoset. If it is not fixed, then
we will test locally. In either case, we will test the program
automatically using script.
Post by Woongbin Kang
3. "How to submit Problem 2 in Assignment 4" article is actually identical
to "How to submit Problem 1 in Assignment 4". Could you please
specify the problem 2 again?
Do you mean the two posts in the newsgroup? No, they are different. Only
the first few paragraphs are same.
Post by Woongbin Kang
Thank you very much,
Woongbin
By the way, Is the deadline still 10:00am 25th March?
n3leung
2011-03-23 17:24:07 UTC
Permalink
The professor mentioned this morning that the assignment would be
extended until monday morning (Mar 28)
Joseph
2011-03-23 20:47:49 UTC
Permalink
Post by Bo Hu
Post by Woongbin Kang
2. Are the ML and Scheme code not tested automatically? How should we
submit them?
marmoset currently only has C-compiler installed, that is why only the C
programming part is available to test right now. We don't have full
access to marmoset, so we are unable to install scheme and ML compiler
right now. I do not know when it would be fixed.
If it is fixed, then we will test on marmoset. If it is not fixed, then
we will test locally. In either case, we will test the program
automatically using script.
If you plan to test ML and Scheme automatically, do we output it in the
same way we output the C program?

Cheers,
Joseph
Bo Hu
2011-03-23 21:12:50 UTC
Permalink
Post by Joseph
Post by Bo Hu
Post by Woongbin Kang
2. Are the ML and Scheme code not tested automatically? How should we
submit them?
marmoset currently only has C-compiler installed, that is why only the C
programming part is available to test right now. We don't have full
access to marmoset, so we are unable to install scheme and ML compiler
right now. I do not know when it would be fixed.
If it is fixed, then we will test on marmoset. If it is not fixed, then
we will test locally. In either case, we will test the program
automatically using script.
If you plan to test ML and Scheme automatically, do we output it in the
same way we output the C program?
Cheers,
Joseph
Similar to or the same as the C program.
Given a sequence of insert/search operations, for each search operation,
the program should print out the accessed node in order.
Kartikaya Gupta
2011-03-24 16:50:55 UTC
Permalink
Post by Bo Hu
Post by Woongbin Kang
Hello,
I have a few clarification questions about this assignment.
- What is the return type of bst-search? Is it a boolean or node option?
Could you annotate the types for us?
I don't know. I will ask others what it should return.
Do you have answer for this question yet? It greatly impacts the way we
can implement the solution. If we are expected to return a new tree with
the necessary value inserted then we can do it functionally otherwise we
cannot. Also, how will your test case create the tree? For question (2) if
we "extend" the datatypes provided for question (1) without a clear
specification then you will not be able to create the trees, and there is
no function we are required to implement that creates the tree for you.

Is it just me, or is this one of the most poorly specified assignments
ever? I've already had to rewrite mine twice as the specifications keep
changing on us.

Cheer,
kats
Bo Hu
2011-03-24 18:32:00 UTC
Permalink
On Wed, 23 Mar 2011 12:50:13 -0400, Bo Hu
Post by Bo Hu
Post by Woongbin Kang
Hello,
I have a few clarification questions about this assignment.
- What is the return type of bst-search? Is it a boolean or node option?
Could you annotate the types for us?
I don't know. I will ask others what it should return.
Do you have answer for this question yet? It greatly impacts the way we
can implement the solution. If we are expected to return a new tree with
the necessary value inserted then we can do it functionally otherwise we
cannot. Also, how will your test case create the tree? For question (2)
if we "extend" the datatypes provided for question (1) without a clear
specification then you will not be able to create the trees, and there
is no function we are required to implement that creates the tree for you.
Is it just me, or is this one of the most poorly specified assignments
ever? I've already had to rewrite mine twice as the specifications keep
changing on us.
Cheer,
kats
I just get the answer. That interface is a reference. Its just means
that you should have a structure for node, a function which implements
inserting, a function which implements searching. The return type can be
whatever you want.
This is also the most poorly specified assignments ever met by me.
shradfor
2011-03-25 13:04:59 UTC
Permalink
Post by Bo Hu
On Wed, 23 Mar 2011 12:50:13 -0400, Bo Hu
Post by Bo Hu
Post by Woongbin Kang
Hello,
I have a few clarification questions about this assignment.
- What is the return type of bst-search? Is it a boolean or node option?
Could you annotate the types for us?
I don't know. I will ask others what it should return.
Do you have answer for this question yet? It greatly impacts the way we
can implement the solution. If we are expected to return a new tree with
the necessary value inserted then we can do it functionally otherwise we
cannot. Also, how will your test case create the tree? For question (2)
if we "extend" the datatypes provided for question (1) without a clear
specification then you will not be able to create the trees, and there
is no function we are required to implement that creates the tree for you.
Is it just me, or is this one of the most poorly specified assignments
ever? I've already had to rewrite mine twice as the specifications keep
changing on us.
Cheer,
kats
I just get the answer. That interface is a reference. Its just means
that you should have a structure for node, a function which implements
inserting, a function which implements searching. The return type can be
whatever you want.
This is also the most poorly specified assignments ever met by me.
I agree, this assignment has been done very poorly. Bo Hu is the only
person who's actually communicating with us.

I didn't even know whether to write in OCaml or SML, I picked OCaml, so
now I have to rewrite :P :(

Loading...