Exam Details
| Subject | operations research (or) | |
| Paper | ||
| Exam / Course | mca | |
| Department | ||
| Organization | Gujarat Technological University | |
| Position | ||
| Exam Date | May, 2019 | |
| City, State | gujarat, ahmedabad |
Question Paper
Page 1 of 2
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
MBA SEMESTER 4 EXAMINATION SUMMER 2019
Subject Code:3549271 Date:04/05 2019
Subject Name: Operations Research
Time: 10.30a.m to 1.30 p.m. Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Q. No.
Marks
Q.1
Write brief about following terms
Monte carlo simulation
Unbounded Solutions in LPP
Unbalanced transportation problem
Big M method
Saddle point in game theory
Transshipment Problem
Queuing System
14
Q.2
Write a note on Characteristics of Queuing System
07
Write a note on duality and its rules
07
OR
Write a note on degeneracy and multiple solutions in LPP
07
Q.3
Write a note on Properties of Linear Programming Model
07
Write a note on Procedure for Numbering the Events Using Fulkerson's Rule
07
OR
Q.3
What is game in game theory? what are the properties of a game? Explain two-person zero sum game with suitable example.
07
Discuss continuous in time vs Direct in time models
07
Q.4
Explain Single Server Queuing Model in detail with example
07
Write a note on CPM, float and slack times.
07
OR
Q.4
A bakery keeps stock of popular brand of cake. Previous experience shows the daily demand pattern for the item with associated probabilities, as given below
Daily demand 0 10 20 30 40 50
Probability 0.01 0.20 0.15 0.50 0.12 0.02
Use the following sequence of random numbers to simulate the demand for next 10 days.
Random numbers: 25,39,65,76,12,05,73,89,19,49
Also calculate average demand of cakes.
07
Page 2 of 2
How to verify and refine a mathematical model?
07
Q.5
A frim makes two products X and Y and has a total production capacity of 9 tons per day, Both X and Y require the same production capacity. The firm has a permanent contract to supply at least 2 tons of X and at least 3 tons of Y per day to another company. Each ton of X requires 20 machine hours of production time and each ton of Y requires 50 machine hours of production time. The daily maximum possible number of machine hours is 360. All of the firm's output can be sold. The profit made is rs.80 per ton of X and rs.120 per ton of Y.
Identify decision variables and prepare objective function
07
Formulate given LPP and suggest suitable method for solution
07
OR
Q.5
Write constrains and objective function of given situation
07
Find solution of given problem
07
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
MBA SEMESTER 4 EXAMINATION SUMMER 2019
Subject Code:3549271 Date:04/05 2019
Subject Name: Operations Research
Time: 10.30a.m to 1.30 p.m. Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Q. No.
Marks
Q.1
Write brief about following terms
Monte carlo simulation
Unbounded Solutions in LPP
Unbalanced transportation problem
Big M method
Saddle point in game theory
Transshipment Problem
Queuing System
14
Q.2
Write a note on Characteristics of Queuing System
07
Write a note on duality and its rules
07
OR
Write a note on degeneracy and multiple solutions in LPP
07
Q.3
Write a note on Properties of Linear Programming Model
07
Write a note on Procedure for Numbering the Events Using Fulkerson's Rule
07
OR
Q.3
What is game in game theory? what are the properties of a game? Explain two-person zero sum game with suitable example.
07
Discuss continuous in time vs Direct in time models
07
Q.4
Explain Single Server Queuing Model in detail with example
07
Write a note on CPM, float and slack times.
07
OR
Q.4
A bakery keeps stock of popular brand of cake. Previous experience shows the daily demand pattern for the item with associated probabilities, as given below
Daily demand 0 10 20 30 40 50
Probability 0.01 0.20 0.15 0.50 0.12 0.02
Use the following sequence of random numbers to simulate the demand for next 10 days.
Random numbers: 25,39,65,76,12,05,73,89,19,49
Also calculate average demand of cakes.
07
Page 2 of 2
How to verify and refine a mathematical model?
07
Q.5
A frim makes two products X and Y and has a total production capacity of 9 tons per day, Both X and Y require the same production capacity. The firm has a permanent contract to supply at least 2 tons of X and at least 3 tons of Y per day to another company. Each ton of X requires 20 machine hours of production time and each ton of Y requires 50 machine hours of production time. The daily maximum possible number of machine hours is 360. All of the firm's output can be sold. The profit made is rs.80 per ton of X and rs.120 per ton of Y.
Identify decision variables and prepare objective function
07
Formulate given LPP and suggest suitable method for solution
07
OR
Q.5
Write constrains and objective function of given situation
07
Find solution of given problem
07
Other Question Papers
Subjects
- advance database management system
- advanced biopharmaceutics & pharmacokinetics
- advanced medicinal chemistry
- advanced networking (an)
- advanced organic chemistry -i
- advanced pharmaceutical analysis
- advanced pharmacognosy-1
- advanced python
- android programming
- artificial intelligence (ai)
- basic computer science-1(applications of data structures and applications of sql)
- basic computer science-2(applications of operating systems and applications of systems software)
- basic computer science-3(computer networking)
- basic computer science-4(software engineering)
- basic mathematics
- basic statistics
- big data analytics (bda)
- big data tools (bdt)
- chemistry of natural products
- cloud computing (cc)
- communications skills (cs)
- computer aided drug delivery system
- computer graphics (cg)
- computer-oriented numerical methods (conm)
- cyber security & forensics (csf)
- data analytics with r
- data mining
- data structures (ds)
- data visualization (dv)
- data warehousing
- data warehousing & data mining
- database administration
- database management system (dbms)
- design & analysis of algorithms(daa)
- digital technology trends ( dtt)
- discrete mathematics for computer science (dmcs)
- distributed computing (dc1)
- drug delivery system
- dynamic html
- enterprise resource planning (erp)
- food analysis
- function programming with java
- fundamentals of computer organization (fco)
- fundamentals of java programming
- fundamentals of networking
- fundamentals of programming (fop)
- geographical information system
- image processing
- industrial pharmacognostical technology
- information retrieving (ir)
- information security
- java web technologies (jwt)
- language processing (lp)
- machine learning (ml)
- management information systems (mis)
- mobile computing
- molecular pharmaceutics(nano tech and targeted dds)
- network security
- object-oriented programming concepts & programmingoocp)
- object-oriented unified modelling
- operating systems
- operation research
- operations research (or)
- pharmaceutical validation
- phytochemistry
- procedure programming in sql
- programming skills-i (ps-i-fop)
- programming skills-ii (ps-oocp)
- programming with c++
- programming with java
- programming with linux, apache,mysql, and php (lamp)
- programming with python
- search engine techniques (set)
- soft computing
- software development for embedded systems
- software engineering
- software lab (dbms: sql & pl/sql)
- software project in c (sp-c)
- software project in c++ (sp-cpp)
- software quality and assurance (sqa)
- statistical methods
- structured & object oriented analysis& design methodology
- system software
- virtualization and application of cloud
- web commerce (wc)
- web data management (wdm)
- web searching technology and search engine optimization
- web technology & application development
- wireless communication & mobile computing (wcmc)
- wireless sensor network (wsn)