C Programming course - TA page (0509.1821.12)
Lecturer: Amitai Armon
Course main homepage
Teaching
assistant: Olga Sorkine
Class time: Monday
Place: Software
engineering, room 008
Office hour: Tuesday
Teaching assistant: Ofer
Pasternak
Class time: Thursday
Place: Software
engineering, room 008
Office hour: Wednesday
Teaching assistant: Shachar Harussi
Class time: Wednesday
Place: Software engineering, room 008
Office hour: Sunday
Email: mailto:harussis@post.tau.ac.il?subject=c
course question
Message board
|
Date |
Message |
|
13/02/2006 |
The graded exercise 13 can be found on the shelves in Wolfson ground-floor (at the end of the left corridor, behind the elevators). Ofer'sgroup: shelf 144; Olga's group: shelf 145; Shachar's group: shelf 146. Old exercises and appeals from ALL the groups are in a separate envelope on shelf 144. The updated grades file can be found below. In case of any problems with the exercises or grades, please contact your metargel (both Olga and Ofer aren't here currently, so their groups can contact the lecturer instead). Good luck! |
|
30/01/2006 |
Ex13: the function add_item
from list.c assumes that the "next" pointer of
the item to be added is NULL |
|
16/01/2006 |
Ex12: note that your list_max
function should work for any linked list. You cannot assume that the
list is sorted when implementing this function, even if you test it in main() with a sorted list. |
|
12/01/06 |
The debugging
instructions for LCC are here: |
|
09/01/06 |
The
grades file is updated (see the link below this table) |
|
26/12:2005 |
Ex9
question 2:
you may assume that the array is sorted; you don't have to get the array as
user-input (it's OK to define "hard coded" arrays in main and test
the function on them). If you do wish to get the array from the user, define some
bound on its size, say, 100. |
|
26/12/2005 |
Please not that Shachar's office hours have changed! (see above) |
|
25/12/2005 |
Guidance
for Ex.8, question 2: For each
place in str, use a (nested) loop to check if the string sub starts in this place (if so, the
string repl should be written there instead of sub). One option is to do the
replacements in the original string str, but remember to keep two
indices: one for the place you reached in reading str, and the other for the place
where you should write into str. Another option is to build the
new string in another array (don't forget the '\0'), and then copy it
character-by-character to the original string. |
|
14/12/2005 |
The grades of Ex5 have been
published (see the link below this table) |
|
13/12/2005 |
NOTE: in the bonus question of Ex7,
you may assume that the maximal length of the input string is 100 |
|
08/12/2005 |
|
|
28/11/2005 |
NOTE: in exercise 5 question 1, the
numbers should be positive (check that). |
|
28/11/2005 |
Grades
posted here. |
|
25/11/2005 |
The solution for exercise 2 is
posted |
|
17/11/2005 |
The grades and the solution for
exercise 1 are posted (see the table below) |
|
31/10/2005 |
Welcome to the course! |
Exercise material:
|
Date |
Slides |
Handouts |
Code |
Homework |
Solutions |
Topics |
|
31/10/2005 |
Computer structure, first C program |
|||||
|
07/11/2005 |
|
Variables |
||||
|
14/11/2005 |
|
Control statements (if, switch) |
||||
|
21/11/2005 |
|
Loops |
||||
|
28/11/2005 |
Functions, debugging |
|||||
|
05/12/2005 |
|
Arrays |
||||
|
12/12/2005 |
Strings |
|||||
|
19/12/2005 |
|
Pointers |
||||
|
26/12/2005 |
|
Recursion |
||||
|
02/01/2006 |
|
Review: pointers, strings and
recursion |
||||
|
09/01/2006 |
Dynamic allocation and structures |
|||||
|
16/01/2006 |
|
Linked lists |
||||
|
23/01/2006 |
same |
|
same |
Linked lists continued |
||
|
30/01/2006 |
|
|
|
Review practice |
Liam's class: