Tree for 234141

max prerequitise depth: 2
max prerequisite-to depth: 2
mark by (*) if 234141 is a necessary prerequisite: yes

Data for 234141:
Prerequisite tree:

234141 (UG) - COMBINATORICS FOR CS
104010 (UG) - DIFFERENTIAL AND INTEGRAL CALCULUS 1M
104167 (UG) - ALGEBRA A
or
104167 (UG) - ALGEBRA A
104195 (UG) - INFINITESIMAL CALCULUS 1

Prerequisite-to tree:

234141 (UG) - COMBINATORICS FOR CS (*)
234218 (UG) - DATA STRUCTURES 1
046271 (UG) - OBJECT-ORIENTED PROGRAMMING AND DESIGN
236716 (UG) - GEOMETRIC MODELS IN CAD SYSTEMS
236719 (UG) - COMPUTATIONAL GEOMETRY
214902 (UG) - DIDACTICS OF COMPUTER SCIENCE
214911 (UG) - PROGRAMMING PARADIGMS
236501 (UG) - INTRODUCTION TO ARTIFICIAL INTELLIGENCE
046345 (UG) - COMPUTER GRAPHICS
236300 (UG) - NATURAL LANGUAGE PROCESSING A
234247 (UG) - INTRODUCTION TO ALGORITHMS (*)
236312 (UG) - DATA STRUCTURES 2
094240 (UG) - DATABASE MANAGEMENT
234309 (UG) - GENERAL YEARLY PROJECT - PART A
234321 (UG) - INTRODUCTION TO SOFTWARE ENGINEERING
234322 (UG) - FILE SYSTEMS
234325 (UG) - COMPUTER GRAPHICS 1
216101 (UG) - THE COMPUTER AS A LEARNING ENVIRONMENT
236927 (UG) - INTRODUCTION TO ROBOTICS
216122 (UG) - EDUCATIONAL TOPICS IN MATH AND COMPUTER
234119 (UG) - INTRODUCTION TO OPERATING SYSTEMS
234120 (UG) - OPERATING SYSTEMS
234123 (UG) - OPERAITING SYSTEMS
234247 (UG) - INTRODUCTION TO ALGORITHMS (*)
236699 (UG) - PARALLEL ALGORITHMS FOR FIXED CONNECTION
236706 (UG) - THE DESIGN OF PARALLEL ALGORITHMS
236752 (UG) - INTRO. TO CONTROL OF DISCRETE-EVENT SYST
236501 (UG) - INTRODUCTION TO ARTIFICIAL INTELLIGENCE
097211 (UG) - FAULT TOLERANT NETWORKS PROTOCOLS (*)
236512 (UG) - PROJECT IN ADVANCED PROGRAMMING B
236521 (UG) - APPROXIMATION ALGORITHMS
236522 (UG) - ALGORITHMS IN COMPUTATIONAL BIOLOGY
236780 (UG) - ALGORITHMS FOR DYNAMIC MEMORY MANAGEMENT (*)
096210 (UG) - FOUNDATIONS AND APPLICATIONS OF ARTIFICI
096211 (UG) - ELECTRONIC COMMERCE MODELS
096215 (UG) - SEMINAR IN INFORMATION SYSTEMS (*)
096227 (UG) - MULTI-AGENT SYSTEMS (*)
096228 (UG) - CONSTRAINT SYSTEMS (*)
096229 (UG) - TESTING AND VERIFICATION OF PROGRAMS
236312 (UG) - DATA STRUCTURES 2
236334 (UG) - INTRODUCTION TO COMPUTER NETWORKS
236335 (UG) - COMPUTER COMMUNICATION NETWORKS DESIGN
236343 (UG) - THEORY OF COMPUTATION
236861 (UG) - NUMERICAL GEOMETRY OF IMAGES
236354 (UG) - VLSI CIRCUIT DESIGN
236372 (UG) - BAYESIAN NETWORKS
236374 (UG) - PROBABILISTIC METHODS AND ALGORITHMS
236918 (UG) - LAYOUT ALGORITHMS FOR INTEGRATED CIRCUIT
236927 (UG) - INTRODUCTION TO ROBOTICS
236307 (UG) - EXPANDER GRAPHS AND THEIR APPLICATIONS
236308 (UG) - ALGEBRAIC GRAPH THEORY AND

Prerequisite tree (with linked courses):

Legend

Hint: Click a node to expand its tree (run query with same parameters as original).



Prerequisite-to tree (without linked courses):

Legend

Hint: Click a node to expand its tree (run query with same parameters as original).