CS6704 Resource Management Techniques 7th Sem Question Paper ND18 Regulation 2013

Sponsored Ads:

Quick Links

University Papers	University Syllabus	Entrance Exam
PSU Papers	Bank Papers	Placement Papers
VTU	Anna Univerity Syllabus	Anna Univerity Papers

Anna University
Question Paper Code : 20379
B.E/B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2018.
Seventh / Eight Semester
Computer Science and Engineering
CS6704 Resource Management Techniques
( Regulation 2013 )

Download PDF

For More 1st Year Question Papers

For More Question paper of CSE

For More Question paper of IT

Books:
Anna university all semester examination books and study material can be accessed through below link. Feel free search for different subject books and authors. The link will provide both local and foreign author books for references. Share the page with friends and college students as required.

• Anna University Books

GATE:
GATE papers can be a good practice for any competitive technical exams like DRDO, ISRO, REC, BEL, BHEL, GAIL, ONGC, IOC, NTPC, NHPC etc. As candidates we can prepare for GATE exams and try solving the papers for getting good score in other entrance examinations.

• Download GATE Papers

CS6701 Syllabus Cryptography and Network Security Syllabus

OBJECTIVES:
The student should be made to: x Be familiar with resource management techniques. x Learn to solve problems in linear programming and Integer programming. x Be exposed to CPM and PERT.
UNIT I  LINEAR PROGRAMMING                                                                                                 9
Principal components of decision problem – Modeling phases – LP Formulation and graphic solution – Resource allocation problems – Simplex method – Sensitivity analysis.

UNIT II DUALITY AND NETWORKS                                                                                 9
Definition of dual problem – Primal – Dual relation ships – Dual simplex methods – Post optimality analysis – Transportation and assignment model – Shortest route problem.

UNIT III    INTEGER PROGRAMMING                                                                                           9
Cutting plan algorithm – Branch and bound methods, Multistage (Dynamic) programming.

UNIT IV   CLASSICAL OPTIMISATION THEORY:                        9
Unconstrained external problems, Newton – Ralphson method – Equality constraints – Jacobean methods – Lagrangian method – Kuhn – Tucker conditions – Simple problems.

UNIT V OBJECT SCHEDULING:                                                                                                   9
Network diagram representation – Critical path method – Time charts and resource leveling – PERT.

TOTAL: 45 PERIODS


OUTCOMES:
Upon Completion of the course, the students should be able to:
x Solve optimization problems using simplex method.
x Apply integer programming and linear programming to solve real-life applications.
x Use PERT and CPM for problems in  project management

TEXT BOOK:
1. H.A. Taha, “Operation Research”, Prentice Hall of India, 2002.

REFERENCES:
1. Paneer  Selvam, Operations Research, Prentice Hall of India, 2002
2. Anderson “Quantitative Methods for Business”, 8th Edition, Thomson Learning, 2002.
3. Winston “Operation Research”, Thomson Learning, 2003.
4. Vohra, “Quantitative Techniques in Management”, Tata Mc Graw Hill, 2002.
5. Anand Sarma, “Operation Research”, Himalaya Publishing House, 2003.