CS136 : Quad trees, HD-trees, Range trees and Skip Lists.pdf

22. If a logical address in paged memory management system has the logical address 518 and the page size is 512 bytes then logical address can be represented on terms of pages as: a. <1, 512> b. <1, 6> c. <1, 1> d. <1,1024>

Question 7. [11 MARKS] This question has you write the bodies of two functions. Complete each function according to its docstring. Part (a) [6 MARKS] Note: you will most likely not need all of the space on this page. def count_letter_case (L): "" (list of list of str) -> list of tuple of int Precondition: each str in L is non-empty and contains only alphabetic characters Count the number of words in each sublist of L that start with lowercase and uppercase letters. Return a new list where each element is a two-item tuple in which the first item is the number of words in the list at the corresponding index of L that start with a lowercase letter and the second item is the number of words in the list at the corresponding index of L that start with an uppercase letter. >>> count_letter_case([['apple', 'Banana'], ['PEAR'], [], ['PEACH', 'apRICot', 'plum']]) [(1, 1), (0, 1), (0, 0), (2, 1)]

Your program will take an arithmetic expression as a String input. For Example:

• “1+2*(3/4)”

• “1+2*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14”

• “1+2*[3*3+{4–5(6(7/8/9)+10)}–11+(12*8)/{13+13}]+14”

Program

Your program will determine whether the open brackets (the square brackets, curly braces and the parentheses) are closed in the correct order.

Outputs:

Output 1

1+2*(3/4)

This expression is correct.

Output 2

1+2*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14

This expression is NOT correct.

Error at character # 10. ‘{‘- not closed.

Output 3

1+2*[3*3+{4–5(6(7/8/9)+10)}–11+(12*8)/{13+13}]+14

This expression is correct.

Output 4

1+2]*[3*3+{4–5(6(7/8/9)+10)–11+(12*8)]+14

This expression is NOT correct.

Error at character # 4. ‘]‘- not opened.

Task 1

Solve the above problem using an array-based stack.

Task 2

Solve the above problem using a linked list-based stack.