 |
.. (לתיקייה המכילה) | |
What computer-science material shall be taught in this course? | |
|
This course teaches not only C programming but also some concepts. This is an integral part of the material and students will be asked to use their acquired knowledge in the final test. The material includes: Space and Time complexity. Top-Down design. Recursion Common sorting algorithms: Bubblesort, Mergesort, Quicksort. Common algorithms in computer sciences. Invariants ("Shmurot") |
What languages shall be taught in this course? | |
| This course teaches pure ANSI C. The material in C language will include syntax and semantics. Among the topics of this course: pointers and their arithmetics, arrays and multidimensional arrays, strings, dynamic allocation, etc. You will be expected to be able to understand existing programs and to write your own. |
I know C++. May I write in C++ in this course ? | |
|
Absolutely not. This course is about pure ANSI-C, and usage of C++ constructs is considered an error in the assignments and the test. You will have time for C++ programming in courses you will take in the future. As for using a C++ compiler for the homeworks, please see the Homework section of this FAQ. |