CSC320 Syllabus
CSC320 Syllabus
INSTRUCTOR
Name: Ruwayda Takchi
Office: 808B block A, Ext. 2321
Email: [email protected]
Course web Page: The course will be using blackboard for assignments, project and
hand-ins. (http://www.lau.edu.lb/blackboard/)
Overview of the history of the digital computer, representation of numeric data, introduction to
digital logic, logic expressions and Boolean functions, logic functions minimization. Processor and
system performance, Amdahl’s law. Introduction to reconfigurable logic and special-purpose
processors. Introduction to instruction set architecture, and microarchitecture. Processor
structures, instruction sequencing, control flow, subroutine call and return mechanism, structure of
machine-level programs, and low level architectural support for high-level languages. Memory
hierarchy, latency and throughput, cache memories: operating principles, replacement policies,
multilevel cache, and cache coherency. Register-transfer language to describe internal operations
in a computer, instruction pipelining and instruction-level parallelism (ILP), overview of superscalar
architectures. Multicore and multithreaded processors.
COURSE PREREQUISITE
Co-requisite: CSC 245: Objects and Data Abstraction, MTH 207: Discrete Structures
TEXTBOOK
COURSE TYPE
Test 1 20%
Test 2 25%
Final Exam 35%
Assignments and Participation: 10%
Project 10%
Late Policy:
Programming projects and assignments must be submitted on the due date. No assignment will be
accepted late. It is best to turn in whatever work you have accomplished for partial credit. Do not
count on extensions. Assignments due dates are absolute. Late submission of class work is
not allowed and such work is not graded.
Exams Make-up:
Make-up tests will not be without a valid excuse. Tests missed due to a valid excuse must be made
up within one week of the absence. The student is responsible for arranging the make-up with the
course instructor.
Page 2 of 4
STUDENT CODE OF CONDUCT - ACADEMIC VIOLATIONS
The following table defines the sanction(s) associated with each violation. In some cases and when the
violation is too general, a range of sanctions is set for the pertinent committee to choose from depending on the
specifics of each case. As for the second offense, the set sanctions apply regardless whether the violation has
taken place in the same course or a different one, within the same semester or not.
Page 3 of 4
UNIVERSITY ATTENDANCE POLICY
1. Students are expected to attend all classes.
2. For valid reasons, students may miss classes for a maximum that is equivalent to two regular
weeks.
3. When exceeding the maximum number of absences, it is the instructor’s prerogative to ask
the concerned student to stop attending and drop the course. In this case, it is the student’s
responsibility to drop the course, otherwise a grade of “F” or “NP” will be given.
4. In exceptional justified cases (long illness, etc…), where absences exceed the maximum, the
student has to petition to the department Chair to be allowed to stay in the course.
5. Students are held responsible for all the material presented in the classroom, even during their
absence.
WITHDRAWAL POLICY
Completion of the online course evaluations is important for feedback and improvement. Students
are highly encouraged to complete the course evaluations at the end of the semester.
ADDITIONAL REMARKS
Deadlines for the assignments must be respected.
Make-ups and Incomplete: students are not automatically entitled to make-ups; F will be
given until reasons (in writing and within one week of absence) are presented and approved.
Some of the exam questions will be based on class discussion and assignments.
Page 4 of 4