CS1102_08 | Faculty of Computer Science

Computer Architecture and Operating Systems

Course name

Computer Architecture and Operating Systems

Code

CS1102

Class	Undergraduate, 2008 - 2011
Level	Licenţă	Year	1	Semester	1	Status	Compulsory

Hours per week				Total hours per semester	Total hours of individual work	Credits	Evaluation type	Teaching language
C	S	L	Pr
2	1	1	0	56	94	5	M	ro

Taught by	Academic and scientific title, name
	Professor, PhD, Henri Luchian Lecturer, PhD, Vlad Rădulescu

Required courses

Objectives	At the end of the semester, the students should know: the basic elements of the computer architecture and organization the fundamentals of internal data representation in computers the main functions of an operating system
General thematics	Von Neumann architecture. Empirical laws. Memory hierarchies. Physical representation of information; bits and bytes. Boolean functions; minimization. Logic gates and combinational circuits; adder, decoder. Flip-flops and sequential circuits; counter, shift register. Internal data representation. Fixed point representations. Floating point representations. The memory; technology, cache memory, virtual memory. The structure of the central processing unit. Techniques for performance improvement. Pipeline. RISC architecture. Parallel architectures. Peripheral devices. The interrupt system. Introduction to the operating systems. Kernel and drivers. System calls. Process management. Memory management; physical and virtual addresses, segmentation and pagination. Creating and executing programs.
Seminary / Laboratory thematics	Empirical laws. Amdahl's law. Locality laws. Boolean functions. Minimization techniques. Fixed point representations. Overflow.Floating point representations. Overflow. Assembly language of the x86 microprocessor family.
Teaching methods	Exposition, debate, problem-solving, case studies, exercises.

Bibliography

J. L. Hennessy, D. A. Patterson, Computer Architecture - A Quantitative Approach, Morgan Kaufmann Publishers, 1990.
D. A. Patterson, J. L. Hennessy, Computer Organization & Design: The Hardware/Software Interface, Morgan Kaufmann Publishers, 1998.
R. W. Hockney, C. R. Jesshope, Parallel Computers 2, IOP Publishing, 1988.
A. Tanenbaum, Structured Computer Organization, Prentice Hall, 1999.
A. Tanenbaum, Modern Operating Systems, Prentice Hall, 2001.

Evaluation	conditions	The presence at the laboratory and seminary activities.
	criterias	At least 5 points on each test; 3 or 4 points are accepted for at most one test.
	modes	Two written tests: the first one (TS1) during the 7th week (40 hours individual study), the second one (TS2) during the examination session (40 hours individual study). One practical test (TL) during the 14th week, regarding the laboratory activity (14 hours individual study).
	formula	If at least 5 points were achieved on each of the three tests: Final result = (TS1 + TS2 + TL) / 3 If 4 points were achieved on one of the tests: Final result = (TS1 + TS2 + TL) / 3, with truncation If 3 points were achieved on one of the tests: Final result = (TS1 + TS2 + TL) / 3 - 1, with truncation