

B.E. COMPUTER ENGINEERING

S ECOND YEAR S EMES TER IV

SUBJECT : APPLIED MATHEMATICS IV

Lectures: 4 per week;

One paper: 100 marks. (3 Hrs.)

Objectives Of The Course: This course aims to build concepts of Complex Variables,
Residue theorem, Matrices and Numerical Methods. These topics are included to
provide required mathematical background for subsequent courses.

Pre-requisites: NIL

DETAILED S YLLABUS

9. Complex Variables:
• Regions and Paths in Z plane;
• Taylor's and Laurent's development;
• Singularities, Poles, residue at isolated singularity and its evaluation;
• Residue theorem: Application to evaluate real integrals.

10. Matrices:
• Vectors; real field inner products; Norm; Linear independence; orthogonality;
• Characteristic values and vectors; their properties for Hermitian and real
symmetric matrices;
• Characteristic polynomial;
• Cayley Hamilton theorem;
• Functions of square matrix;
• Minimal polynomial;
• Diagonalizable matrix.
11. Numerical Methods:
• Errors: Types and Estimation;
• Solutions to Transcendental and polynomial equations: Bisection method; Gauss-
Jordan method; Newton-Raphson method;
• Solutions to system of linear algebraic equations: Gauss elimination method;
Gauss-Jordan method; Gauss Siedel iteration method;
• Interpolation: Linear interpolation; High order interpolation using Lagrange and
Newton's methods; Finite difference operators and difference tables;
• Numerical Integration: Trapezoidal rule; Simpson's 1/3  rd and 3/8 thrules.
• Solutions to ordinary differential equations: Taylor's series method; Euler's
predictor-corrector method; Rungekutta method of second and fourth order.

BOOKS
Text Books:
1. P. N. Wartikar and J. N. Wartikar, "Element of applied mathematic", Vol I/Vol II, A.
V. Griha, Pune.
2. Shanti Narayan, "Matrices", S. Chand Publishing House, Delhi.
3. Shanti Narayan, "Theory Of Functions Of Complex Variables", S. Chand Publishing
House, Delhi.
4. S. S. Shastri, "Introductory Methods of Numerical Analysis" , Vol-2, PHI, Second
Edition , 1994.

Referrences:
1. John S. Mathews , "Numerical Method for Mathematics, Science and Engineering".
2. Salvadari and MacCraken, "Numerical Methods".
 B.E. INFORMATION THEORY
S ECOND YEAR S EMES TER IV

SUBJECT : PRINCIPLES OF COMMUNICATION ENGINEERING.

Lectures: 3 per week; Practicals: 2 per week;

One paper: 100 marks. (3 Hrs.); Term work - 25 marks. ; Oral Exam -25 marks.

Objectives Of The Course: This course aims to build the basics of communication
principles.

Pre-requisites: NIL

DETAILED SYLLABUS

1. Introduction:
• Elements of a communication system, Modulation and demodulation; Noise in
Communication systems, Signal-to-Noise ratio, Noise factor and Noise Figure,
Equivalent Noise Temperature.

2. Amplitude Modulation:
• DSB Full carrier AM - principles, modulator circuits, transmitters. Different
types of AM, Suppressed - carrier AM, SSB, ISB - Principles, transmitters.

3. Angle Modulation:
• Frequency modulation, Phase modulation, Effect of noise, FM modulators, Transmitters.

4. Radio Receivers:
• Receiver characteristics, TRF and Superheterodyne receivers, AM detectors, FM detectors,
Receiver circuits.

5. Radio Wave Propagation:

• Electromagnetic waves, Properties of radio waves, Propagation of waves, Propagation terms and
definitions.

6. Analog Pulse Modulation:

• Sampling Theorem for Low-pass and Band-pass signals - proof with spectrum,
Aliasing. Sampling Techniques - principle, generation, demodulation, spectrum.
PAM, PWM, PPM - generation and detection.

7. Digital Transmission:
• Quantization , Quantization error, Non-uniform quantizing, Encoding. PCM,
PCM, Delta modulation, Adaptive Delta modulation - transmission system,
bandwidth.

8. Multiplexing:
• TDM, FDM - Principles, Hierarchy.
 BOOKS

Text Books:
1. Wayne Tomasi, "Electronic Communication Systems", Pearson Eduction, Third
Edition, 2001.
2. Roy Blake, "Electronic Communication Systems", Thomson Learning, Second
Edition.
3. Kennedy and Davis, "Electronic Communication Systems", TMH.

Re fe rence s:
1. Leon W Couch, "Digital and Analog Communication Systems", Pearson
Education, Sixth Edition.
2. T aub and Schilling, "Principles of Communication Systems", T ata McGraw-Hill, Second Edition.

Topics of Experiments

1. AM generation and detection.

2. FM generation and detection.
3. Superheterodyne Receiver.
4. Sampling and reconstruction.
5. PWM generation and detection.
6. PPM generation and detection.
7. PCM generation and detection.
8. Delta modulation generation and detection.
9. T ime Division Multiplexing.
10. Frequency Division Multiplexing.

TERM WORK

1. Term work should consist of at least 8 experiments and 5 assignments covering

all the topics.
2. A term work test must be conducted with a weightage of 10 marks.

ORAL EXAMINATION

An oral examination based on the above syllabus should be conducted to test the knowledge of the
students.
 B.E. COMPUTER ENGINEERING
S ECOND YEAR S EMES TER IV

SUBJECT : COMPUTER ORGANI ZATION AND ARCHI TECTURE

Lectures: 4 per week; Practicals: 2 per week;

One paper: 100 marks. (3 Hrs.); Term work - 25 marks; Oral Exam - 25 marks.

Objectives of the course: Computer Organization and architecture is a subject of increasing relevance with
the merging of computer, communication technology and consumer electronics. The purpose of this course
is to acquaint budding engineers with the basic principles of organization, operation and performance of
modern-day computer systems. It covers all aspects of computer technology, from the underlying integrated
circuit technology used to construct computer components, to the use of parallel organization concepts in
combining those components.

Pre-requisites: Digital Logic and Design.

DETAILED S YLLABUS

1. Overview:
• General organization and architecture;
• Structural/functional view of a computer;
• Evolution/brief history of computers.

2. S ystem Buses:
• Computer components-memory, CPU, I/O;
• Interconnection structures;
• Bus interconnection, multiple bus hierarchies, pci bus structure.

3. Memory Organization:
• Internal memory— characteristics, hierarchy;
• Semiconductor main memory - types of ram, chip logic, memory module organization;
• Cache memory-- elements of cache design, address mapping and translation, replacement
algorithms;
• advanced dram organization;
• Performance characteristics of two-level memories;
• External memory: magnetic disk, tape, raid, optical memory;
• High speed memories: associative and interleaved memories.

4. Data Path Design:

• Fixed point representation;
• Floating point representation;
• Design of basic serial and parallel high speed adders, subtractors,
multipliers, Booth's algorithm;
• The arithmetic and logic unit (ALU): Combinational and sequential
ALU's.

5. The Central Processing Unit:

• Basic instruction cycle;
• Instructions sets, formats and addressing;
• Processor organization;
 IT22

• Register organization;

• Instruction pipelining;
• Co-processors, pipeline processors;
• RISC Computers, RISC versus CISC characteristics.

6. The Control Unit:

• Micro- operations;
• Hardwired implementation;
• Microprogrammed control;
• Micro-Instruction format;
• Applications of microprograming.

7. Input and Output Unit:

• External devices-: keyboard, monitor, disk drive and device drivers;
• I/O modules: programmed I/O, interrupt driven I/O, DMA, I/O
channels and I/O processors;
• Serial transmission and synchronization.

8. Multiple Processor Organizations:

• Flynn's classification of parallel processing systems;
• Pipelining concepts.

BOOKS

Text Books:
1. William Stallings, "Computer Organization and Architecture", Prentice
Hall / Pearson Education Asia, Fifth Edition.
2. John P. Hayes, "Computer Architecture and Organization", Mc-Graw
Hill, Third Edition.
3. Tannenbaum, "Computer Organization", PHI.

References:
1. V. Carl Hamacher and Zaky, "Computer Organization", Mc-Graw Hill.
2. Thomas C. Bartee, "Computer Architecture and Logic Design", Tata Mc-
Graw Hill.
3. Moris Mano, "Computer System Architecture", Prentice Hall of India,
Second Edition.

TERM WORK

1. The term work must consist of at least 6 simulation programs (for example
implementation of high speed adders/subtractors and multipliers, simulation of
pipelined multipliers etc.).
2. The term work must also include 4 assignments. The assignments should
include case studies of at least two RISC and CISC processors and
the
3. corresponding P.C. used in the lab.
A term work test must be conducted with a weightage of 10 marks.

ORAL EXAMINATION
An oral examination is to be conducted based on the above syllabus to test the knowledge
of the students.
 B.E. INFORMATION THEORY
SECOND YEAR SEMESTER III

SUBJECT : DATA STRUCTURES AND ALGORI THMS

Lectures: 3 per week; Practicals: 3 per week;

One paper: 100 marks. (3 Hrs.); Term work - 25 marks; Practial Exam - 25 marks;

Objectives of the course: Data structures are commonly used in all program designs. The systematic study
of the design and analysis of algorithms forms the basis on which students would base their programs. This
course in data structures and algorithms, therefore, rightly forms the central course of the curriculum in
Information Technology. At the end of this course, students are expected to understand the various data
structures and use different algorithms, a knowledge they will use in every program they write for the rest
of their lives.

Pre-requisites: Course in C.

DETAIL D ES IGN

1. Introduction in C:
• Static and Dynamic Structures;
• Unions;
• Strings;
• Files;
• M acros;

2. Algorithm Analysis:
• M athematical Background;
• The M odel;
• The Time Complexity:
• How to Analyze and M easure;
• Big-Oh and Big-Omega Notations;
• Best Case, Average Case and Worst Case Analyses.

 Lists:
• Abstract Data Types;
• Stacks:
• ADT;
• Representation;
• Operations;
• Examples;
• Applications;
• Queues:
• ADT;
• Representation;
• Operations;
• Circular and Priority Queues;
• Examples;
• Applications;
• Other Lists and their Implementations.

 Linked Lists:
 • ADT; 
• Dynamic M emory and Pointers; 
• Dynamic Representation: 
• Insertion and Deletion of Nodes; 
• Linked Stacks and Queues; 
• Linked Lists as Data Structures; 
• Array Implementation of Linked List; 
• Comparison of Dynamic and Array Representations. 

5. Binary Tree: 
• Binary Tree Operations and Applications; 
• Binary Tree Representations: 
• Node Representation; 
• Array Representation; 
• Binary Tree Traversals; 
• The Huffman Algorithm; 
• Representing Lists as Binary Trees: 
• Finding and Deleting Elements, 
• Tree-Represented Lists. 

 S orting Methods: 
• Efficiency Considerations in Sorting; 
• Different Sorting M ethods: 
• Bubble Sort; 
• Quicksort; 
• Straight Selection Sort; 
• Binary Tree Sort; 
• Heaps and Heapsort; 
• Heap as Priority Queue; 
• Insertion Sort; 
• Shell Sort; 
• Bucket Sort; 
• M erge Sort; 
• Radix Sort; 
• Time Complexity Calculation: 
• Best Case, Worst Case and Average Case Calculations of the Different Sorting M ethods. 

 S earching Methods: 
• Efficiency Considerations in Searching; 
• Basic Searching Techniques: 
• Sequential Search; 
• Efficiency Considerations for Sequential Search; 
• Searching Ordered Table; 
• Indexed Sequential Search; 
• Binary Search; 
• Interpolation Search; 
• Binary Search Tree: 
• Implementation; 
• Insertions and Deletions; 
• Efficiency Considerations; 
• General Search Trees: 
• M ultiway Search Trees; 
• B-Trees; 
 • Hashing: 
• Hash Functions; 
• Resolving Clashes (Open and Closed Hashing); 
• Hashing in External Storage; 
• Dynamic Hashing. 

8. Graph as a Data S tructure: 

• Representation and Construction of a Graph; 
• Operations on Graph. 

9. Algorithms: 
• Greedy M ethod; 
• Divide and Conquer M ethod; 
• Dynamic Programming; 
• Back-Tracking M ethod. 

Topics of Experiment 

1. Structures and Files in C

2. Implementation of Stack and its Operations.
3. Implementation of Queue and its Operations.
4. Implementation of Circular Queue and its Operations.
5. Array and Dynamic Implementation of Linked List and its Operations.
6. Pattern M atching.
7. Binary Tree: Implementation, Creation of Binary Tree, Insertion and deletion of Nodes in an Existing
Tree.
8. Elementary and Advanced Sorting techniques with and without Recursion.
9. Elementary and Advanced Searching techniques with and without Recursion.
10. Implementation of graph.

Algorithms and Flowcharts are to be included for all programs.

BOOKS

Text Books:
1. Y. Langsam, M . J. Augenstein and A. M . Tannenbaum, "Data Structures Using C and C++", Prentice-
Hall India, Second Edition.
2. G. Brassard and P. Bratley, "Fundamentals of Algorithmics", Prentice-Hall India.
3. R. F. Gilberg, "Data Structures: A Pseudocode Approach with C", Thomson Learning

Referrences:
1. Aho, J. E. Hopcroft and J. D. Ullman, "Data Structures and Algorithms", Addison
Wesley, Low Price Edition.
2. M. A. Weiss, "Data Structures and Algorithm Analysis in C++", Addison Wesley
Longman, International Student Edition.
3. R. Kruse, "Data Structures and Program Design in C", Prentice-Hall India/Pearson Education.
4. Tremble and Sorenson, "Data Structures and Algorithms" Tata M cGraw-Hill.

TERM WORK

1. Minimum 12 practical experiments should be conducted covering all the above

topics.
2. A term work test must be conducted with a weightage of 10 marks.
PRACTICAL EXAMINATION

Practical examination along with oral examination must be conducted to test the knowledge of the students
in the Laboratory.
 B.E. INFORMATION TECHNOLOGY
S ECOND YEAR S EMES TER IV

SUBJECT : INFORMATION THEORY AND CODING

Lectures: 4 per week; Practicals: 2 per week;

One paper: 100 marks. (3 Hrs.); Term work - 25 marks.

Objectives Of The Course: The concept of 'information' forms the core of Information Technology.
This course deals with the representation of information, transmission of information from one site to
another and the techniques required to accomplish an efficient and secure information exchange.

Pre-requisites: NIL

DETAILED S YLLABUS

1. Introductory Concepts:
• Information Theory:
• Entropy and Uncertainty;
• Information Content;
• Rate of a language;
• Redundancy;
• Complexity Theory:
• Computational complexity;
• P , NP , NP Complete;
• Number Theory; 
• M odular Arithmetic:
• Fermat's Little Theorem;
• Chinese Remainder Theorem;
• Prime Number Generation;
• Random Number Generation;
• Discrete Probability.

2. Cryptographic Techniques:
• Cryptographic Protocols; 
• Introduction; 
• One way function; 
• One way hash function; 
• Keys and Keys M anagement; 
• Public Key M anagement; 
• Public Key Cryptography; 
• Algorithms: 
• Block Cypher M odes; 
• M ultiple Encryption; 
• Stream Cyphers; 
• Block Algorithms; 
• Public Key Algorithms; 
• Encrypting data for storage/communication; 
• Data Encryption Standard ( DES ). 

3. Compression Algorithms: 
 • Optimal Compression;
• Compression Algorithms;
• Huffman Coding;
• Adaptive Huffman Compression;
• Statistical M odelling;
• Dictionary Based Compression;
• Sliding Window Compression;
• Speech Compression;
• LZW, RLE;
• Lossy Compression schemes;
• Image Compression using DCT.

4. Error Control Coding:

• Coding for reliable digital transmission and storage;
• Types of codes;
• Error Checking codes;
• Error Correcting Codes;
• Coding Schemes;
• Linear Block Codes;
• Cyclic Codes;
• Error Trapping;
• Decoding for cyclic codes;
• Convolution codes.

BOOKS

Text Books:
1. Bruce Schneier, "Applied Cryptography: Protocols, Algorithms and Source code
in C", John Wiley and Sons, 1994.
2. Adam Drozdek, "Elements of Data Compression", Thomson Learning.

Referrences:
1. Vera Pless, "Introduction to the theory of error correcting codes", John Wiley and Sons

TERM WORK

1. The term Work should consist of at least 8 practical experiments covering all the
topics.
2. A term work test must be conducted with a weightage of 10 marks.

ORAL EXAMINATION

An oral examination is to be conducted based on the above syllabus.

 B.E. INFORMATION THEORY
S ECOND YEAR S EMES TER IV

SUBJECT : INDUSTRIAL ECONOMICS AND MANAGEMENT

Lectures: 4 per week;

One paper: 100 marks. (3 Hrs.).

Objectives Of The Course: This course aims making Engineering students familiar
with the concepts in Economics and Management. This familiarity will enable them
to understand the industrial set-up, which is enhanced by the domain of Economics
and Management.

Pre-requisites: NIL

DETAILED S YLLABUS

1. Nature and significance of economics, science, engineering, technology and their

relationship with economic development, appropriate technology for developing
countries.

2. Demand, supply, elasticity of demand and supply, Competition, monopoly,

oligopoly, monopolistic competition, causes creating categories of monopoly
organization, price determination under perfect competition and monopoly, Price
discrimination, equilibrium of firm under competition and monopoly.

3. Functions of money, supply and demand for money, money price level and inflation,
black money, meaning, magnitude and consequences.

4. Functions of commercial banks, multiple credit creation, banking system in India,

shortcomings and improvement.

5. Central Banking: Function of central banking illustrated with reference to RBI,

Monetary policy - meaning, objectives and features.

6. Sources of public revenue, principles of taxation, direct and indirect taxes,

distribution of incidence, tax structure, reform of tax system.

7. Theory of International Trade, balance of trade and payment, theory of protection,

tariffs and subsidies, foreign exchange control, Devaluation.

8. New Economic Policy: Liberalization, extending privatization, globalization, market-

friendly state, export-led-growth.

9. Causes of underdevelopment, determinants of economic development, economic

and non-economic factors, stages of growth, strategy of development— big push,
balanced and unbalanced, critical minimum effort strategy.
10.
Management functions, responsibilities of management to society, development
of management thought, contribution of F.W. Taylor, Henri Fayol, Elton Ma'o,
System contingency approaches to management.

11. Nature of planning, decision-making process, management by objectives.

12.
Organization: line and staff authority relationships, decentralization of delegation
of authority, span of management, flat organization.

13. Communication process, media channels and barriers to effective communication

14.
Maslow, Herzberg and Macgregor's theory of motivation. McClelland's
achievement motivation, Blanchard's situational leadership theory.

15. Production management: Production planning and control, Inventory control, Quality
control and Total quality management.

16. Project management : Project development like cycle, project feasibility, project
planning, organization and control, Tools of project management - CPM, PERT.
Project information systems.

17. Need for good cost accounting system, cost control techniques of financial
control, financial statements, financial ratios, break-even analysis, budgeting and
budgetary control.

18. Marketing functions, managements of sales and advertising, marketing research.

19. Human resource management: Function, Application of industrial psychology for

selection, training, machine design and man-machine systems.

20. Engineering economics: Investment decision, present worth, Annual worth and rate
of return methods. Payback time.

BOOKS

Text Books:
1. A. N. Agarwal, "Indian Economy".
2. Koonz and Odonnel, "Essentials of Management".
3. B. K. Chatterji, "Finance for Non-Finance Managers".
4. Prasanna Chandra, "Project Management".

References:
1. Samuelson, "Economics".
2. Dewet and Warma, "Modern Economic Theory".
3. V. S. Ramaswamy, "Marketing Management".
4. Hampton David, "Management".