BCA Syllabus Topics

SEMESTER-2nd Course: BCA

SUBJECT: DIGITAL COMPUTER ORGANIZATION

Syllabus:

Unit-I: Digital computer and digital system; Binary number system: number base conversion. Compliments: one's, two's, 9's and 10's complements code: Gray BCD, ASCII, and error detection code. Logic Gates: AND, OR, NOT, EX-OR, Universal gate. Logic Circuit. Boolean function: Rules and simplification, simplification of Boolean function using map method, don't care condition.

Unit-II: Combinational Circuits: Adders, Subtractors, Multiplexer, Demultiplexer Decoder, Encoder) Sequential Circuit: Flip-Flop: RS, Clocked RS, JK, D flip-flop, and Master board, Case studies to understand organization of laptop like Dell, Lenovo etc. slave flip-flop. Register- Introduction, Shift register, serial Transfer & parlor Load. Counters- Ripple Counter (Asynchronous), Synchronous Counters.

Unit-III: 8086 internal architecture, register organization of 8086, addressing modes, instruction set and assembler directives, data movement instructions. Register Transfer, Bus and Memory transfer, Micro operation: Logic and Shift Instruction code: Instruction code, Direct and Indirect address. Interrupt and Processing and Parallel Interrupt cycle, Machine Language: Assembly language, assembler. Subroutines

Unit-IV: Control processing unit: general register organization, stack organization. polish notation. Instruction Format: Three Address instruction, Addressing modes, RISC and CISC, Pipeline and its types.

Unit-V: Computer Arithmetic: Addition and Subtraction with H/W algorithm Multiplication algorithm, Booth Multiplication. Mode of transfer: DMA, DMA controller Memory Organization: Memory Hierarchy Main memory, Auxiliary, Associative, catch, and Virtual memory

Text Books:

  • Computer Architecture & Parallel Processing Sigapur (TMH)
  • Digital Electronics W.HGothman (PHI)
  • Modern digital electronics R.P Jain (TMH)
  • Digital fundamental Floyd (UBS)
  • Digital Computers (H) Tiwari Ashish (KamalPrakashan)

Reference Books:

  • Digital Computer Electronics MALVINO (TMH Publication)
  • Computer System Architecture MORRIS MANO (PHI Publication)
  • Digital Computer Fundamentals BARTEE (TMH Publication)

Comments

Post a Comment

Popular posts from this blog

Introduction of K-Map (Karnaugh Map) Part 2

Image
  5 variable K-Map in Digital Logic Karnaugh Map  or K-Map is an alternative way to write truth table and is used for the simplification of Boolean Expressions. So far we are familiar with 3 variable K-Map & 4 variable K-Map. Now, let us discuss the 5-variable K-Map in detail. Any Boolean Expression or Function comprising of 5 variables can be solved using the 5 variable K-Map. Such a 5 variable K-Map must contain   = 32 cells . Let the 5-variable Boolean function be represented as : f ( P Q R S T)  where P, Q, R, S, T are the variables and P is the most significant bit variable and T is the least significant bit variable. The structure of such a K-Map for SOP expression is given below : The cell no. written corresponding to each cell can be understood from the example described here: Here for variable  P=0, we have Q = 0, R = 1, S = 1, T = 1 i.e. (PQRST)=(00111)  . In decimal form, this is equivalent to  7 . So, for the cell shown above the corresponding cell no. = 7. In a similar
Read more