Prepare for Your Exam?
Hire an expert
Latest Questions
898F3 Programming in C++: The Money Class
Write and then test a Money class, which represents amounts of UK currency. The value is implemented as a single integer value that represents the amount of money as if it were converted to all pennies.
ECON 601 - Microeconomics: Theory and Applications - Final Exam - Question 6: Applying theory
Answer any one question that we have yet to solve in class or lab, other than the two short discussion questions 21 and 28, i.e., any one of problems 8, 12, 14, 16, 18, 19, 22-27 and 29-37
ECON 601 - Microeconomics: Theory and Applications - Final Exam - Question 5: Exchange under incomplete contracts
Consider a situation where a Buyer seeks to purchase goods for resale from n small business Suppliers, but cannot contract on the quality q of the goods provided, and hence may only decide to terminate a relationship if quality is too low
ECON 601 - Microeconomics: Theory and Applications - Final Exam - Question 4: Social coordination of public outcomes
Consider a classic tragedy of the fishers where two individuals’ actions have negative external effects on each other and also act as substitutes. Assume that individuals lower and Upper are maximizing utility functions
ECON 601 - Microeconomics: Theory and Applications - Final Exam - Question 3: Social Preferences
A major theme of this class has been how social preferences influence behavior. Consider two students working on a joint project who care about both their own outcomes as well as the outcomes of students that they work with, such that for each individual i receiving payoffs πi while working with individual j receiving payoff πj
ECON 601 - Microeconomics: Theory and Applications - Final Exam - Question 1: Games and game theory
Suppose table A is the payoff matrix for the row player in a two-person symmetrical game. Indicate restrictions on the relative values of the payoffs in table A that would be sufficient to define the game as a Prisoner’s Dilemma
ECON 601 - Microeconomics: Theory and Applications - Final Exam - Question 2: Evolutionary dynamics
Suppose that two cultural groups, red and blue, have housing preferences that vary as a function of the fraction f ∈ [0,1] of red households in the neighborhood, with each group’s relative valuation / price being given
[2022] UOW - CSIT121 Object Oriented Design and Programming - Final Exam - Q4 Shift Cipher Program
This question is part of the CSIT121 Object Oriented Design and Programming 2022 Final Exam, University of Wollongong (UOW)
CS440 Programming Languages - Midterm Exam - Part 3: Interpreter modifications
The TEST-EXPR is first evaluated, and its result is compared to the various INT-VALs --- if one matches, the corresponding EXPR is evaluated and becomes the result of the case expressions.
CS440 Programming Languages - Midterm Exam - Part 1: Recursion and lists
wordle takes two strings -- a solution and guess (a la Wordle) -- and returns a list of clues that indicate which characters in the guess are in the correct spot
[2022] COMPSCI 711: Parallel and Distributed Computing - Final Exam - Q5 HTTP Latency
This question is part of the COMPSCI 711: Parallel and Distributed Computing, Final Exam 2022, the University of Auckland
[2022] COMP6771 Advanced C++ Programming Final Exam - Question 1 2048 Game Sliding and Merging Implementation
2048 is a 2014 game developed by Gabriele Cirulli. The game consists of using arrow keys on the keyboard (left, right, up down) in order to slide all cells on a board in that particular direction.
EEEM018: Advanced Mobile Communications Systems - Final S2 2021/2022 Question3: TDMA
In a digital TDMA cellular mobile system, 5 carrier frequencies are allocated to a high capacity cell. The burst transmission rate per user is 100kb/s (kilo bits per second).
EEEM018: Advanced Mobile Communications Systems - Final S2 2021/2022 Question2: SSH Security
For each of the first 8 Ethernet frames, specify the source of the frame (client or server), determine the number of SSL records that are included in the frame, and list the SSL record types that are included in the frame
EEEM018: Advanced Mobile Communications Systems - Final S2 2021/2022 Question1: Circuit and Packet Switching Principles
A mixture of IPv4 and IPv6 networks are normally used by mobile and fixed network providers, with typically IPv4 at the backbone (core) and IPv6 at the edges.
[2022] COMP6771 Advanced C++ Programming Final Exam - Question 2 Smart List
You are to develop a new class template smart_list<T> that behaves similar to a std::vector<T> except that it has a handful of modified funtionality and additional functionality. You are also to develop a new class very_smart_list<T> which can do everything a smart_list<T> can do, with more.
COMPSCI 753 Algorithms for Massive Data - Semester2 2021- Final Exam - Q4 Recommender Systems
A recommender system generates a ranked list of items for a specific user u as (p3, p10, p5, p7, p1, p9, p2, p4, p6, p8). The ranked list contains all items that haven’t been purchased by the user in the training data. Apply the basic user-based collaborative filtering (without considering bias) with cosine similarity. Give the top-1 recommended item to user u2.
COMPSCI 753 Algorithms for Massive Data - Semester2 2021- Final Exam - Q3 Algorithms for Graphs
Use two or three sentences to explain the differences between modularity maximization and the Girvan-Newman algorithm for community detection
COMPSCI 753 Algorithms for Massive Data - Semester2 2021- Final Exam - Q2 Data Stream Algorithms
Data Stream Algorithms: Given the data stream below, perform the Misra-Gries algorithm with k = 3 counters and present the summary, including the elements and its counter values, when the execution of the algorithm is finished.
COMPSCI 753 Algorithms for Massive Data - Semester2 2021- Final Exam - Q1 Locality-Sensitive Hashing
Computing MinHash Signatures. Generate the bit-vector representation for {S1, S2, S3, q} in feature space {0, 1, 2, 3, 4, 5}. Generate the MinHash matrix for {S1, S2, S3, q} using the following four MinHash functions. [2 marks]
[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 20 Decision Network
onstruct the decision network for this problem. In the textbox, list all the directed edges in the decision network. Remark: An edge from node x to node y can be written as (x,y).
[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 18 PDDL
Consider the following robotic domain (as shown in the picture below). There are three rooms lined up along a corridor, where each room has a door (always open) and a light switch
[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 17 Backtracking Algorithm
Starting from the node YU with assignment f(YU)=R, apply the backtracking algorithm, where the Select-Unassigned-Var operation is implemented using two heuristics:
[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 15 Prolog Program
In this frame Instance, sentient, food, cooking_creation, condiment, vegetable, vegetarian and vegetarian_friendly are all
[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 9 Manhattan Distance
If you are playing a new game where you have one hunter, H1, who is trying to catch all of the animals, A1....An. The hunter can only move horizontally or vertically.
[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 8 A* Search Algorithm
The solution found by A* tree search with h2 is guaranteed to be an optimal solution. The solution found by A* tree search with h2 has no guarantee of optimality.
[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 7 Genetic Algorithm
Give the name of the local search algorithm that best describes the results from the following special case: Genetic algorithm with population size, P, set to one.
[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 6 Local Search Algorithm
Give the name of the local search algorithm that best describes the results from the following special case: Simulated annealing with a constant value of one trillion for the temperature parameter.
[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 5 GBFHS
Front-to-front heuristics can exponentially reduce the number of node expansions. Ignoring the C* level, GBFHS is guaranteed to never expand more nodes than blind bidirectional.
[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 4 Bubble Puzzle Hill-Climbing
So the heuristic of the starting state is 2+1+1+0+0=4. Assume each bottle can only hold 4 bubbles. What state will hill-climbing return?
[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 3 Minimum size of state space
What is the minimum size of the state space for an "altered" 24 puzzle (a square puzzle similar to the 8 puzzle but 5 by 5 with 24 tiles instead of 8, normally numbered 24 through 1). I
[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 2 Local Search Algorithms
Give the name of the local search algorithm that best describes the results from the following special case: beam search with B=1.
[2021] COMPSCI 367 Artificial Intelligence - Final Exam - Question 1 Search Algorithm
A* Search, Branch and Bound Search,Greedy Search,Uniform Cost Search, Depth-first Search
[2020] COMPSCI 367 Artificial Intelligence - Final Exam - Question 15 Progression Planning
In our lecture on progression planning, we defined all of the predicates, except for applicationResult(Step, Sit, NewSit). The effects of a step are expressed in the update language.
[2020] COMPSCI 367 Artificial Intelligence - Final Exam - Question 11 A* Search Algorithm
Given a problem, P, in a unit-cost domain, where the forward and backward average branching factor is b, the optimal solution cost for P is d, and an admissible and consistent heuristic h, with an average value of x. For the sub-questions below, please specify a formula.
[2020] COMPSCI 367 Artificial Intelligence - Final Exam - Question 10 Heuristic Search
Given a unit-cost domain problem, P, with an optimal cost solution of 20, a front-to-end heuristic h, whose max heuristic value is 9 and whose average heuristic value for this problem is 7
[2020] COMPSCI 367 Artificial Intelligence - Final Exam - Question 9 Alpha-beta Pruning
Explain what the differences are in the values for the Alpha-beta pruning and for Minimax results? What is the main advantage of the Alpha-beta pruning algorithm?
[2020] COMPSCI 367 Artificial Intelligence - Final Exam - Question 8 Expectimax search
Why is Markov Decision Processes taught as an Expectimax search? How is what the Expectimax search is doing the same as what the MDP is doing?
[2020] COMPSCI 367 Artificial Intelligence - Final Exam - Question 7 Genetic Algorithm
What kind of local search is genetic algorithm doing? Can you explain what it does in terms of other local search algorithms?
[2020] COMPSCI 367 Artificial Intelligence - Final Exam - Question 6 Iterative Improvement Algorithm
In assignment 3, the iterative improvement algorithm did better than the constraint satisfaction algorithm for some problems and not for others. Why is this the case? What is it about those problems that make them more suitable for certain algorithms?
[2020] COMPSCI 367 Artificial Intelligence - Final Exam - Question 5 Constraint Satisfaction Solvers Ordering Techniques
One of the main techniques used by constraint satisfaction solvers is ordering. What are the two things that they order and in what order do they order them?
[2020] COMPSCI 367 Artificial Intelligence - Final Exam - Question 3 3 Main Variables of Markov Decision Process
What are the 3 main variables that you can calculate for a Markov Decision process? What are the differences between them and which is most important?
[2020] COMPSCI 367 Artificial Intelligence - Final Exam - Question 4 Main Components of a Constraint Satisfaction Problem
What are the main components of a Constraint Satisfaction Problem? Give an example of each using one of the constraint satisfaction problems from assignment 3.
[2020] COMPSCI 367 Artificial Intelligence - Final Exam - Question 2 Main Components of Markov Decision Process
What are the main components of a Markov Decision Process? Which of these components are the same as a classical planning problem and which are different?
[2020] COMPSCI 367 Artificial Intelligence - Final Exam - Question 1 Markov Decision Process
Why is it called a Markov Decision Process? What is the importance of the word “Markov” what does it bring to the definition?
CPT106 SEMESTER 2021/22 Resit Exam - Question 5
A newspaper office is using object-oriented technology to develop a computer management system for newspaper subscriptions. CPT 106 C++ Programming and Software Engineering
CPT106 SEMESTER 2021/22 Resit Exam - Question 4
Write a main() function to test the class Rectangle and Shape. In the main() function, the following are expected to be tested: the two constructors, shape type output, Rectangle’s area and overloading operators.
CPT106 SEMESTER 2021/22 Resit Exam - Question 3
CPT106 C++ Programming and Software Engineering II. Exam. Write down one line of correct code to fix the compiling error of the program by updating the definition of class clB.
CPT106 SEMESTER 2021/22 Resit Exam - Question 2
Create a function that can create a double-type array with a variable size, and return the array pointer and obtain the size of the array
CPT106 SEMESTER 2021/22 Resit Exam - Question 1
Assuming that t is an array and p is a pointer to that array, which expression does not refer to the value of element 3 of the array?
[2020] COMPSCI5077 Enterprise Cyber Security (M) - Question 3 Backup System
The technical support team state the transaction system could be restored within 36 hours from failure and so the business will not become irreparably damaged. Discuss RPO, RTO and MTPOD in the given context and argue whether the statement from the technical support team is accurate.
[2020] COMPSCI5077 Enterprise Cyber Security (M) - Question 2 Cyber Attack and Protection
The Lena Corporation design various Image Processing Units (IPUs) for portable devices, such as smartphones and tablets. The company remains competitive due to a number of valuable trade secrets related to the design of its IPUs.
[2020] COMPSCI5077 Enterprise Cyber Security (M) - Question 1 Cloud Deployment Models
The pair have decided to use cloud computing, but the pair are unsure of the optimal cloud deployment model. Critique FOUR different cloud deployment models in the given context. Argue for the optimal solution in the given context.
[2019] COMPSCI5077 Enterprise Cyber Security (M) - Question 3 Redundant Data
The management want to make efficient use of infrastructure and avoid storage of redundant data and reduce the flow of data over their internal network. Devise and describe an appropriate solution that reduces redundant data in the given context.
[2019] COMPSCI5077 Enterprise Cyber Security (M) - Question 1 Legacy System Protection
Brooks Industries is a large enterprise and has several legacy systems that effectively manage employee records. These legacy systems are maintained by a group of technical staff that are nearing retirement.
[2019] COMPSCI5077 Enterprise Cyber Security (M) - Question 2 Data Protection Regulations
The company are yet to appoint a data protection officer and the management team are concerned about some of the design decisions from the perspective of data protection. Critique the ActivSystem from the perspective of FOUR principles of the General Data Protection Regulations (GDPR).
CSSE3100/7100 Reasoning About Programs - Semester One 2020- Final Exam - Q7 Bounded Queue
CSSE3100/7100 Reasoning About Programs 2021 semester one final exam, Q7 Bounded Queue
CSSE3100/7100 Reasoning About Programs - Semester One 2020- Final Exam - Q6 Dafny Method Signature and Specification
CSSE3100/7100 Reasoning About Programs 2021 semester one final exam, Q6 Dafny Method Signature and Specification
CSSE3100/7100 Reasoning About Programs - Semester One 2020- Final Exam - Q5 Dafny Method Single Loop
CSSE3100/7100 Reasoning About Programs 2021 semester one final exam, Q5 Dafny Method Single Loop
CSSE3100/7100 Reasoning About Programs - Semester One 2020- Final Exam - Q4 Weakest precondition Proof Dafny mehtod
CSSE3100/7100 Reasoning About Programs 2021 semester one final exam, Q4 Weakest precondition Proof Dafny mehtod
CSSE3100/7100 Reasoning About Programs - Semester One 2020- Final Exam - Q3 Weakest precondition Reasoning
CSSE3100/7100 Reasoning About Programs 2021 semester one final exam, Q3 Weakest precondition Reasoning
CSSE3100/7100 Reasoning About Programs - Semester One 2021- Final Exam - Q5 Bounded ordered queue
CSSE3100/7100 Reasoning About Programs 2021 semester one final exam, Q5 Bounded ordered queue
CSSE3100/7100 Reasoning About Programs - Semester One 2021- Final Exam - Q4 Sequence Operation
CSSE3100/7100 Reasoning About Programs 2021 semester one final exam, Q4 Sequence Operation
CSSE3100/7100 Reasoning About Programs - Semester One 2021- Final Exam - Q1 Weakest Precondition Proof
CSSE3100/7100 Reasoning About Programs 2021 semester one final exam, question 1 - Weakest Precondition Proof
CSSE3100/7100 Reasoning About Programs - Semester One 2021- Final Exam - Q2 Loop Invariant Weakest Precondition Proof
CSSE3100/7100 Reasoning About Programs 2021 semester one final exam, question 2 - Loop Weakest Precondition Proof
CSSE3100/7100 Reasoning About Programs - Semester One 2021- Final Exam - Q3 Partial Correctness
CSSE3100/7100 Reasoning About Programs 2021 semester one final exam, Q3 Partial Correctness
[2021] Economics 482 Game Theory and Economics - Midterm Exam - Q3 Hotelling Game Nash Equilibrium
This question is part of the Economics 482 Game Theory and Economics, midterm exam 2021 Spring, Rutgers, The State University of New Jersey. Hotelling Game
[2021] Economics 482 Game Theory and Economics - Midterm Exam - Q2 Cournot Competition
This question is part of the Economics 482 Game Theory and Economics, midterm exam 2021 Spring, Rutgers, The State University of New Jersey. Payoff Matirx
[2021] Economics 482 Game Theory and Economics - Midterm Exam - Q1 Nash equilibrium
This question is part of the Economics 482 Game Theory and Economics, midterm exam 2021 Spring, Rutgers, The State University of New Jersey.
[2021] CMPSC311 Introduction to Systems Programming - Midterm Exam - Q1 Dynamic Memory Malloc and Free
This question is part of CMPSC311 Introduction to Systems Programming, Midterm Exam 2021, The Pennsylvania State University (PSU)
[2021] CMPSC311 Introduction to Systems Programming - Midterm Exam - Q2 Pointers
This question is part of CMPSC311 Introduction to Systems Programming, Midterm Exam 2021, The Pennsylvania State University (PSU)
[2021] CMPSC311 Introduction to Systems Programming - Midterm Exam - Q3 Egrep
This question is part of CMPSC311 Introduction to Systems Programming, Midterm Exam 2021, The Pennsylvania State University (PSU)
[2021] CMPSC311 Introduction to Systems Programming - Midterm Exam - Q4 Char Array Length/Size
This question is part of CMPSC311 Introduction to Systems Programming, Midterm Exam 2021, The Pennsylvania State University (PSU)
[2021] CMPSC311 Introduction to Systems Programming - Midterm Exam - Q5 Signal Handler
This question is part of CMPSC311 Introduction to Systems Programming, Midterm Exam 2021, The Pennsylvania State University (PSU)
[2021] CMPSC311 Introduction to Systems Programming - Midterm Exam - Q6 File Permission and Copy Function
This question is part of CMPSC311 Introduction to Systems Programming, Midterm Exam 2021, The Pennsylvania State University (PSU)
[2021] CMPSC311 Introduction to Systems Programming - Midterm Exam - Q7 Grep Palindromes
This question is part of CMPSC311 Introduction to Systems Programming, Midterm Exam 2021, The Pennsylvania State University (PSU)
[2021] CMPSC311 Introduction to Systems Programming - Midterm Exam - Q11 Print Strings with Odd Number of a
This question is part of CMPSC311 Introduction to Systems Programming, Midterm Exam 2021, The Pennsylvania State University (PSU)
[2021] CMPSC311 Introduction to Systems Programming - Midterm Exam - Q8 Function Sum
This question is part of CMPSC311 Introduction to Systems Programming, Midterm Exam 2021, The Pennsylvania State University (PSU)
[2021] CMPSC311 Introduction to Systems Programming - Midterm Exam - Q9 Shell
This question is part of CMPSC311 Introduction to Systems Programming, Midterm Exam 2021, The Pennsylvania State University (PSU)
[2021] CMPSC311 Introduction to Systems Programming - Midterm Exam - Q10 Cache Operation
This question is part of CMPSC311 Introduction to Systems Programming, Midterm Exam 2021, The Pennsylvania State University (PSU)
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q20 Sentences Generation
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q19 Depth-first Search Node Expanding Order
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q18 A* Search Solution Path
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q16 Neural Network Function Approximation
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q15 Fuzzy Controller Error
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q14 Minimax search procedure
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q13 Machine Learning
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q12 Neural Network Brains
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q11 Simultaneous Localization and Mapping
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q10 Manhattan Distance
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q2 A neural network with Thresholding Logic Units
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q1 Fuzz Rules
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q9 MYCIN
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q8 Liability Issue
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q6 A* Search Algorithm
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q5 Science Fiction Portray of Human Beings
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q4 Depth-first Search
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] EIE1D03 Artificial Intelligence and Science Fiction - Exam - Q3 Robot Location Estimate
This question is part of the EIE1D03 Artificial Intelligence and Science Fiction, Exam Spring 2021, The Hong Kong Polytechnic University
[2021] CS3002 Artificial Intelligence - Final Exam - Q7: Deep Learning for Natural Language Processing
This question is part of the CS3002 Artificial Intelligence, final exam May 2021, Brunel University London
[2021] CS3002 Artificial Intelligence - Final Exam - Q6: Deep Learning
This question is part of the CS3002 Artificial Intelligence, final exam May 2021, Brunel University London