REFERENCES
Electronic Communication Kennedy 
Modern Communication Circuits J Smith 
Principles of Communication Systems H. Taub & Schilling 
--------------------------------------------------------------------------------

LOGIC CIRCUITS 
--------------------------------------------------------------------------------

Evaluation system: Theory Examination : 3 hours marks : 100
Oral marks : 25 
Term work marks : 25 
10 Expriments 15 marks 
Class Test 10 marks 
--------------------------------------------------------------------------------

NUMBER SYSTEMS AND CODES:
Binary, Octal, Hexadecimal number systems, Conversion from any base to another base number system. 
Binary, BCD, Excess-3, Gray, Alphanumeric, EBCDIC, Hollerith, ASCII codes, codes conversion. 
Error detecting and Error correcting codes :- Parity and Hamming codes. 

BINARY ARITHMETIC 
Basic rules for addition and multiplication. 
Sign magnitude notation. 
One's complement notation 
Two's complement notation. 
Additions and multiplications using binary, octal and hexadecimal number systems 

BOOLEAN ALGEBRA AND LOGIC GATES 
Boolean algebraic theorems. 
Reduction of logic expressions using boolean algebra. 
Truth tables, minterms, maxterms, SOP & POS forms, standard SOP & POS forms. 
Basic and universal logic gates ( block approach), 'control' aspect of gates. 
Enabling and disabling of gates, K map representation of logical functions. 
Amplification of logical functions using K maps upto 6 variables. 
Quine Mc Cluskey method and Veitch diagrams used for logic function 
Reduction 

COMBINATIONAL LOGIC GATES 
Concepts of combinational & sequential circuits. 
Idealization of following circuits using gates:- 
Systems implementing combinational logic 
Arithmetic circuits :- HAlf and Full adders, subtracters, multipliers, code convertors, parity generators, parity checkers, comparators. 
Multiplexers, demultiplexers / decoders, Encoders. 
Concept of mode control. 
Application of WSI devices for multiplexer, demultiplexer / decoder, comparator, parity generator / checker, concept of capacity expansion of dvices using gates.
Use of MSI devices for adders :- Sequential adder, BCD adder / subtractor, Carry look ahead adder, multipliers, fast multipiers. Arithmetic Logic Unit (ALU). 

SEQUENTIAL CIRCUITS 
Concept of synchronous & asynchronous operations. 
Flip-flops :- Basic cell, S-R, clocked S-R, D, T, J-K, J-K with preset and clear
master-slave J-K flip-flops. Concepts of level triggering and edge triggering, flip-flop excitation tables, triggering and timing of flip-flops 
Registers :- shift registers, bi-directional, seriel-parallel, parallel-serial conversion 
Analysis of clocked sequential circuits. 
Asynchronous counters :- up-down counters, modulo N counters, glitch problem. 
Synchronous counters :- use of K maps for synchronous counters, ring counters, twisted ring counters, counters using shift registers, sequence generators using flip-flops. 

--------------------------------------------------------------------------------

BOOKS RECOMMENDED
Digital Systems Schaums outline series, by Palmer & PErlman 
Introduction to switching theory and logic design Hill & Peterson 
--------------------------------------------------------------------------------

C PROGRAMMING 

--------------------------------------------------------------------------------

Lectures/week : 4
Practicals/week : 4

Evaluation system: Theory Examination : 3 hours marks : 100
Term work marks : 25 

12 Programs 15 marks 
Class Test 10 marks 

--------------------------------------------------------------------------------

Features of C, ANSI C, structure of a C program.

Character set, variable names, Data types, constants and declarations. Scope and lifetime of variables.

Arithmetic, logical, relational, increment, bitwise, assingment, operators and expressions; conditional expressions; precedence of order of evaluation and type conversion.

Basic input and output, formatted input and output.


Control structures - Concept of block statement, IF, IF - ELSE, Switch, Looping structures - FOR, DO, WHILE, Break and continue statements, GOTO statement.

Functions, external variables, scope rules, nesting of functions, recursion, function with arrays.

Arrays - One dimensional, two dimensional and multi dimensional arrays, their initialisation and manipulation. String handling features.

Pointers, addresses, their initialisation, pointer arithmetic, pointers and functions, pointers and arrays, pointers to pointers, pointers to functions.

Structures and Unions - Basics of structures, initialisation, structures and functions, structures and arrays, pointers to structures, structures within structures, Unions and bit fields.

Dynamic memory management - malloc( ), calloc( ), free( ), sizeof( ) functions.

File management - Low level and high level file access, sequential and random access files, error handling.

Pre processor, macro substitution, header file inclusion, study of standard libraries like stdio.h, ctype.h, string.h, math.h, stdlib.h, stdarg.h, dos.h etc. 

--------------------------------------------------------------------------------

BOOKS RECOMMENDED

The C Programming Language Kernighan & Ritchie 
Programming in C Stephen Kochan 

--------------------------------------------------------------------------------



BUSINESS DATA PROCESSING 

--------------------------------------------------------------------------------

Lectures/week : 4
Practicals/week : 4

Evaluation system: Theory Examination : 3 hours marks : 100
Term work marks : 25 

6 Programs 15 marks 
Class Test 10 marks 
--------------------------------------------------------------------------------

Introduction to Business Organisation 
Need, Structure and nature of Information systems - data processing activities - Management Information Systems. 
Introduction to structures programming 
Typical examples of systems like - Inventory, Accounting, Pay roll, Production planning etc.

Introduction to Input / Output and Data Storage devices - their organisation and access methods. File concepts, record layout. Organisation and access stratergies of files.

COBOL Programming 
Character set, words, data names, verbs, structure of COBOL program. 
Elementary and Group data items, hierarchial structuring of data, picture clauses.

Arithmetic operations, ADD, SUBTRACT, MULTIPLY, DIVIDE and COMPUTE statements, arithmetic expressions and operator precedence. Data transfer statements - MOVE, editing and edit pictures.

File control entries - File configuration section, Input-Output Section, Data Division - File section and working storage section. Input Output verbs - OPEN, READ, WRITE, CLOSE, ACCEPT, DISPLAY.

Condition Statements - 
relational and logical operators 
simple and compound conditions 
Control structures - IF, nested IF, GOTO, STOP, GOTO DEPENDING ON, PERFORM statements.

Sequential file processing - fixed and variable record files, sorting and merging, sequential file update operations, Magnetic tape files.

Direct access files - Indexed sequential file handling, update of indexed files 
Relative files - relative file handling - key address transformations.

Introduction to report writer - REPORT section, Report group description and procedure division statements.

Introduction to subroutines, subprograms, segmentation and overlay management.

Introduction to systems analysis and Data base management systems. 

--------------------------------------------------------------------------------

BOOKS RECOMMENDED
Information Systems through COBOL Philippakis & Kazmier
Structured COBOL Programming Stern & Stern 
Stuctered COBOL Philippakis & Kazmier 
COBOL Programming Roy, Ghosh and Dastidar 
COBOL programming with business applications N L Sarda 
A practical approach to COBOL Programming Sharad Kant 
Guide to COBOL Programming McCraken and Garbasic 
Systems analysis for business data processing Clifton 

--------------------------------------------------------------------------------


SCHEME OF INSTRUCTIONS AND EXAMINATIONS

--------------------------------------------------------------------------------

SEMESTER - III
SUBJECT LECT/
WEEK PRACT/
WEEK DURATION OF PAPER HOURS PAPER
(max marks) TERM WORK PRACT ORAL TOTAL 
APPLIED MATHEMATICS - III 5 - 3 100 - - - 100 
ELECTRONICS-1 5 3 3 100 25 - - 125 
ELECTRICAL NETWORKS 5 3 100 25 - - 125 
COMPUTER METHODOLOGY & ALGORITHMS 5 4 3 100 25 - - 125 
NUMERICAL METHODS 4 4 3 100 25 - - 125 
ENGINEERING MATERIALS AND COMPONENTS 4 - 3 100 - - - 100 
28 14 700 

--------------------------------------------------------------------------------

SEMESTER - IV
SUBJECT LECT/
WEEK PRACT/
WEEK DURATION OF PAPER HOURS PAPER
(max marks) TERM WORK PRACT ORAL TOTAL 
APPLIED MATHEMATICS - IV 5 - 3 100 - - - 100 
ELECTRONICS - II 5 3 3 100 25 25 25 175 
PRINCIPLES OF COMMUNICATION ENGINEERING 4 3 3 100 25 - 25 150 
LOGIC CIRCUITS 4 3 3 100 25 - 25 150 
C PROGRAMMING 4 3 3 100 25 - 25 150 
BUSINESS DATA PROCESSING 4 3 3 100 25 - - 125 
26 15 825 

Check out the Syllabus