Showing posts with label topics. Show all posts
Showing posts with label topics. Show all posts

Important Topics for MicroProcessor

Important Topics for MicroProcessor :


1. DESIGN OF MUX,COUNTERS K MAPS ,DE CODERS BOOLEAN
EXPRESSION REDUCTION USING THHOREMS

2. MAKE A LIST OF 1 BYTE, 2BYTE AND 3 BYTE INSTRUCTIONS


3. WRITE A PROGRAM TO ADD TWO 8 BIT NUMBERS STORE THE SUM
AND CARRY CALCULATE THE NUMBER OF MEMORY LOCATIONS TO
STORE PROGRA,DATA AND OUTPUT

4. T STATE CALCULATION FOR LOOP AND NESTED LOOPS

5. PREPARE CONTROL WORD FOR THE FALLOWING
  • A. 8253
  • B. 8255
  • C. INTERUPT CONTROL WORD

6. GO THROUGH DIAGRAMS IN
  • A. I\O INTERFACING
  • B. MEMORY INTERFACING

7. GO THROUGH M CYCLE DIAGRAM

8. IN CHAPTER NO 17 DIAGRAM OF KEY BOARD INTERFACE

9. BCD TO 7 SEGMENT DISPLAY IN DETAIL

10. SQUARE WAVE GENERATION BY USING 8253 CHIP

DISCRETE STRUCTURES FOR COMPUTER SCIENCE - Topics


Course Description :

Introduction to discrete mathematical structures; Formal logic and predicate calculus; Sets, relations and functions; Proof techniques; Graphs and trees; Primes, factorization, greatest common divisor, residues and application to cryptology; Boolean algebra; Permutations, combinations and partitions; Recurrence relations and generating functions; Introduction to error-correcting codes; Formal languages and grammars, finite state machines.

Textbook :

T1.      Kolman, Busby, Ross and Rehman, Discrete Mathematical Structures for Computer Science, Pearson Education, 5th Edition, 2003.

Topics :


Week No.
Topics
Reference to
Text Book
1
Sets, Operations on sets, Sequences, Matrices
T1-Ch.1
2
Propositions, Conditional statements, Induction
T1-Ch.2
3
Pigeonhole Principle, Recurrence Relations
T1-Ch. 3.3, 3.5
4
Relations and Digraphs, Paths in Relations, Equivalence Relations
T1-Ch. 4.2 - 4.5
5
Operations on Relations, Transitive closure
T1-Ch. 4.7 – 4.8
6
Functions, Function for Computer Science Permutation functions
T1-Ch. 5.1,5.2,5.4
7
Partially ordered sets, Lattices, Boolean Algebras
T1-Ch.6.1, 6.3, 6.4
8
Review and Problem Solving

Syllabus for Mid-Semester Test: Topics covered in the first eight weeks
9
Graphs, Euler Paths, Hamilton Paths
T1-Ch 8.1 – 8.3
10
Trees, Labeled Trees
T1-Ch.7.1, 7.2
11
Tree Searching, Undirected Trees
T1-Ch. 7.3, 7.4
12 – 13
Minimal Spanning Trees
T1-Ch. 7.5
14
Semi groups, Products and Quotients of Semi groups
T1-Ch.9.1, 9.2
15
Groups, Products and Quotients of Groups
T1-Ch.9.3, 9.4
16
Review and Problem Solving

Syllabus for Comprehensive Exam (Open Book) All topics given in Plan 


 
Reference Books :

R1.     D.S. Malik and M.K. Sen, Discrete Mathematical Structures: Theory and Applications, Thomson, 2004.
R2.     Goodaire & Parmenter : Discrete Mathematics & Graph Theory, Pearson Education, 2000.
R3.     Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw Hill, 5th Ed., 2004.
R4.     C.L. Liu, Elements of Discrete Mathematics, 2nd Edition, McGraw Hill, 1986.

DIGITAL ELECTRONICS & MICROPROCESSORS - Topics


Course Description :

Binary logic gates; logic circuits; Boolean algebra and K-map simplification; number systems and code; arithmetic logic units; flip-flops; registers and counters; introduction to microprocessors; architecture; instruction set and programming; memory interfacing.
Prescribed Text Books :

T1.           Ronald J. Tocci, Neal S. Widmer and Gregory L. Moss, Digital Systems : Principles and Applications, Pearson Education.  Ninth Edition

T2.     Barry B. Brey and C.R. Sarma, The Intel Microprocessors : Architecture, Programming and Interfacing, Pearson Education.

Topics :

Sr. No.
Ref. in the book
Learning objectives
1















T1 : 
Ch 2








NUMBER SYSTEMS AND CODES
To be able to :
1. Convert a number from one number system (decimal, binary, octal, hexadecimal) to its equivalent in one of the other number systems
2. Understand the advantages of the octal and hexadecimal number systems.
3. Count in octal and hexadecimal number systems
4. Represent decimal numbers using the BCD code.
5. Understand the difference between BCD and straight binary.
6. Understand the purpose of ASCII code
7. Understand Parity for error detection.
T1 : 
Ch 3






LOGIC GATES AND BOOLEAN ALGEBRA
To be able to :
1. Perform AND, OR , NOT  gate operations
2. Explain Truth Table for AND, NAND, OR, NOR, NOT circuits
3. Write Boolean expressions for combinations of gates
4. Implement logic circuits using basic AND, OR , NOT gates
5. Use Boolean algebra to simplify complex logic circuits.
2








T1 : 
Ch 4





COMBINATIONAL LOGIC
To be able to :
1. Convert a logical expression into a sum-of-products expression.
2. Minimise a given Sum-of-Products expression
4. Use Exclusive-OR and Exclusive-NOR gates
5. Design simple logic circuits
T1 : 
Ch 6



DIGITAL ARITHMETIC
To be able to :
1. ADD and SUB two HEXADECIMAL numbers
2. Explain operation and use of HALF-Adders and FULL-Adders
3









T1 : 
Ch 5









LATCHES AND FLIP-FLOPS
To be able to :
1. Construct and analyse the operation of a latch flip-flop made from NAND or NOR gates
2. Differentiate between synchronous and asynchronous systems.
3. Explain RS-, clocked RS-, JK-, D-,T- lip-Flops
4. Understand conversion of Flip-Flop from one type to another.
5. Understand triggering mechanisms in flip-flops.
6. Understand Parallel- and Serial- data transfers
7. Employ Flip-Flops as shift registers
8. Employ flip-flops as frequency-division and counting circuits.
4











T1 : 
Ch 7





COUNTERS
To be able to  design and explain the operation of :
1. Asynchronous (ripple) counters
2. Modulo N counters
3. Synchronous (Parallel) counters
4. Synchronous Down and Up/Down counters
T1 : 
Ch 7





REGISTERS
To be able to  design and explain the operation of :
1. Parallel in/Parallel out shift registers
2. Serial in/serial out shift registers
3. Parallel in/serial out shift registers
4. Serial in/parallel out shift registers
5



T1 : 
Ch 9



MSI LOGIC CIRCUITS
To be able to  design and explain the operation of :
1. DECODERS and ENCODERS
3. MULTIPLEXERS and DEMULTIPLEXERS
6





T2 : 
Ch 1 & Ch2





MICROPROCESSOR AND ITS ARCHITECTURE
To be able to :
1. Explain the function of each block of a computer system
2. Give a brief historical perspective of Computers
3. Provide a overview of Intel microprcessors
4. Understand and Explain the internal architecture of 8086 microprocessor
7






T2 : Ch 2






MICROPROCESSOR AND ITS ARCHITECTURE
To be able to :

2. Explain the function and purpose of each  register in 8086
3. Detail the flag register and the purpose of each flag bit
4. Understand and explain Segments and Offsets
5. Explain Default Segments
8

Review and Problem Solving
Mid semester test
9







T2 : 
Ch 3







ADDRESSING MODES
To be able to :
1. Explain the operation of each data-addressing mode
2. Use the data-addressing modes to form assembly language statements
3. Explain the operation of each program memory-addressing mode.
4. Form appropriate assembly and mchine language statements
5. Use appropriate addressing mode to accomplish a given task
6. Explain Stack read/write sequence of operations
10




T2 :
Ch 4




DATA MOVEMENT INSTRUCTIONS
To be able to :
1. Explain PUSH, POP, LEA, LDS, LES, LODS, STOS, MOVS, XCHG,LAHF, SAHF, XLAT,IN, OUT
2. Explain the purpose and usage of SEGMENT OVERRIDE PREFIX.
3. Explain the purpose and usage of ASSEMBLER DIRECTIVES
11&12









T2 : 
Ch 5









ARITHMETIC AND LOGIC INSTRUCTIONS
To be able to :
1.Explain Addition  instructions such as ADD, INC, ADC, NEG
2.Explain  Subtraction instructions such as  SUB, DEC, SBB
3.Explain Shift/Rotate instructions such as SHL, SHR, SAL, SAR, ROL, RCL, RCR, ROR
4.Explain  Multiplication and division instructions such as    IMUL, MUL, DIV, IDIV
5.Explain logical instructions such as CMP, AND, OR, XOR, TEST, NOT
6.Explain adjustment operation on decimal and ASCII representations such as  DAA, DAS, AAA, AAD, AAM, AAS
7. Explain string operations such as  SCAS, CMPS
8. Logical inversion and Arithmetic sign inversion such as NOT and NEG
13&14









T2 : 
Ch 6









PROGRAM CONTROL INSTRUCTIONS
To be able to :
1. Explain Conditional and Unconditional Jump instructions
2. Explain NEAR and Far JUMP instructions
3. Explain Conditional jump instructions
4. Explain Near CALL and Far CALL
5. Explain RET instruction
6. Explain Conditional LOOPs
7. Explain how Interrupts are used in Assembly Language Program to read, write characters/strings from keyboard/to screen
8. Explain the other Program Control Instructions such as WAIT, HLT,NOP
15







T2 : 
Ch 9







MEMORY INTERFACING
To be able to :
1. Explain the different types of Memory devices : Volatile/Non-Volatile
2. Symbolic representation of a RAM and a ROM showing pin connections (ADDR, DATA, R/W, CS)
3.  Calculate the Address lines rquired for different RAM/ROM sizes 1KB/2KB/4KB/8KB etc.
4. Stack memory chips with low capacity to realise larger sizes.
5. Importance of CHIP SELECT pin on memory chips
6. Decode the memory address and use the outputs of the decoder to select various memory components
16

Review and Problem Solving
Comprehensive examination

WASE open book exams - June 2013

Hey waseians, All the best for exams... ☺ Exams time table Useful posts for open book exam Semester 3 materials Get ready...