Freie Universität Berlin
Fachbereich Mathematik und Informatik

Computer Systems & Telematics

 

 

Teaching-> WS 02/03 -> 19504 V

Computer Structures/Rechnerstrukturen (2,3,N)

 

Lecturer: Schiller
Office Hours: Tuesday 14-15

Location: Takustraße 9, HS
Time: Friday, 10-12, starts 18.10.02

Content: Rechnerstrukturen/Computer Structures forms the fundament for all further lectures, seminaries, tutorials etc. in the area of technical computer science. The following topics are covered in this course: internal data representation, error detection and correction, logic and Boolean gates, design of basic networks, coders/decoders, multiplexers, ROM, PLA, adders, synchronous and asynchronous automata, flip-flops, RAM, memory, registers, controllers, simple computer architecture.

Participants: computer science students, 1. semester

Prerequisites: none

 

Criteria for successful participation/Scheinkriterien:

This course comprises lectures and tutorials. Homework assignments will be given for the tutorials. The following is required for the participation in the final exam:

Aufzählung

Active participation in the tutorials. This requires your physical presence!

Aufzählung

Handing in the assignments right on time, not later! Each assignment will show the deadline.

Aufzählung

At least 50% of the max. possible number of points are required.

Aufzählung

You have to hand in at least n-1 assignments with at least 25% of the max. possible number of points per assignment (i.e. you have to have at least 25% correct in each but one assignment). n is the number of assignments handed out during the course.

Aufzählung

If you hand in a correct solution for an assignment/part of an assignment you must be able to demonstrate your solution/partial solution in the tutorial. Again, this requires your presence in the tutorial. Each student has to present a solution during the course in his/her tutorial. This presentation of a solution is essential for the participation in the exam.

Aufzählung

You can work together in groups of max. 2 students and hand in a solution together (don't forget all names). But: each of you must be able to present the solution in the tutorials!

Why these criteria? Well, statistics show that over 85% of students failing in the exams did not do their assignments or did not actively participate in the tutorials. Thus, these criteria are in your own interest!

Fulfilling the criteria allows you to participate in the written exam. To pass the exam 40% of the max. points are needed. The final degree depends on the written exam only.

Homework assignments:

1. Assignment (Deadline: 01.11.02)

2. Assignment (Deadline: 08.11.02)

3. Assignment (Deadline: 15.11.02)

4. Assignment (Deadline: 22.11.02)

5. Assignment (Deadline: 29.11.02)

6. Assignment (Deadline: 06.12.02)

7. Assignment (Deadline: 13.12.02)

8. Assignment (Deadline: 20.12.02)

9. Assignment (Deadline: 10.01.03)

10. Assignment (Deadline: 17.01.03)

11. Assignment (Deadline: 24.01.03)

12. Assignment (Deadline: 31.01.03)

13. Assignment

 

Exam: 21.02.2003, 10-12h (60 min incl. preparation etc., location: HS Arnimallee 22), only paper, pencil & your brain permitted! At least 40% of the max. number of points required to pass. Max. number of points is 60, thus 24 points are required to pass. Duration of the exam is 60 minutes.

Exam Solution

 

Second Chance: 11.04.2003, 10-12h (60 min incl. preparation etc., location: ZIB-HS), only paper, pencil & your brain permitted! At least 40% of the max. number of points required to pass. Max. number of points is 60, thus 24 points are required to pass. Duration of the exam is 60 minutes. (Admission only if you fulfill the prerequisites and did not pass the first exam).

Exam Solution

 

Literature: A copy of the slides is available (and without the slides it is very difficult to follow the lectures...)!
Where? R155, Takustr. 9
When? Tue-Fri, 10:00-12:00 & 14:00-15:00
How much? 5€

Basic text book for this course (will be used mainly in the 2nd semester during the computer organization course):

Online material: