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 →
Computing Science
Writing a Literature Review in Computing Science
This individual assessment requires students to write a concise literature review on a selected topic within computing science. The review should be no more than six pages in length and should be written in a style appropriate for a general computing science audience. The assignment is designed to demonstrate technical knowledge, independent learning, effective written communication and professionalism in producing a concise technical document. Students must select a research topic from one of five permitted areas: algorithmic bias and fairness, a data science application, quantum computing, the Internet of Things (IoT), or the use of artificial intelligence in cybersecurity. Possible topics include how algorithms can discriminate and techniques for detecting and correcting algorithmic bias, applications of data science in areas such as agriculture or healthcare, quantum computing algorithms and hardware, technical IoT problems and potential solutions, and the use of AI for cybersecurity threat detection and prevention. The literature review must contain several required components. The first page should contain only the title, student number, abstract and statement of AI usage. The abstract must provide a concise overview of the review and must not exceed 200 words. The report should also include an introduction that provides broad background information before narrowing the discussion to the selected research topic. The introduction should explain why the topic is important and provide relevant context and examples of applications. Students are expected to review a range of relevant literature, including theories, methods, techniques, ethical concerns or tools where appropriate. The selected literature should not simply be described individually; instead, students must synthesise the sources to identify important themes, findings and areas of interest and provide a critical review of the literature. The conclusion should summarise the main findings, identify open issues and discuss possible future directions. The assessment must include a bibliography with accurate and up-to-date references formatted using Harvard style. The final document may be prepared in LaTeX or Word but must use one of the provided templates and be submitted as a PDF through Blackboard. The complete review, including figures and bibliography, must not exceed six pages. The assessment is marked according to structure, sources and their description, synthesis and critical review, and presentation.
Read Model Answer →
Computer Science / Algorithms / Parallel Computing / Clustering
Parallel Algorithms for Hierarchical Clustering: Single-Link, Minimum Spanning Trees and Parallel Architectures
This research paper investigates parallel algorithms for hierarchical clustering, a clustering technique in which individual data points initially form separate clusters and the closest clusters are repeatedly merged until a hierarchical tree structure, or dendrogram, is formed. The paper reviews important sequential clustering algorithms, surveys previous parallel approaches and proposes parallel methods for several commonly used inter-cluster distance metrics. Prims_algorithm_for_hierarchica… The paper distinguishes between graph-based metrics and geometric metrics. Graph metrics include single-link, average-link and complete-link clustering, while geometric metrics include centroid, median and minimum-variance methods. It also discusses the Lance–Williams updating formula, which provides a general framework for updating inter-cluster distances after agglomeration. Prims_algorithm_for_hierarchica… Prims_algorithm_for_hierarchica… A major focus is the relationship between single-link hierarchical clustering and the Euclidean minimum spanning tree. The paper explains that the cluster hierarchy for single-link clustering can be obtained from a minimum spanning tree, making minimum-spanning-tree algorithms highly relevant to efficient hierarchical clustering. It presents practical single-link algorithms with O(n²) time complexity and discusses space requirements and nearest-neighbour update properties. Prims_algorithm_for_hierarchica… Prims_algorithm_for_hierarchica… The paper also examines algorithms for metrics satisfying the reducibility property, where nearest-neighbour chains can be used to efficiently determine which clusters to merge. Minimum-variance and graph-based metrics satisfy this property, while centroid and median metrics do not necessarily do so. Prims_algorithm_for_hierarchica… Prims_algorithm_for_hierarchica… For more general clustering metrics, the paper describes priority-queue-based algorithms with O(n² log n) sequential time complexity. It then reviews previous parallel work, including parallel implementations of SLINK, Ward’s method and Prim’s minimum spanning tree algorithm. The cited parallel Prim implementation achieves O(n log n) time when sufficient processors are available. Prims_algorithm_for_hierarchica… Prims_algorithm_for_hierarchica… The core contribution is a set of parallel algorithms for hierarchical clustering on PRAM, butterfly and tree architectures. For single-link clustering, the paper shows how a parallel minimum-spanning-tree approach can be used and reports an O(n log n) running time using n/log n processors. Similar optimal results are described for centroid, median and minimum-variance clustering, while average-link and complete-link methods are more difficult to optimise on local-memory architectures. Prims_algorithm_for_hierarchica… Prims_algorithm_for_hierarchica… Prims_algorithm_for_hierarchica… Overall, the paper demonstrates how hierarchical clustering can be accelerated through parallel computation while preserving the computational structure of different clustering metrics. Its main themes include minimum spanning trees, Prim’s algorithm, single-link clustering, nearest-neighbour methods, PRAM computation, parallel data structures and asymptotic complexity analysis. Prims_algorithm_for_hierarchica… Important: because this file is a journal research paper rather than a university assessment brief, fields such as module name, academic level, assignment type and formal word count do not genuinely apply.
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 / Network Optimisation
An Improved Dijkstra’s Shortest Path Algorithm for Sparse Networks
This technical research paper investigates an improved version of Dijkstra’s shortest path algorithm for sparse weighted networks. Traditional implementations of Dijkstra’s algorithm can achieve a time complexity of O(m + n log n) when Fibonacci heaps are used, but the authors argue that heap construction increases implementation complexity. The proposed approach modifies the original algorithm so that heap construction is avoided while maintaining competitive performance on sparse graphs. An_improved_Dijkstra’s_shortest… The study focuses on the single-source shortest path problem in weighted directed graphs with non-negative edge lengths. It begins by reviewing a refined Dijkstra algorithm in which each vertex maintains a distance label representing an upper bound on the shortest distance from the source vertex. The main computational bottleneck is repeatedly identifying the unvisited vertex with the smallest distance label. A naïve implementation requires O(n²) time, while Fibonacci-heap implementations improve efficiency but introduce additional implementation complexity. An_improved_Dijkstra’s_shortest… An_improved_Dijkstra’s_shortest… The authors propose an improved Dijkstra algorithm that maintains distance labels in an ordered list. When a distance label changes, the corresponding entry is reinserted into the appropriate location rather than rebuilding or maintaining a heap. The algorithm exploits the characteristics of sparse networks, where each vertex is connected to only a relatively small number of edges. This is particularly relevant to road networks, where the maximum degree of each node is typically low. An_improved_Dijkstra’s_shortest… To support efficient reinsertion, the paper introduces a predefined step-size vector and a binary-search-style process for locating the correct insertion position. This approach reduces the number of comparisons required while avoiding the division operations commonly associated with standard binary search implementations. An_improved_Dijkstra’s_shortest… An_improved_Dijkstra’s_shortest… The theoretical analysis shows that the proposed method requires approximately O(m + Dmax log(n!)) comparisons and arithmetic operations, where m represents the number of edges and Dmax is the maximum number of edges incident on a vertex. The authors argue that this complexity makes the approach especially suitable for large-scale sparse networks where the maximum node degree remains relatively small. An_improved_Dijkstra’s_shortest… An_improved_Dijkstra’s_shortest… The algorithm is evaluated through numerical experiments implemented in MATLAB. Two families of randomly generated sparse networks are tested, with network sizes ranging from approximately 10,000 to 21,000 nodes. The first experiment uses a maximum node degree of four, while the second uses a maximum degree of six. Experimental ratios reported in the paper remain close to the theoretical complexity estimate as network size increases. An_improved_Dijkstra’s_shortest… The paper concludes that the improved Dijkstra approach is practical for large sparse networks, particularly road-traffic networks. By avoiding Fibonacci-heap construction and using an ordered-list reinsertion strategy, the algorithm aims to simplify implementation while maintaining competitive computational performance for shortest-path calculations. An_improved_Dijkstra’s_shortest… Important: because this is a published journal article rather than a university assignment brief, fields such as module name, assessment level and assignment word count are not stated in the source. For the portal, it is safer to use Not specified / Not applicable for those fields rather than inventing academic-assessment details.
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 →
Computer Science / Parallel Computing
Parallel Merge Sort with Load Balancing
This technical research article investigates the performance limitations of conventional parallel merge sort and proposes a load-balanced alternative designed to improve processor utilisation in distributed-memory parallel computing systems. Traditional parallel merge sort progressively reduces the number of active processors during successive merge stages, causing many processors to remain idle and reducing the performance benefits of parallelisation. The proposed approach addresses this limitation by ensuring that all processors continue participating throughout the merging process. Parallel_Merge_Sort_with_Load_B… The paper first explains the conventional parallel merge-sort process, in which data are locally sorted before processors are paired for a series of merging operations. At every subsequent stage, the number of participating processors is halved until only one processor remains responsible for the final merged list. This results in poor processor utilisation and increasing workload concentration. Parallel_Merge_Sort_with_Load_B… The proposed load-balanced parallel merge sort distributes each partially sorted list across multiple processors so that every processor maintains approximately the same number of keys throughout execution. Processor groups use histograms and boundary values to determine how data should be redistributed during merging. Histogram-based partitioning reduces unnecessary data movement, while an index-swapping mechanism is introduced to avoid transferring large blocks of keys when logical processor reassignment can achieve the same result more efficiently. Parallel_Merge_Sort_with_Load_B… Parallel_Merge_Sort_with_Load_B… The algorithm was implemented in C using MPI and experimentally evaluated on a Cray T3E parallel computer and an eight-node PC cluster. Testing considered both uniform and Gaussian key distributions. Results show that performance improvements increase as processor count grows, although communication and histogram-management overhead can reduce benefits for small workloads. Parallel_Merge_Sort_with_Load_B… The proposed technique achieved a maximum merge-phase speedup of 9.6 on a 32-processor Cray T3E and 2.3 on an eight-node PC cluster when processing four million keys. The study concludes that distributing approximately equal workloads across processors can substantially improve parallel merge performance and may also be applicable to related parallel sorting algorithms. Parallel_Merge_Sort_with_Load_B… Overview word count: approximately 330 words. For your portal, I would not label this as university coursework unless you also have the actual assessment brief that uses this paper. This PDF itself only establishes a published academic paper and the authors’ Korea University affiliation.
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 →
Computer Networks / Network Security / Cloud and Software Defined Networking
3,500 words
Network Systems and Security: Ad Hoc, Cloud and Software Defined Networking Emulation
This Network Systems and Security coursework requires students to design, implement and critically evaluate a series of practical network-emulation environments covering wireless Ad Hoc networking, cloud services and Software Defined Networking (SDN). The project combines Python-based network configuration with practical connectivity testing, cloud deployment, controller-based networking and theoretical evaluation of contemporary network-security technologies. The first task involves designing an Ad Hoc wireless network representing an emergency-response scenario. Students configure at least three wireless stations using Mininet-WiFi, assign appropriate network parameters and demonstrate connectivity through ICMP communication. The task requires discussion of the design and implementation together with the Python script used to configure the emulated environment. 7COM1076+ref+def+CW+2025+26+ The second task focuses on cloud-service emulation. Students develop a simple static website, deploy it through Render.com and GitHub, and access the hosted service from a Mininet-emulated network. Required evidence includes the Python implementation, cloud configuration screenshots, commands used to provide internet connectivity, webpage access through an xterm environment and the associated HTML code. 7COM1076+ref+def+CW+2025+26+ The third practical component examines Software Defined Networking using the ONOS controller. Students construct an emulated topology containing hosts, servers and programmable switches, demonstrate complete ICMP connectivity and perform a TCP transmission lasting 600 seconds. Evidence must include the network-emulation script, ONOS graphical interface and connectivity results. 7COM1076+ref+def+CW+2025+26+ The final analytical section critically evaluates whether Software Defined Networking and Network Functions Virtualisation (NFV) complement one another and examines security algorithms used within cloud computing. Students compare two selected cryptographic approaches, evaluating their respective advantages and disadvantages. 7COM1076+ref+def+CW+2025+26+ Overall, the coursework integrates network modelling, wireless networking, cloud deployment, SDN control, Python scripting, connectivity testing and security analysis. The marking scheme gives substantial weight to system modelling, cloud and SDN implementation, ICMP/TCP functionality, technical analysis and overall report quality. 7COM1076+ref+def+CW+2025+26+
Read Model Answer →
Machine Learning / Cloud Computing / Artificial Intelligence
4,004 words
Cloud-Based Machine Learning for Financial Fraud Detection
This Machine Learning on Cloud assessment requires students to design, implement and critically evaluate a cloud-oriented machine-learning solution for financial fraud detection. Working as a group, students address a scenario in which a financial-services organisation requires an automated model capable of detecting fraudulent transactions, reducing financial losses and improving customer security. The project combines machine-learning development with critical evaluation of cloud infrastructure, data preparation, model performance and responsible AI considerations. NUL - LD7187 -Assessment Brief … The project begins with a cloud feasibility study comparing at least two major machine-learning platforms such as Microsoft Azure, Amazon Web Services and Google Cloud Platform. Students evaluate factors including performance, scalability, cost, compliance, system integration and vendor lock-in before providing a justified recommendation. The project then moves into Exploratory Data Analysis, where patterns, anomalies and correlations within the fraud dataset are investigated using visualisations such as heatmaps, histograms and boxplots. NUL - LD7187 -Assessment Brief … A substantial part of the assessment focuses on data preprocessing and class imbalance. Students are expected to clean and transform the dataset, apply scaling and encoding, perform feature engineering and investigate techniques such as SMOTE, undersampling and cost-sensitive learning. These decisions must be justified in terms of their potential effect on predictive performance. NUL - LD7187 -Assessment Brief … Students must then select and train at least two machine-learning models. Suggested algorithms include Logistic Regression, Random Forest, XGBoost and Neural Networks. Appropriate cross-validation and hyperparameter-tuning procedures should be applied, followed by systematic evaluation using precision, recall, F1-score, AUC and precision-recall curves. Supporting visualisations should include confusion matrices, ROC curves and feature-importance analysis. NUL - LD7187 -Assessment Brief … The final component addresses professionalism and ethics in cloud-based AI, including bias, fairness, transparency, data privacy and environmental sustainability. Overall, the project integrates cloud-platform selection, exploratory analytics, preprocessing, imbalanced-data handling, predictive modelling, model evaluation and ethical AI into an applied financial fraud-detection solution. NUL - LD7187 -Assessment Brief … Note: the uploaded brief does not explicitly name a referencing system. If your portal requires a selection, I would use Not specified rather than assume Harvard.
Read Model Answer →
Applied Data Science
500 words
Critique of a Data Science Book and Selected Chapter
This assignment requires students to critically evaluate a selected data science book and a specific chapter from that book. Students must choose one book from the list provided in the assignment, read the preface or introduction to understand the intended audience, and then select a chapter that is relevant to their interests, existing knowledge and learning objectives. The available books cover a range of data science and analytical subjects, including practical time series analysis, machine learning with Python, Python-based data science, technical analysis, Bayesian statistics and artificial intelligence applications. The main purpose of the assignment is to develop the student's ability to engage critically with technical literature rather than simply summarising its content. The critique should identify the selected book and its intended audience, clearly state the chosen chapter and explain the reasons for selecting it. Students are expected to consider what they hoped to learn from the selected material and then critically assess whether the chapter achieved these objectives. The assessment should consider the clarity, usefulness and accessibility of the material, as well as the extent to which it contributes to the student's understanding of data science concepts. Students should also discuss additional knowledge they would like to gain from the book and identify particular aspects that were either helpful or less useful. This may include the quality of explanations, examples, technical depth, practical applications, organisation of material and relevance to the student's existing knowledge. The critique should demonstrate engagement with the selected chapter and provide reasoned observations rather than simply describing what the author has written. The final submission is a 500-word critique with a permitted variation of plus or minus 10 percent, meaning the expected range is approximately 450–550 words. The text must be written as a continuous narrative and should not use subheadings for the individual assessment points. The headline should follow the format “Critique of <book title> by <book author>”, with the student's name and student ID as the subtitle. The assignment assesses both technical presentation and content, including grammar, writing style, word count, completeness, breadth and depth of the book assessment, critical analysis and evidence of engagement with the selected material. Students must submit text that can be processed by Turnitin.
Read Model Answer →
Data Mining
Data Mining – Classification, Model Optimisation and Evaluation
This individual Data Mining assignment requires students to apply the techniques covered in the module using the WEKA data mining platform. The assessment is worth 40% and focuses on practical application of machine learning and data mining methods, requiring students to configure algorithms, analyse datasets, optimise model parameters, evaluate classification performance and explain their technical choices and results. The assignment also assesses the ability to critically evaluate different algorithms and models of data mining. The assignment includes several tasks covering different stages of the data mining process. Students are required to work with supplied datasets and use appropriate preprocessing and classification techniques. The datasets include a balanced screenshot dataset containing processed screenshots classified into categories such as "Okay" and "Bad", where the objective is to train a model capable of identifying inappropriate content. The data has been processed using PCA to provide a smaller four-dimensional representation while protecting privacy and reducing the size of the data. Another supplied dataset concerns furniture reviews, containing positive ("pos") and negative ("neg") written feedback, with the objective of building a model that can determine whether a furniture review belongs to either class. The assessment evaluates students' ability to understand and describe the datasets, including the number of instances, number of columns, data types and relevant statistical information. For text-based data, students must apply appropriate vectorisation and describe the resulting dataset characteristics. Students must also consider class imbalance and apply an appropriate method where necessary, explaining how the chosen approach affects the distribution of instances between the classes. A significant component of the assignment involves classification algorithms and parameter optimisation. The assessment requires students to work with algorithms including Naive Bayes, LibSVM and J48. Students must investigate appropriate parameters and perform parameter searches or fine grid searches to identify suitable configurations. They must explain the selected parameters, their impact on the model and the reasoning behind the chosen values. Model performance must be evaluated using appropriate validation techniques, including cross-validation. Students are required to compare the algorithms using results such as overall accuracy and confusion matrices. The assignment expects students to identify an appropriate or best-performing algorithm in the context of the dataset and to provide a clear explanation of the comparison rather than simply reporting numerical results. The rubric places emphasis on accurate configuration, clear explanation of parameter choices, dataset analysis, class-balance treatment, parameter optimisation, cross-validation and critical comparison of algorithm strengths and weaknesses. High-quality work should explain both the technical process and the implications of the results, with results presented clearly through appropriate tables, confusion matrices and graphical outputs where required. The submission must be a single PDF document containing the report and must not exceed 10 pages. Students are instructed to include their student ID at the beginning of the report but not their name or other identifying details so that marking remains anonymous. Screenshots are specifically required to demonstrate use of the student's ID number as the random seed; other WEKA results should be presented in the student's own tables or result formats. The brief also states that no research beyond the material covered in the module is required and therefore no citations or reference list are required. The assignment explicitly prohibits the use of Generative AI tools for creating content and prohibits using GenAI tools or proofreading services for proofreading. Students are expected to complete the practical work themselves and explain their own technical choices and results.
Read Model Answer →
Programming for Data Science
2,500 words
Individual Coursework – Programming for Data Science
This Individual Coursework assignment for the Programming for Data Science module requires students to demonstrate practical programming skills and the ability to critically select and apply Python data science tools and libraries. The assessment is worth 20 credits and has a word count of 2,500 words plus 10%, excluding the reference list and output. Students are required to submit one clearly organised report covering two tasks and their individual subtasks. Task 1 focuses on designing, building, testing, explaining, adapting and critiquing a Python program. Students are required to implement a dice-based football match simulation for two players using at least two Python functions. The implementation should follow the logic of the physical dice game, demonstrate good Python coding style, and use functions designed with high cohesion and low coupling. The report must include the full Python code and carefully selected output from a sample match that demonstrates the progression of the game and changes in the score. Students must not implement a Python class or graphical visualisation. The second part of Task 1 requires students to explain how they designed their implementation, including assumptions, incremental development and testing. They must then modify their program to estimate at least two performance measures relevant to a football manager. The coursework asks students to investigate how these measures change when a restrictive shot clock is introduced and to model a realistic “Hail Mary” shot when the shot clock is close to expiring. Students must provide modified Python code, clearly identify the changes made, include selected output for checking the logic, and provide a robust conclusion based on comparison of the results. Task 2 focuses on critically assessing, selecting and applying Python data science libraries and algorithms. Students must describe an applied data science problem involving unstructured data such as image, audio, video or text. They must provide a specific example based on the context of a Coventry University fresher and explain how the problem could be solved manually. Students then select two Python libraries, justify their selection, compare their capabilities, apply both libraries to the chosen problem, and provide the relevant Python code and output. The final part of Task 2 requires a critical assessment of the selected Python libraries using the student's experience and additional sources. Factors may include coding difficulty, adaptability, level of control and quality of the resulting solution. Students must make a reasoned assessment of the suitability of the libraries for their chosen application and support their discussion with appropriate references. The assignment assesses three module learning outcomes: understanding essential programming concepts relevant to data science; designing, building, testing, explaining, adapting and critiquing small programs in a high-level programming language; and critically assessing, selecting and applying data science tools, libraries or algorithms for different applications and tasks. The submission must be provided as a single Microsoft Word or PDF report, organised by subtask, with each task starting on a new page. Python code, relevant output and plots must be included directly in the report. The brief requires APA referencing and states that sources should be cited in-text with a reference list for each task where relevant.
Read Model Answer →
Programming for Data Science
4,000 words
Programming for Data Science – Individual Portfolio
This individual portfolio assessment for the Programming for Data Science module at Coventry University consists of four tasks designed to assess programming, debugging, data science, data visualisation, data protection and data ethics skills. The assessment carries 20 credits and has a total value of 4,000 words equivalent, excluding the reference list and output. Students are required to submit one clearly organised report containing all four tasks, with each task beginning on a new page. Python code, outputs and relevant plots must be included directly within the report. Task 1 focuses on analysing, critiquing and debugging Python code. Students are required to identify syntax errors, logical errors, style and readability issues in a supplied program, determine what the program is intended to calculate, and make appropriate corrections. Students must test the program using varying values, explain the changes made, and improve its overall readability and annotation so that an unfamiliar user can understand it. The task also requires students to investigate computational efficiency by measuring execution time for different input limits and identifying more efficient coding or logical approaches. Task 2 requires students to design, build and test a simple Python implementation of the Blackjack card game. The program should simulate a single-player game against a computer-controlled dealer, allow the player to choose between hitting and standing, automatically simulate the dealer's turn, and offer the option to play additional rounds. Complex rules such as splitting and betting are excluded, and students must not implement a Python class or graphical visualisation. The submission must include the Python code and the output from five games, with sufficient storytelling in the output to allow the code to be tested from the results shown. Task 3 assesses the student's ability to critically assess, select and apply data science tools. Students work with animal lifespan information from the AnAge database and use Python, including pandas and appropriate graphical libraries, to explore and communicate insights. The task involves summarising the number of animal species represented within each animal Class and producing plots of maximum longevity against adult weight for the four Classes with the most represented species. Students must discuss whether smaller or larger animals live longer, identify extreme outliers, compare trends between animal groups and consider implications for ageing research. Task 4 examines data protection and data ethics using the Cancer Genome Atlas (TCGA) as a case study. Students must explain how a potential data breach could occur, identify the personal and sensitive information that could be compromised, and discuss consequences for patient confidentiality, institutional reputation, participation in future research and possible legal or public relations responses. A second part considers a hypothetical UK database and requires discussion of GDPR and the UK Government Data Ethics Framework, including informed consent, anonymisation, transparency, ethical governance, privacy and public trust in biomedical research. The assessment assesses two module learning outcomes. MLO2 focuses on designing, building, testing, adapting and critiquing small programs in a high-level programming language and is assessed through Tasks 1 and 2. MLO3 focuses on critically assessing, selecting and applying data science tools, libraries or algorithms throughout the data science project lifecycle and is assessed through Tasks 3 and 4. The assignment requires APA referencing and asks students to provide in-text citations and reference lists where relevant. The brief also classifies the assessment as “Amber” for Generative AI: AI tools may be used for inspiration but not to generate answers or analyse datasets. Any permitted use must be clearly acknowledged, documented and cited using APA style.
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 →
Machine Learning and Deep Learning
2,000 words
Development and Evaluation of Deep Learning Models for Healthcare Classification
This individual technical assessment focuses on the design, development, analysis and evaluation of a deep learning solution for a healthcare-related classification problem. Students select one of two provided scenarios: Polycystic Ovary Syndrome (PCOS) detection using ultrasound images or heartbeat classification using electrocardiogram (ECG) signals. The objective is to develop an appropriate deep learning approach and demonstrate critical understanding of the complete machine learning workflow, from initial data exploration through to model evaluation and reflection. Students may either design and train a deep learning model from scratch or customise and fine-tune an existing pre-trained architecture. The complete work is presented through a single Jupyter Notebook integrating Python code, technical discussion, results and visualisations. The notebook must clearly define the selected healthcare problem, explain its significance, justify methodological and architectural choices, and critically evaluate the resulting solution. The first stage involves exploratory data analysis and preprocessing, including investigation of class distributions, data imbalance and relevant patterns. Students prepare the data through techniques such as normalisation, augmentation, train-validation-test splitting and appropriate handling of class imbalance. This is followed by model design, training, validation and hyperparameter tuning, with the architecture selected according to the characteristics of the data and classification task. Model performance must then be evaluated using appropriate classification measures, including precision, recall, F1-score, ROC curves and area under the curve (AUC). The developed model should also be compared against suitable benchmark approaches, which may include traditional machine learning algorithms or alternative deep learning architectures. This comparison should identify the relative strengths and limitations of the proposed solution. The final component requires clear visual presentation and critical reflection on the complete modelling process, including limitations, challenges and opportunities for improvement. Importantly, grading prioritises methodological rigour, analytical depth and critical evaluation rather than simply achieving the highest predictive accuracy. Overview word count: approximately 330 words. AI restriction: this brief only permits automated AI tools for spelling and grammar checking. It explicitly prohibits tools such as ChatGPT, Gemini or Copilot from authoring assessment text or code; any permitted AI use must also be acknowledged.
Read Model Answer →
Machine Learning / Artificial Intelligence and Data Science
1,000 words
End-to-End Machine Learning Model Development, Tuning and Evaluation
This Level 7 Machine Learning and Intelligent Agents assessment requires students to develop and document an end-to-end machine-learning solution, covering the complete workflow from data preparation through model training, tuning, testing and evaluation. Students select an appropriate dataset or scenario, formulate a research question and determine whether the problem is most appropriately addressed through supervised learning, unsupervised learning or reinforcement learning. Suitable machine-learning techniques must then be implemented to create a model that can be systematically trained and tested. The assignment requires students to follow a structured machine-learning development process and document the complete development journey. The report should explain the selected scenario, data collection or dataset, Exploratory Data Analysis (EDA), rationale for selecting particular machine-learning methods, model training, fine-tuning and evaluation. Model performance must be assessed using appropriate established metrics, with relevant published research used to justify methodological decisions and support the interpretation of results. The technical implementation should demonstrate the ability to identify the performance of machine-learning algorithms, implement machine-learning approaches using one or more object-oriented programming languages, and determine which algorithms are most appropriate for a particular analytical brief. These requirements directly correspond to the module learning outcomes relating to machine-learning performance, implementation and algorithm selection. Students are advised to document their work within a Jupyter Notebook, combining Markdown explanations with executable code. The notebook may be submitted directly or converted to PDF. Alternatively, students may prepare the 1,000-word report in Microsoft Word, provided that the Python code is included within the submitted document. Assessment is divided into three principal areas: Introduction (20 marks), Machine Learning Process (40 marks), and Evaluation of Model Performance (40 marks). Higher-level work is expected to demonstrate strong understanding of machine-learning concepts, a functioning and thoroughly tested implementation, appropriate selection of algorithms and critical evaluation of the developed solution. Overall, the assessment integrates research-question formulation, data exploration, algorithm selection, programming, model optimisation and evidence-based evaluation within a reproducible machine-learning workflow. All academic sources must be presented using Harvard referencing.
Read Model Answer →
Machine Learning / Data Science
Linear Regression and Stability of the Moore–Penrose Pseudoinverse Using Python
This machine learning practical and assessment activity develops an understanding of linear regression, Ordinary Least Squares and the Moore–Penrose pseudoinverse using Python. The work progresses from generating synthetic regression datasets to implementing regression algorithms manually, applying established machine learning libraries, analysing real datasets and evaluating the stability of estimated regression coefficients. The laboratory component begins with the generation of synthetic linear regression data using NumPy, including explanatory variables, random noise and an outcome variable. Students then implement simple linear regression without relying on machine learning libraries, using the least-squares solution to estimate the intercept and slope. The resulting observations and fitted regression line are visualised using Matplotlib. The work is subsequently extended to multiple linear regression, where several independent variables are used and coefficients are first calculated manually before the same problem is solved using Scikit-learn. The laboratory also introduces application of regression to the Scikit-learn Diabetes dataset, including feature and target standardisation, model fitting, prediction, correlation analysis and interpretation of regression coefficients. It also highlights the importance of residual analysis when assessing whether a linear model is appropriate. The associated weekly challenge focuses on the stability of linear regression solutions estimated using the Moore–Penrose pseudoinverse. Using a house-price dataset containing variables such as property size, number of bedrooms, distance from the city centre and property age, students construct the design matrix, standardise features and the response variable, and calculate regression coefficients using the pseudoinverse. Students then investigate model robustness by repeatedly fitting the regression model to random subsamples of different sizes and analysing the mean and standard deviation of each coefficient. Tables, boxplots or error-bar visualisations can be used to compare coefficient variability. The final discussion considers which variables are most influential, which coefficients are most stable, how sample size affects stability and whether coefficient interpretation remains reliable across different samples. The final work is submitted as a single PDF exported from Jupyter Notebook or Google Colab, combining documented Python code, experimental results, plots and written interpretation in a professionally organised notebook. Overview word count: approximately 360 wor
Read Model Answer →
Computer Networks and Network Engineering
3,500 words
Wireless, Cloud and Software Defined Networking: Network Modelling, Emulation and Evaluation
This technical networking assignment focuses on the design, implementation, emulation and evaluation of wireless, cloud and Software Defined Networking environments. It combines practical network modelling with analytical discussion and requires students to demonstrate their understanding of modern networking architectures through Mininet-WiFi, Mininet, cloud deployment technologies and an ONOS Software Defined Networking controller. The first task involves creating an ad-hoc wireless network for an emergency-response scenario. A minimum of three wireless stations must be configured using specified parameters such as transmission range, antenna height, antenna gain, SSID and wireless capabilities. Students are required to explain the network design and implementation, provide the Python configuration script used with Mininet-WiFi, and demonstrate connectivity using ICMP communication between appropriate stations. The second task examines cloud-service emulation. Students must construct a Mininet topology containing a switch and two hosts and deploy a simple static website using Render.com. The task requires evidence of cloud configuration, GitHub repository integration, commands used to provide internet access to the emulated host, webpage access through Xterm, screenshots of the resulting webpage and the associated HTML code. The third task addresses Software Defined Networking (SDN). Students create an emulated environment involving three hosts and three servers, implement the required network topology and use the ONOS controller to provide control-plane programmability. Evidence must include the Python emulation script, ONOS GUI output, host-to-server connectivity testing and TCP transmission testing. The final analytical component requires students to critically evaluate the relationship between Software Defined Networking and Network Functions Virtualisation (NFV) and assess security algorithms used in cloud computing, including a comparison of the advantages and disadvantages of two selected algorithms. The coursework therefore integrates practical network configuration, connectivity testing, cloud deployment, programmable networking and academically referenced technical evaluation. Overview word count: approximately 335 words. Important: the brief explicitly states that AI-generated report or code content is prohibited, so this Reference Library description should be treated only as catalogue/metadata content, not as coursework material for submission.
Read Model Answer →
Computer Science / Algorithms and Optimisation
Genetic Algorithms for the Balanced Spanning Tree Problem
This technical research work investigates the Balanced Spanning Tree Problem, an optimisation problem that seeks to construct a spanning tree capable of balancing two competing network objectives: the low overall cost associated with a Minimum Spanning Tree and the short source-to-destination distances provided by a Shortest Path Tree. For an undirected, weighted and connected graph with a designated root vertex, a balanced spanning tree is defined using two parameters, α and β. The first limits the distance between the root and each vertex relative to the corresponding shortest path in the original graph, while the second limits the total tree weight relative to the Minimum Spanning Tree. Finding an optimal balanced spanning tree is computationally challenging because determining whether a graph contains an (α, β)-balanced spanning tree is an NP-complete problem. The research therefore proposes genetic algorithms as heuristic optimisation techniques for two variants of the problem: minimising β while α is fixed, and minimising α while β is fixed. The proposed genetic algorithm represents individual spanning trees as chromosomes composed of graph edges. An initial population of valid spanning trees is generated before evolutionary operations are repeatedly applied. The approach incorporates chromosome selection, crossover, mutation, fitness evaluation and stopping criteria. Four selection strategies are examined: Random Selection, Roulette Wheel Selection, Stochastic Universal Sampling and Tournament Selection. The fitness function is based on the relationship between the Minimum Spanning Tree weight and the total weight of the candidate chromosome. Experimental evaluation is performed using randomly generated weighted graphs containing 6, 10, 15 and 20 vertices. The experiments investigate different values of the balancing parameters, selection mechanisms and population sizes. The implementation uses a population size of 30, a maximum of 300 generations, crossover probability of 0.9 and mutation probability of 0.01 in the principal experiments. The reported results show that the genetic approach can generate high-quality balanced spanning trees and, for the tested instances, produced solutions matching the corresponding optimal balanced spanning trees. The study also examines how balancing parameters and population size influence execution time and convergence, demonstrating the practical use of evolutionary computation for complex graph-optimisation problems.
Read Model Answer →
Machine Learning / Artificial Intelligence and Data Science
1,011 words
End-to-End Machine Learning Model Development, Testing and Evaluation
This Level 7 Machine Learning and Intelligent Agents assignment requires students to develop and document an end-to-end machine-learning solution, covering the complete process from data preparation through model training, tuning, testing and evaluation. Students independently select a suitable dataset or scenario, formulate an appropriate research question and determine whether the problem should be addressed using supervised learning, unsupervised learning or reinforcement learning. Appropriate machine-learning algorithms must then be implemented to create a model capable of being trained and objectively tested. The assessment encourages the use of a structured machine-learning development methodology. Students are expected to explain the selected scenario and data source, perform suitable data preparation and Exploratory Data Analysis (EDA), and provide a reasoned justification for the machine-learning methods selected. The development process should demonstrate how the chosen algorithms are trained and fine-tuned before their performance is evaluated using established and relevant metrics. Published academic research should be incorporated to justify methodological choices and support the interpretation of results. The technical work is normally documented within a Jupyter Notebook, combining Markdown explanations with executable code cells. Alternatively, the report may be produced in Microsoft Word provided that the Python implementation is included. The assignment therefore assesses both conceptual understanding and practical programming competence. Students must demonstrate an ability to identify the performance of machine-learning algorithms, implement machine-learning techniques using an object-oriented programming language, and evaluate which algorithms are appropriate for a particular analytical brief. Assessment places particular emphasis on three areas: the Introduction, the Machine Learning Process, and the Evaluation of Model Performance. The marking criteria reward strong understanding of machine-learning concepts, a functioning and thoroughly tested implementation, appropriate selection of algorithms, and critical evaluation of the final solution. At the highest achievement level, implementations are expected to work without exception, satisfy the required functionality, demonstrate comprehensive testing and extend beyond the basic requirements. Overall, the assignment combines research-question formulation, data analysis, algorithm selection, machine-learning implementation, model optimisation and evidence-based evaluation within a reproducible technical workflow. All academic sources and supporting material must be presented using Harvard referencing.
Read Model Answer →