CSC 207 Software Design Final Preparation Structure of

  • Slides: 8
Download presentation
CSC 207 – Software Design Final Preparation

CSC 207 – Software Design Final Preparation

Structure of Exam • Descriptive Qs. – 5 each 4 marks • Code understanding

Structure of Exam • Descriptive Qs. – 5 each 4 marks • Code understanding – 1 for 10 marks • Analysis / Implementation Qs – 4 for 60 marks • Regular expressions – 1 for 10 marks

Coverage • All lectures are included in the exam – Except the week 2

Coverage • All lectures are included in the exam – Except the week 2 (May 24) – Scope / Memory Model • Sources: – Book – useful for the technical questions – Lecture Slides – Class discussions

UML Modeling • Bank Account – Each bank account has an owner, who has

UML Modeling • Bank Account – Each bank account has an owner, who has a distinct identifier. There are two types of accounts: Saving account and Checking accounts; but for the saving accounts we offer three subcategories: Gold accounts (those which should have balance higher than $10, 000. 00); Silver accounts (those which should have balance higher than $1, 000. 00); and Usual account (those which have no restriction). Owners of all count types can deposit and withdraw money into/from their accounts; but only the owners of Gold accounts can apply for loan.

UML Exercise • The Midterm Q. – Customers order products from an online store;

UML Exercise • The Midterm Q. – Customers order products from an online store; their orders will be processes by the closest store to their address, and their bills will be issued. After the payment is done, items will be shipped to the customer address.

Reg. Ex Exercise • If a file is an imaginary filename format, then it

Reg. Ex Exercise • If a file is an imaginary filename format, then it starts with 3 digits followed by 4 alphabetic characters followed by the exact same digits as the first part, followed by a “. imaginary” extension

Reg. Ex • Match a string consisting entirely of digits. • Match a person's

Reg. Ex • Match a string consisting entirely of digits. • Match a person's name, for example Harry Potter. The name is assumed to consist of two words, each starting with a capital letter and consisting entirely of letters (from the usual alphabet, without accents). There may be one or more white space characters separating the two parts.