ACTUAL EXAM QUESTIONS AND 100% ACCURATE SOLUTIONS |
VERIFIED ANSWERS - INSTANT PDF DOWNLOAD
Candidate Name: ________________________________
Candidate ID: ________________________________
Date: ________________________________
Examination Location: ________________________________
Time Allowed: 3 Hours
Total Questions: 60 (This booklet contains Questions 1–30)
Instructions to Candidates:
Read all questions carefully before answering. This assessment evaluates
advanced understanding of business analytics concepts, including data
modeling, optimization, decision analysis, forecasting, and statistical
reasoning. Answer all questions. Select the best answer for each multiple-
choice item. Calculators are permitted where appropriate. Show structured
reasoning mentally when selecting answers, as many questions involve
applied business scenarios. Manage your time effectively to ensure completion
of all questions within the allocated period.
Disclaimer:
This examination is an original simulation designed for educational purposes. It
reflects the structure and rigor of a typical BUAL 2650 final assessment but
does not replicate any official or proprietary exam content.
Core Competency Areas Assessed:
• Optimization Modeling (Linear Programming, Integer Programming)
• Decision Analysis and Risk Modeling
• Forecasting and Time Series Analysis
• Regression and Statistical Inference
• Data Visualization and Interpretation
, • Simulation and Monte Carlo Methods
• Business Decision Frameworks
This examination assesses a student's ability to apply analytical models and
quantitative reasoning to complex business scenarios. Emphasis is placed on
interpreting results, selecting appropriate models, and making data-driven
decisions under uncertainty. Students are expected to demonstrate both
conceptual understanding and practical problem-solving skills across multiple
domains of business analytics.
Q1. A firm is maximizing profit using a linear programming model with two
decision variables. The optimal solution occurs at the intersection of two
constraints. Which condition must hold at this point?
A. Both constraints are redundant
B. Both constraints are non-binding
C. Both constraints are binding
D. Only one constraint is binding
Correct Answer: C. Both constraints are binding
Explanation: 🟡 At an optimal corner point where two constraints intersect, both
constraints must be binding (active). This defines the feasible region vertex. A is
incorrect because redundant constraints do not affect the solution. B is
incorrect since non-binding constraints are not tight. D is incorrect because
intersection requires both constraints to be binding.
Q2. In sensitivity analysis, the shadow price represents:
A. The change in objective coefficient per unit increase in variable
B. The change in optimal value per unit increase in RHS constraint
,C. The total cost of constraint violation
D. The maximum allowable increase in decision variables
Correct Answer: B. The change in optimal value per unit increase in
RHS constraint
Explanation: 🟡 Shadow price indicates how much the objective function
improves per unit increase in a constraint’s right-hand side. A refers to reduced
cost. C is unrelated. D describes feasibility ranges, not shadow prices.
Q3. A regression model shows an R² of 0.85. What does this imply?
A. 85% of variance is unexplained
B. 85% of variance is explained by independent variables
C. 85% of observations are accurate
D. 85% correlation between variables
Correct Answer: B. 85% of variance is explained by independent
variables
Explanation: 🟡 R² measures explanatory power of the model. A is incorrect (it’s
the opposite). C misinterprets accuracy. D confuses correlation with R².
Q4. In decision trees, rollback analysis is used to:
A. Estimate probabilities
B. Calculate expected values
C. Determine regression coefficients
D. Reduce uncertainty
, Correct Answer: B. Calculate expected values
Explanation: 🟡 Rollback computes expected values from terminal nodes
backward. A is incorrect since probabilities are inputs. C is unrelated. D is a
general outcome, not the method.
Q5. A constraint in LP is non-binding. What is its slack?
A. Zero
B. Negative
C. Positive
D. Undefined
Correct Answer: C. Positive
Explanation: 🟡 Non-binding constraints have slack > 0. Binding constraints
have zero slack. Negative slack indicates infeasibility. Undefined is incorrect.
Q6. Which forecasting method assigns exponentially decreasing weights to past
data?
A. Moving average
B. Linear regression
C. Exponential smoothing
D. Naïve method
Correct Answer: C. Exponential smoothing
Explanation: 🟡 Exponential smoothing applies declining weights. Moving
average uses equal weights. Regression models relationships. Naïve uses last
observation.