Resources » Articles/Knowledge Sharing » Syllabus

B.Tech information technology full 8 semester syllabus


Posted Date: 26-May-2008  Last Updated:   Category: Syllabus    
Author: Member Level: Silver    Points: 3



full 8semester syllabus of B-TECH IT CURRICULUM 2004

B.TECH. INFORMATION TECHNOLOGY

SEMESTER III

Code No. Course Title L T P M
THEORY
MA1201 Mathematics III 3 1 0 100
IT1201 Signals and Systems 3 1 0 100
CS1202 Digital Principles and Systems Design 3 1 0 100
CS1203 System software 3 0 0 100
IT1202 Principles of Communication 3 1 0 100
CS1204 Object Oriented Programming 3 0 0 100
PRACTICAL
CS1205 Object Oriented Programming Lab 0 0 3 100
CS1206 Digital Lab 0 0 3 100
CS1207 System Software Lab 0 0 3 100



SEMESTER IV

Code No. Course Title L T P M
THEORY
MA1253 Probability and Statistics 3 1 0 100
CS1353 Software Engineering 3 0 0 100
IT1251 Information Coding Techniques 3 0 0 100
CS1251 Computer Architecture 3 1 0 100
IT1252 Digital Signal Processing 3 1 0 100
CS1304 Microprocessors and Microcontrollers 3 1 0 100
PRACTICAL
IT1253 Software Engineering Lab 0 0 3 100
IT1254 DSP and Communications Systems Lab 0 0 3 100
CS1306 Microprocessors and Microcontrollers Lab 0 0 3 100



SEMESTER V

Code No. Course Title L T P M
THEORY
GE1301 Professional Ethics and Human Values 3 0 0 100
CS1402 Object Oriented Analysis and Design 3 1 0 100
CS1252 Operating Systems 3 0 0 100
CS1302 Computer Networks 3 0 0 100
EC1391 Telecommunication Systems 3 0 0 100
CS1301 Database Management Systems 3 1 0 100
GE1302 Communication Skill & Seminar** 0 0 3 -
PRACTICAL
CS1403 Case Tools Lab 0 0 3 100
CS1254 Operating System Lab (Linux based) 0 0 3 100
CS1307 DBMS Lab 0 0 3 100



SEMESTER VI

Code No. Course Title L T P M
THEORY
MG1351 Principle of Management 3 0 0 100
IT1351 Network Programming and Management 3 0 0 100
IT1352 Cryptography and Network Security 3 1 0 100
CS1253 Visual Programming 3 0 0 100
IT1353 Embedded Systems 3 0 0 100
MA1251 Numerical Methods 3 1 0 100
GE1351 Professional Skill & Seminar** 0 0 3 -
PRACTICAL
CS1255 Visual Programming Lab 0 0 3 100
CS1305 Network Lab 0 0 3 100



SEMESTER VII

Code No. Course Title L T P M
THEORY
MG1401 Total Quality Management 3 0 0 100
IT1401 Component Based Technology 3 0 0 100
IT1402 Mobile Computing 3 0 0 100
CS1354 Graphics and Multimedia 3 0 0 100
Elective I 3 0 0 100
Elective II 3 0 0 100
PRACTICAL
IT1403 Software Components Lab 0 0 3 100
CS1355 Graphics and Multimedia Lab 0 0 3 100



SEMESTER VIII

Code No. Course Title L T P M
THEORY
IT1451 Web Technology 3 1 0 100
Elective III 3 0 0 100
Elective IV 3 0 0 100
PRACTICAL
IT1452 Project Work 0 0 12 200
IT1453 Comprehension** 0 0 2 -

** No Examinations






























MA1201 Mathematics III 3 1 0 100

Aim
The course aims to develop the skills of the students in the areas of boundary value problems and transform techniques. This will be necessary for their effective studies in a large number of engineering subjects like heat conduction, communication systems, electro-optics and electromagnetic theory. The course will also serve as a prerequisite for post graduate and specialized studies and research.
Objectives
At the end of the course the students would
Be capable of mathematically formulating certain practical problems in terms of partial differential equations, solve them and physically interpret the results.
Have gained a well founded knowledge of Fourier series, their different possible forms and the frequently needed practical harmonic analysis that an engineer may have to make from discrete data.
Have obtained capacity to formulate and identify certain boundary value problems encountered in engineering practices, decide on applicability of the Fourier series method of solution, solve them and interpret the results.
Have grasped the concept of expression of a function, under certain conditions, as a double integral leading to identification of transform pair, and specialization on Fourier transform pair, their properties, the possible special cases with attention to their applications.
Have learnt the basics of Z – transform in its applicability to discretely varying functions, gained the skill to formulate certain problems in terms of difference equations and solve them using the Z – transform technique bringing out the elegance of the procedure involved.

UNIT I PARTIAL DIFFERENTIAL EQUATIONS 9 + 3
Formation of partial differential equations by elimination of arbitrary constants and arbitrary functions – Solution of standard types of first order partial differential equations – Lagrange’s linear equation – Linear partial differential equations of second and higher order with constant coefficients.

UNIT II Fourier Series 9 + 3
Dirichlet’s conditions – General Fourier series – Odd and even functions – Half range sine series – Half range cosine series – Complex form of Fourier Series – Parseval’s identify – Harmonic Analysis.

UNIT III Boundary value problems 9 + 3
Classification of second order quasi linear partial differential equations – Solutions of one dimensional wave equation – One dimensional heat equation – Steady state solution of two-dimensional heat equation (Insulated edges excluded) – Fourier series solutions in Cartesian coordinates.

UNIT IV Fourier Transform 9 + 3
Fourier integral theorem (without proof) – Fourier transform pair – Sine and Cosine transforms – Properties – Transforms of simple functions – Convolution theorem – Parseval’s identity.

UNIT V Z -TRANSFORM AND DIFFERENCE Equations 9 + 3
Z-transform - Elementary properties – Inverse Z – transform – Convolution theorem -Formation of difference equations – Solution of difference equations using Z - transform.

TUTORIAL 15

TOTAL : 60

Text Books
Grewal, B.S., “Higher Engineering Mathematics”, Thirty Sixth Edition, Khanna Publishers, Delhi, 2001.
Kandasamy, P., Thilagavathy, K., and Gunavathy, K., “Engineering Mathematics Volume III”, S. Chand & Company ltd., New Delhi, 1996.
Wylie C. Ray and Barrett Louis, C., “Advanced Engineering Mathematics”, Sixth Edition, McGraw-Hill, Inc., New York, 1995.
ReferenceS
Andrews, L.A., and Shivamoggi B.K., “Integral Transforms for Engineers and Applied Mathematicians”, Macmillen, New York, 1988.
Narayanan, S., Manicavachagom Pillay, T.K. and Ramaniah, G., “Advanced Mathematics for Engineering Students”, Volumes II and III, S. Viswanathan (Printers and Publishers) Pvt. Ltd. Chennai, 2002.
Churchill, R.V. and Brown, J.W., “Fourier Series and Boundary Value Problems”, Fourth Edition, McGraw-Hill Book Co., Singapore, 1987.

IT1201 SIGNALS AND SYSTEMS 3 1 0 100

AIM
To understand the concepts of continuous time, discrete time signals and the analysis of continuous and discrete systems.

OBJECTIVES
To understand the representation and classification of signals
To understand the basics of signal analysis using transforms
To analyze the linear time invariant systems using Fourier, Laplace Transforms and state equations.
To study the analysis of Discrete Time signals using DFT and Z-transforms.
To find the frequency response of linear time invariant discrete time system using FFT and Z-transform analysis.

UNIT I CLASSIFICATION OF SIGNALS AND SYSTEMS 9
Continuous time signals (CT signals), discrete time signals (DT signals) - step, Ramp, Pulse, Impulse, Exponential, Classification of CT and DT signals - periodic and aperiodic, Random signals, CT systems and DT systems, Classification of systems – Linear Time Invariant Systems.

UNIT II ANALYSIS OF CT SIGNALS 9
Fourier series analysis, Spectrum of CT signals, Fourier Transform and Laplace Transform in Signal Analysis.

UNIT III LTI-CT SYSTEMS 9
Differential equation, Block diagram representation, Impulse response, Convolution Integral, Frequency response, Fourier Methods and Laplace transforms in analysis, State equations and Matrix.

UNIT IV ANALYSIS OF DT SIGNALS 9
Spectrum of DT Signals, Discrete Time Fourier Transform (DTFT), Discrete Fourier Transform (DFT), Properties of Z-transform in signal analysis.

UNIT V LTI-DT SYSTEMS 9
Difference equations, Block diagram representation, Impulse response, Convolution SUM, Frequency response, FFT and Z-transform analysis, State variable equation and Matrix.
TUTORIAL 15
TOTAL : 60
TEXTBOOK
Alan V. Oppenheim, Alan S. Willsky with S.Hamid Nawab, “Signals & Systems”, Pearson / Prentice Hall of India Pvt. Ltd., 2003.

REFERENCES
K.Lindner, “Signals and Systems”, McGraw-Hill International, 1999.
Simon Haykin and Barry Van Veen, “Signals and Systems”, John Wiley & Sons, Inc., 1999.

CS1202 DIGITAL PRINCIPLES AND SYSTEM DESIGN 3 1 0 100

AIM
To provide an in-depth knowledge of the design of digital circuits and the use of Hardware Description Language in digital system design.

OBJECTIVES
• To understand different methods used for the simplification of Boolean functions
• To design and implement combinational circuits
• To design and implement synchronous sequential circuits
• To design and implement asynchronous sequential circuits
• To study the fundamentals of VHDL / Verilog HDL

UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 8
Review of binary number systems - Binary arithmetic – Binary codes – Boolean algebra and theorems - Boolean functions – Simplifications of Boolean functions using Karnaugh map and tabulation methods – Logic gates

UNIT II COMBINATIONAL LOGIC 9
Combinational circuits – Analysis and design procedures - Circuits for arithmetic operations - Code conversion – Introduction to Hardware Description Language (HDL)

UNIT III DESIGN WITH MSI DEVICES 8
Decoders and encoders - Multiplexers and demultiplexers - Memory and programmable logic - HDL for combinational circuits

UNIT IV SYNCHRONOUS SEQUENTIAL LOGIC 10
Sequential circuits – Flip flops – Analysis and design procedures - State reduction and state assignment - Shift registers – Counters - HDL for sequential logic circuits, Shift registers and counters.

UNIT V ASYNCHRONOUS SEQUENTIAL LOGIC 10
Analysis and design of asynchronous sequential circuits - Reduction of state and flow tables – Race-free state assignment – Hazards.

TUTORIAL 15
TOTAL : 60
TEXT BOOKS
1. M.Morris Mano, “Digital Design”, 3rd edition, Pearson Education, 2002.

REFERENCES
1. Charles H.Roth, Jr. “Fundamentals of Logic Design”, 4th Edition, Jaico Publishing House, 2000.
2. Donald D.Givone, “Digital Principles and Design”, Tata McGraw-Hill, 2003.

CS1203 SYSTEM SOFTWARE 3 0 0 100

AIM
To have an understanding of foundations of design of assemblers, loaders, linkers, and macro processors.

OBJECTIVES
• To understand the relationship between system software and machine architecture.
• To know the design and implementation of assemblers
• To know the design and implementation of linkers and loaders.
• To have an understanding of macroprocessors.
• To have an understanding of system software tools.

UNIT I Introduction 8
System software and machine architecture – The Simplified Instructional Computer (SIC) - Machine architecture - Data and instruction formats - addressing modes - instruction sets - I/O and programming.

UNIT II Assemblers 10
Basic assembler functions - A simple SIC assembler – Assembler algorithm and data structures - Machine dependent assembler features - Instruction formats and addressing modes – Program relocation - Machine independent assembler features - Literals – Symbol-defining statements – Expressions - One pass assemblers and Multi pass assemblers - Implementation example - MASM assembler.

UNIT III Loaders and Linkers 9
Basic loader functions - Design of an Absolute Loader – A Simple Bootstrap Loader - Machine dependent loader features - Relocation – Program Linking – Algorithm and Data Structures for Linking Loader - Machine-independent loader features - Automatic Library Search – Loader Options - Loader design options - Linkage Editors – Dynamic Linking – Bootstrap Loaders - Implementation example - MSDOS linker.

UNIT IV Macro Processors 9
Basic macro processor functions - Macro Definition and Expansion – Macro Processor Algorithm and data structures - Machine-independent macro processor features - Concatenation of Macro Parameters – Generation of Unique Labels – Conditional Macro Expansion – Keyword Macro Parameters-Macro within Macro-Implementation example - MASM Macro Processor – ANSI C Macro language.

UNIT V SYSTEM SOFTWARE TOOLS 9
Text editors - Overview of the Editing Process - User Interface – Editor Structure. - Interactive debugging systems - Debugging functions and capabilities – Relationship with other parts of the system – User-Interface Criteria.

TOTAL : 45
TEXT BOOK
Leland L. Beck, “System Software – An Introduction to Systems Programming”, 3rd Edition, Pearson Education Asia, 2000.

REFERENCES BOOKS
1. D. M. Dhamdhere, “Systems Programming and Operating Systems”, Second Revised Edition, Tata McGraw-Hill, 1999.
2. John J. Donovan “Systems Programming”, Tata McGraw-Hill Edition, 1972.

IT1202 PRINCIPLES OF COMMUNICATION 3 1 0 100

AIM
To have knowledge about Analog and Digital transmission of both Analog data and Digital Data, Security, modulation and different accessing methods.

OBJECTIVES
To have understanding about different types of AM Communication systems (Transmitters & Receivers)
To study in detail the different types of FM transmitters & Receivers and PM Transmitters and Receivers
To gain knowledge about different digital modulation techniques for digital transmission.
To have knowledge about base band transmission ISI and distortion free base band transmission
To know the spread spectrum modulation techniques and different multiple access methods.

UNIT I AMPLITUDE MODULATION: TRANSMISSION AND RECEPTION 9
Principles of amplitude modulation – AM envelope, frequency spectrum and bandwidth, modulation index and percent modulation, AM power distribution, AM modulator circuits – low level AM modulator, medium power AM modulator, AM transmitters – low level transmitters, high level transmitters, Receiver parameters.
AM reception: AM receivers – TRF, Superheterodyne receivers, Double Conversion AM receivers.

UNIT II ANGLE MODULATION: TRANSMISSION AND RECEPTION 9
Angle Modulation – FM and PM waveforms, phase deviation and modulation index, frequency deviation, phase and frequency modulators and demodulators, frequency spectrum of a angle modulated waves, Bandwidth requirement, Broadcast band FM, Average power FM and PM modulators – Direct FM and PM, Direct FM transmitters, Indirect transmitters, Angle modulation Vs. amplitude modulation.
FM receivers: FM demodulators, PLL FM demodulators, FM noise suppression, Frequency Vs. phase Modulation.

UNIT III DIGITAL MODULATION TECHNIQUES 9
Introduction, Binary PSK, DPSK, Differentially encoded PSK, QPSK, M-ary PSK, QASK, Binary FSK, MSK, Duobinary encoding – Performance comparison of various systems of Digital Modulation.

UNIT IV BASEBAND DATA TRANSMISSION 9
Sampling theorem, Quadrature sampling of bandpass signals, reconstruction of message from its samples, Signal distortion in sampling, Discrete PAM signals, power spectra of Discrete PAM signals, ISI Nyquist Criterion for Distortionless baseband binary transmission, eye pattern, baseband M-ary PAM systems, adaptive equalization for data transmission.

UNIT V SPREAD SPECTRUM AND MULTIPLE ACCESS TECHNIQUES 9
Introduction, Pseudo-noise sequence, DS spread spectrum with coherent binary PSK, Processing gain, FH spread spectrum, multiple access techniques, wireless communications, TDMA and CDMA, wireless communication systems, source coding of speech for wireless communications.

TUTORIAL 15
TOTAL : 60
TEXT BOOKS
1. Wayne Tomasi, “Electronic Communication Systems: Fundamentals Through Advanced”, Pearson Education, 2001.
(UNIT I Chapters- 3,4; UNIT II : Chapters-6,7; UNIT III Chapters-12).
2. Simon Haykin, Digital Communications, John Wiley & Sons, 2003. (UNIT IV Chapters-3,4; UNIT V Chapters-7,

REFERENCESS
1 Simon Haykin, Communication Systems, John Wiley & Sons, 4th edn.,2001.
2. Taub & Schilling, Principles of Communication Systems, TMH, 2nd edn., 2003.
3. Martin S.Roden, Analog and Digital Communication System, PHI, 3rd edn. 2002.
4. Blake, Electronic Communication Systems, Thomson Delman, 2nd edn., 2002.

CS1204 OBJECT ORIENTED PROGRAMMING 3 0 0 100

AIM
To present the concept of object oriented programming and discuss the important elements of C++ and Java.

OBJECTIVES
Since C++ and Java play a predominant role in software development it is felt that the following objectives can be achieved after studying this subject.
Understand the concepts of Object oriented Programming.
Write simple applications using C++ and Java.
Compare and contrast features of C++ and Java.

UNIT I INTRODUCTION 8
Object-oriented paradigm, elements of object oriented programming – Merits and demerits of OO methodology – C++ fundamentals – data types, operators and expressions, control flow, arrays, strings, pointers and functions.

UNIT II PROGRAMMING IN C++ 10
Classes and objects – constructors and destructors, operator overloading – inheritance, virtual functions and polymorphism.

UNIT III FILE HANDLING 9
C++ streams – console streams – console stream classes-formatted and unformatted console I/O operations, manipulators - File streams - classes file modes file pointers and manipulations file I/O – Exception handling.

UNIT IV JAVA INTRODUCTION 9
An overview of Java, data types, variables and arrays, operators, control statements, classes, objects, methods – Inheritance.

UNIT V JAVA PROGRAMMING 9
Packages and Interfaces, Exception handling, Multithreaded programming, Strings, Input /Output

TOTAL : 45
TEXT BOOKS
1. K.R.Venugopal, Rajkumar Buyya, T.Ravishankar, “Mastering C++”, TMH, 2003 (Unit I, Unit II, Unit III)
2. Herbert Schildt, “The Java 2 : Complete Reference”, Fourth edition, TMH, 2002 (Unit IV, Unit-V) (Chapters 1-11,13,17)

REFERENCES
1. Ira Pohl, “ Object oriented programming using C++”, Pearson Education Asia, 2003
2. Bjarne Stroustrup, "The C++ programming language" Addison Wesley, 2000
3. John R.Hubbard, "Progranning with C++", Schaums outline series, TMH, 2003
4. H.M.Deitel, P.J.Deitel, "Java : how to program", Fifthe edition, Prentice Hall of India private limited.
5. E.Balagurusamy “ Object Oriented Programming with C++”, TMH 2/e

CS1205 OBJECT ORIENTED PROGRAMMING LAB 0 0 3 100
C++
1. Programs Using Functions
- Functions with default arguments
- Implementation of Call by Value, Call by Address and Call by Reference
2. Simple Classes for understanding objects, member functions and Constructors
- Classes with primitive data members
- Classes with arrays as data members
- Classes with pointers as data members – String Class
- Classes with constant data members
- Classes with static member functions
3. Compile time Polymorphism
- Operator Overloading including Unary and Binary Operators.
- Function Overloading
4. Runtime Polymorphism
- Inheritance
- Virtual functions
- Virtual Base Classes
- Templates
5. File Handling
- Sequential access
- Random access

JAVA
6. Simple Java applications
- for understanding reference to an instance of a class (object), methods
- Handling Strings in Java
7. Simple Package creation.
- Developing user defined packages in Java
8. Interfaces
- Developing user-defined interfaces and implementation
- Use of predefined interfaces
9. Threading
- Creation of thread in Java applications
- Multithreading
10. Exception Handling Mechanism in Java
- Handling pre-defined exceptions
- Handling user-defined exceptions

CS1206 DIGITAL LABORATORY 3 0 0 100

LIST OF EXPERIMENTS
1. Verification of Boolean theorems using digital logic gates
2. Design and implementation of combinational circuits using basic gates for arbitrary functions, code converters, etc.
3. Design and implementation of 4-bit binary adder / subtractor using basic gates and MSI devices.
4. Design and implementation of parity generator / checker using basic gates and MSI devices.
5. Design and implementation of magnitude comparator
6. Design and implementation of application using multiplexers
7. Design and implementation of Shift registers
8. Design and implementation of Synchronous and Asynchronous counters
9. Coding combinational circuits using Hardware Description Language (HDL software required)
10. Coding sequential circuits using HDL (HDL software required)

CS1207 SYSTEM SOFTWARE LAB 0 0 3 100
(Using C or C++)
Implement a symbol table with functions to create, insert, modify, search, and display.
Implement pass one of a two pass assembler.
Implement pass two of a two pass assembler.
Implement a single pass assembler.
Implement a macro processor.
Implement an absolute loader.
Implement a relocating loader.
Implement pass one of a direct-linking loader.
Implement pass two of a direct-linking loader.
Implement a simple text editor with features like insertion / deletion of a character, word, sentence.

(For loader exercises, output the snap shot of the main memory as it would be, after the loading has taken place)

MA1253 PROBABILITY AND STATISTICS 3 1 0 100

AIM
The scope of probability and statistics in engineering applications is well known. This course aims at providing the requisite skill to apply the statistical tools in engineering problem.

OBJECTIVES
At the end of the course, the students would
Have a fundamental knowledge of the basic probability concepts.
Have a well – founded knowledge of standard distributions which can describe real life phenomena.
Acquire skills in handling situations involving more than one random variable and functions of random variables.
Be introduced to the notion of sampling distributions and have acquired knowledge of statistical techniques useful in making rational decision in management problems.
Be exposed to statistical methods designed to contribute to the process of making scientific judgments in the face of uncertainty and variation.

UNIT I PROBABILITY AND RANDOM VARIABLE 9 +3
Axioms of probability - Conditional probability - Total probability - Bayes theorem - Random variable - Probability mass function - Probability density functions - Properties- Moments - Moment generating functions and their properties.

UNIT II STANDARD DISTRIBUTIONS 9 +3
Binomial, Poisson, Geometric, Negative Binomial, Uniform, Exponential, Gamma, Weibull and Normal distributions and their properties - Functions of a random variable.

UNIT III TWO DIMENSIONAL RANDOM VARIABLES 9 + 3
Joint distributions - Marginal and conditional distributions – Covariance - Correlation and Regression - Transformation of random variables - Central limit theorem .

UNIT IV TESTING OF HYPOTHESIS 9 + 3
Sampling distributions – Testing of hypothesis for mean, variance, proportions and differences using Normal, t, Chi-square and F distributions - Tests for independence of attributes and Goodness of fit.

UNIT V DESIGN OF EXPERIMENTS 9 + 3
Analysis of variance – One way classification – CRD - Two – way classification – RBD - Latin square.

TUTORIAL 15

TOTAL : 60
TEXT BOOKS
1. Ross. S., “A first Course in Probability”, Fifth Edition, Pearson Education, Delhi 2002. (Chapters 2 to
2. Johnson. R. A., “Miller & Freund’s Probability and Statistics for Engineers”, Sixth Edition, Pearson Education, Delhi, 2000. (Chapters 7, 8, 9, 12)

REFERENCES
1. Walpole, R. E., Myers, R. H. Myers R. S. L. and Ye. K, “Probability and Statistics for Engineers and Scientists”, Seventh Edition, Pearsons Education, Delhi , 2002.
2. Lipschutz. S and Schiller. J, “Schaum’s outlines - Introduction to Probability and Statistics”, McGraw-Hill, New Delhi, 1998.
3. Gupta, S.C, and Kapur, J.N., “Fundamentals of Mathematical Statistics”, Sultan Chand, Ninth Edition , New Delhi ,1996.

CS1353 SOFTWARE ENGINEERING 3 0 0 100

AIM
To introduce the methodologies involved in the development and maintenance of software (i.e) over its entire life cycle.

OBJECTIVE
To be aware of
• Different life cycle models
• Requirement dictation process
• Analysis modeling and specification
• Architectural and detailed design methods
• Implementation and testing strategies
• Verification and validation techniques
• Project planning and management
• Use of CASE tools

UNIT I SOFTWARE PROCESS 9
Introduction –S/W Engineering Paradigm – life cycle models (water fall, incremental, spiral, WINWIN spiral, evolutionary, prototyping, object oriented) - system engineering – computer based system – verification – validation – life cycle process – development process –system engineering hierarchy.

UNIT II SOFTWARE REQUIREMENTS 9
Functional and non-functional - user – system –requirement engineering process – feasibility studies – requirements – elicitation – validation and management – software prototyping – prototyping in the software process – rapid prototyping techniques – user interface prototyping -S/W document. Analysis and modeling – data, functional and behavioral models – structured analysis and data dictionary.

UNIT III DESIGN CONCEPTS AND PRINCIPLES 9
Design process and concepts – modular design – design heuristic – design model and document. Architectural design – software architecture – data design – architectural design – transform and transaction mapping – user interface design – user interface design principles. Real time systems - Real time software design – system design – real time executives – data acquisition system - monitoring and control system. SCM – Need for SCM – Version control – Introduction to SCM process – Software configuration items.

UNIT IV TESTING 9
Taxonomy of software testing – levels – test activities – types of s/w test – black box testing – testing boundary conditions – structural testing – test coverage criteria based on data flow mechanisms – regression testing – testing in the large. S/W testing strategies – strategic approach and issues - unit testing – integration testing – validation testing – system testing and debugging.

UNIT V SOFTWARE PROJECT MANAGEMENT 9
Measures and measurements – S/W complexity and science measure – size measure – data and logic structure measure – information flow measure. Software cost estimation – function point models – COCOMO model- Delphi method.- Defining a Task Network – Scheduling – Earned Value Analysis – Error Tracking - Software changes – program evolution dynamics – software maintenance – Architectural evolution. Taxonomy of CASE tools.

TOTAL : 45
TEXT BOOKS
1. Roger S.Pressman, Software engineering- A practitioner’s Approach, McGraw-Hill International Edition, 5th edition, 2001.

REFERENCES
1. Ian Sommerville, Software engineering, Pearson education Asia, 6th edition, 2000.
2. Pankaj Jalote- An Integrated Approach to Software Engineering, Springer Verlag, 1997.
3. James F Peters and Witold Pedryez, “Software Engineering – An Engineering Approach”, John Wiley and Sons, New Delhi, 2000.
4. Ali Behforooz and Frederick J Hudson, “Software Engineering Fundamentals”, Oxford University Press, New Delhi, 1996.

IT1251 INFORMATION CODING TECHNIQUES 3 0 0 100

AIM
To introduce the fundamental concepts of information theory: data compaction, data compression, data transmission, error detection and correction.

OBJECTIVES
To have a complete understanding of error–control coding.
To understand encoding and decoding of digital data streams.
To introduce methods for the generation of these codes and their decoding techniques.
To have a detailed knowledge of compression and decompression techniques.
To introduce the concepts of multimedia communication.

UNIT I INFORMATION ENTROPY FUNDAMENTALS 9
Uncertainty, Information and Entropy – Source coding Theorem – Huffman coding –Shannon Fano coding – Discrete Memory less channels – channel capacity – channel coding Theorem – Channel capacity Theorem.

UNIT II DATA AND VOICE CODING 9
Differential Pulse code Modulation – Adaptive Differential Pulse Code Modulation – Adaptive subband coding – Delta Modulation – Adaptive Delta Modulation – Coding of speech signal at low bit rates (Vocoders, LPC).

UNIT III ERROR CONTROL CODING 9
Linear Block codes – Syndrome Decoding – Minimum distance consideration – cyclic codes – Generator Polynomial – Parity check polynomial – Encoder for cyclic codes – calculation of syndrome – Convolutional codes.

UNIT IV COMPRESSION TECHNIQUES 9
Principles – Text compression – Static Huffman Coding – Dynamic Huffman coding – Arithmetic coding – Image Compression – Graphics Interchange format – Tagged Image File Format – Digitized documents – Introduction to JPEG standards.

UNIT V AUDIO AND VIDEO CODING 9
Linear Predictive coding – code excited LPC – Perceptual coding, MPEG audio coders – Dolby audio coders – Video compression – Principles – Introduction to H.261 & MPEG Video standards.

TOTAL : 45
TEXTBOOKS
1. Simon Haykin, “Communication Systems”, John Wiley and Sons, 4th Edition, 2001.
2. Fred Halsall, “Multimedia Communications, Applications Networks Protocols and Standards”, Pearson Education, Asia 2002; Chapters: 3,4,5.

REFERENCES
1. Mark Nelson, “Data Compression Book”, BPB Publication 1992.
2. Watkinson J, “Compression in Video and Audio”, Focal Press, London, 1995.

CS1251 COMPUTER ARCHITECTURE 3 1 0 100

AIM
To discuss the basic structure of a digital computer and to study in detail the organization of the Control unit, the Arithmetic and Logical unit, the Memory unit and the I/O unit.

OBJECTIVES
• To have a thorough understanding of the basic structure and operation of a digital computer.
• To discuss in detail the operation of the arithmetic unit including the algorithms & implementation of fixed-point and floating-point addition, subtraction, multiplication & division.
• To study in detail the different types of control and the concept of pipelining.
• To study the hierarchical memory system including cache memories and virtual memory.
• To study the different ways of communicating with I/O devices and standard I/O interfaces.

UNIT I BASIC STRUCTURE OF COMPUTERS 10
Functional units - Basic operational concepts - Bus structures - Software performance – Memory locations and addresses – Memory operations – Instruction and instruction sequencing – Addressing modes – Assembly language – Basic I/O operations – Stacks and queues.

UNIT II ARITHMETIC UNIT 8
Addition and subtraction of signed numbers – Design of fast adders – Multiplication of positive numbers - Signed operand multiplication and fast multiplication – Integer division – Floating point numbers and operations.

UNIT III BASIC PROCESSING UNIT 9
Fundamental concepts – Execution of a complete instruction – Multiple bus organization – Hardwired control – Microprogrammed control - Pipelining – Basic concepts – Data hazards – Instruction hazards – Influence on Instruction sets – Data path and control consideration – Superscalar operation.

UNIT IV MEMORY SYSTEM 9
Basic concepts – Semiconductor RAMs - ROMs – Speed - size and cost – Cache memories - Performance consideration – Virtual memory- Memory Management requirements – Secondary storage.

UNIT V I/O ORGANIZATION 9
Accessing I/O devices – Interrupts – Direct Memory Access – Buses – Interface circuits – Standard I/O Interfaces (PCI, SCSI, USB).

TUTORIAL 15
TOTAL : 60
TEXT BOOKS
Carl Hamacher, Zvonko Vranesic and Safwat Zaky, 5th Edition “Computer Organization”, McGraw-Hill, 2002.

REFERENCES
William Stallings, “Computer Organization and Architecture – Designing for Performance”, 6th Edition, Pearson Education, 2003.
David A.Patterson and John L.Hennessy, “Computer Organization and Design: The hardware / software interface”, 2nd Edition, Morgan Kaufmann, 2002.
John P.Hayes, “Computer Architecture and Organization”, 3rd Edition, McGraw-Hill, 1998.

IT1252 DIGITAL SIGNAL PROCESSING 3 1 0 100

AIM
To review signals and systems, study DFT and FFT, discuss the design of IIR & FIR filters and study typical applications of digital signal processing.

OBJECTIVES
• To have an overview of signals and systems.
• To study DFT & FFT
• To study the design of IIR filters.
• To study the design of FIR filters.
• To study the effect of finite word lengths & applications of DSP

UNIT I SIGNALS AND SYSTEMS 9
Basic elements of digital signal Processing –Concept of frequency in continuous time and discrete time signals – Sampling theorem –Discrete time signals. Discrete time systems – Analysis of Linear time invariant systems –Z transform –Convolution and correlation.

UNIT II FAST FOURIER TRANSFORMS 9
Introduction to DFT – Efficient computation of DFT Properties of DFT – FFT algorithms – Radix-2 and Radix-4 FFT algorithms – Decimation in Time – Decimation in Frequency algorithms –Use of FFT algorithms in Linear Filtering and correlation.

UNIT III IIR FILTER DESIGN 9
Structure of IIR – System Design of Discrete time IIR filter from continuous time filter – IIR filter design by Impulse Invariance. Bilinear transformation – Approximation derivatives – Design of IIR filter in the Frequency domain.

UNIT IV FIR FILTER DESIGN 9
Symmetric & Antisymteric FIR filters – Linear phase filter – Windowing technique – Rectangular, Kaiser windows – Frequency sampling techniques – Structure for FIR systems.

UNIT V FINITE WORD LENGTH EFFECTS 9
Quantization noise – derivation for quantization noise power – Fixed point and binary floating point number representation – comparison – over flow error – truncation error – co-efficient quantization error - limit cycle oscillation – signal scaling – analytical model of sample and hold operations – Application of DSP – Model of Speech Wave Form – Vocoder.

TUTORIAL 15
TOTAL : 60
TEXT BOOK
1. John G Proakis and Dimtris G Manolakis, “Digital Signal Processing Principles, Algorithms and Application”, PHI/Pearson Education, 2000, 3rd Edition.

REFERENCES
1. Alan V Oppenheim, Ronald W Schafer and John R Buck, “Discrete Time Signal Processing”, PHI/Pearson Education, 2000, 2nd Edition.
2. Johny R.Johnson, “Introduction to Digital Signal Processing”, Prentice Hall of India/Pearson Education, 2002.
3. Sanjit K.Mitra, “Digital Signal Processing: A Computer – Based Approach”, Tata McGraw-Hill, 2001, Second Edition.

CS1304 MICROPROCESSORS AND MICROCONTROLLERS 3 1 0 100

AIM
To have an in depth knowledge of the architecture and programming of 8-bit and 16-bit Microprocessors, Microcontrollers and to study how to interface various peripheral devices with them.

OBJECTIVE
• To study the architecture and Instruction set of 8085 and 8086
• To develop assembly language programs in 8085 and 8086.
• To design and understand multiprocessor configurations
• To study different peripheral devices and their interfacing to 8085/8086.
• To study the architecture and programming of 8051 microcontroller.

UNIT I THE 8085 MICROPROCESSOR 9
Introduction to 8085 – Microprocessor architecture – Instruction set – Programming the 8085 – Code conversion.

UNIT II 8086 SOFTWARE ASPECTS 9
Intel 8086 microprocessor – Architecture – Instruction set and assembler directives – Addressing modes – Assembly language programming – Procedures – Macros – Interrupts and interrupt service routines.

UNIT III 8086 SYSTEM DESIGN 9
8086 signals and timing – MIN/MAX mode of operation – Addressing memory and I/O – Multiprocessor configurations – System design using 8086

UNIT IV I/O INTERFACING 9
Memory Interfacing and I/O interfacing - Parallel communication interface – Serial communication interface – Timer – Keyboard /display controller – Interrupt controller – DMA controller – Programming and applications

UNIT V MICROCONTROLLERS 9
Architecture of 8051 – Signals – Operational features – Memory and I/O addressing – Interrupts – Instruction set – Applications.

TUTORIAL 15
TOTAL : 60
TEXT BOOKS
1. Ramesh S.Gaonkar, “Microprocessor - Architecture, Programming and Applications with the 8085”, Penram International publishing private limited, fifth edition.
(UNIT-1: – Chapters 3,5,6 and programming examples from chapters 7-10)
2. A.K. Ray & K.M.Bhurchandi, “Advanced Microprocessors and peripherals- Architectures, Programming and Interfacing”, TMH, 2002 reprint. (UNITS 2 to 5: – Chapters 1-6, 7.1-7.3, 8, 16)

REFERENCES
1. Douglas V.Hall, “Microprocessors and Interfacing: Programming and Hardware”, TMH, Third edition
2. Yu-cheng Liu, Glenn A.Gibson, “Microcomputer systems: The 8086 / 8088 Family architecture, Programming and Design”, PHI 2003
3. Mohamed Ali Mazidi, Janice Gillispie Mazidi, “The 8051 microcontroller and embedded systems”, Pearson education, 2004.

IT1253 SOFTWARE ENGINEERING LAB 0 0 3 100
Develop two or three of the following applications using the software engineering methodologies given below using C/C++ as frontend and MS-ACCESS as Backend.

Requirements Analysis
Design Concepts
Function Point Analysis
Implementation
Software Testing Techniques
Error Tracking

Suggested List of Applications:
Library Management System
Bank Management System
Inventory System
Software for a Game
Text Editor
Natural Language Based Grammar Checker
Airline Reservation System
Online Survey
Financial Accounting System
Graphics Toolkit

IT1254 DSP AND COMMUNICATION SYSTEMS LAB 0 0 3 100
Generation and detection of Amplitude Modulation
Generation of Frequency modulation and its detection
Generation and detection of PAM
Generation of BFSK and its detection
Pseudo Random Noise sequence generation with digital IC’s.
Generation of i/p Signals.
Analysis of linear system [with convolution and deconvolution operation]
FIR filter design. [any one Technique]
IIR filter design [any one Technique]
Implementation of FFT, Interpolation and decimation
Simulation of DS spread spectrum [Experiments 6 to 11 are to be implemented with MATLAB]

CS1306 MICROPROCESSORS AND MICROCONTROLLERS LAB 0 0 3 100

LIST OF EXPERIMENTS
1. Programming with 8085 – 8-bit / 16-bit multiplication/division using repeated addition/subtraction
2. Programming with 8085-code conversion, decimal arithmetic, bit manipulations.
3. Programming with 8085-matrix multiplication, floating point operations
4. Programming with 8086 – String manipulation, search, find and replace, copy operations, sorting. (PC Required)
5. Using BIOS/DOS calls: Keyboard control, display, file manipulation. (PC Required)
6. Using BIOS/DOS calls: Disk operations. (PC Required)
7. Interfacing with 8085/8086 – 8255, 8253
8. Interfacing with 8085/8086 – 8279,8251
9. 8051 Microcontroller based experiments – Simple assembly language programs (cross assembler required).
10. 8051 Microcontroller based experiments – Simple control applications (cross assembler required).

GE1301 PROFESSIONAL ETHICS AND HUMAN VALUES 3 0 0 100

Objective
To create an awareness on Engineering Ethics and Human Values.
To instill Moral and Social Values and Loyalty
To appreciate the rights of Others

1. Human Values 10
Morals, Values and Ethics – Integrity – Work Ethic – Service Learning – Civic Virtue – Respect for Others – Living Peacefully – caring – Sharing – Honesty – Courage – Valuing Time – Co-operation – Commitment – Empathy – Self-Confidence – Character – Spirituality

2. Engineering Ethics 9
Senses of 'Engineering Ethics' - variety of moral issued - types of inquiry - moral dilemmas - moral autonomy - Kohlberg's theory - Gilligan's theory - consensus and controversy – Models of Professional Roles - theories about right action - Self-interest - customs and religion - uses of ethical theories.

3. Engineering as Social Experimentation 9
Engineering as experimentation - engineers as responsible experimenters - codes of ethics - a balanced outlook on law - the challenger case study

4. Safety, Responsibilities and Rights 9
Safety and risk - assessment of safety and risk - risk benefit analysis and reducing risk - the three mile island and chernobyl case studies.
Collegiality and loyalty - respect for authority - collective bargaining - confidentiality - conflicts of interest - occupational crime - professional rights - employee rights - Intellectual Property Rights (IPR) - discrimination.

5. Global Issues 8
Multinational corporations - Environmental ethics - computer ethics - weapons development - engineers as managers-consulting engineers-engineers as expert witnesses and advisors -moral leadership-sample code of Ethics like ASME, ASCE, IEEE, Institution of Engineers(India), Indian Institute of Materials Management, Institution of electronics and telecommunication engineers(IETE),India, etc.

TUTORIAL 15
TOTAL : 60
TEXT BOOKS
Mike Martin and Roland Schinzinger, “Ethics in Engineering”, McGraw-Hill, New York 1996.
Govindarajan M, Natarajan S, Senthil Kumar V. S, “Engineering Ethics”, Prentice Hall of India, New Delhi, 2004.

REFERENCES
Charles D. Fleddermann, “Engineering Ethics”, Pearson Education / Prentice Hall, New Jersey, 2004 (Indian Reprint)
Charles E Harris, Michael S. Protchard and Michael J Rabins, “Engineering Ethics – Concepts and Cases”, Wadsworth Thompson Learning, United States, 2000 (Indian Reprint now available)
John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New Delhi, 2003.
4. Edmund G Seebauer and Robert L Barry, “Fundamentals of Ethics for Scientists and Engineers”, Oxford University Press, Oxford, 2001.

CS1402 OBJECT ORIENTED ANALYSIS AND DESIGN 3 1 0 100

AIM
To understand the concepts of object oriented analysis and design.

OBJECTIVES
• To understand the object oriented life cycle.
• To know how to identify objects, relationships, services and attributes through UML.
• To understand the use-case diagrams.
• To know the Object Oriented Design process.
• To know about software quality and usability.

UNIT I INTRODUCTION 8
An Overview of Object Oriented Systems Development - Object Basics – Object Oriented Systems Development Life Cycle.

UNIT II OBJECT ORIENTED METHODOLOGIES 12
Rumbaugh Methodology - Booch Methodology - Jacobson Methodology - Patterns – Frameworks – Unified Approach – Unified Modeling Language – Use case - class diagram - Interactive Diagram - Package Diagram - Collaboration Diagram - State Diagram - Activity Diagram.

UNIT III OBJECT ORIENTED ANALYSIS 9
Identifying use cases - Object Analysis - Classification – Identifying Object relationships - Attributes and Methods.

UNIT IV OBJECT ORIENTED DESIGN 8
Design axioms - Designing Classes – Access Layer - Object Storage - Object Interoperability.

UNIT V SOFTWARE QUALITY AND USABILITY 8
Designing Interface Objects – Software Quality Assurance – System Usability - Measuring User Satisfaction

TOTAL : 45+15 HRS
TEXT BOOKS
1. Ali Bahrami, “Object Oriented Systems Development”, Tata McGraw-Hill, 1999 (Unit I, III, IV, V).
2. Martin Fowler, “UML Distilled”, Second Edition, PHI/Pearson Education, 2002. (UNIT II)

REFERENCE BOOKS
1. Stephen R. Schach, “Introduction to Object Oriented Analysis and Design”, Tata McGraw-Hill, 2003.
2. James Rumbaugh, Ivar Jacobson, Grady Booch “The Unified Modeling Language Reference Manual”, Addison Wesley, 1999.
3. Hans-Erik Eriksson, Magnus Penker, Brain Lyons, David Fado, “UML Toolkit”, OMG Press Wiley Publishing Inc., 2004.

CS1252 OPERATING SYSTEMS 3 0 0 100

AIM
To have a thorough knowledge of processes, scheduling concepts, memory management, I/O and file systems in an operating system.

OBJECTIVES
• To have an overview of different types of operating systems
• To know the components of an operating system.
• To have a thorough knowledge of process management
• To have a thorough knowledge of storage management
• To know the concepts of I/O and file systems.

UNIT I 9
Introduction - Mainframe systems – Desktop Systems – Multiprocessor Systems – Distributed Systems – Clustered Systems – Real Time Systems – Handheld Systems - Hardware Protection - System Components – Operating System Services – System Calls – System Programs - Process Concept – Process Scheduling – Operations on Processes – Cooperating Processes – Inter-process Communication.

UNIT II 9
Threads – Overview – Threading issues - CPU Scheduling – Basic Concepts – Scheduling Criteria – Scheduling Algorithms – Multiple-Processor Scheduling – Real Time Scheduling - The Critical-Section Problem – Synchronization Hardware – Semaphores – Classic problems of Synchronization – Critical regions – Monitors.

UNIT III 9
System Model – Deadlock Characterization – Methods for handling Deadlocks -Deadlock Prevention – Deadlock avoidance – Deadlock detection – Recovery from Deadlocks - Storage Management – Swapping – Contiguous Memory allocation – Paging – Segmentation – Segmentation with Paging.

UNIT IV 9
Virtual Memory – Demand Paging – Process creation – Page Replacement – Allocation of frames – Thrashing - File Concept – Access Methods – Directory Structure – File System Mounting – File Sharing – Protection

UNIT V 9
File System Structure – File System Implementation – Directory Implementation – Allocation Methods – Free-space Management. Kernel I/O Subsystems - Disk Structure – Disk Scheduling – Disk Management – Swap-Space Management. Case Study: The Linux System, Windows

TOTAL : 45
TEXT BOOK
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, Sixth Edition, John Wiley & Sons (ASIA) Pvt. Ltd, 2003.

REFERENCES
1. Harvey M. Deitel, “Operating Systems”, Second Edition, Pearson Education Pvt. Ltd, 2002.
2. Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall of India Pvt. Ltd, 2003.
3. William Stallings, “Operating System”, Prentice Hall of India, 4th Edition, 2003.
4. Pramod Chandra P. Bhatt – “An Introduction to Operating Systems, Concepts and Practice”, PHI, 2003.

CS1302 COMPUTER NETWORKS 3 0 0 100

AIM
To introduce the concepts, terminologies and technologies used in modern days data communication and computer networking.

OBJECTIVES
• To understand the concepts of data communications.
• To study the functions of different layers.
• To introduce IEEE standards employed in computer networking.
• To make the students to get familiarized with different protocols and network components.

UNIT I DATA COMMUNICATIONS 8
Components – Direction of Data flow – networks – Components and Categories – types of Connections – Topologies –Protocols and Standards – ISO / OSI model – Transmission Media – Coaxial Cable – Fiber Optics – Line Coding – Modems – RS232 Interfacing sequences.

UNIT II DATA LINK LAYER 10
Error – detection and correction – Parity – LRC – CRC – Hamming code – low Control and Error control - stop and wait – go back-N ARQ – selective repeat ARQ- sliding window – HDLC. - LAN - Ethernet IEEE 802.3 - IEEE 802.4 - IEEE 802.5 - IEEE 802.11 – FDDI - SONET – Bridges.

UNIT III NETWORK LAYER 10
Internetworks – Packet Switching and Datagram approach – IP addressing methods – Subnetting – Routing – Distance Vector Routing – Link State Routing – Routers.

UNIT IV TRANSPORT LAYER 9
Duties of transport layer – Multiplexing – Demultiplexing – Sockets – User Datagram Protocol (UDP) – Transmission Control Protocol (TCP) – Congestion Control – Quality of services (QOS) – Integrated Services.

UNIT V APPLICATION LAYER 8
Domain Name Space (DNS) – SMTP – FTP – HTTP - WWW – Security – Cryptography.

TOTAL: 45
TEXT BOOKS
1. Behrouz A. Forouzan, “Data communication and Networking”, Tata McGraw-Hill, 2004.

REFERENCES
1. James F. Kurose and Keith W. Ross, “Computer Networking: A Top-Down Approach Featuring the Internet”, Pearson Education, 2003.
2. Larry L.Peterson and Peter S. Davie, “Computer Networks”, Harcourt Asia Pvt. Ltd., Second Edition.
3. Andrew S. Tanenbaum, “Computer Networks”, PHI, Fourth Edition, 2003.
4. William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson Education, 2000.

EC1391 TELECOMMUNICATION SYSTEMS 3 0 0 100

AIM
To gain knowledge about microwave, satellite, optical, telephone and cellular communication systems.

OBJECTIVES
To have knowledge about characteristics of Transmission and microwave devices.
To study about the fundamentals of satellite communication
To gain brief knowledge about optical communication
To gain knowledge about optical communication
To gain knowledge about advances in Telephone systems
To understand the essentials of cellular communication systems.

UNIT I METHODS OF COMMUNICATION 9
Transmission lines – Types and Characteristics, Antenna Fundamentals – Different types of antennas & their Characteristics, Radio Frequency wave propagation- Microwave –Principles, Devices (Reflex Klystron, Magnetron, TWT)-(Principles Only) Radar - Pulsed Radar - CW Radar (Principles and Block Diagram Only).

UNIT II INTRODUCTION TO SATELLITE COMMUNICATIONS 9
Satellite orbits- Satellite communication systems –Earth stations- Applications: Surveillance, Navigation, Mobile Communication, TV Broadcast, Satellite Radio, Satellite Telephone-The Internet.

UNIT III INTRODUCTION TO FIBER OPTIC COMMUNICATION 9
Light wave communication systems – Fiber structure and function types of Fiber – Optical Transmitter & Receiver –Fiber optic Data communication systems
UNIT IV TELEPHONE SYSTEM AND ITS APPLICATION 9
Telephones –Telephone system- Facsimile- Cellular telephone system-Paging system –Integrated services Digital Networks (ISDN)

UNIT V CELLULAR RADIO 9
Citizen’s band Radio, Cordless Telephone, Improved Mobile Telephone service (IMTS), Introduction to Advanced Mobile Phone Service (AMPS), GSM – RF channels and time slots – Voice transmission – Frequency Hopping - Subscriber ID module – GSM Privacy and Security – IS-95 CDMA PCS – Channels – Forward Channel – Reverse Channel – Voice Coding – Power Control – Hand-off and CDMA Security.

TOTAL : 45
TEXT BOOKS
Louis.E.Frenzel, Communication Electronics – Principles and Application”, 3rd Editions, Tata McGraw-Hill, 2002 (Units I to IV)
2. Roy Blake, “Wireless Communication Technology”, Thomson Delmar Learning, Second Reprint 2002. (UNIT V Chapters: 10, 11)

REFERENCES
1. Wayne Tomasi,”Electronic Communication systems” 4th Edition, Pearson Education, 2001.
Marin Cole, “Introduction to Telecommunications –Voice, Data and Internet”, Pearson Education, 2001.

CS1301 DATABASE MANAGEMENT SYSTEMS 3 1 0 100

AIM
To provide a strong foundation in database technology and an introduction to the current trends in this field.

OBJECTIVES
• To learn the fundamentals of data models and to conceptualize and depict a database system using ER diagram.
• To make a study of SQL and relational database design.
• To understand the internal storage structures using different file and indexing techniques which will help in physical DB design.
• To know the fundamental concepts of transaction processing- concurrency control techniques and recovery procedure.
• To have an introductory knowledge about the emerging trends in the area of distributed DB- OO DB- Data mining and Data Warehousing and XML.

UNIT I INTRODUCTION AND CONCEPTUAL MODELING 9
Introduction to File and Database systems- Database system structure – Data Models – Introduction to Network and Hierarchical Models – ER model – Relational Model – Relational Algebra and Calculus.

UNIT II RELATIONAL MODEL 9
SQL – Data definition- Queries in SQL- Updates- Views – Integrity and Security – Relational Database design – Functional dependences and Normalization for Relational Databases (up to BCNF).

UNIT III DATA STORAGE AND QUERY PROCESSING 9
Record storage and Primary file organization- Secondary storage Devices- Operations on Files- Heap File- Sorted Files- Hashing Techniques – Index Structure for files –Different types of Indexes- B-Tree - B+Tree – Query Processing.

UNIT IV TRANSACTION MANAGEMENT 9
Transaction Processing – Introduction- Need for Concurrency control- Desirable properties of Transaction- Schedule and Recoverability- Serializability and Schedules – Concurrency Control – Types of Locks- Two Phases locking- Deadlock- Time stamp based concurrency control – Recovery Techniques – Concepts- Immediate Update- Deferred Update - Shadow Paging.

UNIT V CURRENT TRENDS 9
Object Oriented Databases – Need for Complex Data types - OO data Model- Nested relations - Complex Types- Inheritance Reference Types - Distributed databases- Homogenous and Heterogenous- Distributed data Storage – XML – Structure of XML- Data- XML Document- Schema- Querying and Transformation. – Data Mining and Data Warehousing.

TUTORIAL 15
TOTAL : 60
TEXT BOOKS
1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan - “Database System Concepts”, Fourth Edition, McGraw-Hill, 2002.

REFERENCES
1. Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third Edition, Pearson Education, 2003.
2. Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing Company, 2003.
3. Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom- “Database System Implementation”- Pearson Education- 2000.
4. Peter Rob and Corlos Coronel- “Database System, Design, Implementation and Management”, Thompson Learning Course Technology- Fifth edition, 2003.

CS1403 CASE TOOLS LAB 0 0 3 100

Prepare the following documents for two or three of the experiments listed below and develop the software engineering methodology.

1. Program Analysis and Project Planning.
Thorough study of the problem – Identify project scope, Objectives, Infrastructure.

Software requirement Analysis
Describe the individual Phases / Modules of the project, Identify deliverables.

3. Data Modeling
Use work products – Data dictionary, Use diagrams and activity diagrams, build and test lass diagrams, Sequence diagrams and add interface to class diagrams.

4. Software Development and Debugging

5. Software Testing
Prepare test plan, perform validation testing, Coverage analysis, memory leaks, develop test case hierarchy, Site check and Site monitor.

Suggested List of Applications:
1. Student Marks Analyzing System
2. Quiz System
3. Online Ticket Reservation System
4. Payroll System
5. Course Registration System
6. Expert Systems
7. ATM Systems
8. Stock Maintenance
9. Real-Time Scheduler
10. Remote Procedure Call Implementation

CS1254 OPERATING SYSTEM LAB (Linux based) 0 0 3 100
(Implement the following on LINUX platform. Use C for high level language implementation)

1. Shell programming
- command syntax
- write simple functions
- basic tests
2. Shell programming
- loops
- patterns
- expansions
- substitutions
3. Write programs using the following system calls of UNIX operating system:
fork, exec, getpid, exit, wait, close, stat, opendir, readdir
4. Write programs using the I/O system calls of UNIX operating system (open, read, write, etc)
5. Write C programs to simulate UNIX commands like ls, grep, etc.
6. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print the average waiting time and average turnaround time
7. Given the list of processes, their CPU burst times and arrival times, display/print the Gantt chart for Priority and Round robin. For each of the scheduling policies, compute and print the average waiting time and average turnaround time
8. Implement the Producer – Consumer problem using semaphores.
9. Implement some memory management schemes – I for eg
Free space is maintained as a linked list of nodes with each node having the starting byte address and the ending byte address of a free block. Each memory request consists of the process-id and the amount of storage space required in bytes. Allocated memory space is again maintained as a linked list of nodes with each node having the process-id, starting byte address and the ending byte address of the allocated space.
10. Implement some memory management schemes – II for eg
When a process finishes (taken as input) the appropriate node from the allocated list should be deleted and this free disk space should be added to the free space list. [Care should be taken to merge contiguous free blocks into one single block. This results in deleting more than one node from the free space list and changing the start and end address in the appropriate node]. For allocation use first fit, worst fit and best fit.

CS1307 DATABASE MANAGEMENT SYSTEMS LAB 0 0 3 100

LIST OF EXPERIMENTS
1. Data Definition Language (DDL) commands in RDBMS.
2. Data Manipulation Language (DML) and Data Control Language (DCL) commands in RDBMS.
3. High-level language extension with Cursors.
4. High level language extension with Triggers
5. Procedures and Functions.
6. Embedded SQL.
7. Database design using E-R model and Normalization.
8. Design and implementation of Payroll Processing System.
9. Design and implementation of Banking System.
10. Design and implementation of Library Information System.

MG1351 PRINCIPLES OF MANAGEMENT 3 0 0 100

Objective
Knowledge on the principles of management is essential for all kinds of people in all kinds of organizations. After studying this course, students will be able to have a clear understanding of the managerial functions like planning, organizing, staffing, leading and controlling. Students will also gain some basic knowledge on international aspect of management.

1. Historical Development 9
Definition of Management – Science or Art – Management and Administration – Development of Management Thought – Contribution of Taylor and Fayol – Functions of Management – Types of Business Organisation.

2. Planning 9
Nature & Purpose – Steps involved in Planning – Objectives – Setting Objectives – Process of Managing by Objectives – Strategies, Policies & Planning Premises- Forecasting – Decision-making.

3. Organising 9
Nature and Purpose – Formal and informal organization – Organization Chart – Structure and Process – Departmentation by difference strategies – Line and Staff authority – Benefits and Limitations – De-Centralization and Delegation of Authority – Staffing – Selection Process - Techniques – HRD – Managerial Effectiveness.

4. Directing 9
Scope – Human Factors – Creativity and Innovation – Harmonizing Objectives – Leadership – Types of Leadership Motivation – Hierarchy of needs – Motivation theories – Motivational Techniques – Job Enrichment – Communication – Process of Communication – Barriers and Breakdown – Effective Communication – Electronic media in Communication.

5. Controlling 9
System and process of Controlling – Requirements for effective control – The Budget as Control Technique – Information Technology in Controlling – Use of computers in handling the information – Productivity – Problems and Management – Control of Overall Performance – Direct and Preventive Control – Reporting – The Global Environment – Globalization and Liberalization – International Management and Global theory of Management.

TOTAL : 45
TEXT BOOKS
1. Harold Kooritz & Heinz Weihrich “Essentials of Management”, Tata McGraw-Hill, 1998.
2. Joseph L Massie “Essentials of Management”, Prentice Hall of India, (Pearson) Fourth Edition, 2003.

REFERENCES
1 Tripathy PC And Reddy PN, “ Principles of Management”, Tata McGraw-Hill, 1999.
2. Decenzo David, Robbin Stephen A, ”Personnel and Human Reasons Management”, Prentice Hall of India, 1996
3. JAF Stomer, Freeman R. E and Daniel R Gilbert Management, Pearson Education, Sixth Edition, 2004.
4. Fraidoon Mazda, “Engineering Management”, Addison Wesley,-2000.

IT1351 NETWORK PROGRAMMING AND MANAGEMENT 3 0 0 100

AIM
To enable the students to develop the necessary skills for developing robust & scalable network applications and to build necessary basic knowledge for managing networks.

OBJECTIVES
To learn the basics of socket programming using TCP Sockets.
To learn basics of UDP sockets.
To develop knowledge of threads for developing high performance scalable applications.
To learn about raw sockets.
To understand simple network management protocols & practical issues.

UNIT I ELEMENTARY TCP SOCKETS 9
Introduction to Socket Programming – Overview of TCP/IP Protocols –Introduction to Sockets – Socket address Structures – Byte ordering functions – address conversion functions – Elementary TCP Sockets – socket, connect, bind, listen, accept, read, write, close functions – Iterative Server – Concurrent Server.

UNIT II APPLICATION DEVELOPMENT 9
TCP Echo Server – TCP Echo Client – Posix Signal handling – Server with multiple clients – boundary conditions: Server process Crashes, Server host Crashes, Server Crashes and reboots, Server Shutdown – I/O multiplexing – I/O Models – select function – shutdown function – TCP echo Server (with multiplexing) – poll function – TCP echo Client (with Multiplexing)

UNIT III SOCKET OPTIONS, ELEMENTRY UDP SOCKETS 9
Socket options – getsocket and setsocket functions – generic socket options – IP socket options – ICMP socket options – TCP socket options – Elementary UDP sockets – UDP echo Server – UDP echo Client – Multiplexing TCP and UDP sockets – Domain name system – gethostbyname function – Ipv6 support in DNS – gethostbyadr function – getservbyname and getservbyport functions.

UNIT IV ADVANCED SOCKETS 9
Ipv4 and Ipv6 interoperability – threaded servers – thread creation and termination – TCP echo server using threads – Mutexes – condition variables – raw sockets – raw socket creation – raw socket output – raw socket input – ping program – trace route program.

UNIT V SIMPLE NETWORK MANAGEMENT 9
SNMP network management concepts – SNMP management information – standard MIB’s – SNMPv1 protocol and Practical issues – introduction to RMON, SNMPv2 and SNMPv3.


Did you like this resource? Share it with your friends and show your love!




Responses to "B.Tech information technology full 8 semester syllabus"
Guest Author: Bhim Gurung     13 May 2013
Subjects in BTech information technology is very informative, thanks


Feedbacks      

Post Comment:




  • Do not include your name, "with regards" etc in the comment. Write detailed comment, relevant to the topic.
  • No HTML formatting and links to other web sites are allowed.
  • This is a strictly moderated site. Absolutely no spam allowed.
  • Name:   Sign In to fill automatically.
    Email: (Will not be published, but required to validate comment)



    Type the numbers and letters shown on the left.


    Submit Article     Return to Article Index

    Awards & Gifts
    Active Members
    TodayLast 7 Daysmore...

    ISC Technologies, Kochi - India. Copyright © All Rights Reserved.