Data Structures. Level 6 C Module Descriptor

Transcription

1 The Further Education and Training Awards Council (FETAC) was set up as a statutory body on 11 June 2001 by the Minister for Education and Science. Under the Qualifications (Education & Training) Act, 1999, FETAC now has responsibility for making awards previously made by NCVA. Module Descriptor Data Structures Level 6 C

2 1 Title Data Structures 2 Code C Level 6 4 Value 2 credits 5 Purpose This module has been designed to enable the learner to understand the concept of a data type and a data structure. The learner will become familiar with the different types of data structures and their application in software development. This is an elective module on Advanced Certificate, Networks and Software Systems at Level 6. 6 Preferred Entry Level Level 5 Certificate or equivalent. 7 Special Requirements The learner should have successfully completed FETAC Computer Programming (C20013) or its equivalent. 8 General Aims This module aims to enable the learner to: 8.1 acquire the skills necessary to understand the concept of a data structure 8.2 understand the need for structuring data in different ways 8.3 understand the need for dynamic memory allocation 8.4 distinguish between linear structures and non-linear structures 8.5 design data structures for specific tasks 8.6 implement the different data structures in a programming language 8.7 develop good work practices in the use and care of computing equipment. 1

3 9 Units Unit 1 Unit 2 Unit 3 Unit 4 Fundamentals Sorting and Searching Linear Structures Non-linear Structures 10 Specific Learning Outcomes Unit 1 Fundamentals The learner should be able to: define a data type list basic data types: intger real char boolean list operations on basic data types explain the meaning of operations on basic types explain user defined data types explain the term record or structure write a program that implements user defined types define the term data structure define the following data structures: array stack queue differentiate between compile-time and run-time allocation of data storage explain the importance of dynamic allocation of memory give an example of an application for which dynamic memory allocation is necessary define the term pointer distinguish between a pointer variable and an ordinary variable explain how memory is allocated and freed write a program using pointers 2

4 explain the term dynamic array explain how pointers are used to implement dynamic arrays write a program that use dynamic arrays for data storage. Unit 2 Sorting and Searching The learner should be able to: explain the need to sort data distinguish between: linear searching binary searching explain the advantages of binary searching over linear searching write an algorithm for a: linear search binary search write functions which implement both searching strategies write programs to test these functions write programs to test these functions explain the following techniques: selection sort bubble sort insertion sort write an algorithm for a: selection sort bubble sort insertion sort write procedures to implement write programs to test explain why these sorting algorithms are O(N 2 ) write algorithms to partition arrays about given values explain the problem known as the Dutch National Flag write an algorithm to solve the problem of the Dutch National Flag explain the algorithm Quicksort write a procedure to implement Quicksort explain why Quicksort is better than the algorithms outlined in and

5 Unit 3 Linear Structures The learner should be able to: define a singly linked list define a node in a list explain how nodes are dynamically linked to form a linear list write code to create an empty singly linked list write code to insert a node in a singly linked list write code to print contents of a singly linked list write code to delete a node from a singly linked list STACKS define a stack explain how to implement a stack using an array write procedures using an array for: new-stack push pop top empty_stack delete_stack explain how to implement a stack using a singly linked list write procedures using a singly linked list for: new-stack push pop top empty_stack delete_stack write a program that uses a stack to store data give two examples from programming where stacks are useful QUEUES define a queue explain how to implement a queue using an array write procedures using an array for: new-queue insert 4

6 remove head empty_queue delete_queue explain how to implement a queue using a singly linked list write procedures using a singly linked list for: new-queue insert remove head empty_queue delete_queue write a program that uses a queue to store data give two examples from programming where queues are useful. Unit 4 Non-linear Structures The learner should be able to: define recursion explain the connection between recursive definition and iteration write recursive routines e.g. read a list of integer values and print them in reverse order define a binary search tree explain the following terms: root node path leaf node parent node sibling construct a binary search tree from a given list of integer values explain the following traversal algorithms: inorder pre-order post-order explain the significance of applying an inorder traversal to a binary search tree explain how to delete an element from the tree for a given binary search tree 5

7 implement the definition of a node in a binary search tree write a procedure to insert an element in a binary search tree write procedures for the three traversal algorithms write a procedure to delete an element from a tree write a procedure to search for a given element write a program that uses binary search trees to store data. 11 Assessment Summary Portfolio of Coursework 60% Examination 40% 11.1 Technique Portfolio of Coursework Format The portfolio of coursework is to consist of 2 programming assignments Assignment 1 30% Details The assignment must be an application that will involve the use of linear data structures. E.g. Implement the data type set_of_ integer and the operations new_set, union, subset, intersection and is_an_element_of Assignment 2 30% Details The assignment must be an application that will involve the use of non-linear data structures Technique Written Examination Format The examination is to be based on all units of the module. Section A 20% One structured question Section B 20% Three structured questions. Two questions to be answered All questions carry equal marks. 12 Grading Pass 50-64% Merit 65-79% Distinction % 6

8 Individual Candidate ing Sheet 1 Data Structures C30151 Assignment 1: Programming linear data Weighting 30% Candidate Name: PPSN: Centre: Centre No: Performance Criteria Maximum Candidate Programme Documentation 20 Design and Implementation of a data structure to solve a given problem Reasons for choosing the given data structure, e.g. suitability, performance issues etc. 25 Application development and use of Data Structure in solving a given problem 40 Test and Evaluation 15 Total s 100 WEIGHED TOTAL (= TOTAL X 0.3) 30% Assessor s Signature: Date: External Authenticator s Signature: Date: 7

9 Individual Candidate ing Sheet 2 Data Structures C30151 Assignment 2: Programming non-linear data Weighting 30% Candidate Name: PPSN: Centre: Centre No: Performance Criteria Maximum Candidate Programme Documentation 20 Design and Implementation of a data structure to solve a given problem Reasons for choosing the given data structure, e.g. suitability, performance issues etc. 25 Application development and use of Data Structure in solving a given problem 40 Test and Evaluation 15 Total s 100 WEIGHED TOTAL (= TOTAL X 0.3) 30% Assessor s Signature: Date: External Authenticator s Signature: Date: 8

10 Individual Candidate ing Sheet 3 Data Structures C30151 Written Examination 40% Candidate Name: PPSN: Centre: Centre No: Performance Criteria Maximum Candidate Section A Question 1 50 Section B Answer 2 questions Question ( ) 25 Question ( ) 25 Total 100 WEIGHED TOTAL (= TOTAL X 0.4) 40% Assessor s Signature: Date: External Authenticator s Signature: Date: 9

11 FETAC Module Results Summary Sheet Module: Data Structures Module Code: C30151 Portfolio of Coursework Elements of Assessment Written % Assignment 1 Assignment 2 Examination s Maximum s per element of assessment 40% 30% 30% 100% Candidate Name Exam No. Grade* Signed: Teacher/Assessor: Date: This sheet is for teachers/assessors to record the overall marks of individual candidates. It should be retained in the centre. The marks awarded should be trans ferred to the official FETAC Module Results Sheet issued to centres before the visit of the external Authenticator. Grade* D: % M: 65-79% P: 50-64% U: 0-49% W: candidates entered who did not present for assessment 10