Scribd
Upload
52 views4 pages

Unit-2 ASM1 Guide

1) The document provides guidelines for completing an assignment on algorithms including defining algorithms, outlining the programming process, and demonstrating a menu-based program. 2) Students are asked to choose a simple business problem, analyze and design a solution using methods like flowcharts, and demonstrate compiling and running a menu-based program to solve the problem. 3) The assignment must meet learning outcomes of defining algorithms, outlining the programming application process, determining steps from writing code to execution, and examining algorithm implementation in a programming language.

Uploaded by

Le Tran Quoc Bao (BTEC DN)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
52 views4 pages

Unit-2 ASM1 Guide

1) The document provides guidelines for completing an assignment on algorithms including defining algorithms, outlining the programming process, and demonstrating a menu-based program. 2) Students are asked to choose a simple business problem, analyze and design a solution using methods like flowcharts, and demonstrate compiling and running a menu-based program to solve the problem. 3) The assignment must meet learning outcomes of defining algorithms, outlining the programming application process, determining steps from writing code to execution, and examining algorithm implementation in a programming language.

Uploaded by

Le Tran Quoc Bao (BTEC DN)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Assignment 1 guide

Assignment report structure:

- Complete and fill all required data in the Front page with scan digital
signature.
o Table of contents
o List of Figures
o List of Tables
For evaluators

General requirements while evaluating assignments:

- According to the template sent by BTEC (teachers could provide it if


needed)
- The assignments must contain Front-sheet, References, check plagiarism
(<20%)
- Stick to the learning outcomes described in the Assignment Brief
- The assignments must submit according to the deadline. In case of late
submission, the lecturer has the right to refuse the evaluation
- To give the student a D rating, the lecturer must use words that express
strong feelings about that student's assignment.

Scenario: You have applied for a post as a trainee with a software development
company and have been invited for an interview. You have been asked to
demonstrate your problem solving and basic programming skills. To do this you
have to prepare a report on using algorithms to solve problems.

You need to explain, using examples, how algorithms are used to solve simple
business problems and the steps needed to be followed to produce a working
program solution. You should make clear your assumption about your program.
The problems to be solved will involve basic procedural programming instructions
- sequence instructions (input, output and assignment statements), loops,
conditional statements. Problems should be analysed and designed by the use of
flowchart and demonstrated by the use of modules (procedures) using a menu
based program.

Tasks:
1. State your simple business problems to be solved.
2. Analyse the problem and design the solutions by the use of suitable
methods.
3. Demonstrate the compilation and running of a menu-based program
4. Evaluate how the problem is solved from the designed algorithm to the
execution program written by a specific programming language.

LO1: Define basic algorithms to carry out an operation and outline the
process of programming an application
1. Provide a definition of what an algorithm is and outline the process in
building an application (P1)
1.1 Definition of algorithm:
- Definition of algorithm.
- Give an example of algorithms in real life:
1.2 Ways to demonstrate algorithms
+ State 2 ways of expressing the algorithm and give examples
- The first way: Using Pseudocode.( Nêu định nghĩa, ví dụ)
- The second way: Using flowchart . ( Nêu định nghĩa, ví dụ: 2 ví dụ)
1.3 Characteristic of Algorithms

- Finiteness: An algorithm should have finite number of steps and it should end
after a finite time.
- Input: An algorithm may have many inputs or no inputs at all.
- Output: It should result at least one output.
- Definiteness: Each step must be clear, well-defined and precise. There should be
no any ambiguity.
- Effectiveness: Each step must be simple and should take a finite amount of time
- Nêu ưu và nhược điểm của thuật toán
Các bước để viết một thuật toán tốt
Đưa ra ví dụ:

1.4 Steps in program development

Step 1: Analyze and define the problem


Step 2: Create a solution (give an algorithm)
Step 3: Program design
Step 4: Code program
Step 5: Debugging the program
Step 6: Testing
Step 7: Deployment and maintenance
Đưa ra ví dụ (có code)
2. Determine the steps taken from writing code to execute. (M1)
Sinh viên xác định bài toán thực hiện: Ví dụ chương trình quản lý sách, quản
lý Nhân Viên…
Bước 1: Xác định nội dung bài toán
Bước 2: Vẽ sơ đồ chức năng của chương trình (sử dụng sơ đồ Flowchart)
Bước 3: Code chương trình
Bước 4: Thực hiện debug lỗi
Bước 5: Chạy chương trình
Ví dụ:
Xây dựng chương trình quản lý điểm sinh viên gồm các chức năng:
1. Nhập điểm: Toán, Văn , Anh
2. Xuất điểm
3. Tính điểm trung bình
4. Tìm điểm lớn nhất
5. Xếp loại
6. Thoát
3. Examine the implementation of an algorithm in a suitable language.
Evaluate the relationship between the written algorithm and the code variant.
( D1)
+ Nêu ví dụ về một bài toán cụ thể (chương trình quản lý sách, quản lý Nhân
Viên…)
- Trình bày thuật toán và viết mã chương trình.
- Đánh giá mối quan hệ giữa thuật toán và mã chương trình.

You might also like