Presentation is loading. Please wait.

Presentation is loading. Please wait.

Computational Science - Computer Science

Similar presentations


Presentation on theme: "Computational Science - Computer Science"— Presentation transcript:

1 Computational Science - Computer Science
Why we need this course? Computational Science - Computer Science Performance? Reliability? Fault Tolerance? Real time requirements? Security? New languages, frameworks, drivers? Parallelism and Concurency IoT Java, C# Java, C# Server

2 The course purpose and structure
Teach the computers internals on hardware/software interface level The students upon completion of the course should be able to write programs on assembly language create simple hardware circuits.

3 Learning modules

4 Assembly and Logic design assignments

5 The course is based on materials
Textbooks: “Computer Organization and Design: The Hardware/Software Interface”, Revised 5th Edition 2014, David A. Patterson, John L. Hennessy, UC Berkeley Digital Design Principles and Practices, John F. Wakerly, 4th Edition, 2006, Stanford University Computer Science courses (CS61C) lecture notes for 2011, UC Berkeley Recommended Reference Books: “Programmed Introduction to MIPS assembly language”, Bradley Kjell, Central Connecticut State University,

6 The software needed. MIPS32 simulator (PC Spim )
Logisim - Logic design simulator

7 Course Organization, Evaluation
Student learning will be evaluated on the basis of the following weighted components: Home assignments % of final grade Grade of midterm examinations, Quizzes 50% Grade of final examination 30% Bonus scores: Class attendance/participation % Bonus Projects (deadline of taking February 28) 5- 10% For the students who pass the waiver examination (29.01, 9:00 – 11:00) the waiver examination grade could be passed as a final grade and student is free to attend the classes. Waiver examination questions: 1. Write Assembly language program (cycles, i/o, arrays). 2. Representation of data in computers. (instructions, characters, numbers) 3. Create a simple combinational logic circuit.

8 Course Organization, Evaluation
Handouts’ topics fully cover all examination questions. (No questions will be out of handout topics). However handouts are not enough for full understanding the topics included there. The students need either to attend the class or work on textbooks for full understanding. Class attendance is graded with the bonus scores. Assignments are based only on the material of the current and previous classes’ handouts and exercises. They contain personal identifiers to make them different for different students. Assignments’ soft deadline is about a week. For example if the deadline is on Sunday then the assignment should be sent to lecturer before the Sunday evening 23:59. Delayed assignments’ grades are lowered. Assignments’ hard deadline is about 2 weeks. Assignments are not accepted after the hard deadline.

9 The course material is on the Academic server ac.aua.am

10

11


Download ppt "Computational Science - Computer Science"

Similar presentations


Ads by Google