HSC Enrichment - Software Design and Development Singleton - - PDF document

hsc enrichment software design and development
SMART_READER_LITE
LIVE PREVIEW

HSC Enrichment - Software Design and Development Singleton - - PDF document

4/30/17 HSC Enrichment - Software Design and Development Singleton Presentation 2017 1 How to do well in the HSC exam n Understand the course content n Use the appropriate terminology n Respond to the terms used in the question n Refer


slide-1
SLIDE 1

4/30/17 1

1

HSC Enrichment - Software Design and Development

Singleton Presentation 2017

2

How to do well in the HSC exam

n Understand the course content n Use the appropriate terminology n Respond to the terms used in the question n Refer specifically to the question n Use your time well n Show what you know!

slide-2
SLIDE 2

4/30/17 2

3

How to do well in the HSC exam

4

Development and Impact

n Methods of Software Development

n RAD n Prototype n End-user n Structured n Agile

Combinations of these

slide-3
SLIDE 3

4/30/17 3

5

Development and Impact

n Methods of Software Development

n RAD n Prototype n End-user n Structured n Agile

n Define n Differences n Appropriateness n Explain process for a given scenario n Refer to Case Study

Combinations of these

6

Social Issues

n Preliminary as well as HSC course

n Rights and responsibilities n Relevant legal case(s) n Intellectual property n The software market n Ergonomics

n Interface design

n Inclusivity n Privacy n Effect of networked solutions (ease of use)

slide-4
SLIDE 4

4/30/17 4

7

Software Development Cycle

n Define and Understand n Planning and Design n Implementation n Testing n Evaluation and Maintenance

8

SDC - Define and Understand

n Inputs, processes, outputs n Consider alternatives n Consider data structures n Initial modeling n Communication with customer/user n Quality Assurance procedures n Social and ethical issues

slide-5
SLIDE 5

4/30/17 5

9

SDC - Planning and Design

n Logic

n Standard routines n Custom designed n Customised n Use of library routines n Passing of parameters n Local / global variables

n Choice of language n Hardware requirements

n See Specs Document

10

SDC - Planning and Design

n Logic

n Standard routines n Custom designed n Customised n Use of library routines n Passing of parameters n Local / global variables

n Choice of language n Hardware requirements

n See Specs Document

n Documentation

n Algorithms n Data dictionary n Data structures n Interfaces, Storyboard

n Thumbnails and links

n Test data n DFD,

Systems Flowchart, Structure chart, IPO chart

n Project management

slide-6
SLIDE 6

4/30/17 6

11

SDC - Planning and Design

n Hardware requirements

n See Specs Document

12

SDC - Planning and Design

n Hardware requirements

n See Specs Document

slide-7
SLIDE 7

4/30/17 7

13

SDC - Implementation

n Code

n Remove syntax and logic errors n Internally document

n Incorporate help n Implement interfaces

n Common interface elements n Navigation n Appropriate graphics

n Documentation

n Users n Subsequent maintenance 14

SDC - Implementation

n Code

n Remove syntax and logic errors n Internally document

n Incorporate help n Implement interfaces

n Common interface elements n Navigation n Appropriate graphics

n Documentation

n Users n Subsequent maintenance

slide-8
SLIDE 8

4/30/17 8

15

SDC - Testing

n Module

n functionality

n Program

n Interaction between modules n Data passed correctly

n System

n Live and volume data n Integration of all programs

n Report on testing process

16

SDC - Evaluate

n Reliable –

n fully tested?

n Relevance –

n Meets original requirements/social & ethical?

n Quality product -

n Quality assurance processes n Relevance of benchmark

n Communication with client/users

n Sign-off

slide-9
SLIDE 9

4/30/17 9

17

SDC - Maintenance

n Reasons for Maintenance of code n Process

n ILDITD

n Documentation

18

SDC - Maintenance

n Reasons for Maintenance of code n Process

n ILDITD

n Documentation

slide-10
SLIDE 10

4/30/17 10

19

SDC - Maintenance

n Reasons for Maintenance of code n Process

n ILDITD

n Documentation

20

SDC - Maintenance

n Reasons for Maintenance of code n Process

n ILDITD

n Documentation

slide-11
SLIDE 11

4/30/17 11

21

DU.PD.I.TE.M

n For each step you should be able to

identify……

n Name n Specific tasks performed n People involved n Documentation produced n Terminology n Relevant use of CASE tools n Relevant social issues

22

Documentation tools

n DFD n Context Diagram n System flowchart n IPO chart n Storyboard n Structure diagram n Data dictionary

slide-12
SLIDE 12

4/30/17 12

23

Documentation tools

n DFD n Context Diagram n System flowchart n IPO chart n Storyboard n Structure diagram n Data dictionary

Check the Specs document for how to present these

24

Documentation tools

n DFD

slide-13
SLIDE 13

4/30/17 13

25

Documentation tools

n System flowchart

26

Documentation tools

n Each shows a different view of a system

n Recognise n Interpret n Modify or complete n Construct n Compare and contrast n Select relevant tool

slide-14
SLIDE 14

4/30/17 14

27

Algorithms - Control Structures

n Sequence n Selection

n Binary n Multiway

n Iteration/Repetition

n Pre - test n Post - test

28

Algorithms - Control Structures

n Sequence n Selection

n Binary n Multiway

n Iteration/Repetition

n Pre - test n Post - test n Recognise in pseudocode

AND flowchart

n Construct (both) n Read and understand (both) n Modify (both)

– use line numbers

n Describe differences in use

slide-15
SLIDE 15

4/30/17 15

29

Algorithms - Desk Check

n Specific question - complete a formal table

with a column for all variables and output

set i to 1 Set count to 0 REPEAT increment count set A to count * i print i set i to A + count UNTIL i > 3

30

Algorithms - Desk Check

n Specific question - complete a formal table

with a column for all variables and output

set i to 1 Set count to 0 REPEAT increment count set A to count * i print i set i to A + count UNTIL i > 3 To predict output – complete a deskcheck

slide-16
SLIDE 16

4/30/17 16

31

Algorithms – Desk check

i count A Output 1

set i to 1 Set count to 0 REPEAT increment count set A to count * i print i set i to A + count UNTIL i > 3

32

Algorithms – Desk check

i count A Output 1 1

set i to 1 Set count to 0 REPEAT increment count set A to count * i print i set i to A + count UNTIL i > 3

slide-17
SLIDE 17

4/30/17 17

33

Algorithms – Desk check

i count A Output 1 1 1

set i to 1 Set count to 0 REPEAT increment count set A to count * i print i set i to A + count UNTIL i > 3

34

Algorithms – Desk check

i count A Output 1 1 1 1

set i to 1 Set count to 0 REPEAT increment count set A to count * i print i set i to A + count UNTIL i > 3

slide-18
SLIDE 18

4/30/17 18

35

Algorithms – Desk check

i count A Output 1 1 1 1 2

set i to 1 Set count to 0 REPEAT increment count set A to count * i print i set i to A + count UNTIL i > 3

36

Algorithms – Desk check

i count A Output 1 1 1 1 2 2

set i to 1 Set count to 0 REPEAT increment count set A to count * i print i set i to A + count UNTIL i > 3

slide-19
SLIDE 19

4/30/17 19

37

Algorithms – Desk check

i count A Output 1 1 1 1 2 2 4

set i to 1 Set count to 0 REPEAT increment count set A to count * i print i set i to A + count UNTIL i > 3

38

Algorithms – Desk check

i count A Output 1 1 1 1 2 2 4 2

set i to 1 Set count to 0 REPEAT increment count set A to count * i print i set i to A + count UNTIL i > 3

slide-20
SLIDE 20

4/30/17 20

39

Algorithms – Desk check

i count A Output 1 1 1 1 2 2 4 2 6

set i to 1 Set count to 0 REPEAT increment count set A to count * i print i set i to A + count UNTIL i > 3

40

Algorithms - Test Data

n boundaries n pathways n sentinel values n known values/ answers

slide-21
SLIDE 21

4/30/17 21

41

Algorithms - Test Data

n sentinel values

42

Algorithms - Design

n clear mainline

(overall flow of program, no detail, use of subroutines – one for each logical task)

n intrinsic documentation n easy to follow n large flowcharts and pseudocode n use a PENCIL ! n include loops if required n include decisions if required

slide-22
SLIDE 22

4/30/17 22

Algorithm - Question

n Consider the following problem..

n Design an algorithm to print all years between

any two given years and print next to each, a message to say if it is a leap year

n A year is leap if it is divisible by 4,

  • r if it is the start of a new century and also

divisible by 400

43 44

slide-23
SLIDE 23

4/30/17 23

45

Search and Sort Routines

n Linear search n Binary Search n Bubble sort n Insertion sort n Selection sort

46

Search and Sort Routines

n Linear search n Binary Search n Bubble sort n Insertion sort n Selection sort

slide-24
SLIDE 24

4/30/17 24

47

Search and Sort Routines

n Linear search n Binary Search n Bubble sort n Insertion sort n Selection sort

48

Search and Sort Routines

n Linear search n Binary Search n Bubble sort n Insertion sort n Selection sort

slide-25
SLIDE 25

4/30/17 25

49

Search and Sort Routines

n Definitions n Recognise logic n Predict array contents after required

number of passes

n Practise at home using 6 playing cards

50

Possible Situations

n Text Manipulation

n Swap letters in a word n Palindrome n Anagrams

Check Specs document for examples

n File Handling

n Sequential files - sentinel values, appending records n Relative files - use of key n Login - Authentication

slide-26
SLIDE 26

4/30/17 26

51

Random numbers

n Generate in a given range n Use appropriately n Non-duplicates / unique numbers

52

Project Work

n Use and identify steps (DUPDITEM) n Produce full documentation

n User manual n Installation guide n Tutorial n Diary / log n Technical Specifications

slide-27
SLIDE 27

4/30/17 27

53

Project management techniques

n Time management (Gantt Chart) n Response to difficulties (Blog entries) n Reflection on stumbling blocks

and successes (Blog entries)

54

In the exam….

slide-28
SLIDE 28

4/30/17 28

55

In the exam….

n 1.5 minutes per mark n 30 minutes for 20 multiple choice questions n Read the question! n Refer to the scenario described in the

question

n Only do ONE option

56

In the exam….

n Use the keywords

n Compare and contrast n Critically evaluate n Explain……

n Number of marks - depth required n Use correct terminology n We can only mark what we read!

slide-29
SLIDE 29

4/30/17 29

57

In the exam….

n Make sure you have learnt your definitions, and

that you understand what you have learnt

n Read the question carefully, so you know what area

you are to write about

n Relate your response to the given question n Remember - the examiner simply wants to see

what you know, and how well you understand it

58

n Syllabus

n Learn to… n Learn about…

n Course and Software Specifications n Past HSC exams, Marking Guidelines & Notes

from the Marking Centre

n Past Trial papers and supplied answers n Texts

Before the exam….

slide-30
SLIDE 30

4/30/17 30

n Good luck!

59