F# Full Stack Developer
Budget: $750 – $1,500 USD
Hello. Dear experts I am looking for some one worked already with F# programming. I will ignore generic proposals.
Integrate both integer vertex and rational vertex in a single implementation.( the difference is
only integer and double, hence we have to change into single implementation if the
implementation is same for both types) Please change the ‘equation’ to ‘polynomial’ in random
generator function ( its confusing as its not an equation technically)
Hash table: every BMD node should be stored only once. At some point of time, we have to
create a new node. Node is having a root node labelled with a variable, left and right sub trees.
Therefore we have a triple (variable, left tree and right tree). We should have a dictionary that
map triples (variable, left and right tree) to the node that is already there.So, when we want to
generate a new node, we have to check if its already there, if yes, return it else create a new
node and put it in dictionary. The dictionary shouldn’t map strings of vertices. It should map the
triples to the vertices. After these changes, we need to convert those polynomials into BMD and
BDD (Generating graphs)
For BDD: For polynomials, we just have to do with the addition and multiplication in terms of
binary numbers as boolean functions.There is already such a function in the code here that
does it for constants, we need to have other one that does addition and multiplication on bit
vectors. We have to initialize the BDD package with the given ordering and then call the BDD
functions(Apply, exists, constraints, reduce, ….) and convert the polynomials into the BDD
graphs.
Size of Variable orderings:
For verifying the size of the variable orderings, we have to check how many nodes it creates in
both BDD and BMD’s, For that, we should write a function to count the number of nodes for both
BDD nodes and BMD nodes and put it in a table
Please bid to my project.
Thanks
Integrate both integer vertex and rational vertex in a single implementation.( the difference is
only integer and double, hence we have to change into single implementation if the
implementation is same for both types) Please change the ‘equation’ to ‘polynomial’ in random
generator function ( its confusing as its not an equation technically)
Hash table: every BMD node should be stored only once. At some point of time, we have to
create a new node. Node is having a root node labelled with a variable, left and right sub trees.
Therefore we have a triple (variable, left tree and right tree). We should have a dictionary that
map triples (variable, left and right tree) to the node that is already there.So, when we want to
generate a new node, we have to check if its already there, if yes, return it else create a new
node and put it in dictionary. The dictionary shouldn’t map strings of vertices. It should map the
triples to the vertices. After these changes, we need to convert those polynomials into BMD and
BDD (Generating graphs)
For BDD: For polynomials, we just have to do with the addition and multiplication in terms of
binary numbers as boolean functions.There is already such a function in the code here that
does it for constants, we need to have other one that does addition and multiplication on bit
vectors. We have to initialize the BDD package with the given ordering and then call the BDD
functions(Apply, exists, constraints, reduce, ….) and convert the polynomials into the BDD
graphs.
Size of Variable orderings:
For verifying the size of the variable orderings, we have to check how many nodes it creates in
both BDD and BMD’s, For that, we should write a function to count the number of nodes for both
BDD nodes and BMD nodes and put it in a table
Please bid to my project.
Thanks