PDF Notes: Lectures1-12

    Master this deck with 12 terms through effective study methods.

    Generated from uploaded pdf

    Created by @mukarit

    What is the attendance policy for the course?

    Missing 10 minutes marks a student absent for the entire lesson.

    What are the weights of the assignments in the course?

    In-Lab work 20%, Mid-term Exam 40%, Oral Final Exam 40%.

    What happens if a student scores above the threshold in the Mid-term?

    They are examined during Lectures for the Oral Final Exam.

    What is the purpose of the course?

    To enhance programming effectiveness through understanding the underlying system.

    How does the course theme contrast abstraction with reality?

    Abstraction is useful but can hide important implementation details.

    What is considered cheating in the course?

    Sharing code, coaching, altering attendance records, or copying code from other sources.

    What is NOT considered cheating?

    Explaining system usage or helping with high-level design issues.

    What is the penalty for cheating?

    Removal from the course with a failing grade and a permanent mark on the record.

    What is a key limitation of computer arithmetic?

    It cannot assume all usual mathematical properties due to finite representations.

    How do integer operations differ from floating point operations?

    Integer operations satisfy ring properties; floating point operations satisfy ordering properties.

    What is a consequence of understanding computer architecture?

    It allows programmers to find and eliminate bugs more efficiently.

    What happens if you add large floats and integers?

    Results may not be accurate due to representation limits.