Module finder

The module introduces more advanced operational research (OR) techniques that can be used to solve a wide range of problems in business and management including scheduling, networks, inventory control and queueing theory. It is split into two parts covering stochastic OR and deterministic OR respectively.

The Stochastic OR Techniques part introduces the concepts and applications of queuing theory and inventory control. Queueing theory can be applied to a wide range of stochastic systems, allowing estimation of statistics of interest such as resource utilisation, delays and the expected time spent within the system. Inventory control helps solve problems in inventory management where demand can be stochastic.

In the deterministic OR section, the module introduces dynamic programming, machine scheduling, project networks, and heuristics. Dynamic programming is introduced as a technique for tackling problems in which decisions can be made sequentially. For machine scheduling, the main focus is on introducing the main problem types and developing solution procedures for selected models. For project networks, the representation of projects as networks and methods for analysing such networks is covered. Following a discussion of the reasons for using heuristic methods for complex problems, a discussion of the properties of good heuristics is given. Some of the design principles for heuristics are explained, and local search heuristics are discussed.

The module introduces more advanced operational research (OR) techniques that can be used to solve a wide range of problems in business and management including scheduling, networks, inventory control and queueing theory. It is split into two parts covering stochastic OR and deterministic OR respectively.

The Stochastic OR Techniques part introduces the concepts and applications of queuing theory and inventory control. Queueing theory can be applied to a wide range of stochastic systems, allowing estimation of statistics of interest such as resource utilisation, delays and the expected time spent within the system. Inventory control helps solve problems in inventory management where demand can be stochastic.

In the deterministic OR section, the module introduces dynamic programming, machine scheduling, project networks, and heuristics. Dynamic programming is introduced as a technique for tackling problems in which decisions can be made sequentially. For machine scheduling, the main focus is on introducing the main problem types and developing solution procedures for selected models. For project networks, the representation of projects as networks and methods for analysing such networks is covered. Following a discussion of the reasons for using heuristic methods for complex problems, a discussion of the properties of good heuristics is given. Some of the design principles for heuristics are explained, and local search heuristics are discussed.

The module introduces more advanced operational research (OR) techniques that can be used to solve a wide range of problems in business and management including scheduling, networks, inventory control and queueing theory. It is split into two parts covering stochastic OR and deterministic OR respectively.

The Stochastic OR Techniques part introduces the concepts and applications of queuing theory and inventory control. Queueing theory can be applied to a wide range of stochastic systems, allowing estimation of statistics of interest such as resource utilisation, delays and the expected time spent within the system. Inventory control helps solve problems in inventory management where demand can be stochastic.

In the deterministic OR section, the module introduces dynamic programming, machine scheduling, project networks, and heuristics. Dynamic programming is introduced as a technique for tackling problems in which decisions can be made sequentially. For machine scheduling, the main focus is on introducing the main problem types and developing solution procedures for selected models. For project networks, the representation of projects as networks and methods for analysing such networks is covered. Following a discussion of the reasons for using heuristic methods for complex problems, a discussion of the properties of good heuristics is given. Some of the design principles for heuristics are explained, and local search heuristics are discussed.

Fundamentals of Bio-organic Chemistry

Nucleic Acids Chemistry
• Chemical structure and properties of nucleosides, nucleotides, nucleic acids.
• Structure and properties of DNA – A, B, and Z-DNA structures, Watson-Crick base pairing.
• The biological and biochemical mechanisms of DNA replication and transcription.
• Synthesis of nucleosides as drugs and for oligonucleotide synthesis, involving protecting group chemistry.
• Automated solid-phase DNA synthesis using phosphoramidite chemistry with emphasis on the reaction mechanisms of each step.

Carbohydrate Chemistry
An Introduction to Carbohydrates, their classification, structure and representation,
Mutarotation, anomeric effect, conformational equilibria, death-taxes-protecting groups,
Glycosyl donors/acceptors, polysaccharides and nucleosides.

Enzymology and Protein Chemistry
• The structure of amino acids and the primary, secondary and tertiary structure of peptides and proteins.
• Mechanism of the serine proteases – the Asp-His-Ser catalytic triad and stabilisation of the tetrahedral oxyanion intermediate by hydrogen bonding.
• Molecular basis for the selectivity of the serine proteases – trypsin as compared to chymotrypsin.
• Mechanism of the methyltransferases
• Michaelis-Menten enzyme kinetics.
• The chemical reactions of glycolysis.
• .The chemistry of amino acid biosynthesis.

Natural Product Biosynthesis
• Thioesters of co-enzyme A as acyl group carriers in biosynthesis.
• Chemical structure of terpenes (including monoterpenes, sesquiterpenes, diterpenes and polymers) and their derivation from isoprene units.
• The biosynthetic pathway to isoprenoids - Claisen-like, Aldol and decarboxylation mechanisms and the subsequent formation of isoprene equivalents illustrated by dimethyl allyl pyrophosphate (DMAPP).
• Terpene biosynthesis: The reaction steps fall into three classes: i) initiation: formation of the carbocation ii) propagation: rearrangement/reaction of the carbocation iii) termination: quenching of the carbocation. Formation of a wide variety of monoterpenes by quenching of the α-terpinyl cation.
• Biosynthesis of sequiterpenes, diterpenes and triterpenes.
• Fatty acid biosynthesis. Six key steps: i) thioester formation ii) C-C bond formation iii) ketone reduction iv) dehydration v) enoyl reduction vi) thioesterase.
• Polyketide and aliphatic polyketide biosynthesis. Aromatic Polyketide biosynthesis.
• Biosynthesis of 6-methylsalicylic acid, tetracylins. Modular polyketide synthases, erythromycin biosynthesis, engineering novel polyketide antibiotics.

Partial Differential Equations (PDEs) occur frequently in many areas of mathematics. This module extends earlier work on PDEs by presenting a variety of more advanced solution techniques together with some of the underlying theory.

Partial Differential Equations (PDEs) occur frequently in many areas of mathematics. This module extends earlier work on PDEs by presenting a variety of more advanced solution techniques together with some of the underlying theory.

Partial Differential Equations (PDEs) occur frequently in many areas of mathematics. This module extends earlier work on PDEs by presenting a variety of more advanced solution techniques together with some of the underlying theory.

Partial Differential Equations (PDEs) occur frequently in many areas of mathematics. This module extends earlier work on PDEs by presenting a variety of more advanced solution techniques together with some of the underlying theory.