HCT needs to schedule the following classes so that no classes can be at the same time if they are being taught by the same teacher or they have common students. • CIS3003 • CIS1103 • CIS1203 • CIS1303 • CIS1403 • CIS3303 • CIS2403 • CIS2303 • CIS3403 You need to consider the following: • All 1000 level classes' students have students in common. • All 2000 level classes' students have students in common. • All 3000 level classes' students have students in common. • CIS3003 and CIS 1403 are taught by Dr. Rula. • CIS1103 and CIS2403 are taught by Dr. Saleel. • CIS 1303 and CIS3403 are taught by Dr. Thair. Use your knowledge in Graph coloring to solve this problem,

HCT needs to schedule the following classes so that no classes can be at the same time if they are being taught by the same teacher or they have common students. • CIS3003 • CIS1103 • CIS1203 • CIS1303 • CIS1403 • CIS3303 • CIS2403 • CIS2303 • CIS3403 You need to consider the following: • All 1000 level classes' students have students in common. • All 2000 level classes' students have students in common. • All 3000 level classes' students have students in common. • CIS3003 and CIS 1403 are taught by Dr. Rula. • CIS1103 and CIS2403 are taught by Dr. Saleel. • CIS 1303 and CIS3403 are taught by Dr. Thair. Use your knowledge in Graph coloring to solve this problem,

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter8: Network Models

Section8.2: Shortest-path Problems

Problem 8P

See similar textbooks

Similar questions

As a teaching administrator of the department, your responsibility is to schedule the classes for a particular classroom. Suppose there are n classes, each class i is represented by its start time and finishing time [Si, fi], and we say that two classes i and j are non-conflicting if they do not overlap in time (i.e., sizfj or szfi). You want to schedule as many classes for the classroom as possible, but the scheduled classes should be non-conflicting. Develop an algorithm so that you can select the maximum number of classes for the classroom. (We are expecting either pseudocode or language description of your algorithm)
Jin Mori is like any other student who loves sleeping. Jin Taejin, his grandfather, imposes a waking schedule that Jin Mori must follow to avoid tardiness at his school. The schedule stated that on weekdays, Mori must be awake at "7:00" and at "10:00" at weekends. Taejin added an exemption for their school vacation. If it is their school vacation, the schedule is "10:00" for weekdays and "off" for weekends. If Jin will not follow the schedule, he is not allowed to practice his favorite martial art, taekwondo. Your job is to create a program that will serve as the alarm clock for Jin Mori. Expected Output: Test Case 1: Vacation: False Day: Monday Alarm Time: 7:00 Awake: Yes Be ready for your practice Mori! Test Case 2: (input) (input) (auto generated) (input) Vacation: False Day: Saturday Alarm Time: 10:00 Awake: No (input) (input) (auto generated) (input) You are not allowed to practice your taekwondo!
PLEASE CODE IN PYTHON Problem Description:In order to ensure peace and prosperity for future generations, the United Nations is creating the world’s largest candy. The ingredients must be taken in railway cars from the top of a mountain and poured into Lake Geneva. The railway system goes steeply from the mountaintop down to the lake, with a T-shaped branch in the middle as shown below. Right now, each of the N ingredients is in its own railway car. Each railway car is assigned a positive integer from 1 to N. The ingredients must be poured into the lake in the order 1, 2, 3, . . . , N but the railway cars are lined up in some random order. The difficulty is that, because of the especially heavy gravity today, you can only move cars downhill to the lake, or sideways on the branch line. Is it still possible to pour the ingredients into the lake in the order 1, 2, 3, . . . , N ? For example, if the cars were in the order 2, 3, 1, 4, we can slide these into the lake in order as described…
EX2010 Mathematics - Computing Coursework C-Cwo(y) West North C=Cnc (X) South дс = 0 By Oc =0 ax East x In a rectangular domain illustrated above, the concentration C satisfies the following advection- diffusive equation, ac ac (a²c a²c\ ас at ax +u+v. =Г ду + in which u and v are velocity in x and y directions; I' is a diffusion coefficient. The length L and width Ly of the domain are 50 m and 1 m, respectively. The corresponding boundary conditions are a On the west boundary x=0: C = Cwo(y) = Cya (y-1)) where Cya is the centration at y ya and a is a coefficient. In this problem, ya=0.1, Cya = 1.0 and α = 1/8; ⚫ On the north boundary y = Ly: C ⚫ On the east boundary x = Lx: = 0 = CnL(x) = 0; ac ax ⚫ On the south boundary y = 0:3 дс = 0 ay At the initial time, C=0. You are asked to calculate the concentration distribution at /= 100s using the finite difference method. For simplicity, both the velocity and the diffusion coefficient are specified as constant values, i.e. u = 1.5 m/s, v =…
A group of firends Anna (A), Bjorn (B), Candice (C), David (D) and Ellen (E) want to enter a basketball contest that caters for teams of different sizes. A team with n players is called an n-team. A player can be in several different teams, including teams of the same size. There is a restriction however: players in a 2-team cannot polay together in any larger team. For example, if friends A,B,C,D form the teams AB, BCD, ACD, then they cannot also form the teams BD or ABC, among others. The five friends want to enter 8 teams including at least one 2-team and at least one 3-team and no team of any other size. Find three ways of doing this with a different number of 3-teams in each case.
• Consider this Texas Hold 'em poker game system: – 2 to 8 human or computer players – Each player has a name and stack of chips – Computer players have a difficulty setting: easy, medium, hard – Summary of each hand: • Dealer collects ante from appropriate players, shuffles the deck, and deals each player a hand of 2 cards from the deck. • A betting round occurs, followed by dealing 3 shared cards from the deck. • As shared cards are dealt, more betting rounds occur, where each player can fold, check, or raise. • At the end of a round, if more than one player is remaining, players' hands are compared, and the best hand wins the pot of all chips bet. – Draw a class diagram for this system. Include relationships between classes (generalization and associational).
Project Optimization and regression: Exact and approximate methods to solve 0-1 Knapsack problem Description The 0/1 Knapsack Problem and Logistics Transportation companies such as TNT and Royal Mail face daily problems in logistics. Consider the following simple logistics problem, which you will solve: An airline cargo company has 1 aeroplane which it flies from the UK to the US on a daily basis to transport some cargo. In advance of a flight, it receives bids for deliveries from (many) customers. Customers state the weight of the cargo item they would like delivered, and the amount they are prepared to pay. The airline is constrained by the total amount of weight the plane is allowed to carry. The company must choose a subset of the packages (bids) to carry in order to make the maximum possible profit, given the weight limit that they must respect. In mathematical form the problem is: Given a set of N items each with weight wi and value vi, for i=1 to N, choose a subset of items…
Show a context-free grammar for each of the following languages. Example 1: {a bm: m > n, m-n is even} Context-free grammar for the language: S -> aSb S -> Sbb S-> € Example 2: {albi: i, j ≥ 0 and 2i = 3j + 1} Context-free grammar for the language: S->aaaSbb S -> aab
int x1-200% int y1-300, int z1, z2, z3, z4, int d1. d2, d3, asm mov EAX, x1, 200 mov EBX, y1: 300 mov z1, ESP, assume initial ESP OFFF FFEA add EAX, x1, 400 push EAX, mov d1, EAX 400 mov z2, ESP: push EBX: SUB EBX, x1: 300-200=100 mov d2, EBX mov z3, ESP: POP ECX, MOV d3, ECX, MOV z4, ESP, POP EDX, mov d4, EDX, What is z1 in Hexidecimal? O OFFF FFEA O OFFF FFE6 O OFFF FFE2 O OFFF FFEE
Exercise 1 Santa is worried about his employee relations, since christmas preparations have led to a lot of overtime. To make sure all the elves are happy, he wants to recruit some of them as complaint officers, with weekly meetings to report any complaints or worries to him. His worker elves W are pretty busy already, so Santa wants to task no more than k elves with this additional workload. Still, Santa wants to make sure that for as many elves e e W as possible, at least one of his friends (whose identities he knows) is a complaint officer. 1. Give an intuitive greedy algorithm that outputs k elves that will serve as compliant officers. 2. Prove that for large numbers of k the algorithm approximates a solution with ratio no more than (1 – !).
You are the chief commander of US Army; you have been deployed in an ongoing war training of defusing the mine. Mines are placed on the ground which can be considered as a gird of size N*M. Each block (i, j) has a mine in it if and only if the summation of the block coordinates is divisible by 2. Your task is to move from the first row to the last row. The mines will not blow if the given rules are followed: • If you are on even row you can move to any cell that is in the neighborhood • If you are on odd row, you can only go the odd row that has mine on that and same with the unmined row. You have to develop a python program to calculate the number of ways to reach row number N starting from row number 1. Test Cases: 4 8 Output: 10
On a chess board of r rows and c columns there is a lone white rook surrounded by a group of opponent's black knights. Each knight attacks 8 squares as in a typical chess game, which are shown in the figure - the knight on the red square attacks the 8 squares with a red dot. The rook can move horizontally and vertically by any number of squares. The rook can safely pass through an empty square that is attacked by a knight, but it must move to a square that is not attacked by any knight. The rook cannot jump over a knight while moving. If the rook moves to a square that contains a knight, it may capture it and remove it from the board. The black knights. never move. Can the rook eventually safely move to the designated target square? The figure illustrates how the white rook can move to the blue target square at the top-right corner in the first sample case. The rook captures one black knight at the bottom-right of the board on its way. Rok nd kight lcoes by Chunen Input The first line…