Scribd Logo
Upload

Welcome to Scribd!

  • 328 views

    Stack Ques

    Uploaded by

    Raffi Sk
    16

    Copyright:

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

    Stack Ques

    Uploaded by

    Raffi Sk
    328 views6 pages
    16

    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?

    16

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    328 views6 pages

    Stack Ques

    Uploaded by

    Raffi Sk
    16

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    of 6

    http://www.cs.colorado.edu/~main/supplements/questio n.

    html

    Sample Data Structures Questions Chapter 7 Stacks


    Data Structures and Other Objects Using C++ by Michael Main and Walter Savitch Second Edition ISBN 0-201-70297-5, Softcover, 816 pages, 2000
    The Purpose of These Questions These are typical exam questions from Chapter 7 of the textbook. These exact questions might not be on your exam, but if you research and find the right answers to these questions, that should be good preparation for a real exam. (It's also possible that some of this material was not covered in your class.) There are 6 short answer questions and 16 multiple choice questions in this file. Short Answers Short Answers Sections 7.1 - 7.2 Stacks and Their Applications 2. Complete the body of this function. You do not need to check the precondition. You may use the stack template class. 1. Explain what modifications would be needed to make the parenthesis matching algorithm check expressions with different kinds of parentheses such as (), [] and {}'s.
    3. 4. 5. bool balanced(const char p[ ], size_t n) // Precondition: p[0]...p[n-1] contains n characters, each of which 6. // is '(', ')', '{' or '}'. 7. // Postcondition: The function returns true if the characters form a 8. // sequence of correctly balanced parentheses with each '(' matching 9. // a ')' and each '{' matching a '}'. Note that a sequence such as 10. // ( { ) } is NOT balanced because when we draw lines to match the 11. // parentheses to their partners, the lines cross each other. On the 12. // other hand, ( { } ) amd { ( ) } are both balanced.

    13. I am going to execute this code with THREE pushes and ONE pop:
    14. 15. 16. 17. 18. 19. stack<int> s; s.push(1); s.push(2); s.push(3); s.pop( );

    Short Answers Section 7.3 Implementations of the stack ADT

    Suppose that s is represented by a partially filled array. Draw the state of the private member variables of s after the above code:
    _______ used| | |_______| __________________________________ data| | | | | | |______|______|______|______|______| [0] [1] [2] [3] [4]

    20. I am going to execute this code with THREE pushes and ONE pop:
    21. 22. 23. 24. 25. 26. stack<int> s; s.push(1); s.push(2); s.push(3); cout << s.pop( );

    Suppose that s is represented by a linked list. Draw the state of the private member variables of s after the above code:
    _______ head_ptr| |

    Short Answers Section 7.4 More Complex Stack Applications


    |_______|

    27. Implement the following function. You may use the stack template class and the stack operations of push, pop, peek, is_empty, and size. You may also use cin.peek( ) and use "cin>>i" to read an integer.
    28. 29. 30. int evaluate_postfix_from_cin( ) // Precondition (Which is not checked): The next input line of cin is a 31. // properly formed postfix expression consisting of integers, 32. // the binary operations + and -, and spaces. 33. // Postcondition: The function has read the next input line (including 34. // the newline) and returned the value of the postfix expression. 35. { 36. int i;

    37.

    stack<int> s;

    38. Consider the usual algorithm to convert an infix expression to a postfix expression. Suppose that you have read 10 input characters during a conversion and that the stack now contains these symbols:
    39. 40. 41. 42. 43. | | | + | | ( | bottom |___*___|

    Now, suppose that you read and process the 11th symbol of the input. Draw the stack for the case where the 11th symbol is: A. A number: B. A left parenthesis: C. A right parenthesis: D. A minus sign: E. A division sign: Multiple Choice Sections 7.1-7.2 Stacks and Their Applications Multiple Choice 1. Entries in a stack are "ordered". What is the meaning of this statement? o A. A collection of stacks can be sorted. o B. Stack entries may be compared with the '<' operation. o C. The entries must be stored in a linked list. o D. There is a first entry, a second entry, and so on. 2. The operation for adding an entry to a stack is traditionally called: o A. add o B. append o C. insert o D. push 3. The operation for removing an entry from a stack is traditionally called: o A. delete o B. peek o C. pop o D. remove 4. Which of the following stack operations could result in stack underflow? o A. is_empty

    B. pop C. push D. Two or more of the above answers 5. Which of the following applications may use a stack? o A. A parentheses balancing program. o B. Keeping track of local variables at run time. o C. Syntax analyzer for a compiler. o D. All of the above. 6. Consider the following pseudocode:
    o o o 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. declare a stack of characters while ( there are more characters in the word to read ) { read a character push the character on the stack } while ( the stack is not empty ) { write the stack's top character to the screen pop a character off the stack }

    What is written to the screen for the input "carpets"? A. serc B. carpets C. steprac D. ccaarrppeettss 19. Here is an INCORRECT pseudocode for the algorithm which is supposed to determine whether a sequence of parentheses is balanced:
    o o o o 20. 21. 22. 23. 24. 25. 26. 27. declare a character stack while ( more input is available) { read a character if ( the character is a '(' ) push it on the stack else if ( the character is a ')' and the stack is not empty ) 28. pop a character off the stack 29. else 30. print "unbalanced" and exit 31. } 32. print "balanced"

    Which of these unbalanced sequences does the above code think is balanced?
    o o o o

    A. ((()) B. ())(() C. (()())) D. (()))()

    33. Consider the usual algorithm for determining whether a sequence of parentheses is balanced. What is the maximum number of parentheses that will appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(()))? o A. 1 o B. 2 o C. 3 o D. 4 o E. 5 or more 34. Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). What is the maximum number of parentheses that will ever appear on the stack AT ONE TIME during the computation? o A. 1 o B. 2 o C. 3 o D. 4 Multiple Choice Section 7.3 Implementations of the stack ADT
    o E. 5 or more 35. Suppose we have an array implementation of the stack class, with ten items in the stack stored at data[0] through data[9]. The CAPACITY is 42. Where does the push member function place the new entry in the array? o A. data[0] o B. data[1] o C. data[9] o D. data[10] 36. Consider the implementation of the stack using a partially-filled array. What goes wrong if we try to store the top of the stack at location [0] and the bottom of the stack at the last used position of the array? o A. Both peek and pop would require linear time. o B. Both push and pop would require linear time. o C. The stack could not be used to check balanced parentheses. o D. The stack could not be used to evaluate postfix expressions. 37. In the linked list implementation of the stack class, where does the push member function place the new entry on the linked list? o A. At the head o B. At the tail o C. After all other entries that are greater than the new entry. o D. After all other entries that are smaller than the new entry. 38. In the array version of the stack class (with a fixed-sized array), which operations require linear time for their worst-case behavior? o A. is_empty

    B. peek C. pop D. push E. None of these operations require linear time. 39. In the linked-list version of the stack class, which operations require linear time for their worst-case behavior? o A. is_empty o B. peek o C. pop
    o o o o

    Multiple Choice Section 7.4 More Complex Stack Applications D. push E. None of these operations require linear time. 40. What is the value of the postfix expression 6 3 2 4 + - *: o A. Something between -15 and -100 o B. Something between -5 and -15 o C. Something between 5 and -5 o D. Something between 5 and 15 o E. Something between 15 and 100 41. Here is an infix expression: 4+3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. What is the maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression? o A. 1 o B. 2 o C. 3 o D. 4 o E. 5
    o o

    Data Structures and Other Objects Using C++


    Michael Main ([email protected]) and Walter Savitch ([email protected]) Thank you for visiting http://www.cs.colorado.edu/~main/questions/chap07q.html Copyright 2000 Addison-Wesley Computer and Engineering Publishing Group

    You might also like