HNDCS - Unit 34 LO1

Assignment front sheet Qualification

Unit number and title

Pearson BTEC HND Level 5 Diploma in Computing and Systems Development

Unit 34 Data Stru!tures and "lgorit#ms

Student name

Assessor name

Date issued

Completion date

Assignment title

"ssignment  Understanding Data Stru!ture "lgorit#ms $ %perations

LO

Learning outcome (LO) Understand data stru!tures and algorit#ms

L% &

AC

&'& &'+ &'3

Submitted on

In this assessment, ou !ill ha"e the opportunit to present e"idence that sho!s ou are able to# produ!e design spe!i(i!ation (or data stru!tures e)plaining t#e valid operations t#at !an *e !arried out on t#e stru!tures e)plain t#e operation and per(orman!e o( sorting and sear!# algorit#ms e)plain t#e operation o( re!ursive algorit#ms and identi(y situations ,#en re!ursion is used

$as% no& & + 3

Learner declaration - !erti(y t#at t#e ,or. su*mitted (or t#is assignment is my o,n and resear!# sour!es are (ully a!.no,ledged'

Student signature

Date

'"idence (age no)

Assignment brief  Unit number and title

Unit 34 Data Stru!tures and "lgorit#ms

Qualification

Pearson BTEC HND Level 5 Diploma in Computing and Systems Development

Start date Deadlinehand*in Assessor

Understanding Data Stru!ture "lgorit#ms $ %perations

Assignment title

urpose of this assignment T#is assignment !onsiders to improving t#e *asi! !on!epts and s.ills o( Data stru!tures and algorit#ms as Trainee So(t,are Developer' T#e aim o( t#is assessment is to understand operations and algorit#ms o( data stru!ture Scenario /ou #ave *een appointed as Trainee so(t,are developer in -ntelle!tual So(t,are Development Company 0-SDC1' " !lient (rom Hard2Core !onta!ted and #ad a meeting ,it# -SDC Program anager' Hard2Core is retailer o( -T related euipments su!# as printers6 s!anners6 USB et!' Client enuires (or a des.top program t#at !an *e supportive in re!ord .eeping6 sorting6 and manipulation o( inventory re!ords' Be(ore t#e designing t#e *etter solution6 your team lead is assigning you to present do!umentation regarding data #andling stru!ture and algorit#ms' So t#at !an *e #elp(ul in a!#ieving *etter suggestion and design a!!ording to t#e !lients need' Here you are assigned to present do!umentation t#at simpli(ies data stru!ture and algorit#ms6 $as% +  (LO +# +&+ and +) Propose in *rie( data storing te!#niues su!# as "rray6 Pointer6 Sta!.6 and Set' "naly7e t#e term L-8%6 8-8%6 Lin. List6 9ueuing6 tress et!' "nd identi(y t#e valid te!#niue (or storing re!ords' Determine design spe!i(i!ation su!# as pseudo !ode6 in(ormation #iding6 and inter(a!e' $as% - (LO +# +&-) State t#e terms pus#6 pop and manipulating te!#niues su!# as delete6 insert6 update et!' "lso investigate di((erent sear!#ing and sorting algorit#ms li.e insertion6 ui!.6 s#ell et!' $as% . (LO +# +&. and D+) "ssess t#e operation o( a!tive6 passive and re!ursive algorit#m' Determine ,#en re!ursive operation is *etter to use' "nd also mention various algorit#ms su!# as linear6 *inary6 *inary sear!# tree et!' Suggest and present t#e *etter solution (or t#e !lients reuirement'

'"idence chec%list

Summar of e"idence re/uired b student

'"idence presented

Tas. &

Do!ument presenting *asi! data storing te!#niues

Tas. +

Do!ument t#at present *asi! data manipulating te!#niues

Tas. 3

Do!ument t#at present various data stru!ture algorit#ms

Sources of information# 0oo%s and 1ebsites# :oodri!# 6 Tamassia ; < Data Stru!tures and "lgorit#ms in C== 0>iley6 +?&?1 el#orn @6 Sanders P < "lgorit#ms and Data Stru!tures T#e Basi! Tool*o) 0Springer6 +??A1 #ttp,,3'datastru!tures'net #ttp,,,'itl'nist'govdivAsgdads 2lossar# Sorting "lgorit#ms "rray Sta!. ;e!ursive algorit#ms String anipulation    

     

Achie"ement Summar Qualification

Unit 3umber and title

Criteria 4eference LO + &'& &'+ &'3 erit &

Distinction D&

Pearson BTEC HND Level 5 Diploma in Computing and Systems Development

Assessor name

Unit 34 Data Stru!tures and "lgorit#ms

Student name

$o achie"e the criteria the e"idence must sho! that the student is able to#

Achie"ed 5 (tic%)

produ!e design spe!i(i!ation (or data stru!tures e)plaining t#e valid operations t#at !an *e !arried out on t#e stru!tures e)plain t#e operation and per(orman!e o( sorting and sear!# algorit#ms e)plain t#e operation o( re!ursive algorit#ms and identi(y situations ,#en re!ursion is used To a!#ieve &6 you must demonstrate t#at appropriate stru!ture and approa!# t#at #as *een used ,#ile do!umenting operations and per(orman!e o( algorit#ms To a!#ieve D&6 you must present do!ument t#at re(le!ts sel(2 evaluation (a!tors regarding operations and per(orman!e o( algorit#ms

6igher 2rade achie"ements (!here applicable)

2rade descriptor

+# Identif and appl strategies to find appropriate solutions

Achie"ed5 (tic%)

2rade descriptor

D+# Use critical reflection to e"aluate o!n !or% and  7ustif "alid conclusions

-# Select  design and appl appropriate methods  techni/ues

D-# $a%e responsibilit for managing and organising acti"ities

.# resent and communicate appropriate findings

D.# Demonstrate con"ergent lateral  creati"e thin%ing

Achie"ed5 (tic%)

Assignment 8eedbac% 8ormati"e 8eedbac%# Assessor to Student

Action lan

Summati"e feedbac%

8eedbac%# Student to Assessor

Assessor Signature

Date

Student Signature

Date