|
|
| COM1001 | Computer Fundamentals | 3+0+0 | ECTS:5 | | Year / Semester | Fall Semester | | Level of Course | First Cycle | | Status | Compulsory | | Department | DEPARTMENT of COMPUTER ENGINEERING | | Prerequisites and co-requisites | None | | Mode of Delivery | | | Contact Hours | 14 weeks - 3 hours of lectures per week | | Lecturer | Prof. Dr. Mustafa ULUTAŞ | | Co-Lecturer | None | | Language of instruction | | | Professional practise ( internship ) | None | | | | The aim of the course: | | Provide basic knowledge on computer hardware and system software. |
| Learning Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | LO - 1 : | use any base to represent numbers and apply Boolean algebra in base two | 1,3,4 | 1 | | LO - 2 : | perform arithmetic operations on binary numbers. | 1,3,4 | 1 | | LO - 3 : | design digital circuits using logic gates. | 1,3,4 | 1 | | LO - 4 : | analyze simple level-triggered digital circuits. | 1,3,4 | 1 | | LO - 5 : | understand and use Operating Systems. | 1,3,4 | 1 | | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), LO : Learning Outcome | | |
| Advantages of digital systems, Digital representation of data, Bases other than ten, representation of whole and fractional numbers, Negative number representations, Fixed point arithmetic, Addition, subtraction, overfflow, Carry-Look-Ahead (CLA) addition, Floating Point representation, biased exponent, normalization, arithmetic operations on floating point representation, Logic gates, Boolean algebra, Simplification of functions by Boolean algebra and Karnaugh maps, Set-Reset (S-R) latch, Memory units, Memory addressing, Read and write operations, Random Access Memory (RAM), Static RAM, Asynchronous static RAM, Dynamic RAM (DRAM), Read Only Memory (ROM), PROM EPROM and EEPROM, Flash memory, Memory expansion, SIMMs and DIMMs, FIFO and LIFO, Magnetic hard drive, Optical storage, Flash memory, Memory expansion, SIMMs and DIMMs, FIFO and LIFO, Magnetic hard drive, Optical storage, Simplified computer architecture, Hardware and software, Shared system resources, Operating system fundamentals |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | Analog quantities, Analog and digital systems, Binary digits and logic levels, Digital waveforms, Actual pulse definitions, Periodic Pulse Waveforms, Pulse definitions | | | Week 2 | Timing diagrams, Serial and parallel data, Basic logic functions, Basic system functions, Integrated circuits, Test and measurement instruments, Programmable logic | | | Week 3 | Decimal numbers, Binary numbers, Binary to decimal conversions, Binary addition, Binary subtraction, 1's complement, 2's complement, Signed binary numbers, Floating point notation | | | Week 4 | Arithmetic operations with signed numbers, Hexadecimal numbers, Octal numbers, BCD, Gray code, ASCII, Parity method, Cyclic Redundancy Check (CRC) | | | Week 5 | Inverter, AND gate, OR gate, NAND gate, NOR gate, XOR gate, XNOR gate, Fixed function logic, Programmable logic | | | Week 6 | Boolean addition, Boolean multiplication, Commutative law, Associative law, Distributive law, Rules of Boolean algebra, DeMorgan's theorems | | | Week 7 | Boolean analysis of logic circuits, SOP and POS forms, SOP standard form, POS standard form, Karnaugh maps, Hardware Description Languages (HDLs) | | | Week 8 | Combinational logic circuits, Exclusive-OR logic, Exclusive-NOR logic, Implementing combinational logic, Karnaugh map implementation | | | Week 9 | Midterm exam | | | Week 10 | NAND logic, Universal gates, NOR logic, Pulsed waveforms, Half-adder, Full-adder, Parallel adders, Comparators, Decoders | | | Week 11 | BCD decoder/driver, Encoders, Code converters, Multiplexers, Demultiplexers, Parity generators/checkers | | | Week 12 | Latches, S-R latch, Memory units, Memory addressing, Read and write operations, Random Access Memory (RAM), Static RAM | | | Week 13 | Dynamic RAM (DRAM), Synchronous DRAM, Read Only Memory (ROM), PROM EPROM and EEPROM | | | Week 14 | Flash memory, Memory expansion, SIMMs and DIMMs, FIFO and LIFO, Magnetic hard drive, Optical storage | | | Week 15 | Simplified computer architecture, Hardware and software, Shared system resources, Operating system fundamentals | | | Week 16 | Final exam | | | |
| 1 | Floyd, T. L., 2015, Digital Fundamentals, Pearson Education Limited, 953 p. | | | |
| 1 | William, R., 2001, Computer System Architecture A Networking Approach, Addison Wessley, 659 p.
| | | 2 | Sammes, T., Jenkinson B., 2007, Forensic Computing, A practitioner's Guide, Springer, 465 p. | | | 3 | Murdocca, M., J,. Heuring V., P., 2000, Principles of Computer Architecture, Prentice-Hall, 553 p. | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | dd/11/2023 | 2 | 50 | | End-of-term exam | 16 | dd/01/2024 | 2 | 50 | | |
| Student Work Load and its Distribution | | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | | Yüz yüze eğitim | 3 | 14 | 42 | | Sınıf dışı çalışma | 7 | 14 | 98 | | Laboratuar çalışması | 0 | 0 | 0 | | Arasınav için hazırlık | 15 | 1 | 15 | | Arasınav | 2 | 1 | 2 | | Uygulama | 0 | 0 | 0 | | Klinik Uygulama | 0 | 0 | 0 | | Ödev | 0 | 0 | 0 | | Proje | 0 | 0 | 0 | | Kısa sınav | 0 | 0 | 0 | | Dönem sonu sınavı için hazırlık | 16 | 1 | 16 | | Dönem sonu sınavı | 2 | 1 | 2 | | Diğer 1 | 0 | 0 | 0 | | Diğer 2 | 0 | 0 | 0 | | Total work load | | | 175 |
|