 |
.. (לתיקייה המכילה) | |
What languages shall be taught in this course? | |
| This courses teaches pure ANSI C. The material in C will include syntax and semantics, including files, multidimensional arrays, pointers and their arithmetics, strings, dynamic allocation, etc. The students will be expected to be able to understand existing programs and to write their own. |
What computer-science material shall be taught in this course? | |
|
This courses 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 Backtracking Algorithms. Common sorting algorithms: Bubblesort, Mergesort, Quicksort. Common algorithms in computer sciences. Invariants ("Shmurot") |
Are there any recommended textbooks ? | |
|
Our tutorials will generally follow the slides booklet used in the faculty. There are also a few good textbooks which can help you study C. See the Literature section for details. The main book for this course, for beginners to C is called "A Book on C" by I. Pohl., published by Addison-Wesley Longman. This is a tutorial on C, from scratch to a high level. This book can be found in Michlol and in the dean's library. |
Can 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 your next semesters. As for using a C++ compiler for the homeworks, please see the Homework section of this FAQ. |