Scribd Logo
Upload

Welcome to Scribd!

  • College of Engineering Roorkee (COER) Tutorial Sheet-2:, Uttarakhand

    Uploaded by

    Charmi Jobanputra
    4 views1 page
    This document contains a tutorial sheet for the subject "Data Structures Using C++" with 6 questions: 1. Convert two expressions to Reverse Polish Notation. 2. Show the steps of the Tower of Hanoi problem for n=5. 3. Explain Abstract Data Types in terms of Object Oriented Programming. 4. Calculate L(25) using a recursive function definition for L(n). 5. Calculate three values for the recursive function S(R,P). 6. Find the location of 14 in a sorted array using Binary Search, showing each iteration.

    Original Description:

    tutorial 2

    Original Title

    Tutorial 2

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains a tutorial sheet for the subject "Data Structures Using C++" with 6 questions: 1. Convert two expressions to Reverse Polish Notation. 2. Show the steps of the Tower of Hanoi problem for n=5. 3. Explain Abstract Data Types in terms of Object Oriented Programming. 4. Calculate L(25) using a recursive function definition for L(n). 5. Calculate three values for the recursive function S(R,P). 6. Find the location of 14 in a sorted array using Binary Search, showing each iteration.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    4 views1 page

    College of Engineering Roorkee (COER) Tutorial Sheet-2:, Uttarakhand

    Uploaded by

    Charmi Jobanputra
    This document contains a tutorial sheet for the subject "Data Structures Using C++" with 6 questions: 1. Convert two expressions to Reverse Polish Notation. 2. Show the steps of the Tower of Hanoi problem for n=5. 3. Explain Abstract Data Types in terms of Object Oriented Programming. 4. Calculate L(25) using a recursive function definition for L(n). 5. Calculate three values for the recursive function S(R,P). 6. Find the location of 14 in a sorted array using Binary Search, showing each iteration.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    COLLEGE OF ENGINEERING ROORKEE

    (COER), Uttarakhand
    Tutorial Sheet- 2

    SUBJECT: Data Structures Using C++ (TCS-607) Issue Date: - Friday, February 22, 2013

    FACULTY: Sachin Kumar Saxena Last Submission Date: - Monday, March 04, 2013

    Q.1. CONVERT THE FOLLOWING EXPRESSION IN REVERSE POLISH NOTATION:-

    ∗[ ∗( )]
    a). X= b). X = [(A*B) + (C-D)]
    ∗( )
    Q.2.Show the each step of Tower of Hanoi Problem for n=5 completely.

    Q.3. Explain Abstract Data Type in terms of Object Oriented Program in detail.

    Q.4. in recursive problem if

    L(n) = 0 if n=1

    L( L n/2 ˩ )+1 if n>1

    a). Find L(25).

    Q.5. Calculate S(2,7), S(5,3) and S(15,2) for

    S(R,P) = 5 if R<P

    S(R-P, P+2) +R if R>=P

    Q.6. For the following array find out the location (value of LOC) for 14 using Binary Search:

    2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28

    Show each “Iteration” for the same.

    ----------------- Best of Luck ----------------

    You might also like