CS6704 Important Questions Resource Management Techniques

CS6704 Important Questions Resource Management Techniques Regulation 2013 Anna University free download. Resource Management Techniques CS6704 Important Questions pdf free download.

Sample CS6704 Important Questions Resource Management Techniques:

1. What is linear programming?
Linear programming is a technique used for determining optimum utilization of limited resources to meet out the given objectives. The objective is to maximize the profit or minimize the resources (men, machine, materials and money)

2. Write the general mathematical formulation of LPP. CS6704 Important Questions Resource Management Techniques
1. Objective function

3. What are the characteristic of LPP? CS6704 Important Questions Resource Management Techniques
 There must be a well defined objective function.
 There must be alternative course of action to choose.
 Both the objective functions and the constraints must be linear equation or inequalities.

4. What are the characteristic of standard form of LPP? CS6704 Important Questions Resource Management Techniques
 The objective function is of maximization type.
 All the constraint equation must be of equal type by adding slack or surplus variables
 RHS of the constraint equation must be positive type
 All the decision variables are of positive type

5. What are the characteristics of canonical form of LPP? (NOV ’07) CS6704 Important Questions Resource Management Techniques
In canonical form, if the objective function is of maximization type, then all constraints are of ≤ type. Similarly if the objective function is of minimization type, then all constraints are of ≥ type. But non-negative constraints are ≥type for both cases. CS6704 Important Questions Resource Management Techniques

6. A firm manufactures two types of products A and B and sells them at profit of Rs 2 on type A and Rs 3 on type B. Each product is processed on two machines M1 and M2.Type A requires 1 minute of processing time on M1 and 2 minutes on M2 Type B requires 1 minute of processing time on M1 and 1 minute on M2. Machine M1 is available for not more than 6 hours 40 minutes while machine M2 is available for 10 hours during any working day. Formulate the problem as a LPP so as to maximize the profit. (MAY ’07)
Maximize z =2×1 +3×2
Subject tot the constraints:
x1 + x2 ≤ 400
2×1 + x2 ≤ 600
x1 ,x2≥ 0 CS6704 Important Questions Resource Management Techniques

CS6704 Important Questions RMT Resource Management Techniques click here to download 

CS6704 Syllabus Resource Management Techniques

CS6704 Notes Resource Management Techniques

CS6704 Question Bank Resource Management Techniques

CS6703 Important Questions Grid and Cloud Computing

CS6703 Important Questions Grid and Cloud Computing Regulation 2013 Anna University free download. Grid and Cloud Computing CS6703 Important Questions pdf free download.

Sample CS6703 Important Questions Grid and Cloud Computing:

1. Define cloud computing
Cloud computing is the delivery of computing as a service rather than a product, hereby shared resources, software, and information are provided to computers and other devices as a utility.

2. What is Distributed computing CS6703 Important Questions Grid and Cloud Computing
This is a field of computer science/engineering that studies distributed systems. A distributed system consists of multiple autonomous computers, each having its own private memory, communicating through a computer network. Information exchange in a distributed system is accomplished through message passing. A computer program that runs in a distributed system is known as a distributed program. The process of writing distributed programs is referred to as distributed programming. CS6703 Important Questions Grid and Cloud Computing

3. Difference between distributed and parallel computing. CS6703 Important Questions Grid and Cloud Computing
Each processor has its own private memory (distributed memory). Information is exchanged by passing messages between the processors.
It is loosely coupled.
An important goal and challenge of distributed systems is location transparency.
All processors may have access to a shared memory to exchange information between processors.
It is tightly coupled.
Large problems can often be divided into smaller ones, which are then solved concurrently (“in parallel”).

4. What is mean by service oriented architecture? CS6703 Important Questions Grid and Cloud Computing
In grids/web services, Java, and CORBA, an entity is, respectively, a service, a Java object, and a CORBA distributed object in a variety of languages. These architectures build on the traditional seven Open Systems Interconnection (OSI) layers that provide the base networking abstractions. On top of this we have a base software environment, which would be .NET or Apache Axis for web services, the Java Virtual Machine for Java, and a broker network for CORBA.

CS6703 Important Questions Grid and Cloud Computing click here to download 

CS6703 Syllabus Grid and Cloud Computing

CS6703 Notes Grid and Cloud Computing

CS6703 Question Bank Grid and Cloud Computing

CS6702 Important Questions Graph Theory and Applications

CS6702 Important Questions Graph Theory and Applications Regulation 2013 Anna University free download. Graph Theory and Applications CS6702 Important Questions pdf free download.

Sample CS6702 Important Questions Graph Theory and Applications:

1. Define Graph.
A graph G = (V, E) consists of a set of objects V={v1, v2, v3, … } called vertices (also called points or nodes) and other set E = {e1, e2, e3, …….} whose elements are called edges (also called lines or arcs).
The set V(G) is called the vertex set of G and E(G) is the edge set of G.
For example : CS6702 Important Questions Graph Theory and Applications
A graph G is defined by the sets V(G) = {u, v, w, x, y, z} and E(G) = {uv, uw, wx, xy, xz}.
A graph with p-vertices and q-edges is called a (p, q) graph. The (1, 0) graph is called trivial
graph.

2. Define Simple graph. CS6702 Important Questions Graph Theory and Applications
 An edge having the same vertex as its end vertices is called a self-loop.
 More than one edge associated a given pair of vertices called parallel edges.
 A graph that has neither self-loops nor parallel edges is called simple graph.

3. Write few problems solved by the applications of graph theory. CS6702 Important Questions Graph Theory and Applications
Konigsberg bridge problem
Utilities problem
Electrical network problems
Seating problems

4. Define incidence, adjacent and degree. CS6702 Important Questions Graph Theory and Applications
When a vertex vi is an end vertex of some edge ej, vi and ej are said to be incident with each other. Two non parallel edges are said to be adjacent if they are incident on a common vertex. The number of edges incident on a vertex vi, with self-loops counted twice, is called the degree (also called
valency), d(vi), of the vertex vi. A graph in which all vertices are of equal degree is called regular graph.

CS6702 Important Questions Graph Theory and Applications click here to download 

CS6702 Syllabus Graph Theory and Applications

CS6702 Notes Graph Theory and Applications

CS6702 Question Bank Graph Theory and Applications