Data Structures and Algorithms

Similar documents
Distributed Software Applications

Procedural Programming

Object Oriented Programming

Unit code: H/601/1537 QCF Level 5: BTEC Higher National Credit value: 15

Networking Infrastructure

Unit code: Y/601/1423 QCF Level 4: BTEC Higher National Credit value: 15

Design a Small or Home Office Network

Local Area Networking Technologies

Internet Server Management

Networking Technologies

Designing Messaging Solutions with Microsoft Exchange Server 2007 (70-237)

Modelling and Simulation for Engineers

Unit code: D/601/1956 QCF Level 5: BTEC Higher National Credit value: 15

Web Applications Development

Unit code: D/601/1939 QCF Level 5: BTEC Higher National Credit value: 15

Unit code: R/601/1288 QCF Level 4: BTEC Higher National Credit value: 15

Unit code: J/601/1286 QCF Level 4: BTEC Higher National Credit value: 15

3D Computer Modelling and Animation

Multimedia Design and Authoring

Business Skills for e-commerce

Credit value: 10 Guided learning hours: 80

Abstract Data Structures IB Computer Science. Content developed by Dartford Grammar School Computer Science Department

CompTIA Linux+/LPI102

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

Web Server Scripting

Binary Trees

Unit 112: Cisco IT Essentials (Part 2)

QCF Level 3: BTEC Specialist Credit value: 10 Guided learning hours: 60. Aim and purpose. Unit introduction

Web Server Scripting. Credit value: 10 Guided learning hours: 60. Aim and purpose. Unit introduction. Learning outcomes

Unit 111: Cisco IT Essentials (Part 1)

ASSIGNMENTS. Progra m Outcom e. Chapter Q. No. Outcom e (CO) I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n))

First Semester - Question Bank Department of Computer Science Advanced Data Structures and Algorithms...

Microsoft Windows Server 2008, Active Directory, Configuring (70-640)

Title: EAL Level 2 Certificate in BusinessImprovement Techniques (QCF) At a glance. Level: Credit value: Guided learning hours: Minimum learner age:

Setting up an IT Network

Marketing on Mobile Devices. SQA code H8PW 04. SCQF level 6. SCQF credit points

Data Structure Advanced

Name of Regulated Qualification: BIIAB Level 2 Certificate In ICT Systems and Principles for Practitioners (QCF)

Server 2008, Network Infrastructure, Configuring (70-642)

Centre Guidance for Onscreen Tested Vocational Qualifications Edexcel BTEC Level 3 in Customer Service (QCF)

Foundation Learning as a progression route to. Apprenticeships. The Toolkit

Apprenticeship for IT, Software, Web and Telecoms Professionals

F453 Module 7: Programming Techniques. 7.2: Methods for defining syntax

University of Palestine. Final Exam 2 nd semester 2014/2015 Total Grade: 50

CH 8. HEAPS AND PRIORITY QUEUES

Name of Regulated Qualification: BIIAB Level 4 Diploma In Professional Competence for IT and Telecoms Professionals (PROCOM) (QCF)

Abstract Data Structures IB Computer Science. Content developed by Dartford Grammar School Computer Science Department

CH. 8 PRIORITY QUEUES AND HEAPS

Higher National Unit specification: general information

Name CPTR246 Spring '17 (100 total points) Exam 3

R13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)

Communication Technologies

Systems and Principles Unit Syllabus

CSE 373 Spring Midterm. Friday April 21st

Course Name: B.Tech. 3 th Sem. No of hours allotted to complete the syllabi: 44 Hours No of hours allotted per week: 3 Hours. Planned.

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT)

Pearson BTEC Level 4 Diploma in Information Security Professional Competence

Trees! Ellen Walker! CPSC 201 Data Structures! Hiram College!

National Vocational Qualifications Delivered Overseas policy

17 February Given an algorithm, compute its running time in terms of O, Ω, and Θ (if any). Usually the big-oh running time is enough.

Setting up an IT Network

Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015

Unit purpose and aim. Designing and Developing a Web Site. OCR unit number 42 Level: 4 Credit value: 15 Guided learning hours: 90

DATA STRUCTURES THROUGH C++

Pearson BTEC Level 2 Diploma in Professional Competence for IT and Telecoms Professionals

COURSE SPECIFICATION

Bharati Vidyapeeth s College Of Engineering for Women Pune-43 Department E & TC. SE- Unit Test I Subject-DS

Data Abstractions. National Chiao Tung University Chun-Jen Tsai 05/23/2012

S Nvq Level 2 Business And Administration Student Book S Nvq Business Administration

The Learner can: 1.1 Describe the common types of security breach that can affect the organisation, such as:

Computer Science E-22 Practice Final Exam

EAL Level 3 Award In Approving Electrical Installation Work in Dwellings in Compliance with Building Regulations (QCF)

Cpt S 122 Data Structures. Course Review Midterm Exam # 1

Stores a collection of elements each with an associated key value

Pearson BTEC Level 2 Award for IT Users (ITQ) Pearson BTEC Level 2 Certificate for IT Users (ITQ) Pearson BTEC Level 2 Diploma for IT Users (ITQ)

Table of Contents. Chapter 1: Introduction to Data Structures... 1

Cpt S 122 Data Structures. Data Structures Trees

Syllabus for Bachelor of Technology. Computer Engineering. Subject Code: 01CE0301. Subject Name: Data Structure. B.Tech. Year - II

Designing an Effective Web Based User Experience

Level 1 Award in Employee Rights and Responsibilities (QCF)

DYNAMIC MEMORY ALLOCATION AND DEALLOCATION

CompTIA A+ Essentials

Cpt S 122 Data Structures. Course Review FINAL. Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

IN COLLABORATION WITH IVTB. Diploma in Information Technology

What qualifications and Apprenticeship frameworks are in scope for change?

Divide-and-Conquer. Divide-and conquer is a general algorithm design paradigm:

Programme Specification

Comparing unit content

Specification. Edexcel Entry 1

Specification. Edexcel BTEC Level 3 Certificate/Subsidiary Diploma/Diploma in Information Technology (Specialist) (QCF) BTEC Specialist qualifications

Draw a diagram of an empty circular queue and describe it to the reader.

namibia UniVERSITY OF SCIEnCE AnD TECHnOLOGY

Content Management System Website Creation

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

1) What is the primary purpose of template functions? 2) Suppose bag is a template class, what is the syntax for declaring a bag b of integers?

CS301 - Data Structures Glossary By

SYLLABUS Type of evaluation

Access Network Techniques and Applications

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May

Transcription:

Unit 34: Data Structures and Algorithms Unit code: H/601/1456 QCF Level 5: BTEC Higher National Credit value: 15 Aim 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: 1 Understand data structures and algorithms 2 Be able to implement data structures and algorithms 3 Understand how strings are structured and processed. 193

Unit content 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. 194 BH029107 Edexcel BTEC Levels 4 and 5 Higher Nationals specification in Computing and Systems Development

Learning outcomes and assessment criteria Learning outcomes On successful completion of this unit a learner will: LO1 Understand data structures and algorithms Assessment criteria for pass The learner can: 1.1 produce design specification for data structures explaining the valid operations that can be carried out on the structures 1.2 explain the operation and performance of sorting and search algorithms 1.3 explain the operation of recursive algorithms and identify situations when recursion is used LO2 Be able to implement data structures and algorithms 2.1 implement data structures in an executable programming language in the context of well-defined problems 2.2 implement opportunities for error handling and reporting 2.3 test results to enable comparison with expected results LO3 Understand how strings are structured and processed 3.1 explain common string operations and their practical applications 3.2 demonstrate the outcome of string operations in specified algorithms. 195

Guidance 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 19: Object Oriented Programming Unit 20: Event Driven Programming Solutions Unit 40: Distributed Software Applications Unit 41: Programming in Java 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. Resources Books Goodrich M, Tamassia R Data Structures and Algorithms in C++ (Wiley, 2010) ISBN-10: 0470383275 Goodrich M, Tamassia R Data Structures and Algorithms in Java (Wiley, 2005) ISBN-10: 0471738840 Melhorn K, Sanders P Algorithms and Data Structures: The Basic Toolbox (Springer, 2008) ISBN-10: 3540779779 Websites http://ww3.datastructures.net http://www.itl.nist.gov/div897/sqg/dads/ 196 BH029107 Edexcel BTEC Levels 4 and 5 Higher Nationals specification in Computing and Systems Development

Employer engagement and vocational contexts To further enrich the content of this unit and to provide more of a vocational context it would be beneficial to bring in programmers or designers from organisations that have engaged with data structures and algorithms within their systems. 197