Teaching Responsibility
LJMU Schools involved in Delivery:
LJMU Partner Taught
Learning Methods
Lecture
Practical
Module Offerings
3100CIT-JAN-PAR
Aims
This module aims to provide students with an introduction to technical computing
and the application of computers in the implementation of simple algorithms. This is
supported by a syllabus which covers the key elements of decision mathematics.
- To introduce the student to the area of computer systems.
- To provide an understanding of the underlying computing platform (hardware, OS, network) upon which applications are developed and hosted.
- To introduce students the key elements of decision mathematics and simple algorithms.
Learning Outcomes
1.
Identify the main components of standard computer hardware architectures, the role of an operating system, the file system, networking and standard hardware interfaces.
2.
Describe the fundamental principles of software, and understand the loading and execution process of the software.
3.
Understand the basic concepts of the algorithm, and know some typical algorithms.
4.
Understand the basic concepts of the data structure, and know some typical data structures.
Module Content
Outline Syllabus:1. Module Overview and Introduction to Computing
• Introduction to Computer Architecture
• CPU Architecture and Multi-core CPUs
• Digital Communication - Buses
• Digital Communication - Networking
2. Fundamental principles of software
• Software - Loading and Execution
• Software - Multi-programming
3. Algorithm overview
• Basic concepts of algorithm, data structure and program
• Algorithm complexity analysis
4. Lists, Stacks and Queues
• Abstract Data Types (ADTs)
• The List ADT
• The Stack ADT
• The Queue ADT
• Applications
5. Trees
• Preliminaries
• Binary Trees
• Tree Traversals
• The Search Tree ADT: Binary Search Trees
• Applications
6. Graph Algorithms
• Definitions
• Representation of Graphs
• Graph Traversals: Depth-First Search and Breadth-First Search Algorithm
• Topological Sort
• Shortest-Path Algorithms: Dijkstra’s Algorithm and Floyd Algorithm
• Minimum Spanning Tree: Prim’s Algorithm and Kruskal’s Algorithm
• Applications
7. Hashing
• General Idea
• Hash Function
• Separate Chaining
• Open Addressing
• Rehashing
• Applications
8. Sorting Algorithm
• Preliminaries
• Insertion Sort: Straight Insertion Sort, Binary Insertion Sort, Shellsort
• Exchange Sort: Bubble Sort, Quicksort
• Selection Sort: Simple Selection Sort, Heapsort
• Mergesort
• Applications
Additional Information:The modules introduces students the basic theory of algorithm and its application to electronics.
Reports are 2000 words maximum word count.