בחינת הכשר מסלול מחקרי .Ms.c במדעי המחשב

סטודנט במסלול ללא תזה שבחר לא לבצע פרויקט גמר חייב לקחת שלושה קורסי בחירה נוספים ולעמוד בבחינת הכשר על מנת לסיים חובותיו האקדמיות. הבחינה היא בחינה כתובה הנערכת אחת לשנה במועד שיפורסם בידיעון לפני שנת הלימודים (בד"כ מעט אחרי חופשת הפסח). חומר הבחינה כולל נושאי ליבה במדעי המחשב המכסים את החומר הנלמד בתואר הראשון בקורסים: שפות תכנות, מבני נתונים, אלגוריתמים, מערכות הפעלה, תקשורת מחשבים, אוטומטים ושפות פורמליות וחישוביות וסיבוכיות. הציון בבחינת ההכשר הוא עובר/לא עובר ואינו משוקלל בממוצע הכללי של התואר, אולם ציון עובר בבחינת ההכשר הוא תנאי מחייב לזכאות לתואר. את בחינת ההכשר יש לעבור במהלך השנתיים הראשונות לתואר.

רשימת הנושאים לבחינת הכשר

Textbook: Introduction to Algorithms, by T. Cormen, C. Leiserson, R. Rivest and C. Stein
- QuickSort, MergeSort,BubbleSort, Lower bound for comparison sorts, Sorting in linear Time: Counting, Radix and Bucket Sort
- Definition and operations, Heapsort
- Open hash, Close hash – definition and operations, Perfect hash – only definition, Universal hash – only definition
- Definition and operations, Traversal: Inoredre, PostOreder, PreOrder, One balance tree: AVL or Red-Black or 2-3 (to the student choice)
Textbook: Modern Operating System, Second Edition by Andrew S. Tanenbaum Publisher: Prentice Hall, 2001 (ISBN 0-13-031358-0). Chapters 1,2,3,4
- (No need to cover Input/Output; File systems)
Textbooks: (1) Lecture notes that can be downloaded from the Digital Architecture course web page (2) "Computer Organization & Design: The Hardware/Software Interface", by D. A. Patterson and J. L. Hennessy, Morgan Kaufman Publishers, Inc. 2nd edition,
- Implementing Boolean function using gates, Simplifying Boolean functions using Karnaugh maps, Cost and delay measures of a design, Decoders and multiplexers
- Unsigned numbers, Representing fractions in fixed point, Two's complement numbers, Negating numbers, Sign extension, Double precision, Adders, fast adders & ALUs
- Master-slave Flip-flops & registers, Registers with write enables, Counters, State machines
- MIPS assembly language, Compilation, linking & loading of C programs (from C to machine language), C procedure convention – Stack frame, transferring arguments, allocation of local variables , Recursion
- Single-cycle MIPS implementation, Multi-cycle MIPS implementation, Exceptions an interrupts handling
Textbook: Introduction to Algorithms, by T. Cormen, C. Leiserson, R. Rivest and C. Stein. MIT Press. (1st edition or open univ. translation are also good
- Weighted or non-weighted edges, Positive weights, non-negative cycles, Directed, undirected or directed acyclic (DAG) graphs. Single source or all-pair shortest path.
- Dynamic programming
Textbook: Computer Networking: A Top Down Approach Featuring the Internet, third edition, by J.F. Kurose and K.W. Ross, Publisher: Addison-Wesley Longman (ISBN: 0-321-26976-4). Chapters 1,2,3,4,5
Textbooks: Introduction to Theory of Computation - M. Sipser 'אוטומטים ושפות פורמליות' – האוניברסיטה הפתוחה
- Deterministic automata, Non-deterministic automata, equivalence to deterministic model, Regular expressions, Closure of regular languages to various operations, Non-regular languages, pumping lemma for regular languages., Minimization of automata
- Context-free grammaras, Pushdown automata, Pumping lemma for context-free languages., Closure of context-free languages to various operations.
Textbook: Introduction to Theory of Computation - M. Sipser
- Turing machines: Definition and the difference between TM and finite automata, pushdown automata, and a desktop computer, Church-Turing thesis, Decidable and recognizable languages: definition and examples, Undecidable languages: Halting problem and other examples, Reducibility: definition and its utilization.
- Time complexity: definition, Definition and examples for each of the following complexity classes: P, NP, NP-complete, NP-hard, EXP, NP-complete problems: CLIQUE, Hamiltonian Path, Vertex Cover, 3SAT, Polynomial reductions: definition and its utilization, Space complexity: PSAPACE, LOG-Space, NLOG-Space (definition and examples).
Textbooks: (1) Structure and Interpretation of Computer Programs, by Gerald J. Sussman and Harold Abelson, 2nd edition. Chapters 1-4. Publisher: MIT Press, 1996. (2) Object-Oriented Software Construction, by Bertrand Meyer, 2nd edition. Chapters 1, 3-1
- Lambda notation, Functions as first-class objects, Higher-order functions
- Abstract data types, The substitution model, Applicative-order and normal-order evaluation, The environment model, Data-directed programming, object-oriented programming and message passing
- Quality and modularity, Classes and objects, Memory management, Genericity, Inheritance and multiple inheritance

בחינת הכשר מסלול מחקרי .Ms.c במדעי המחשב

רשימת הנושאים לבחינת הכשר

Textbook: Introduction to Algorithms, by T. Cormen, C. Leiserson, R. Rivest and C. Stein

Textbook: Modern Operating System, Second Edition by Andrew S. Tanenbaum Publisher: Prentice Hall, 2001 (ISBN 0-13-031358-0). Chapters 1,2,3,4

Textbooks: (1) Lecture notes that can be downloaded from the Digital Architecture course web page (2) "Computer Organization & Design: The Hardware/Software Interface", by D. A. Patterson and J. L. Hennessy, Morgan Kaufman Publishers, Inc. 2nd edition,

Textbook: Introduction to Algorithms, by T. Cormen, C. Leiserson, R. Rivest and C. Stein. MIT Press. (1st edition or open univ. translation are also good

Textbook: Computer Networking: A Top Down Approach Featuring the Internet, third edition, by J.F. Kurose and K.W. Ross, Publisher: Addison-Wesley Longman (ISBN: 0-321-26976-4). Chapters 1,2,3,4,5

Textbooks: Introduction to Theory of Computation - M. Sipser 'אוטומטים ושפות פורמליות' – האוניברסיטה הפתוחה

Textbook: Introduction to Theory of Computation - M. Sipser

Textbooks: (1) Structure and Interpretation of Computer Programs, by Gerald J. Sussman and Harold Abelson, 2nd edition. Chapters 1-4. Publisher: MIT Press, 1996. (2) Object-Oriented Software Construction, by Bertrand Meyer, 2nd edition. Chapters 1, 3-1