National Institute of Technology Calicut

Module I

Introduction to computers and software (3 Hours)

Problem solving, algorithm design, and algorithm analysis (mention only) (3 Hours)

Design methodologies: (6 Hours)

Stepwise refinement: Modules and Interfaces.

Object oriented methodology: Encapsulation, Inheritance, Polymorphism

Module II

Programming language concepts and constructs: Expressions, Statements, selection, repetition.

(11 Hours)

Module III

Functions, recursion, I/O mechanisms (Exceptions optional) (10 Hours)

Module IV

Data types: Primitive types and structured types (4 Hours)

Coding practices: (3 Hours)

Indentation guidelines, naming conventions, documenting code, debugging

Testing: Verification methods, test data selection. (2 Hours)
Note: Programming language C++ / Java may be used as a vehicle to achieve the goal.
Text Books:

1.Bruce Eckel, Thinking in Java, 3/ed, Available online at www.bruceeckel.com

2. Bruce Eckel, Thinking in C++, 2/ed. Vol I and II, Available online at www.bruceeckel.com
References:

1. Robert Lafore, Object Oriented Programming in Turbo C++, The Waite Group’s, Galgotia Publications Pvt. Ltd. 2000.

2. Rebecca Thomas, Lawrence R Rogers, Jean L Yates, Advanced Programmer’s Guide to UNIX System V, McGraw Hill International Edition, Computer Science Series.

3. Patrick Naughton, Herbert Schildt, Java ^TM 2: The Complete Reference, Tata McGraw-Hill Publishing Company Ltd. 3/ed

4. Danny Kalev, The ANSI/ISO C++ Professional Programmer’s Handbook, PHI 2000.
CSU 202 LOGIC DESIGN
Pre-requisite: CSU 101 Computer Programming

L	T	P	C
3	0	2	4

Module I (10 + 5 Hours)

Number Systems and codes, Boolean algebra: postulates and theorems, constants, variables and functions, switching algebra, Boolean functions and logical operations, Karnaugh map: prime cubes, minimum sum of products and product of sums, Quine-McClusky algorithm, Combinational Logic: analysis and design of combinational logic circuits, parallel adders and look-ahead adders, comparators, decoders and encoders, code conversion, multiplexers and demultiplexers, parity generators and checkers, ROMs,

 

Module II (10 + 5 Hours)

PLAs, .PLA minimization, PLA folding, design for testability, Counters and shift registers: excitation tables, ripple counters, synchronous counters, up-down counters, design of sequential circuits, shift registers and their applications. Clock mode sequential machines.

 Module III (11 + 10 Hours)

Microprocessor architecture: real mode and protected mode memory addressing, memory paging. Addressing modes: data addressing, program memory addressing, stack memory addressing. Data movement instructions, Arithmetic and logic instructions, Program control instructions, Programming the microprocessor: modular programming, using keyboard and display, data conversions, disk files, interrupt hooks, using assembly language with C/C++.

Module IV (11 + 8 Hours)

Memory interface: memory devices, address decoding, 16 bit (8086), 32 bit (80486) and 64 bit (Pentium) ,Hardware architecture for embedded systems-processor-memory-latches and buffers-display unit-16 and 32 bit processors. Memory interfaces, dynamic RAM. I/O interface: port address decoding, PPI, 8279 interface, 8254 timer interface, 16550 UART interface, ADC/DAC interfaces, Interrupts- Interrupt controller, DMA Controller.

 

References:

1. 
   N. N. Biswas, Logic Design Theory, Prentice Hall of India, New Delhi, 1993.
   
2. 
   T. L. Floyd, Digital Fundamentals, 3/e, Universal Book Stall, New Delhi, 1986.
   

3.  B. B. Brey, The Intel Microprocessors 8086 to Pentium: Architecture, Programming and Interface, 6/e,

Prentice Hall of India, New Delhi, 2003.

4. Programming for embedded systems Dream Software team , Willey 2002

5. H. P. Messmer, The Indispensable PC Hardware Book, 3/e, Addison Wesley, 1997.

6. A. K. Ray, and K. M. Bhurchandi, Advanced Microprocessors and Peripherals, Tata McGraw Hill, 2000.

7. D. V. Hall, Microprocessors and Interfacing: Programming and Hardware, 2/e, Tata McGraw Hill, New Delhi, 1992.

CSM 591 PROGRAMMING LAB
Pre-requisite: CSU 101 Computer Programming

L	T	P	C
0	0	5	3

Module I (5 Lab Sessions)

 

HCF (Euclid’s algorithm) and LCM of given numbers - find mean, median and mode of a given set of numbers – Conversion of numbers from binary to decimal, hexadecimal, octal and back – evaluation of functions like e^x, sinx, cosx etc. for a given numerical precision using Taylor’s series – testing whether a given number is prime.