Basic Information
This Course Is For Computer Science Students. 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 Complexity. 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.
Faculty: Mathematics
|Undergraduate Studies
Course with no extra credit
234114 - Introduction to Computer Science
Semestrial Information
Weekly Hours
4 Academic Credit • 2 Lecture Hours • 2 Discussion Hours • 2 Lab Hours
Notes
-
קבוצה 77 סגורה לסיניים בלבד.
Registration Groups
|
|
Weekly Hours
4 Academic Credit • 2 Lecture Hours • 2 Discussion Hours • 2 Lab Hours
Notes
-
קבוצה 77 סגורה לסיניים בלבד.
Registration Groups
|
|
Weekly Hours
4 Academic Credit • 2 Lecture Hours • 2 Discussion Hours • 2 Lab Hours
Notes
-
קבוצה 77 סגורה לסיניים בלבד
Registration Groups
|
|