Hanoi University of Business and Technology OOP-20192 PDF

Title Hanoi University of Business and Technology OOP-20192
Author Tung Viet
Course Laws of E-commerce
Institution Trường Đại học Kinh doanh và Công nghệ Hà Nội
Pages 2
File Size 79.7 KB
File Type PDF
Total Downloads 89
Total Views 153

Summary

Hanoi University of Business and TechnologyHanoi University of Business and TechnologyHanoi University of Business and TechnologyHanoi University of Business and TechnologyHanoi University of Business and Technology...


Description

Q1. (1.0 point) List maximum of 2 best things you like about this course, and minimum of 3 things that should be improved. Q2. (0.5 point) Which of the followings are diagrams used in UML 2.0 representing the dynamic structure of the system? a. b. c. d. e. f. g. h.

Activity diagram Class diagram Sequence diagram Deployment diagram Communication diagram Object diagram State machine diagram Use case diagram

Q3. (2 point) The class diagram below shows part of an ordering system used for mail order and teleshopping. Catalogs, which contains selling products in a month, will be advertised or sent to customers by post monthly. Each catalog contains selling products with price for only that month. Customers can send the orders by post or phone. Customers can buy multiple products in an order. Please write the most appropriate relations that should be insert into blanks A through D and add multiplicity for all relations (if any) directly to the below class diagram to complete the diagram? Hint: Some options could be considered to insert into the blanks A through D: Aggregation, Generalization, Composition, Navigability, Association, … A. B. C. D.

……………………………… ……………………………… ……………………………… ………………………………

Q4. (1 point) Why do we need interface although we already have parent classes in UML 2.0 (assume that we can accept both single or multiple inheritance). When should you use interfaces and when should we use parent classes? Q5. (6.5 point) You are asked to develop a Java program manipulating to math expressions. An expression grammar can be defined in BNF (Backus normal form) as follow: expression :: = variable | sequence sequence ::= expression + expression | expression – expression | expression * expression | expression / expression An expression can be a variable or a sequence expression. A variable one contains only a double value while the sequence one contains two expressions and their operator (which can be +, -, *, /) -

The value of a variable expression

-

Or the value of the operation between two expressions composing the sequence expression.

An expression can be compared to be “less than”...


Similar Free PDFs