Tribhuvan University
Bachelor of Computer Application
Semester 8 · TU Board 2022
Course Title: Data Analysis and Visualization (CACS455)
Full Marks: 60Pass Marks: 24Time: 3 hours
Candidates are required to answer the question in their own words as far as possible.
Group A
Group B
Attempt any SIX question.(6 × 5 = 30)
- 2.5
What is data analysis and visualization? Explain the general methods of solving OR model.
- 3.5
A chair manufacturing company produces two types of chairs A and B using three machines, X, Y and Z. The time required for each chair on each machine and the maximum time available on each machine for a given below:MachineTime required for each typeMaximum time availableA | BPer week in hrsX6 | 8120Y3 | 5100Z12 | 4144The profit on the A and B are rupees 500 and rupees 300 respectively. What combination of chairs should be produced to obtain maximum profit?
- 4.5
Write an algorithm to minimize the solution of LPP using simplex method.
- 5.5
Given the transportation framework, find the optimal solutionFromTo → ABCPlant CapacityX121160Y71160240Z21603535Requirement653535115
- 6.5
Find the cost per period of machine replacement policy of an installation given in the following table. The $200 street lamps a. Cost of replacing individually bulb is given in table b. Cumulative probability of failure is given belowWeek012345Cumulative probability of failure00.10.30.50.71.0
- 7.5
Discuss single channel queuing model with suitable example? Give its assumptions.
- 8.5
Write short notes on (any two) a. Kendall's notation b. Big M method c. Importance and advantage of duality problem
Group C
Attempt any TWO questions(2 × 10 = 20)
- 9.10
Solve duality to solve the LLP Minimize z = 20x₁ + 40x₂ Subject to 3x₁ + 6x₂ ≥ 600 5x₁ + 12x₂ ≥ 36 20x₁ + 10x₂ ≥ 100 and x₁, x₂ ≥ 0
- 10.10
A City Corporation has decided to carry out Maintenance work on city. There are four tasks to be completed using 5 contractors. Which of these contractors should be assigned those tasks? Solve the assignment problem to get best result.ContractorTask 1Task 2Task 3Task 4A19243728B18372839C19283126D30162830E20253126
- 11.10
a) Two types of food manufacturers are competing for an increased market share. The payoff matrix describes the increase in market share of A and decrease of share of B. Determine optimal strategies for both the manufacturers and the value of the game.A \ BGive PriceDecrease PriceMaintain present strategyIncrease AdvertisingGive Price2520148Decrease Price27161214Maintain present strategy358156Increase Advertising-28135b) Write Hungarian algorithm to solve the assignment problem.
— The End —