Unit 34 Data Structures and Algorithms
This unit provides learners with an understanding of how data structures are used in algorithms and enables them to design and implement data structures.
· Unit abstract
The unit starts by introducing abstract data types and explores their use in data structures. Based on this knowledge and understanding, learners should be able to develop solutions, using data structures for a range of commercial needs. Data structures may be implemented using a variety of programming paradigms and learners may use one or more areas for their implementations.
Finally, learners will research commercial applications that incorporate data structures and evaluate their use.
On completion of this unit the learner should be able to design and implement a variety of data structures and be able to evaluate different algorithms that implement data structures.
· Learning outcomes
On successful completion of this unit a learner will:
- Understand data structures and algorithms
- Be able to implement data structures and algorithms
- Understand how strings are structured and processed.
1 Understand data structures and algorithms
Data structures: array; set; stack; queue; list; tree; types eg active, passive, recursive.
Operations: types eg create, empty, push, pop, insert, delete, search, sort.
Design specification: using non-executable programme specification language eg pseudo code; issues eg complexity in software development; interfaces; information hiding.
Creation: pre-conditions, post-conditions, error-conditions.
Algorithms: sort eg insertion, quick, shell, merge, heapsort, selection sort; search eg linear, binary, binary search tree; recursive eg binary tree traversals (preorder, inorder, postorder).
2 Be able to implement data structures and algorithms
Implementation: sorting, searching and recursive algorithms; using eg arrays (single and/or multi dimensional), handle, pointer, class, methods; using an executable programming language.
3 Understand how strings are structured and processed
String: structure eg sequence of characters, data type, character
encoding. Operations: types eg
concatenation, find character, length, lowercase, substring, trim. Algorithms: processing eg string
searching, string sorting, string manipulation.
Learning outcomes and assessment criteria
|Learning outcomes On successful completion of this unit a learner will:||Assessment criteria for pass The learner can:|
|LO1 Understand data structures and algorithms||produce design specification for data structures explaining the valid operations that can be carried out on the structuresexplain the operation and performance of sorting and search algorithmsexplain the operation of recursive algorithms and identify situations when recursion is used|
|LO2 Be able to implement data structures and algorithms||implement data structures in an executable programming language in the context of well-defined problemsimplement opportunities for error handling and reportingtest results to enable comparison with expected results|
|LO3 Understand how strings are structured and processed||explain common string operations and their practical applicationsdemonstrate the outcome of string operations in specified algorithms.|
Links to National Occupational Standards, other BTEC units, other BTEC qualifications and other relevant units and qualifications
The learning outcomes associated with this unit are closely linked with:
|Level 3||Level 4||Level 5|
|Unit 18: Procedural Programming||Unit 40: Distributed Software Applications|
|Unit 19: Object Oriented Programming||Unit 41: Programming in Java|
|Unit 20: Event Driven Programming Solutions||Unit 42: Programming in .NET|
|Unit 21: Software Applications Testing,|
|Unit 22: Office Solutions Development|
|Unit 23: Mathematics for Software Development|
This unit has links to the Level 4 and Level 5 National Occupational Standards for IT and Telecoms Professionals, particularly the areas of competence of:
- Data Design
- Software Development.