- Title: Computer Systems and Algorithms
Please see p. 3 of this document for report instructions.
Your report should have the following structure:
- Task One
- Task Two
- Task Three
- List of References (APA style)
- Word Count:
The word count is 1500. Refer to the Module Handbook for guidelines on word counts. Please note that writing/code in screenshots does not count towards the final word count.
As stated in the Module Handbook, the report format should comprise the following:
- Include a title page with your assessment number, title of your work, word count, module title and code and name of module tutor.
- Include a footer and header with student assessment number, module title and code.
- Word-processed work must use:
- 5-line spacing
- Arial (Body) font style
- Font size 12
- Standard margins
- All references should be constructed using the APA referencing system. APA Reference Guide and Information can be found here:
- It is expected that your writing will conform to Standard English in terms of spelling, syntax and grammar.
- Use impersonal academic style, e.g., avoid using the first person such as I, me and in my opinion.
- Learning outcomes assessed:
LO4: Develop a basic understanding of key algorithms used for sorting and searching, and to assess their computational complexity. This will include an introduction to formal languages used to describe algorithms.
LO5: Understand key web technologies such as website creation and hosting, with an introduction to using HTML & CSS. This will also include an introduction to networking and various protocols used to transport data around networks.
LO6: Understand Boolean Logic and its uses in Computing. This will include logic gates within computer systems and their role in performing logical operations and will also include Boolean algebra.
- Submission procedure
The assignment must be submitted electronically to the assigned Turnitin submission inbox on the Moodle module page via the University of Chester Portal before 1pm on the day that it is due.
Any late submissions will result in a 5 mark deduction per 24 hours (or part thereof).
Submissions must consist of .pdf or Word (.doc or .docx) files, or PowerPoint (.ppt or .pptx) for presentations. If you have problems uploading, it is advised that you save the final piece as a .pdf and submit the .pdf to Turnitin.
Submissions in the wrong file type will not be processed or marked. If Turnitin does not accept your submission because it is the wrong file type, this will not be an acceptable reason for mitigation (Section 7.3 of the Assessment Regulations).
You are a technical intern at a large web-based organisation that provides a popular search engine, web hosting and cloud storage solutions. Part of your role is to advise management on the technical side of the organisation, and suggest improvements that could improve efficiency.
|Task 1: Key Algorithms and complexity||L04|
The organisation returns search results in an unordered fashion, and they would like to provide a function which automatically sorts the website names alphabetically.
Your task is to choose four sorting algorithms, and then decide on one which is the most efficient. You should discuss how they sort data, their time and space complexity and provide a step-by-step run through of how an unordered array of strings is sorted by the algorithm.
You should use an array of 16 unordered strings to test your algorithm, and use the same strings for each algorithm. You should refer to published research throughout.
|Task 2: Website technologies and HTML||L05|
The organisation wants to provide a simple web page to explain the new sorting feature which sorts search results alphabetically. Your task is to design a simple webpage using HTML and CSS. The webpage should have a clean design, with appropriate text and colours, and use a wide variety of tags and features to show your HTML and CSS fluency.
You may choose a fictional organisation name for the purposes of this task. You need to provide evidence of your code, and evidence of the finished webpage.
Evidence must be submitted in the form of screenshots attached to your coursework. Do not directly copy code into your report.
|Task 3: Boolean Logic||L06|
You have also been asked to prepare a small report for new members of the technical team on the topic of logic gates in computer systems; they are interested in how logic gates can be used in sequence to create new circuits.
Show how the logic gates ‘XOR’, ‘XNOR’ and ‘NAND’ can be created by combining the logic gates ‘AND’, ‘OR’ and ‘NOT’. You should provide a visual diagram and explanation for each new circuit to justify your design. You may also Boolean algebra to back up your argument