UNIT SYLLABUS

F2G SE PROGRAMME
BTEC LEVEL 5 HND DIPLOMA IN COMPUTING AND SYSTEMS DEVELOPMENT

Assignment Due:
. Assignment 1: slot 26
. Assignment 2: slot 38
The student must pass these Assignments to pass the course

FRM01_Syllabus_29.11.2012 Page 1
Unit Title: Data Structures and Algorithms

Unit Code H/601/1456

QCF level 5

Credit value 15 credits

Unit 51: Computer Systems Architecture
Unit 2: Computer Systems
Pre-requisite Unit 1: Procedural Programming
Unit 19: Object Oriented Programming
Unit 41: Programming in Java

Instructor <Instructor name>

Class hours <00:00 - 00:00 (date)>

Room <Room No.>

FRM01_Syllabus_29.11.2012 Page 2
 UNIT IMPLEMENTATION AND EVALUATION
1. 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.

2. Unit abstract
This unit is designed to enable learners to become confident using research techniques and methods. It
addresses the elements that make up formal research including the proposal, a variety of research
methodologies, action planning, carrying out the research itself and presenting the findings. To complete
the unit satisfactorily, learners must also understand the theory that underpins formal research.
The actual research depends on the learner, the context of their area of learning, their focus of interest and
the anticipated outcomes. The unit draws together a range of other areas from
within the programme to form a holistic piece of work that will make a positive contribution to the learners
area of interest. Learners should seek approval from their tutors before starting their research project.

3. 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.

4. Assessment Methods
Assignment 1: Theories
Purpose of the Assignment: the purpose of this Assignment is to provide learners with
understandings of different steps of conducting research. It also helps students learn to
formulate different elements of a research project. This in an individual assignment and is
designed to finish at home.
Assignment 1 would help students to achieve:
LO1: Understand how to formulate a research specification.
Students have to complete all assignments individually

FRM01_Syllabus_29.11.2012 Page 3
 5. Unit assessment criteria
Learning outcomes
On successful completion of
this unit a learner will:
LO1 Understand data
structures and
algorithms
LO2 Be able to implement
data structures and
algorithms
LO3 Understand how strings
are structured and
processed
6. Required Unit Textbooks
Textbooks 1
Drozdek, A., 2010. Data Structures and Algorithms in Java. 2nd ed. Cengage Learning.
7. Suggested Readings
Websites
http://ww3.datastructures.net
http://www.itl.nist.gov/div897/sqg/dads/
FRM01_Syllabus_29.11.2012
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
2.1 implement data structures in an executable programming
language in the context of well-defined problems
2.2 i mplement opportunities for error handling and
reporting
2.3 test results to enable comparison with expected results
3.1 explain common string operations and their practical
applications
3.2 demonstrate the outcome of string operations in
specified algorithms.
Page 4
 8. Unit Schedule

Student's task Student's task

Day Session. Chapter Content Category Teacher's Material
before class after class

Assignment 1 - Evaluate, Design, and Implement Data Structures and

Power point slides
1 1. Course Introduction
Solution to Exercises Book
3.1 Singly Linked Lists
Tutorial Text Book Sources codes Data Files for
3.2 Doubly Linked Lists
2 Additional Faculty Files Students
1 3.3 Circular Lists
Data Files for Students

3 Review Exercises/Coach Assignments Tutorial Exercises/Assignment CMS: Forum

Power point slides

4 4.1 Stacks Solution to Exercises Book
4-Stacks and

Algorithms
4.2 Queues Tutorial Text Book Sources codes Data Files for
Queues

2 4.3 Priority Queues Additional Faculty Files Students

5 Data Files for Students

6 Review Exercises/Coach Assignments Tutorial Exercises/Assignment CMS: Forum

5- Recursion

3 5.1 Recursive definition Lecture Text Book Power point slides Book
5.2 Function calls and recursion Solution to Exercises Data Files for
7 implementation Sources codes Students
5.3 Anatomy of a recursive call Additional Faculty Files
5.4 Tail recursion Data Files for Students
8 5.5 Non-tail recursion
5.6 Indirect recursion (*)
5.7 Nested recursion (*)
5.8 Excessive recursion
5.9 Backtracking (*)

FRM01_Syllabus_29.11.2012 Page 5
 9 Review Exercises/Coach Assignments Tutorial Exercises/Assignment CMS: Forum

Power point slides

10 Solution to Exercises Book
9.1 Elementary Sorting Algorithms Lecture Text Book Sources codes Data Files for
4 11 Additional Faculty Files Students
9 - Sorting Data Files for Students

12 Guiding Exercises/Assignment Tutorial Exercises/Assignment CMS: Forum

Power point slides

13 Solution to Exercises Book
9.3 Efficient Sorting Algorithms Lecture Text Book Sources codes Data Files for
5 14 Additional Faculty Files Students
Data Files for Students

15 Guiding Exercises/Assignment Tutorial Exercises/Assignment CMS: Forum

6.1 Trees, Binary Trees, and Binary

Power point slides
16 Search Trees
Solution to Exercises Book
6.2 Implementing Binary Trees
Lecture Text Book Sources codes Data Files for
6 6.3 Binary Search Tree
Additional Faculty Files Students
6.4 Tree Traversal
17 Data Files for Students
6.5 Insertion
6 - Binary Trees

18 Review Exercises/Coach Assignments Tutorial Exercises/Assignment CMS: Forum

19 Power point slides

Solution to Exercises Book
6.6 Deletion
Lecture Text Book Sources codes Data Files for
6.7 Balancing a Tree (*)
7 20 Additional Faculty Files Students
Data Files for Students

21 Review Exercises/Coach Assignments Tutorial Exercises/Assignment CMS: Forum

Power point slides

8 22 Lecture Text Book
Solution to Exercises

FRM01_Syllabus_29.11.2012 Page 6
 6.9 Heaps Sources codes Book
23 6.10 Polish Notation and Expression Additional Faculty Files Data Files for
Trees (*) Data Files for Students Students
24 Review Exercises/Coach Assignments Tutorial Exercises/Assignment CMS: Forum

25
Assessment

9 26 Assignment 1 review Assessment

27

Assignment 2 - String manipulations

Power point slides
28 - Concept overview
Notebook to be Solution to Exercises Notebook to be
- Key-Indexed Counting
Lecture provided by Sources codes provided by
String

- LSD String Sorts

10 29 lecturer Additional Faculty Files lecturer
- MSD String Sorts
Data Files for Students

30 Guiding Exercises/Assignment Tutorial Exercises/Assignment CMS: Forum

Power point slides

31 Notebook to be Solution to Exercises Notebook to be
- Tries
Lecture provided by Sources codes provided by
String

- TrieST API Implementation

11 32 lecturer Additional Faculty Files lecturer
Data Files for Students

33 Guiding Exercises/Assignment Tutorial Exercises/Assignment CMS: Forum

8 - Graph

12 8.1 Graph Representation Lecture Text Book Power point slides Book
34 8.2 Graph Traversals Solution to Exercises Data Files for
8.3 Shortest Paths Sources codes Students
8.4 Cycle Detection Additional Faculty Files
35 8.5 Spanning Trees Data Files for Students
8.11 Graph Coloring

FRM01_Syllabus_29.11.2012 Page 7
 36 Guiding Exercises/Assignment Tutorial Exercises/Assignment CMS: Forum

37

Assessment
13 38 Assignment 2 review Assessment

39

14 40 Feedback
Feedback

FRM01_Syllabus_29.11.2012 Page 8