B23-CAP-103 Logical Organization of Computer
| Part A – Introduction | |||
| Subject | BCA | ||
| Semester | I | ||
| Name of the Course | Logical Organization of Computer | ||
| Course Code | B23-CAP-103 (Common with B23-CAI-101, B23-CDS- 101, B23-CTS-101) | ||
| Course Type: (CC/MCC/MDC/CC- M/DSEC/VOC/DSE/PC/AEC/ VAC) | CC | ||
| Level of the course (As per Annexure-I | 100-199 | ||
| Pre-requisite for the course (if any) | Basic Knowledge of Mathematics (10th Level) | ||
| Course Learning Outcomes(CLO): | After completing this course, the learner will be able to:
1. understand number systems, error detecting correcting code and representations of numbers in a computer system. 2. understand computer arithmetic and Boolean algebra and simplification of Boolean expressions. 3. understand working of logic gates and design various combinational circuits using these logic gates. 4. understand working of different types of flip-flops and design different types of registers.
5*. to understand the practical aspects of logical organization of computer. |
||
| Credits | Theory | Practical | Total |
| 3 | 1 | 4 | |
| Contact Hours | 3 | 2 | 5 |
| Max. Marks:100(70(T)+30(P))
Internal Assessment Marks:30(20(T)+10(P)) End Term Exam Marks: 70(50(T)+20(P)) |
Time: 3 Hrs.(T), 3Hrs.(P) | ||
| Part B- Contents of the Course | |||
| Instructions for Paper- Setter
Examiner will set a total of nine questions. Out of which first question will be compulsory. Remaining eight questions will be set from four unit selecting two questions from each unit. Examination will be of three-hour duration. All questions will carry equal marks. First question |
|||
| will comprise of short answer type questions covering entire syllabus.
Candidate will have to attempt five questions in all, selecting one question from each unit. First question will be compulsory. Practicum will be evaluated by an external and an internal examiner. Examination will be of three-hour duration. |
||
| Unit | Topics | Contact Hours |
| I | Number Systems: Binary, Octal, Hexadecimal etc. Conversions from one number system to another, BCD Number
System. BCD Codes: Natural Binary Code, Weighted Code, Self- Complimenting Code, Cyclic Code. Error Detecting and Correcting Codes. Character representations: ASCII, EBCDIC and Unicode. Number Representations: Integer numbers – sign-magnitude, 1’s & 2’s complement representation. Real Numbers normalized floating point representations. |
10 |
| II | Binary Arithmetic: Binary Addition, Binary Subtraction, Binary Multiplication, Binary Division using 1’s and 2’s Compliment representations, Addition and subtraction with BCD representations. Boolean Algebra: Boolean Algebra Postulates, basic Boolean Theorems, Boolean Expressions, Boolean Functions, Truth Tables, Canonical Representation of Boolean Expressions: SOP and POS, Simplification of Boolean Expressions using Boolean Postulates & Theorems, Kaurnaugh-Maps (upto four variables), Handling Don’t Care conditions. | 10 |
| III | Logic Gates: Basic Logic Gates – AND, OR, NOT, Universal Gates – NAND, NOR, Other Gates – XOR, XNOR etc. Their symbols, truth tables and Boolean expressions.
Combinational Circuits: Design Procedures, Half Adder, Full Adder, Half Subtractor, Full Subtracor, Multiplexers, Demultiplexers, Decoder, Encoder, Comparators, Code Converters. |
10 |
| IV | Sequential Circuits: Basic Flip- Flops and their working. Synchronous and Asynchronous Flip –Flops, Triggering of Flip- Flops, Clocked RS, D Type, JK, T type and Master-Slave Flip-Flops. State Table, State Diagram and State Equations.
Flip-flops characteristics & Excitation Tables. Sequential Circuits: Designing registers –Serial-In Serial-Out (SISO), Serial-In Parallel-Out (SIPO), Parallel-In Serial-Out (PISO) Parallel-In Parallel-Out (PIPO) and shift registers. |
10 |
| V* | Practicum:
Students are advised to do laboratory/practical practice not limited to, but including the following types of problems: Number System: · Problems based on Number System and their conversion. · Programs based on Number System conversion. Binary Arithmetic · Problems based on Binary Arithmetic. |
25 |
| · Programs based on Binary Arithmetic.
· Problems based on Boolean Expression and their simplification Logic Gates · Understanding working of logic Gates. Combinatorial Circuits: · Designing and understanding various combinational circuits. Sequential Circuits: · Designing and understanding various sequential circuits. |
||
| Suggested Evaluation Methods | ||
| Internal Assessment:
➢ Theory · Class Participation: 5 · Seminar/presentation/assignment/quiz/class test etc.: 5 · Mid-Term Exam: 10 ➢ Practicum · Class Participation: 5 · Seminar/Demonstration/Viva-voce/Lab records etc.: 5 · Mid-Term Exam: NA |
End Term Examination: A three hour exam for both theory and practicum. | |
| Part C-Learning Resources | ||
| Recommended Books/e-resources/LMS:
· M. Morris Mano, Digital Logic and Computer Design, Prentice Hall of India Pvt. Ltd. · V. Rajaraman, T. Radhakrishnan, An Introduction to Digital Computer Design, Prentice Hall. · Andrew S. Tanenbaum, Structured Computer Organization, Prentice Hall of India Pvt. Ltd. · Nicholas Carter, Schaum’s Outlines Computer Architecture, Tata McGraw-Hill. |
||
