Filter by keyword, subject, or both. Updates live as new model answers are added to our portal.
Computational Algorithms and Paradigms
1,000 words
Computational Algorithm Analysis – Research Paper Algorithm
This individual coursework for the Computational Algorithms and Paradigms module requires students to thoroughly analyse a computational algorithm proposed in a research paper selected from the list of research papers provided on Canvas. The purpose of the assessment is to develop students' ability to understand, explain and critically evaluate computational algorithms presented in academic research. Students must first identify and describe the computational problem addressed by the selected research paper and clearly state the research questions investigated by the authors. They must then extract the main computational algorithm proposed in the paper and present it in pseudocode. The assessment also requires students to clearly identify the inputs required by the algorithm and the outputs produced by it. The coursework consists of six main analytical sections. The first section focuses on the computational problem and research questions addressed in the selected paper. Students are expected to provide an accurate description of the problem and explain the research questions that the proposed algorithm attempts to address. The second section requires the proposed computational algorithm to be represented using suitable pseudocode. The third section identifies and explains the algorithm's inputs and outputs. The fourth section requires students to explain the proposed algorithm using simple and understandable language. The explanation should demonstrate a clear understanding of how the algorithm operates rather than simply reproducing the description provided in the research paper. The fifth section focuses on analysing the time complexity of the proposed algorithm. Students should evaluate the computational cost of the algorithm and explain its time complexity appropriately. The final section requires a critical evaluation of the algorithm's strengths and weaknesses. Students should identify the advantages and limitations of the proposed approach and discuss potential improvements where appropriate. This section should demonstrate critical thinking about the effectiveness, efficiency and practical applicability of the algorithm. The coursework has a total word count requirement of 800–1,000 words. The inputs and outputs, pseudocode and time-complexity analysis sections are excluded from this word-count limit. The template requires approximately 250 words for the computational problem and research questions, approximately 250 words for the simple explanation of the algorithm, and approximately 300 words for the strengths and weaknesses evaluation. Students must report the word count for sections 1, 4 and 6 after completing the assignment. The submitted work must be original and is subject to plagiarism and collusion checks through Turnitin. The assessment brief also states that generative AI tools may be used for proofreading but are not permitted for creating the coursework content. No figures or images are permitted, and the coursework must be submitted using the provided Word template in DOC or DOCX format.
Read Model Answer →
Critical Analysis of Computational Algorithms: Research Paper Evaluation and Complexity Analysis
This postgraduate Computer Science coursework requires students to undertake a critical technical analysis of a computational algorithm presented in a prescribed academic research paper. Students select one paper from the available options and demonstrate that they understand both the research problem addressed by the authors and the algorithmic solution proposed. The assessment contributes 30% of the overall module grade and is completed individually. assignment The available research papers cover several algorithmic topics, including an improved Dijkstra shortest-path algorithm for sparse networks, a modified merge-sort approach for large-scale datasets, parallel merge sort with load balancing, and a Prim-based algorithm for hierarchical clustering. Students must extract the principal algorithm from their selected paper and explain its purpose, inputs, outputs and operating procedure. A major component involves identifying the research question and computational problem addressed by the selected study. Students then reproduce or extract the proposed algorithm in pseudocode form and clearly identify the information supplied to the algorithm and the outputs it generates. The algorithm must also be explained step by step using straightforward language so that its operation can be understood without relying exclusively on formal notation. The coursework further requires a detailed time-complexity analysis, demonstrating understanding of how computational requirements grow with input size and how the proposed technique compares with alternative or conventional approaches. Students must critically evaluate the algorithm’s strengths, weaknesses, performance characteristics and limitations, and suggest potential improvements where appropriate. The marking rubric gives substantial emphasis to five areas: identifying the computational problem and research questions, extracting the proposed algorithm, identifying inputs and outputs, explaining the algorithm clearly, analysing its time complexity, and critically evaluating its strengths and weaknesses. assignment The written submission must be 800–1,000 words, although the inputs/outputs, pseudocode and time-complexity sections are excluded from that limit. Figures and images are not permitted, and the work must be submitted using the prescribed coursework template in DOC/DOCX format. Overview word count: approximately 340 words. AI-use note: the guideline permits generative AI only for proofreading. AI tools are explicitly not permitted to create the assessed work itself. assignment
Read Model Answer →
Computer Science / Algorithms / Computational Complexity
Modified Merge Sort for Large-Scale Data: Algorithm Analysis, Complexity and Evaluation
This Computational Algorithms and Paradigms assignment critically examines a modified merge sort algorithm designed for large-scale datasets. The work focuses on the computational problem of sorting very large collections of data efficiently while preserving the stability and predictable complexity associated with classical merge sort. The analysed approach replaces recursive processing with an iterative successive-merging strategy intended to reduce stack overhead and improve practical performance on large datasets. Dubba ramesh(up) The first section identifies the underlying computational problem and frames the main research questions. These include how standard merge sort can be modified to improve large-scale performance, whether recursion can be replaced with a non-recursive iterative process, whether the proposed double-merge technique reduces resource consumption, and how its computational performance compares with classical merge sort. Dubba ramesh(up) A technical section then reconstructs the algorithm in pseudocode. The modified process begins with subsequences of size one and repeatedly merges adjacent sorted subsequences, doubling the merge size after each iteration until the entire dataset is sorted. This bottom-up approach removes the recursive decomposition used in conventional merge sort. Dubba ramesh(up) The assignment also identifies the algorithm's principal inputs and outputs. Inputs include the dataset, number of elements, subsequence boundaries and temporary storage required during merging. The resulting output is a fully sorted and stable sequence. Dubba ramesh(up) Complexity analysis shows that the modified algorithm processes approximately n elements across log₂(n) merging levels, resulting in O(n log n) time complexity in both best and worst cases. Because an auxiliary array is used during merging, the reported space complexity is O(n). Dubba ramesh(up) The final critical evaluation highlights the main benefits of the modified approach, including removal of recursive-call overhead, greater stability when processing very large datasets, predictable performance and preservation of merge-sort stability. Its main limitation is the continued requirement for auxiliary memory during the merge operation. The work also notes that the performance advantages are most relevant for large-scale datasets and may be less significant for smaller inputs. Dubba ramesh(up) Overall, the assignment integrates algorithm interpretation, pseudocode extraction, input-output analysis, complexity analysis and critical evaluation within the context of large-scale sorting. Note: this upload appears to be the completed student response rather than the original assessment brief, so the referencing style and exact formal overall word limit are not stated. I would leave the reference-style field as Not specified unless you also upload the official 7COM1078 guideline.
Read Model Answer →
Cyber Security / Applied Cryptography / Secure Systems Design
2,500 words
Secure Property Contract Exchange: Cryptographic Protocol Design, Threat Modelling and Post-Quantum Readiness
This Applied Theory of Cyber Security and Secure Design coursework places students in the role of a cyber security consultant engaged by Hackit & Run LLP, a legal firm specialising in UK and international property transactions. The firm wishes to implement a secure digital system for handling, exchanging and legally signing property contracts. Students must design and evaluate a secure communication protocol supporting interactions between the buyer’s solicitor, the seller’s solicitor and the buyer while addressing both first-time communications and previously established secure relationships. 11b17febb9eeb4570f76f6ca95a831a… Section A – Cryptographic Protocol Design, worth 45%, requires a complete secure communication protocol. Students must explain how trust is initially established, how later communications can be simplified without weakening confidentiality, integrity or availability, and how the buyer can digitally sign a contract in a manner enforceable under UK law. The design must justify specific cryptographic algorithms for functions such as key exchange, bulk encryption, digital signatures and hashing. The protocol must be presented through both a sequence diagram showing message flows and cryptographic operations and pseudocode explaining the key algorithmic stages. 11b17febb9eeb4570f76f6ca95a831a… Section B – Threat Modelling, worth 20%, requires a focused analysis using the STRIDE methodology. Students identify three realistic threats from different STRIDE categories and analyse the attack vector, asset at risk and potential effect on the legal transaction. Each threat must then be connected back to specific protocol defences, with residual risks acknowledged where controls cannot provide complete mitigation. The guidance encourages consideration of issues such as social engineering, insider threats, key-management failures and availability risks in addition to purely cryptographic attacks. 11b17febb9eeb4570f76f6ca95a831a… Section C – Security Evaluation Against Standards, worth 15%, requires students to evaluate the proposed system against a recognised cybersecurity standard or framework. Options include ISO/IEC 27001:2022, Common Criteria (ISO/IEC 15408) and the OWASP Application Security Verification Standard. Students select three or four directly relevant controls or requirements, assess whether the proposed design satisfies them, identify gaps and recommend specific improvements. 11b17febb9eeb4570f76f6ca95a831a… Section D – Post-Quantum Readiness and Critical Reflection, worth 15%, examines how a future quantum-capable adversary could affect the protocol. Students identify vulnerable cryptographic components, discuss the NIST Post-Quantum Cryptography standardisation programme, and examine replacement algorithms such as ML-KEM for key establishment and ML-DSA for digital signatures. They must also evaluate a hybrid migration strategy combining classical and post-quantum algorithms, considering performance overhead, backward compatibility and the legal admissibility of post-quantum digital signatures. 11b17febb9eeb4570f76f6ca95a831a… The remaining 5% evaluates professional report quality, logical structure, technical language, integration of diagrams and consistent CUHarvard referencing. Higher-quality work is expected to demonstrate a sophisticated trust model, clear traceability between threats and controls, precise standards mapping, practical security recommendations and well-evidenced analysis of post-quantum migration. 11b17febb9eeb4570f76f6ca95a831a… Important for the public Reference Library: the brief states that the assessment document is intended only for Coventry University Group students and must not be passed to third parties or posted on any website. Therefore, publish only an original high-level description such as the overview above; do not upload or reproduce the original assignment brief publicly. 11b17febb9eeb4570f76f6ca95a831a…
Read Model Answer →
Cryptography
2,500 words
Cryptography – Secure Land Transaction Contract Exchange Protocol
This 2,500-word Cryptography coursework for Coventry University examines the design of a secure communication protocol for the remote exchange and signing of legal property transaction contracts. The assignment is based on a scenario involving Hackit & Run LLP (H&R), a firm of solicitors specialising in property transactions in the UK and overseas. Because property transactions are increasingly conducted through remote communications, H&R intends to establish a comprehensive system for secure document handling, exchange and digital signing that complies with legal requirements and remains enforceable under UK law. The scenario concerns a land transaction between Mrs. Harvey, the buyer, and Mr L.M. Facey, the seller. Students must devise a communication protocol involving three parties: H&R, the seller’s solicitor and Mrs. Harvey. H&R communicates with the seller through the seller’s solicitor rather than directly with the seller. The seller’s solicitor sends the contract to H&R, H&R forwards it to Mrs. Harvey, Mrs. Harvey digitally signs the contract and returns it to H&R, and H&R then sends the signed contract to the seller’s solicitor. The assignment requires students to consider two communication scenarios between H&R and the seller’s solicitor: a situation where the two parties have previously communicated securely and a situation where they are communicating securely for the first time. Students must identify suitable encryption algorithms for the different stages of the contract exchange protocol and justify their algorithm choices. The work should demonstrate an understanding of appropriate cryptographic approaches for maintaining confidentiality, integrity and availability during secure communication. Students must clearly illustrate their proposed protocol using suitable graphics and pseudocode. A full functioning implementation using a programming language may be provided as a higher-level approach. The report must identify the strengths and limitations of the proposed protocol and discuss the findings. This requires students to connect cryptographic theory with a practical security protocol designed for a real-world legal transaction. The coursework assesses knowledge of modern cryptography, including symmetric-key cryptography, key exchange, asymmetric cryptography, digital signatures, digital certificates and authentication. Students are also expected to model, test and assess the suitability of cryptographic protocols and algorithms for different practical requirements and critically evaluate current research and technological developments in cryptography and its applications. The final submission is a written report of 2,500 words, excluding appendices and tables, with properly formatted references. The assignment is categorised as a report and is a normal coursework attempt. The brief does not specify a particular referencing style or academic level, so these fields should not be guessed when entering the assignment into the Reference Library.
Read Model Answer →
Cryptography
2,500 words
Cryptography – Secure Contract Exchange Protocol
This 2,500-word Cryptography assignment for Coventry University examines the design of a secure communication protocol for the digital exchange and signing of property contracts. The scenario is based on Lauren Order & Cashgrab LLP (LO&C), a UK and overseas property law firm seeking to establish a comprehensive document handling, exchange and signing system that supports remote property transactions while remaining consistent with legal requirements and enforceable under UK law. The assignment requires students to consider the exchange of contracts using the extended CIA model and to devise a secure communication protocol involving three parties: LO&C, the buyer's solicitor Hackit & Run (H&R), and the seller. The scenario specifies that LO&C communicates with the buyer through H&R, that LO&C and the seller collaborate on initial contract drafts, and that LO&C prepares and sends the final contract to the seller for approval and digital signing before forwarding the signed contract to H&R for the buyer's signature. LO&C and H&R have an existing secure communication relationship. A central requirement is the identification and justification of suitable encryption algorithms for the different stages of the contract exchange protocol. Students may select algorithms covered in lectures or undertake additional research to identify alternative algorithms. The report must explain why particular algorithms are appropriate at different stages of the protocol and demonstrate how the selected cryptographic techniques address the practical security requirements of the scenario. The protocol must be clearly illustrated using suitable graphics and pseudocode, with functioning code being an optional higher-level approach. Students are required to identify the strengths and limitations of their proposed protocol and discuss their findings. The assignment therefore combines theoretical knowledge of modern cryptography with practical protocol design and evaluation. Generative AI may be used to create suitable code where permitted, but students must demonstrate their understanding of the code. The assessed learning outcomes cover modern cryptographic concepts and techniques, including symmetric-key cryptography, key exchange, asymmetric cryptography, digital signatures, digital certificates and authentication. Students are also expected to model, test and assess the suitability of cryptographic protocols and algorithms for practical requirements and critically evaluate current research and technological developments in cryptography and its applications.
Read Model Answer →