overall points overall success rate overall average 153.5 100 80.70

exemptionst

credit points

course name

without points

0.0

### 113013 - INTRODUCTORY PHYSICS 1

Lecture Tutorial Laboratory Project/Seminar
Weekly hours 0 0 0 0
Credit points
0.0

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

0

0

0

0

Credit points

0.0

 Prerequisites: ( 113013 - INTRODUCTORY PHYSICS 1 )

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

2367 04

exempt with points

(from delft)

3.5

2367 05

236704 and 236705 where given me for the project i did in delft (in delft i got 8 points) this is the best they could do.

exempt with point

(from delft)

3.0

### 236941 - INTRODUCTION TO NEURAL NETWORKS

exempt with points

3.0

### 324012 - TECHNICAL ENGLISH

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

4

0

0

0

Credit points

3.0

 Prerequisites: ( 324022 - SCIENTIFIC ENGLISH 2 )

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

credit points

course name

78

5.0

### 104010 - DIFFERENTIAL AND INTEGRAL CALCULUS 1M

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

4

2

0

0

Credit points

5.0

 Overlapping courses: 104195 - INFINITESIMAL CALCULUS 1 104003 - DIFFERENTIAL AND INTEGRAL CALCULUS 1

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

4

2

0

0

Credit points

5.0

 Overlapping courses: 104016 - ALGEBRA 1/EXTENDED 104005 - ALGEBRA 1

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

2

2

0

Credit points

4.0

 Overlapping courses: 234102 - INTRODUCTION TO COMPUTERS-MECH.ENG-C 234104 - INTR. TO COMPUTERS# CHEM.ENG.FORTRAN 234109 - INTRODUCTION TO COMPUTERS - FORTRAN 234112 - PROGRAMMING (C) 234114 - INTRODUCTION TO COMPUTER SCIENCE 234108 - INTRODUCTORY PROGRAMMINGS FOR MEDICAL ST

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

 Overlapping courses: 104286 - COMBINATORICS

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

 Linked courses: 104133 - LINEAR ALGEBRA H 104134 - MODERN ALGEBRA H 044145 - 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
100%

20.0

total

winter 1996/97

credit points

course name

71

5.0

### 104011 - DIFFERENTIAL AND INTEGRAL CALCULUS 2M

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

4

2

0

0

Credit points

5.0

 Prerequisites: Incorporated courses: ( 104010 - DIFFERENTIAL AND INTEGRAL CALCULUS 1M ) 104004 - DIFFERENTIAL AND INTEGRAL CALCULUS 2 104281 - INFINITESIMAL CALCULUS 2 104282 - INFINITESIMAL CALCULUS 3

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

2.5

 Prerequisites: ( 104016 - ALGEBRA 1/EXTENDED ) or ( 104167 - ALGEBRA A )

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

3

1

0

0

Credit points

3.5

 Prerequisites: Linked courses: ( 113013 - INTRODUCTORY PHYSICS 1 ) 104010 - DIFFERENTIAL AND INTEGRAL CALCULUS 1M 114001 - PHYSICS 1C 114051 - PHYSICS 1

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

2

0

0

Credit points

3.0

 Overlapping courses: 214104 - DEVELOPMENTAL PSYCHOLOGY 214107 - COGNITIVE PSYCHOLOGY

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

1

0

Credit points

3.0

 Prerequisites: Overlapping courses: ( 234111 - INTRODUCTION TO COMPUTER SCIENCE ) or ( 234114 - INTRODUCTION TO COMPUTER SCIENCE ) 044264 - SYSTEM 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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

2

0

0

Credit points

3.0

 Prerequisites: Linked courses: ( 234111 - INTRODUCTION TO COMPUTER SCIENCE ) or ( 234114 - INTRODUCTION TO COMPUTER SCIENCE ) 044264 - SYSTEM PROGRAMMING 234118 - COMPUTER ORGANIZATION AND PROGRAMMING 044101 - INTRODUCTION TO SYSTEM DESIGN 234121 - 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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

0

2

0

0

Credit points

1.0

average: 74.10

success
100%

20.0

total

spring 1996/97

credit points

course name

70

2.5

### 104131 - ORDINARY DIFFERENTIAL EQUATIONS/H

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

2.5

 Prerequisites: ( 104003 - DIFFERENTIAL AND INTEGRAL CALCULUS 1 and 104005 - ALGEBRA 1 ) or ( 104003 - DIFFERENTIAL AND INTEGRAL CALCULUS 1 and 104016 - ALGEBRA 1/EXTENDED ) or ( 104003 - DIFFERENTIAL AND INTEGRAL CALCULUS 1 and 104167 - ALGEBRA A ) or ( 104005 - ALGEBRA 1 and 104010 - DIFFERENTIAL AND INTEGRAL CALCULUS 1M ) or ( 104010 - DIFFERENTIAL AND INTEGRAL CALCULUS 1M and 104016 - ALGEBRA 1/EXTENDED ) or ( 104010 - DIFFERENTIAL AND INTEGRAL CALCULUS 1M and 104167 - ALGEBRA A ) 104029 - ORDINARY DIFFERENTIAL EQUATIONS A 104285 - ORDINARY DIFFERENITIAL EQUATIONS A

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

4

1

0

0

Credit points

4.5

 Prerequisites: Linked courses: ( 113014 - INTRODUCTORY PHYSICS 2 and 114071 - PHYSICS 1M ) 104011 - DIFFERENTIAL AND INTEGRAL CALCULUS 2M 114002 - PHYSICS 2C 114014 - WAVES, OPTICS, ACOUSTICS AND HEAT 114052 - PHYSICS 2

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

1

0

Credit points

3.0

 Prerequisites: ( 234121 - INTRODUCTION TO SYSTEMS PROGRAMMING and 234144 - DISCRETE MATHEMATICS ) or ( 104286 - COMBINATORICS and 234121 - INTRODUCTION TO SYSTEMS PROGRAMMING ) or ( 234122 - INTRODUCTION TO SYSTEMS PROGRAMMING and 234144 - DISCRETE MATHEMATICS ) or ( 104286 - COMBINATORICS and 234122 - INTRODUCTION TO SYSTEMS PROGRAMMING ) 044268 - INFORMATION STRUCTURES 035015 - APPLICATIONS OF DATA STRUCTURES

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

 Prerequisites: Linked courses: ( 104167 - ALGEBRA A and 234144 - DISCRETE MATHEMATICS ) 234218 - DATA STRUCTURES 1 044268 - INFORMATION STRUCTURES 104287 - COMBINATORIAL ALGORITHMS 104291 - COMBINATORIAL ALGORITHMS 046002 - DESIGN AND ANALYSIS OF 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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

 Prerequisites: Linked courses: ( 044145 - DIGITAL SYSTEMS ) or ( 234145 - DIGITAL SYSTEMS ) 234118 - COMPUTER ORGANIZATION AND PROGRAMMING 234246 - GRAPH ALGORITHMS

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

 Prerequisites: ( 234144 - DISCRETE MATHEMATICS )

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

0

2

0

0

Credit points

1.0

average:

80.70

success
100%

20.0

total

winter 1997/98

credit points

course name

91

4.0

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

3

2

0

0

Credit points

4.0

 Prerequisites: Overlapping courses: ( 104004 - DIFFERENTIAL AND INTEGRAL CALCULUS 2 ) or ( 104011 - DIFFERENTIAL AND INTEGRAL CALCULUS 2M ) 104024 - INTRODUCTION TO PROBABILITY 104034 - INTRODUCTION TO PRIBABILITY H 104222 - PROBABILITY THEORY 094419 - STATISTICS FOR THE SOCIAL SCIENCES 1 094450 - PROBABILITY

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

3

1

0

0

Credit points

3.5

 Incorporated courses: 124104 - INORGANIC CHEMISTRY 1 124105 - INORGANIC CHEMISTRY 1P

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

3

1

0

0

Credit points

4.0

 Prerequisites: ( 104011 - DIFFERENTIAL AND INTEGRAL CALCULUS 2M and 104167 - ALGEBRA A and 234111 - INTRODUCTION TO COMPUTER SCIENCE ) or ( 104011 - DIFFERENTIAL AND INTEGRAL CALCULUS 2M and 104016 - ALGEBRA 1/EXTENDED and 234111 - INTRODUCTION TO COMPUTER SCIENCE ) or ( 104011 - DIFFERENTIAL AND INTEGRAL CALCULUS 2M and 104167 - ALGEBRA A and 234114 - INTRODUCTION TO COMPUTER SCIENCE ) or ( 104011 - DIFFERENTIAL AND INTEGRAL CALCULUS 2M and 104016 - ALGEBRA 1/EXTENDED and 234114 - INTRODUCTION TO COMPUTER SCIENCE ) 085135 - NUMERICAL ANALYSIS FOR AERONAUTICAI ENG.

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

0

2

0

Credit points

3.5

 Prerequisites: ( 234118 - COMPUTER ORGANIZATION AND PROGRAMMING and 234218 - DATA STRUCTURES 1 ) or ( 044264 - SYSTEM PROGRAMMING and 234118 - COMPUTER ORGANIZATION AND PROGRAMMING )

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

 Prerequisites: ( 044264 - SYSTEM PROGRAMMING and 234262 - LOGICAL DESIGN ) or ( 234118 - COMPUTER ORGANIZATION AND PROGRAMMING and 234262 - LOGICAL DESIGN ) 234119 - INTRODUCTION TO OPERATING SYSTEMS 234248 - INT. TO DIGITAL COMPUTER 236267 - DIGITAL COMPUTER ARCHITECTURE

### 234248 - INT. TO DIGITAL COMPUTER

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

2

0

Credit points

3.0

 Prerequisites: ( 234246 - GRAPH ALGORITHMS )

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
100%

21.0

total

spring 1997/98

credit points

course name

99

2.0

### 085201 - INTRODUCTION TO AEROSPACE ENGINEERING

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

0

0

0

Credit points

2.0

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

3

1

0

0

Credit points

3.5

 Prerequisites: Overlapping courses: ( 104010 - DIFFERENTIAL AND INTEGRAL CALCULUS 1M ) 094590 - MANAGERIAL ECONOMICS FOR ENGINEERS

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

 Prerequisites: Overlapping courses: ( 234246 - GRAPH ALGORITHMS ) 046302 - COMPUTATIONAL MODELS 046002 - DESIGN AND ANALYSIS OF ALGORITHMS

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

 Prerequisites: ( 236353 - AUTOMATA AND FORMAL LANGUAGES )

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

 Prerequisites: ( 234218 - DATA STRUCTURES 1 and 234246 - GRAPH ALGORITHMS and 234292 - LOGIC FOR COMPUTER SCIENCE 1 ) 096210 - FOUNDATIONS AND APPLICATIONS OF ARTIFICI 048997 - 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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

1

0

Credit points

3.0

 Prerequisites: ( 234319 - PROGRAMMING LANGUAGES )

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
100%

17.5

total

winter 1998/99

credit points

course name

84

2.5

### 097317 - COOPERATIVE GAME THEORY

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

2.5

 Prerequisites: Linked courses: ( 094412 - PROBABILITY (ADVANCED) and 104005 - ALGEBRA 1 ) 094313 - DETERMINISTIC MODELS IN OPER.RESEARCH 094317 - INTRODUCTION TO 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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

 Prerequisites: ( 094412 - PROBABILITY (ADVANCED) and 234246 - GRAPH ALGORITHMS ) or ( 104024 - INTRODUCTION TO PROBABILITY and 234246 - GRAPH ALGORITHMS ) or ( 104034 - INTRODUCTION TO PRIBABILITY H and 234246 - GRAPH ALGORITHMS ) 046334 - 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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

3

0

Credit points

3.0

 Prerequisites: ( 234292 - LOGIC FOR COMPUTER SCIENCE 1 )

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

 Prerequisites: ( 046267 - COMPUTER ARCHITECTURE and 234119 - INTRODUCTION TO OPERATING SYSTEMS ) or ( 234119 - INTRODUCTION TO OPERATING SYSTEMS and 234267 - DIGITAL COMPUTER ARCHITECTURE ) 046209 - 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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

0

4

0

Credit points

3.0

 Prerequisites: Overlapping courses: ( 236501 - INTRODUCTION TO ARTIFICIAL INTELLIGENCE ) 234304 - LABORATORY IN ARTIFICIAL INTELLIGENCE U

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

0

4

0

Credit points

3.0

 Prerequisites: ( 234119 - INTRODUCTION TO OPERATING SYSTEMS )

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

0

0

0

Credit points

1.0

97

1.0

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

0

2

0

0

Credit points

1.0

average 86.00

success
100%

19.5

total

spring 1998/99

credit points

course name

58

3.0

### 236312 - DATA STRUCTURES 2

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

1

0

Credit points

3.0

 Prerequisites: ( 234218 - DATA STRUCTURES 1 and 234246 - GRAPH ALGORITHMS )

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

 Prerequisites: ( 234119 - INTRODUCTION TO OPERATING SYSTEMS and 236343 - THEORY OF COMPUTATION )

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

5

0

Credit points

4.0

 Prerequisites: ( 044262 - LOGIC DESIGN AND INTR. TO COMP. and 234246 - GRAPH ALGORITHMS ) or ( 234246 - GRAPH ALGORITHMS and 234262 - LOGICAL 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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

1

0

0

Credit points

3.0

 Prerequisites: ( 234119 - INTRODUCTION TO OPERATING SYSTEMS )

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

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

0

0

0

Credit points

2.0

this course was: introduction to computational geometry.

92

2.0

### 236806 - SEMINAR IN COMPUTER SCIENCE 6

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

0

0

0

Credit points

2.0

my seminar was in hardware: i did a lecture on hardware simulation.

96

1.5

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

2

0

0

0

Credit points

1.5

average

87.40 success
100%

18.5

total

spring 1999/00

credit points

course name

-

didnt get

it yet !

3.5

### 094313 - DETERMINISTIC MODELS IN OPER.RESEARCH

Lecture

Tutorial

Laboratory

Project/Seminar

Weekly hours

3

1

0

0

Credit points

3.5

 Prerequisites: ( 104005 - ALGEBRA 1 and 234113 - INTRODUCTION TO PROGRAMMING ) or ( 234105 - PROGRAMMING 1 (PL/1) ) or ( 234098 - PROGRAMMING 1 (PASCAL) ) or ( 234112 - PROGRAMMING (C) ) or ( 234111 - INTRODUCTION TO COMPUTER SCIENCE ) 094380 - INT. TO O.R FOR BUSINESS ADMINISTRATION 096390 - OPERATIONS RESEARCH FOR ENGINEERS 094390 - INTR. TO QUANTITATIVE METHODS

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