|
overall points |
overall success rate |
overall average |
|
153.5 |
100 |
80.70 |
|
exemptionst |
||||||||||||||||||||||
|
grade |
credit points |
course name |
||||||||||||||||||||
|
without points |
0.0 |
113013 - INTRODUCTORY PHYSICS 1
Statics: vectors, components of vectors, vector addition, moments,
equilibrium of forces. Kinematics: velocity, constant velocity,
relative velocity, acceleration, motion with constant accleration
along straight line, free fall, projectiles. Dynamics: Newton's laws,
mass and force, friction, inclined plane, impulse and momentum,
conservation of momentum, collisions. Energy: work and power,
mechanical energy (potential and kinetic), conservation of energy,
elastic and inelastic collisions. Central force: circular motion,
angular velocity, frequency and period, centripetal acceleration,
centripetal force. Gravitation: Kepler's laws, force of universal
attraction, acceleration due to gravity, gravitational potential,
escape velocity. Simple Harmonic Motion: displacement, velocity and
acceleration as functions of time, potential energy and total
enery in
S.H.M., pendulum and springs.
|
||||||||||||||||||||
|
without points |
0.0 |
113014 - INTRODUCTORY PHYSICS 2
Electrostatics: Coulomb law, Electric field, Gauss
law, Electric potential, capacitance, capacitors, induced charges.
Electrodynamics: electric current, resistance, electromotive force,
Kirchof's laws, electric power, Joules law. Magnetism: Magnetic
field,
Lorentz force, magnetic force on conductors carrying current,
magnetic
field due to electric currents, electromagnetic induction, Faraday
law. Geometrical optics: Snell's laws, reflection and refraction by
planar and spherical surfaces, total reflection, dispersion, thin
lenses, simple optical instruments.
|
||||||||||||||||||||
|
exempt with points (from delft) |
3.0 |
234325 - COMPUTER GRAPHICS
|
||||||||||||||||||||
|
exempt with points (from delft) |
3.0 |
236363 - DATABASE SYSTEMS
|
||||||||||||||||||||
|
exempt with points (from delft) |
1.5 |
|||||||||||||||||||||
|
exempt with points (from delft) |
3.5 |
|
||||||||||||||||||||
|
exempt with point (from delft) |
3.0 |
236941 - INTRODUCTION TO NEURAL NETWORKS
|
||||||||||||||||||||
|
exempt with points |
3.0 |
324012 - TECHNICAL ENGLISH
Advanced level English. The principal aim of this
course is the improvement of students' ability to read professional
literature. The groups are homogeneous according to faculties and
cover authentic material specific to their field. Grammar and syntax
relevant to technical and scientific writing is covered. In addition,
the course stresses oral and written skills. Students completing this
course have completed all English requirements.
|
||||||||||||||||||||
|
|
17.0 |
overall exempt points |
||||||||||||||||||||
|
spring 1995/96 |
||||||||||||||||||||||||||||||||||||||||||||||||||||
|
grade |
credit points |
course name |
||||||||||||||||||||||||||||||||||||||||||||||||||
|
78 |
5.0 |
104010 - DIFFERENTIAL AND INTEGRAL CALCULUS 1M
The final grade will be determined by weekly quizzes, one midterm
exam
and a final exam. The real numbers. Infinite sequences of real
numbers. Real functions of one variable: limits, continuity,
continuity on a closed interval, monotonic functions and inverse
functions. Differentiability and the main theorem of the differential
calculus. The Taylor theorem, the L'Hopital rule and study of the
behavior of a function. The antiderivative and methods of
integration.
The definite integral and its properties. Integrable functions. The
principle theorems of the integral calculus. Improper integrals.
Vectors in R2 and R3. Scalar product, vector product and mixed
product. The equations of planes and lines. Conditions for
colinearity
and coplanarity. In the course 104110 there is a greater emphasis on
theory and applications than in 104003
|
||||||||||||||||||||||||||||||||||||||||||||||||||
|
85 |
5.0 |
104167 - ALGEBRA A
Fields, complex numbers, vector spaces, subspaces, bases, dimension,
linear equations, matrices, the Gauss elimination process:
determinants, linear transformations, kernels, images, Hom (V,w), Hom
(V,V), determinants, eigenvalues and diagonalization.
|
||||||||||||||||||||||||||||||||||||||||||||||||||
|
86 |
4.0 |
234111 - INTRODUCTION TO COMPUTER SCIENCE
Computer architecture. Algorithmic approach to problem solving. Basic
concepts in the C language. Top-down design. Structured programming.
Bottom-up design. Debugging. Partial and complete correctness
proof of
programs. Measures of algorithm efficiency: time and space
complexity.
Polynomial and exponential time. Probabilistic analysis of
algorithms.
Randomized algorithms. Intractable problems. Stack. Queue.
Representations of arithmetic expressions, and implementation of
their
evaluation by stack. Recursion and its implementation. Branch and
Bound Search. Efficient sorting.
|
||||||||||||||||||||||||||||||||||||||||||||||||||
|
67 |
3.0 |
234144 - DISCRETE MATHEMATICS
Combinatorics: basic counting techniques, Newton's Binom, inclusion -
exclusion principle, recursion, induction. Set theory: basic
definitions, relations, functions, equivalence relation, order
relation, cardinality of sets and cardinal numbers, Cantor's diagonal
procedure.
|
||||||||||||||||||||||||||||||||||||||||||||||||||
|
67 |
3.0 |
234145 - DIGITAL SYSTEMS
Logical operations, Boolean algebra. Combinational circuits and their
various realizations. Minimization techniques. Electronic logic
elements. Various codes. Design and analysis of synchronous and
asynchronous sequential systems. Memory elements. Counters and
registers. Design examples of digital control systems. Simplification
methods of sequential circuits. Limitations of sequential
circuits.
|
||||||||||||||||||||||||||||||||||||||||||||||||||
|
average 78.10 success |
20.0 |
total |
||||||||||||||||||||||||||||||||||||||||||||||||||
|
winter 1996/97 |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
grade |
credit points |
course name |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
71 |
5.0 |
104011 - DIFFERENTIAL AND INTEGRAL CALCULUS 2M
Functions of several variables, basic differential calculus of such
functions. Multiple integrals, line integrals, surface integrals,
vector calculus. Numerical series, sequences and series of functions,
power series. Additional topics in differential calculus: Taylor's
formula, local and global extrema, implicit functions,
transformations
in Rn.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
63 |
2.5 |
104134 - MODERN ALGEBRA H
Properties of integers, equivalence relations, groups, sub-groups,
cyclic groups, normal sub-groups, Lagrange's theorem, quotient
groups,
the homomorphisms theorems, rings and fields: definition and
examples,
polynomial rings, the Euclidean algorithm and the g.c.m., zero
divisors, integral domains, ideals, quotient rings, and the
homomorphism theorem, unique factorization in rings of polynomials
over a field.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
57 |
3.5 |
114071 - PHYSICS 1M
Classical mechanics: Newton's laws, dynamics of a particle, Galilean
transformation, non-inertial systems, conservation of energy, linear
momentum and angular momentum, many-particle systems, dynamics of
rigid bodies, harmonic oscillator, gravitation. Relativistic
mechanics: Lorentz transformation of space time and of
momentum-energy, velocity transformation, relativistic dynamics,
zero-mass particles.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
81 |
2.0 |
214101 - EDUCATIONAL PSYCHOLOGY 1
Histirical background (schools of thought) and research methods.
individual differences: intelligence and its measurement cognitive
development (Piaget, Bruner, language development) social aspects of
personality development (Erikson). Special education: cognitive,
emotional and motor aspects, learning disabilities. Cognitive
theories, memory, forgetting, attention. Learning theories:
definition
of types of learning, conditioning, information processing, social
learning, problem solving and creativity, creativity tests,
transfer.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
86 |
3.0 |
234118 - COMPUTER ORGANIZATION AND PROGRAMMING
The computer model and its software systems, from a user's
perspective. Memory organization and information representation.
Machine instruction format and addressing modes. Structure of
programs
in Assembly Language, symbols and instructions to the assembler.
One-pass and two-pass assemblers. Assembly language programming,
loops, condition codes and subroutines. Implementation of data
structures (arrays and linked lists). Input/output and interrupts,
linking and loading.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
85 |
3.0 |
234122 - INTRODUCTION TO SYSTEMS PROGRAMMING
C complements: structures, linked lists, modules, memory management,
file handling, the compilation process. Using the UNIX
environment and
system tools for software construction: the file system, processes,
building blocks, shell scripts, version control, managing the
compilation process.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
94 |
1.0 |
394806 - PHYSICAL EDUCATION COURSES
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
average: 74.10 success |
20.0 |
total |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
spring 1996/97 |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
grade |
credit points |
course name |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
70 |
2.5 |
104131 - ORDINARY DIFFERENTIAL EQUATIONS/H
First order differential equations: linear, separable, exact,
integrating factors, homogeneous equations, existence and uniqueness
theorem (without proof), linear differential equations of order n,
systems of linear differential equations, solution of differential
equations by power series, Bessel's equation.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
65 |
4.5 |
114072 - PHYSICS 2M
Electrostatics, electric field and electric potential, electric
current, fields of a moving charges, magnetic field, electromagnetic
induction, Maxwell equations, fields in matter. Introduction to
waves,
dispersion, reflection and refraction, phase and group velocities,
momentum and energy of electromagnetic waves, polarization,
interference and diffraction.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
93 |
3.0 |
234218 - DATA STRUCTURES 1
Emphasis on abstract data structures, selection and designing data
structures for efficient solution of given problems. Various data
structures, their properties, implementations and applications:
arrays, stacks, queues, dequeues, various types of lists, search
trees, heaps and priority queues, hash-tables. Other topics: basic
concepts of complexity, garbage collection, memory allocation,
internal and external sorting and searching.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
97 |
3.0 |
234246 - GRAPH ALGORITHMS
The course includes topics of graph theory with emphasis on
algorithmic questions and their complexity. Typical subjects: Euler
paths, shortest-path algorithms, trees, minimum trees, directed
trees,
Konig's infinity lemma, tree enumeration, depth-first search and
finding the nonseparable components, Huffman's code, network flow
(max-flow min-cut theorem, algorithms for max-flow, networks with
bounds, minimum flow).
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
94 |
3.0 |
234262 - LOGICAL DESIGN
Building blocks for digital design, with and without memory. Timing
considerations. Binary arithmetic and its implementation. Algorithms
for speeding up arithmetic operations. Memories. Programmable logic
and its implementation.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
65 |
3.0 |
234292 - LOGIC FOR COMPUTER SCIENCE 1
The purpose of the course is to present a formal language to express
problems of mathematics and computer science. Topics: the natural
numbers, and the principle of induction, first order logic,
interpretations, satisfiability and validity, axiomatization, formal
proofs, decidability and completeness, application to computer
science.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
99 |
1.0 |
394806 - PHYSICAL EDUCATION COURSES
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
average: 80.70 success |
20.0 |
total |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
winter 1997/98 |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
grade |
credit points |
course name |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
91 |
4.0 |
094412 - PROBABILITY (ADVANCED)
Probability spaces. Conditional probability. Random variables.
Transformation of random variables. Expectations and moments.
Discrete
and continuous distributions. Vector of random variablrs and their
joint distributions. Characteristic functions and limit theorems.
Conditional distributions and expectations.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
97 |
3.5 |
124002 - CHEMISTRY 1B
Basic concepts and stoichiometry, atomic structure, properties of
atoms and the periodic table, chemical bonds, atomic and molecular
orbitals, kinetics and equilibrium, gases acids and bases, redox
reactions, solubility of ionic solids.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
69 |
4.0 |
234107 - NUMERICAL ANALYSIS 1
Introduction to numerical analysis, error analysis, approximation of
functions, interpolation, spines, least squares, orthogonal
polynomials, numerical integration and differentiation, solution of
non-linear equations, direct methods for the solution of systems of
linear equations, introduction to the numerical solution of
P.D.E.'s.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
85 |
3.5 |
234119 - INTRODUCTION TO OPERATING SYSTEMS
Using system services. Process management: context switching, process
scheduling. Synchronization of processes: the critical section
problem, semaphores, message passing. Main memory management, virtual
memory. Interrupt and exception handling. Clock interrupts.
Input/output management. Initialization File systems. The course is
based on laboratory work.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
100 |
3.0 |
234267 - DIGITAL COMPUTER ARCHITECTURE
234248 - INT. TO DIGITAL COMPUTER
1. The dynamic methodology, role and structure of functional
units. 2.
The instruction set. 3. The structure of a processor built by the
controller + data path. 4. Basic pipeline. 5. Pipeline hazards.
6. The
memory hierarchy. 7. I/O. (This course is for students who did not
take "Logical Design")
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
66 |
3.0 |
236353 - AUTOMATA AND FORMAL LANGUAGES
Finite automata and regular languages, nondeterministic automata,
closure properties of regular languages, Nerode and Kleene Theorems,
algebra of regular expressions, transition from automata to regular
expressions and vice versa, the Chomsky hierarchy, context- free
grammars, reductions and normal forms, push-down automata, pumping
lemma, closure properties of context-free languages, ambiguity.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
average 84.50 success |
21.0 |
total |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
spring 1997/98 |
||||||||||||||||||||||||||||||||||||||||||||||||||||
|
grades |
credit points |
course name |
||||||||||||||||||||||||||||||||||||||||||||||||||
|
99 |
2.0 |
085201 - INTRODUCTION TO AEROSPACE ENGINEERING
Summarized history of the development of the
aerospace sciences.
Types and components of flight vehicles. Basic aerodynamics
(concepts,
dimensions, standard atmosphere, etc.), subsonic and supersonic
flows.
Astronautics, propulsion, flight control, aerospace structures,
stability and flight mechanics. The airplane as a system.
|
||||||||||||||||||||||||||||||||||||||||||||||||||
|
70 |
3.5 |
094591 - INTRODUCTORY ECONOMICS
Supply, demand and market equilibrium, government policy and its
effect on the equilibrium. Production, cost function and
derivation of
the supply curve. Behavior under various market structures: perfect
and imperfect competition. The national economy: the national
accounts. Determination of national income in a Keynsian model. The
interest rate and its effect on investment. Equilibrium in the money
market. Money demand and supply. General equilibrium in the
commodities and money market. Fiscal and monetary policies.
|
||||||||||||||||||||||||||||||||||||||||||||||||||
|
57 |
3.0 |
236343 - THEORY OF COMPUTATION
Recursive and primitive recursive functions, Turing machines.
Equivalence between several models, Church's thesis, universal
machine, undecidable problems, deterministic and nondeterministic
machines, the class P and NP-completeness, Cook's Theorem.
|
||||||||||||||||||||||||||||||||||||||||||||||||||
|
70 |
3.0 |
236360 - THEORY OF COMPILATION
Theoretical background and practical techniques involved in writing a
compiler, grammars and languages, programming a scanner, top-down
parsers with and without backup, simple precedence grammars and their
parsers, and other bottom-up recognizers, run-time storage
organization, symbol tables, internal forms of the source program,
semantic routines for block-structured languages, storage allocation,
error recovery, code of organization, hints to the compiler
writer.
|
||||||||||||||||||||||||||||||||||||||||||||||||||
|
77 |
3.0 |
236501 - INTRODUCTION TO ARTIFICIAL INTELLIGENCE
Heuristic methods for search in problem spaces. Search in game trees.
Methods for knowledge representation using: logic, semantic networks,
frame systems, probabilistic networks. Additional possible topics:
learning systems, natural language processing, expert systems,
planning.
|
||||||||||||||||||||||||||||||||||||||||||||||||||
|
80 |
3.0 |
236703 - OBJECT-ORIENTED PROGRAMMING
Comparative approach to object-oriented programming in different
languages. The concept of an "object". Classes and methods,
abstract data types, inheritance and multiple inheritance.
Applications for implementing user interface. Writing programs in
several object-oriented languages, including smalltalk and C++. Final
project.
|
||||||||||||||||||||||||||||||||||||||||||||||||||
|
average 74.00 success |
17.5 |
total |
||||||||||||||||||||||||||||||||||||||||||||||||||
|
winter 1998/99 |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
grades |
credit points |
course name |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
84 |
2.5 |
097317 - COOPERATIVE GAME THEORY
Matching games. Games in characteristic function form. Games in
strategic form. Utility theory. Bargaining games. Social welfare
functions and Arrow's impossibility theorem. |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
79 |
3.0 |
236334 - INTRODUCTION TO COMPUTER NETWORKS
A basic course in computer networks. Structure of computer networks,
ARQ protocols for the data link layer. The MAC layer and Local Area
Networks. Bridging architectures for Local Area Networks.
Introduction
to TCP/IP networking.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
76 |
3.0 |
236342 - INTRODUCTION TO SOFTWARE VERIFICATION
Various methods for program verification with respect to given
specifications. The course consists of two parts. The first part
introduces deductive methods. The second presents model-checking
methods. The deductive approach (input-output programs): partial
correctness and termination of flowchart programs. The compositional
approach - partial correctness and termination. Arrays and
(non-recursive) procedures. Development of a program from its
specification based on deductive rules. The model chacking approach
(reactive programs): Temporal logics and kripke structures. CTL model
chicking with fairness. BDDs and their use. Concise representation of
the state space. Symbolic model checking. Using a software tool for
model checking.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
82 |
3.0 |
236364 - STRUCTURE OF OPERATING SYSTEMS
Processes and threads: coordination (mutual exclusion and
synchronization), scheduling algorithms and performance measures,
virtual memory management: paging algorithms, deadlock detection and
recovery, multiprocessors and distributed operating systems: models,
interprocessor communication, distributed shared memory and
distributed file systems.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
97 |
3.0 |
236502 - ARTIFICIAL INTELLIG.& HEURISTICS LABORAT
This laboratory course consists of a large software project in
artificial intelligence. Students will work singly or in small teams
under close supervision of a laboratory assistant. The project
will be
selected by the senior faculty member responsible for the
laboratory.
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
94 |
3.0 |
236503 - PROJECTS IN ADVANCED PROGRAMMING A
The object is to provide insight in advanced software. The development methodology includes study and analysis of the chosen subject. Planning, implementation and verification of the solution on a computer. Evaluation of the produced program. Writing detailed documentation
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
רבע |
1.0 |
324864 - ENTERPRENEURSHIP 1
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
97 |
1.0 |
394806 - PHYSICAL EDUCATION COURSES
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
average 86.00 success |
19.5 |
total |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
spring 1998/99 |
|||||||||||||||||||||||||||||||||||||
|
grades |
credit points |
course name |
|||||||||||||||||||||||||||||||||||
|
58 |
3.0 |
236312 - DATA STRUCTURES 2
The course presents and analyzes advanced data structures.
Techniques:
amortized time, backward analysis, dynamization, persistent data
structures. Data structures: Fibonacci heaps, search trees, splay
trees, treaps, universal and perfect hash tables, loglog N priority
queues, dynamic trees. Applications: Minimum spanning trees, network
flows, pattern matching, problems in computational geometry.
|
|||||||||||||||||||||||||||||||||||
|
92 |
3.0 |
236350 - PROTECTION IN PROGRAMMED SYSTEMS
Fundamental definitions: mechanism, policy, complete mechanism, sound
mechanism. Function levels of protection: isolation, controlled
sharing, memoryless execution, mutual suspicion, controlled
information flow. Insufficiency of second generation protection
mechanisms. Design principles: complete mediation, least privilege,
least common mechanism. Integrity: Kernel approach, verification,
generic classification, relation to software engineering. Access
control models: Lampson, Graham and Denning, Jones. Access control
scheme: password, capabilities, ACLs. Encryption, encryption in
programmed environments, comparison with access control. Controlled
information flow: the data mark machine, Denning's lattice model,
extending access control mechanism to control information flow,
covert
channels, virtual execution, multilevel information systems. Case
studies: MULTICS, HYDRA, CAP, RACF.
|
|||||||||||||||||||||||||||||||||||
|
96 |
4.0 |
236354 - VLSI CIRCUIT DESIGN
This course covers the design principles of VLSI circuits from
practical and theoretical perspectives. Issues of low level circuit
and layout design are investigated with the aid of CAD tools. Higher
level design issues are addressed via theoretical models that
facilitate cost analyses. This course includes a design project to be
executed by the student.
|
|||||||||||||||||||||||||||||||||||
|
85 |
3.0 |
236370 - PARALLEL AND DISTRIBUTED PROGRAMMING
Survey of computational models and synchronization primitives.
Control
of structures: monitors, rendezvous, message passing of CSP. Special
problems: mutual exclusion, deadlock, starvation, global termination.
Dividing a program into processes: properties of safety,
liveness, and
fairness. Developing a correct and efficient parallel program. The
course includes programming exercises.
|
|||||||||||||||||||||||||||||||||||
|
100 |
2.0 |
236601 - ADVANCED TOPICS IN COMPUTER SCIENCES 1
|
|||||||||||||||||||||||||||||||||||
|
92 |
2.0 |
236806 - SEMINAR IN COMPUTER SCIENCE 6
my seminar was in hardware: i did a lecture on hardware simulation. |
|||||||||||||||||||||||||||||||||||
|
96 |
1.5 |
324402 - ORIGIN OF LIFE# PHILOSOPHY AND SCIENCE
|
|||||||||||||||||||||||||||||||||||
|
average 87.40 success |
18.5 |
total |
|||||||||||||||||||||||||||||||||||
|
spring 1999/00 |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
grades |
credit points |
course name |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
- didnt get it yet ! |
3.5 |
094313 - DETERMINISTIC MODELS IN OPER.RESEARCH
Methodology of operations research. Distribution problems and the
transportation method. Linear programming. Formulating various
problems as linear and integer programming models. C.P.M. Maximal
flow
and other network models. Integer programming and branch and bound
method. Dynamic programming.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
- |
0.0 |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||