Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    Assignmentcs 3

    Uploaded by

    Anonymous BOreSF
    This document contains instructions for an assignment on polynomial expressions and binary trees. Students are asked to: 1) Rewrite two polynomials in ordered form. 2) Represent the terms of one polynomial stored in an ordered linear array. 3) Draw a binary tree corresponding to an algebraic expression. 4) Find the scope of the exponential operator in the expression and the preorder traversal of the corresponding binary tree. 5) Find a prefix Polish expression equivalent to the given expression.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Assignmentcs 3

    Uploaded by

    Anonymous BOreSF
    3 views1 page
    This document contains instructions for an assignment on polynomial expressions and binary trees. Students are asked to: 1) Rewrite two polynomials in ordered form. 2) Represent the terms of one polynomial stored in an ordered linear array. 3) Draw a binary tree corresponding to an algebraic expression. 4) Find the scope of the exponential operator in the expression and the preorder traversal of the corresponding binary tree. 5) Find a prefix Polish expression equivalent to the given expression.

    Original Description:

    ASSIGNMENTCS-3.doc

    Original Title

    ASSIGNMENTCS-3.doc

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains instructions for an assignment on polynomial expressions and binary trees. Students are asked to: 1) Rewrite two polynomials in ordered form. 2) Represent the terms of one polynomial stored in an ordered linear array. 3) Draw a binary tree corresponding to an algebraic expression. 4) Find the scope of the exponential operator in the expression and the preorder traversal of the corresponding binary tree. 5) Find a prefix Polish expression equivalent to the given expression.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    3 views1 page

    Assignmentcs 3

    Uploaded by

    Anonymous BOreSF
    This document contains instructions for an assignment on polynomial expressions and binary trees. Students are asked to: 1) Rewrite two polynomials in ordered form. 2) Represent the terms of one polynomial stored in an ordered linear array. 3) Draw a binary tree corresponding to an algebraic expression. 4) Find the scope of the exponential operator in the expression and the preorder traversal of the corresponding binary tree. 5) Find a prefix Polish expression equivalent to the given expression.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    of 1

    JAGANNATH GUPTA INSTITUTE OF ENGINEERING & TECHNOLOGY, SITAPURA JAIPUR B.Tech. III Semester Sessi ! " #$%%"#$%# Br&!

    !ch '" C m()ter Scie!ce B*IT S)+,ect '" -&t& Str)ct)re &!. A/0 rithms F&c)/t1 '" She2h&r Ch&!.er

    ASSIGN3ENT III
    4%Fi!. the ( /1! mi&/s POLY% &!. POLY# st re. i! 5i0)re #.%.

    Figure 2.1 4#C !si.er & ( /1! mi&/ ( 67,1,89 i! :&ri&+/es 7,1 &!. 8. U!/ess ther;ise st&te., the terms i! ( 67,1,89 ;i// +e r.er. /e7ic 0r&(hic&//1. Th&t is 5irst ;e r.er the terms &cc r.i!0 t .ecre&ssi!0 .e0rees i! 7< th se ;ith the s&me .e0ree i! 7 ;e r.er &cc r.i!0 t .ecre&ssi!0 .e0rees i! 1< th se ;ith the s&me .e0rees i! 7 &!. 1 ;e r.er &cc r.i!0 t .ecre&si!0 .e0rees i! 8 .S)(( se (67,1,89 = >7#1#8 " ?18> @ A7A18 @ #71B8 " C7#1A " D71B8A 6&9 Re;rite the ( /1! mi&/ s th&t the terms &re r.ere.. 6+9 S)(( se the terms &re st re. i! the r.er sh ;! i! the (r +/em st&teme!t i! the /i!e&r &rr&1s COEF, EEEP, YEEP &!. FEEP, ;ith the HEA- ! .e 5irst. Assi0! :&/)es t LING s th&t the /i!2e. /ist c !t&i!s the r.ere. seH)e!ce 5 terms. 4AA Bi!&r1 tree T h&s I ! .es. The i! r.er &!. (rec r.er tr&:ers&/s 5 T 1ie/. the 5 // ;i!0 seH)e!ces 5 ! .es ' I! r.er ' E A C G F H - B G Pre r.er ' F A E G C - H G B -r&; the tree T. 4DC !si.er the &/0e+r&ic e7(ressi ! E = 6#7@196C&"+9A 6&9 -r&; the tree T ;hich c rres( !.s t the e7(ressi ! E. 6+9 Fi!. the sc (e 5 the e7( !e!ti&/ (er&t r < i.e., 5i!. the s)+tree r te. &t the e7( !e!ti&/ (er&t r. 6c9 Fi!. the (re5i7 P /ish e7(ressi ! P ;hich is eH)i:&/e!t t E, &!. 5i!. the (re r.er 5 T.

    You might also like