|Of Exam | | | | | | |Theory |Sessional* | | |MCA-101 |Computer Fundamentals and Problem Solving Using C |3 Hours |80 |20 |100 | |MCA-102 |Computer Organisation |3 Hours |80 |20 |100 | |MCA-103 |Discrete Mathematical
Words: 13848 - Pages: 56
|C Programming and Data Structures |3+1 |- |6 | | |Network Analysis |2+1 |- |4 | | |Electronic Devices and Circuits |3+1 |- |6 | | |Engineering Drawing |- |3 |4 | | |Computer Programming Lab.
Words: 26947 - Pages: 108
supplying snowplow blades, producing snow blades and wings for wheel loaders and motor graders, the most common barriers used in snow removal. As there was enormous growth, they started producing buckets and other attachments for excavators. The main problem is, the company was losing out on sales due to highly seasonal nature of demand. The plant was fully loaded during 4 months of the year and was ignoring many possible requests for product. At the same time, they had many unused capacity in the
Words: 2613 - Pages: 11
Quantitative Literacy and Statistics Case Study # 1 BUS 501 _______________________________________________________________________ The Delight Dairy Company produces a broad line of dairy products. For production planning purposes, the company has been aggregated into two major products: Ice Cream and Specialties such as ice cream sandwiches and prepackaged ice cream. Both products has its own packaging machine but use a common, single
Words: 278 - Pages: 2
1.3 Methodology In a genetic algorithm there are a population of candidate solutions it’s called 1) Individuals 2) Creatures 3) Phenotypes to optimize a problem is evolved toward a best solutions. Each solution has a set of properties it is a chromosomes or a genotype, which they can be mutated, solutions are represented in binary as strings(0,1) also the other encodings are also possible. The evolutions usually start from a population randomly generated individuals, and are an iterative process
Words: 1221 - Pages: 5
university of bahrain | Operation Research | Case Study (Transportation Problem) | | Ali Al-Nasser | 20092446 | Problem Al Kobaisi Group is a ready mix company which has three plants in various locations among Kingdom of Bahrain. They signed a contract with Al-Moayed contracting to supply them with concrete mix for three different projects located at three different areas. The following tables show the amount of concrete mix each plant can provide and required quantities for each
Words: 1536 - Pages: 7
Yield revenue management system has optimized profit by utilizing demand forecast, inventory allocation, and seamless interface to the reservation system. Prior to One Yield, Marriott relied on the manual approach through historical rates. The problem with this approach is that the complexity of daily updates and rapid changes in demand over a very long booking horizon creates static rates. These rates do not reflect individual customers’ willingness to pay, do not reflect the potential for displacement
Words: 1342 - Pages: 6
employs three full-time employees and one ¾ - time employee. a. Formulate a linear programming model for production planning for Delight Dairy Company. b. Solve the problem Graphically. c. Now, suppose that 10 additional labor-hours could be made available by hiring that part time employee as a full time one. What does this do to the solution? Show the result graphically. d. Refer to the original case described in (a). Suppose competition has forced the price of ice cream down from
Words: 269 - Pages: 2
group (admission-batch) of students. Also known as Class Counsellor. “Grade Card” means the detailed performance record in a semester/ programme. "He" means both genders “he” and “she”; similarly "his" and/or "him" includes "her" as well, in all the cases. "HOD" means, the Head of the Department. “MLC”
Words: 14653 - Pages: 59
Two primal problems are constructed implementing the structural risk minimization principle; 2) The dual problems of these two primal problems have the same advantages as that of the standard SVMs, so that the kernel trick can be applied directly; 3)The dual problems have the same elegant formulation with that of standard SVMs and can certainly be solved efficiently by sequential minimization optimization algorithm, while existing GEPSVM or TWSVMs are not suitable for large scale problems; 4) It has
Words: 1328 - Pages: 6
