SEMESTER IV:

Periods of Instruction Subject Code Subject Title

L T P Credits

BICCMA401 R01 Discrete Structures & Combinatorics 3 1 0 4

BICCIC402 R02 Operating Systems 3 1 0 4 BICCIC403 R01 Java Programming 3 1 0 4

BICCIC404 R02 Analog & Digital Communications 3 1 0 4

BICCEE 405 Control Systems 3 1 0 4 BICDIC XXX DE 2 3 1 0 4 BICCIC406 R01 Operating Systems Lab 0 0 3 2 BICCIC407 Java Programming Lab 0 0 3 2 BICCTP408R01 HR SKILLS II 1 0 0 1 TOTAL 19 6 6 29 DEPARTMENTAL ELECTIVES:

BICDIC402 R01 Satellite Communication 3 1 0 4 BICDIC403 Object Oriented Analysis and Design 3 1 0 4

ADDITIONAL COURSES FOR LATERAL ENTRY STUDENTS :

BICDIC401R01 Object Oriented Programming in C++ 3 1 0 4 BICDIC407R01 Object Oriented Programming Lab 0 0 3 2

BICCMA401R01 DISCRETE STRUCTURES AND COMBINATORICS

(Common for CSE, IT and ICT) L T P CREDITS

3 1 0 4 UNIT – I (15 Periods) Mathematical Logic and Set Theory – Statements and notations – connectives – normal forms – predicate calculus – Inference theory of predicate calculus – relations and ordering – functions – recursion – recursion in mechanical theorem proving – mathematical induction. UNIT – II (15 Periods) Algebraic structures – Group- definition – examples – Abelian and cyclic groups – permutation group – Cosets – Right and left cosets- Lagrange’s theorem – Normal subgroups – Examples and simple problems only. Boolean algebra – Boolean functions – representation and minimization K-map and Quine MC-cluskey. UNIT – III (15 Periods) A general introduction on graphs – connected and disconnected graphs – types of graphs – paths and circuits – cut set and cut vertices – Euler and Hamiltonian graphs – matrix representation of graphs – incidence and adjacency matrices – properties. UNIT – IV (15 Periods) Combinatorics: Combination of sets – finite and infinite sets – countability and uncountability – binary relations – equivalence relation and partition – partial ordering and lattices anti-chains application of relational Model in databases – algebra of formal power series – recursive functions.

Text books: 1. M.K. Venkataraman, S. Chandrasekaran and N. Sridharan, “Discrete Mathematics”,

National Publication Company, 2003. [Units I & II]. 2. Narsingh Deo, “Graph Theory and its Engineering applications”, Prentice Hall of

India, 2004. [Unit III] 3. C.L. Liu, “Elements of Discrete mathematics”, Tata McGraw Hill, Second Edition,

2000. [Unit IV] References:

1. V. Krishnamoorthy, “Combinatorics”, Affiliated East-West Press, 1985. 2. M.L. Santigo, “Modern Algebra”, Tata McGraw Hill Publishing Company, 2001.

BICCIC 402 R02 OPERATING SYSTEMS (Common for CSE, IT and ICT)

L T P CREDITS 3 1 0 4

UNIT - I (15 Periods) Operating system overview: Objectives and functions – Evolution of Operating systems – Major achievements – Developments leading to modern operating systems – Computer system overview: Basic elements – Processor registers – Instruction execution – Interrupts – Memory hierarchy – Cache memory – I/O communication techniques. Processes: Process – Process States – Process Description – Process Control Threads: Processes and threads UNIT - II (15 Periods) Scheduling: Uniprocessor scheduling – Types of processor scheduling – Scheduling algorithms – Multiprocessor scheduling – Real-Time scheduling. Concurrency: Principles of Concurrency – Mutual exclusion – Semaphores – Monitors – Message passing – Readers/Writers problem. Deadlock and Starvation: Principles of deadlock – Deadlock Prevention – Deadlock Avoidance – Deadlock Detection – Integrated deadlock strategy – Dinning philosophers problem.

UNIT - III (15 Periods) Memory Management: Address binding – logical verses physical address space –Dynamic loading – Dynamic linking and shared libraries – Overlays – Swapping – Contiguous memory allocation – Paging – Segmentation – Segmentation with paging Virtual Memory: Background – Demand paging – Process creation – Page replacement – Allocation of frames – Thrashing

UNIT - IV (15 Periods) I/O Management and disk scheduling: I/O devices – Organization of the I/O function – OS design issues – I/O buffering – Disk scheduling – RAID – Disk cache. File management: Overview – Organization and access – File directories – File sharing – Record blocking – Secondary storage managements. Security: Security threats – Protection – Intruders – Malicious software – Trusted systems.

Text Books: 1. William Stallings, “Operating Systems Internals and Design Principles”, Pearson

Education, Fifth Edition, 2005. [Units I, II & IV] 2. SilberSchatz, J. Peterson, P. Galvin, ”Operating System concepts”, John Wiley, Sixth

Edition, 2004. [Unit III]

References: Tanenbaum, Andrew S, “Modern Operating Systems”, Prentice Hall of India, Third

Edition, 2007. Milenkovic, M, “Operating Systems: Concepts and design”, Tata McGraw Hill, Second

Edition, 1997.

BICCIC 403 R01 JAVA PROGRAMMING (Common for CSE, IT and ICT)

L T P CREDITS 3 1 0 4

UNIT – I (15 Periods) Introduction: Object Oriented Programming - Genesis of Java - Overview of Java - Data types, Variables and Arrays - Operators – Control Statements - Introducing Classes - Methods and Classes - Overloading - Understanding static, final - Nested and Inner Classes - String class - Command Line Arguments - Inheritance - I/O Basics - Packages and Interfaces - Exception Handling. UNIT – II (15 Periods) Multithreaded Programming: Multithreaded Programming – Java Thread Model - Creating Multiple Threads - Thread Priorities - Synchronization - Inter thread communication - Suspending, Resuming and Stopping threads. Applets: Fundamentals - Applet class - Applet Skeleton - Event Handling - Event classes – Event Listener Interfaces - Adapter Classes - Inner Classes. UNIT – III (15 Periods) AWT, RMI: AWT – Window Fundamentals – Working with Frame Windows, Graphics, colors and Fonts – Using AWT controls, Layout managers and Menus – Control Fundamentals - Understanding Layout Managers - Java RMI. Networking: Basics - Networking Classes and Interfaces - InetAddress - TCP/IP Socket , ServerSocket classes - UDP DatagramSocket, DatagramPacket classes. UNIT – IV (15 Periods) Strings and Files: Java Library - String handling - String Operation, comparison, searching, modifying - String Buffer - java.lang - Simple Type Wrappers – Math - java.util - Stack - Dictionary - Hash table - Date class - Random class - java.io - File - ByteStreams - CharacterStreams - Serialization . Text Book: 1. Herbert Schildt, "The Complete Reference JAVA 2", Tata McGraw Hill, Fifth

Edition, 2002. References: 1. Harvey M. Deitel, Paul J. Deitel, "JAVA: How to Program", Deitel &

Associates Inc., Seventh Edition, 2006. 2. Peter Norton and William Stanek, “Peter Norton’s Guide to JAVA

Programming”, Techmedia, 1997.

BICCIC 404R02 ANALOG AND DIGITAL COMMUNICATION L T P CREDITS

3 1 0 4 UNIT – I (15 Periods) Amplitude Modulation: Transmission and Reception Electromagnetic spectrum-Need for modulation-Principles of amplitude modulation - AM envelope, frequency spectrum and bandwidth, modulation index and percent modulation, AM power distribution- SSB, DSBSC and VSB systems. AM modulator circuits – linear and non linear modulators – Envelope detector-AM transmitters – Low and high level transmitters, receiver parameters– AM receivers – TRF, super heterodyne receiver. UNIT – II (15 Periods) Angle Modulation: Transmission and Reception Angle modulation - FM and PM waveforms, phase deviation and modulation index, frequency deviation, bandwidth requirements for angle modulated waves- Direct and indirect method of FM generation - Slope, balanced slope, ratio detector and foster seely FM discriminators - Direct and indirect FM transmitters - Comparison of AM, FM and PM . UNIT – III (15 Periods) Digital Communication Base Band Modulation-Review of signal types - Sampling Theorem-aliasing– Quantization-Uniform and non uniform quantization- Companding -Encoding - PCM -– Delta modulation – PAM, PDM and PPM - Modulation and Demodulation techniques . Bandpass Modulation-Shannon limit for information capacity - OOK, ASK, FSK ,PSK systems – Bit rate and Baud rate consideration – Comparison – QPSK - Quadrature Amplitude modulation -Constellation diagram UNIT – IV (15 Periods) Transmission Lines and Antennas Transmission lines: Introduction – Transverse Electromagnetic waves – Types of Transmission lines – Transmission line equivalent circuit – Transmission line wave propagation – Transmission line losses. Antenna: Introduction – Basic antenna operation – antenna terminology and definitions – basic antennas – Introduction to special purpose antennas and waveguides – UHF and Microwave antennas Text Books: 1. Kennedy and Davis, “Electronic Communication systems”, Tata McGraw Hill, Fourth Edition , 2003 [Units I ,II & III ]. 2. Wayne Tomasi, “Electronic Communication Systems: Fundamentals Through Advanced”, Pearson Education, 2004 [Unit IV]. References: 1. Simon Haykin, “Communication Systems”, John Wiley & Sons, Fourth

Edition,2001. 2. Roody D and Coolen J, “Electronic Communications”, Prentice Hall of India,

Fourth Edition, 2006. 3. Behrouz Forouzan, “Introduction to data communications and Networking “,

McGraw Hill, Fifth Edition, 2006.

BICCEE 405 CONTROL SYSTEMS (Common for CSE, IT and ICT)

L T P C

4 1 0 4 UNIT – 1 (14 periods) Introduction: Definition of control system – linear system – open loop and closed loop systems – block diagrams – transfer function – signal flow graph (Mason’s rule) – examples and problems. Control system components: Potentiometers-synchros-a.c and d.c tacho generators – transfer functions of armature controlled and field controlled d.c shunt motor – a.c and d.c servomotors for position control – stepper motor – gear trains – analogy with transformer. UNIT – 2 (15 periods) Time response of linear systems : first order and second order ystems – impulse response and step response of first and second order linear systems – time domain specifications like rise time, delay time, overshoot and settling time of a second order system – response to ramp input – type and order of a system – stready state error and error constants – generalized error constants – examples and problems. UNIT – 3 (15 periods) Frequency response: correlation between time and frequency response – polar plot – Bode plots – magnitude plot – steps for drawing the asymptotic Bode magnitude plot – phase angle plot – gain and phase cross-over frequencies – gain margin and phase margin their definitions and determination from Bode plots-examples and problems UNIT – 4 (16 periods) Stability analysis: concept of stability – BIBO criterion – characteristic equation –

stability definitions – Routh-Hurwitz stability criterion – Nyquist plot – Steps for drawing the Nyquist plot – Typical Nyquist curves – critical point – Nyquist stability criterion and its application – examples and problems. Root locus technique: Root locus plot – rules for construction – typical root locus trajectories – determination of critical gain.

Text Book:

1. I.J. Nagrath & M.Gopal, ‘Control System Engineering’, New Age International,2001.

References:

1. Benjamin C.Kuo, ‘Automatic Control Systems’, Prentice Hall,India,New Delhi, 7th Edition 2000. 2. Katsuhiko Ogata, ‘Modern Control Engineering’, Prentice Hall,India, New Delhi, 3rd Edition 2000.

BICDIC402R01 SATELLITE COMMUNICATION

L T P CREDITS 3 1 0 4

UNIT - I (15 Periods) Introduction: Frequency allocation for satellite services - Kepler’s first law - Orbital perturbations - Antenna look angles - Polar mount antenna - Limits of visibility - Geostationary orbits-Launching orbits-Radio wave propagation-Atmospheric losses-Ionospheric effects- Rain attenuation-Other propagation impairments-Antenna polarization-Polarization of satellite signals-Reciprocity theorem for antennas-Coordinate system-The radiated fields. UNIT - II (15 Periods) Space Segment: The power supply-Attitude control-Station keeping –Thermal control-TT&C subsystem-Transponders-The antenna subsystem. Earth Segment: Receive-only home TV system-Master antenna TV system Space Link: Equivalent Isotropic Radiated Power-Transmission losses-Effects of rain-The Link Power Budget Equation-The uplink and downlink-Carrier to Noise Ratio UNIT - III (15 Periods) Satellite Access: Single access -Pre assigned FDMA- Demand assigned FDMA - Spade system - Bandwidth-limited and power-limited TWT amplifier operation-TDMA-on-board signal processing for FDMA/TDM operation - Satellite-switched TDMA - Code-division multiple access UNIT - IV (15 Periods) Satellite Services: Network layers-TCP link -Enhancing TCP – Orbital spacing – Power rating and number of transponders – Frequencies and polarization – Transponder capacity – Bit rates for digital TV – MPEG compression standards – FEC – Home Receiver - Outdoor and Indoor unit – Satellite mobile services – VSATs – Radarsat – GPS satellite Text Book:

1. Dennis Roddy, “Satellite Communication”, Tata McGraw Hill, Third Edition, 2001. Reference :

1. T.Pratt & Bostian, “Satellite Communication”, John Wiley & Sons , Second Edition,2002.

BICDIC403 OBJECT ORIENTED ANALYSIS AND DESIGN (Common for CSE, IT and ICT)

L T P CREDITS 3 1 0 4

UNIT - I (15 Periods) OBJECT BASICS :Overview of Object Oriented System Development - Objects – Attributes – Behaviors – Relationship and Associations – Aggregation – Object and identity – Static and Dynamic binding–Object persistence – OOSD Life cycle – OO Methodologies – Patterns – Frameworks -Unified approach. UNIT - II (15 Periods) ANALYSIS: Unified modeling language – Introduction - UML Class diagrams – Use Case Diagram – Dynamic modeling - OO Analysis Process – Use case driven OO Analysis– Use case model – Classification – Noun Phrase approach – Common class pattern - Identifying object relationship - Associations – super subclass –Aggregation – Identifying Attributes and Methods – Classes, Responsibilities and Collaborators -Object Responsibility.

UNIT - III (15 Periods) DESIGN: Object Oriented Design – Axioms and Corollaries.- Designing classes – Process – Class visibility – Refining Attributes – Designing methods and protocols – Access Layer – OODBM S – Object relational systems – Multi database systems- Designing Access layer classes – View layer – Designing view layer classes –

UNIT - IV (15 Periods) APPLICATIONS: Client server computing- Object diagram compiler- Computer animation - Electrical distribution design system.

Text Books: 1. Ali Bahrami, “Object oriented System Development “, McGraw Hill, 1999. [Units I, II

& III] 2. James Rumbaugh, Michael Blaha, William Premerlani, Frederick Eddy and William

Lorensen, “Object Oriented Modeling and Design”, Prentice Hall of India, 2002. [Unit IV]

BICDIC401 R01 OBJECT ORIENTED PROGRAMMING IN C++ (Common for CSE, IT and ICT)

L T P CREDITS 3 1 0 4

UNIT - I (15 Periods) Introduction: Principles of Object Oriented Programming- C++-Applications-C++ statements-Structure –Tokens – Keywords-Identifiers-Constants-Data Types – user defined-derived – declaration of variables – dynamic initialization of variables – reference variables – operators in C++ - scope resolution – member dereferencing and memory management operators – type cast operator – expressions and their types – operator overloading – operator precedence-control structures UNIT – II (15 Periods) Functions, Classes and Objects: Function prototyping – call by reference- inline functions-function overloading-friend and virtual functions – class – defining member functions – nesting of member functions-private member functions-static data members – static member functions-array of objects – objects as function arguments – pointers to members-Constructors - destructors UNIT –III (15 Periods) Overloading, Inheritance and Polymorphism: Overloading unary, binary operators – binary operators using friends, manipulation of strings- rules – type conversions – single, multi-level, multiple, hierarchical, hybrid inheritance – virtual base classes- abstract classes – virtual functions – pointers -pointers to objects. UNIT – IV (15 Periods) Files, Templates and Exception Handling: File stream operations – file modes – file pointers – command line arguments, class templates – function templates – overloading of template functions – basics of exception handling, mechanism, throwing, catching- manipulation of strings Text Book: 1. E. Balagurusamy, “Object Oriented Programming with C++”, Tata McGraw Hill,

Third Edition, 2006. References: 1. Bjarne Stroustrup, “The C++ Programming Language”, Pearson Education, Third

Edition, 2005. 2. Robert Lafore, “Object Oriented Programming in Turbo C++”, Galgotia

Publications, 2006.

BICCIC 406 R02 OPERATING SYSTEMS LAB L T P CREDITS

0 0 3 2

1. Write a C program that illustrates the execution of two commands concurrently with a command pipe.

2. Write a C program that illustrates the creation of child process using fork system call.

3. Write a C program that implements a producer-consumer system with two processes 4. Write a C program that implements a Reader- Writer problem. 5. Write a C program that implements a Dining Philosopher Problem. 6. Write a C program that illustrates inter process communication using shared memory

system calls. 7. Write a C program that illustrates the following : 8. Creating a message queue. 9. Writing to a message queue. 10. Reading from a message queue. 11. Simulate the following CPU scheduling algorithms :

a) Round Robin b) SJF c) FCFS d) Priority 12. Simulate the following File Allocation strategies :

a)Sequential b. Indexed c. Linked

13. Simulate MVT and MFT 14. Simulate Bankers Algorithm for Dead Lock Avoidance. 15. Simulate Bankers Algorithm for Dead Lock Detection. 16. Simulate the following File Organization Techniques :

a)Single level directory b) Two level c) Hierarchical d) DAG

17. Simulate the following Page Replacement algorithms :

a). FIFO b) LRU c) LFU

18. Simulate Paging Technique of Memory Management.

BICCIC 407 JAVA PROGRAMMING LAB

L T P CREDITS 0 0 3 2

1. Polymorphism in java.

2. Inheritances in Java.

3. Interfaces in Java.

4. Packages in java.

5. Programs to create multiple threads in JAVA.

6. Developing a simple applet using labels, text fields and buttons.

7. Developing a simple applet using list box, choice box, scroll bar and check box.

8. Developing standalone GUI interface using frames.

9. Developing an applet for demonstrating the font features.

10. Develop an applet using panels and layout manager.

11. Develop an applet for demonstrating graphics features – using brush styles,

colors, etc.

BICDIC 406 R01 OBJECT ORIENTED PROGRAMMING LAB L T P CREDITS

0 0 3 2 Develop C++ Program with the following concepts

1. Pointers and Arrays.

2. Structures and Functions.

3. Classes and Objects.

4. Unary and Binary Operator Overloading with and without Friend Functions.

5. Various types of Inheritance.

6. Virtual functions and Abstract Classes.

7. Overriding Virtual base functions.

8. Class and Function Templates.

9. Exceptions Handling.

10. Files and Streams.

11. Overloading Insertion/Extraction Operators.

BICCTP 408 HR SKILLS - II

L T P CREDITS 1 0 0 1

S.NO DETAILS NO.OF CLASSES

1. Creative Thinking-Picture/Case Study 2

2. Check your memory Power –Audio Visual Presentation 1

3. If I were …………?-Speech 2

4. Aptitude Test II 3

5. Skit/Mime Presentation-Group Exercise 2

6. The Book I like-(Book Review) 2

7. Quiz on Current Affairs 1

8. End Semester Examinations 2

TOTAL 15

SEMESTER VI:

Period of Instruction Subject Code Subject Title L T P

Credits

BICCIC601 R01 Soft Computing Techniques 3 1 0 4 BICCIC603 R01 Digital Signal Processing 3 1 0 4 BICCIC602 R01 Computer Graphics 3 1 0 4 BICCIC604 R01 Computer Networks 4 1 0 5 BICDIC XXX DE 5 3 1 0 4 BICDIC XXX DE 6 3 1 0 4 BICCIC 605 R01 Computer Networks Lab 0 0 3 2 BICCIC 606 R01 Digital Signal Processing Lab 0 0 3 2 BICCTP607R01 HR SKILLS IV 1 0 0 1 TOTAL 20 6 6 30

BICDIC601 R01 Data Warehousing and Data Mining 3 1 0 4 BICDIC602 R01 Distributed Systems 3 1 0 4 BICDIC604 TCP/IP and Socket Programming 3 1 0 4

BICCIC 601 R01 SOFT COMPUTING TECHNIQUES (Common for CSE, IT and ICT)

L T P CREDITS 3 1 0 4

UNIT-I (15 Periods) Fuzzy Logic: Introduction to fuzzy sets – Fuzzy Relations – properties - Fuzzy rules and fuzzy reasoning and inference – Standard Forms and Boundaries - Fuzzification and De-fuzzification methods - Extension Principles – Functions of Fuzzy Sets – Fuzzy Transform (Mapping) - Practical Considerations – Fuzzy numbers – Interval Analysis in Arithmetic – Approximate methods of Extension – Vertex Method – DSW Algorithm – Restricted DSW Algorithm.

UNIT-II (15 Periods) ANS and BPN: Network inputs and outputs - feed back inter connections and network stability - feed forward networks - adaptive networks - supervised and unsupervised learning - Back Propagation Network – Approach – Operation – Generalized Delta Rule – Update of output – Layer weights – Updates of hidden layer weights – Training data – Network sizing – Weights and Learning Parameters – BPN Applications – Data compression.

UNIT-III (15 Periods) BAM and CPN: Associative Memory definitions – Hamming Distance – Linear Associator – BAM Architecture – BAM Processing – BAM Mathematics – BAM Energy Function – Discrete Hopfield Memory –Counter Propagation Network – CPN Building Blocks – Input Layer – Instar – Competitive Networks – Outstar – CPN data processing.

UNIT-IV (15 Periods) Genetic Algorithm: Introduction to Genetic Algorithms - Mathematical foundations – Computer implementation of GA: data structures – reproduction, crossover and mutation – a time to reproduce, a time to cross – mapping objective functions to fitness form – fitness scaling-crossover schema theorem – codings – a multiparameter mapped fixed-point coding - discretization – constraints.

Text Books: 1. Timothy J. Ross, “Fuzzy Logic with Engineering Applications”, McGraw Hill, 2002.

[Unit I] 2. James A Freeman, David M Skapura, “Neural Networks”, Addison Wesley, 1991.

[Units II & III] 3. David E. Goldberg, “Genetic Algorithms in Search, Optimization, and Machine

Learning”, Addison Wesley, 2001. [Unit IV] References: 1. Jyh-shing Roger Jang, Chnesy-Tsai sur, Eiji Miziltazi, "Neuro Fuzzy and

Softcomputing: A Computational approach to learning and machine intelligence”, Pearson Education, 2004.

2. Melanie Mitchell, “Introduction to Genetic Algorithms”, Prentice Hall of India, 2004.

BICCIC 602 R01 COMPUTER GRAPHICS (Common for CSE, IT and ICT)

L T P CREDITS 3 1 0 4

UNIT-I (15 Periods) Introduction: Application areas of Computer Graphics, overview of graphics systems, video-display devices, and raster-scan systems, random scan systems, graphics monitors and workstations and input devices.

Output primitives: Points and lines, DDA Line Drawing Algorithm – Bresenhams Line, Circle & Ellipse algorithms. Filled area primitives: Scan line polygon fill algorithm, boundary-fill and flood-fill algorithms.

UNIT-II (15 Periods) 2D Geometrical transforms: Translation, scaling, rotation, reflection and shearing transformations, matrix representations and homogeneous coordinates, composite transforms, transformations between coordinate systems.

2D Viewing & Clipping: The viewing pipeline, viewing coordinate reference frame, window to view-port coordinate transformation, viewing functions, Cohen-Sutherland and Cyrus-beck line clipping algorithms, Sutherland –Hodgeman polygon clipping algorithm – Text Clipping. UNIT-III (15 Periods) 3D Geometric transformations: Translation, rotation, scaling, reflection and shearing transformations, composite transformations. 3-D viewing: Viewing pipeline, viewing coordinates, view volume and general projection transforms and clipping 3D object representation: Polygon surfaces, quadric surfaces, spline representation, Hermite curve, Bezier curve and B-Spline curves, Bezier and B-Spline surfaces. Basic illumination models, polygon-rendering methods.

UNIT-IV (15 Periods) Hidden Surface Elimination: Back Face Elimination – Z Buffer Algorithm-Scan Line Algorithm-Painter’s Algorithm Computer animation: Design of animation sequence, general computer animation functions, raster animation, computer animation languages, key frame systems, motion specifications.

Text Book:

1. Donald Hearn, “Computer Graphics C version 2e”, Dorling Kindersley (India) Pvt Ltd, 2006.

References:

Zhigand xiang, Roy Plastock, Schaum’s outline Series, “Computer Graphics”, Tata McGraw Hill, Second Edition, 2000.

Foley, VanDam, Feiner and Hughes, “Computer Graphics Principles & Practice”, Addison Wesley, Second Edition,1995.

BICCIC 603 R01 DIGITAL SIGNAL PROCESSING

L T P CREDITS 3 1 0 4

UNIT- I: Discrete Transforms (15 Periods) Introduction – Z transform and its application to the analysis of LTI systems: Region of Convergence – Right, Left and two sided sequences – Properties of Z transform – Rational Z transform – System function of LTI systems – Inversion of Z transform - Discrete-Time Fourier transform – Relationship of DFT to other transforms – Properties of DFT – Linear filtering of long data sequences – Frequency analysis of signals using DFT – Computational complexity of DFT – Decimation-in-time, Fast Fourier Transform algorithm - Inverse FFT. UNIT – II: Implementation of Discrete Time Systems (15 Periods) Structures for the realization of discrete time systems– Structures for FIR systems: Direct Form structure – Cascade Form structure – Frequency sampling structure – Lattice structure Structures for IIR systems: Direct Form – Signal Flow Graphs and Transposed Structures – Cascade, Parallel Form, Lattice and Lattice Ladder Structures Representation of numbers: Fixed point and binary floating point representation – quantization of filter coefficients – Round of effects in digital filters UNIT – III: Finite Impulse Response (FIR) Filters (15 Periods) Design of Digital Filters – General Considerations - Symmetric and antisymmetric FIR filters – Design of Linear Phase FIR filters using rectangular, Hanning, Hamming, Blackman and Keiser windows. Design of Linear phase FIR filters by frequency sampling method – Optimum equiripple linear phase FIR filter – Comparison of design methods for linear phase FIR filter. UNIT – IV: Infinite Impulse Response (IIR) Filters (15 Periods) Review of analog filters: Butterworth, Chebyshev and Elliptic types – Design of IIR filter from Analog Filters – Design by Approximation of Derivatives - Design by Impulse Invariance – IIR filter design by Bilinear Transformation – Matched Z transform - Frequency transformation in the analog and digital domain. Text Book: 1. John G. Proakis , Dmitris G. Manolakis and Sharma, “Digital Signal Processing”,

Pearson Education , 2006. References: 1. Sanjit K. Mitra, “DSP - A Computer Based Approach”, McGraw Hill, Third Edition,

2007. 2. S.V.Narasimhan and S.Veena, “Signal Processing principles and implementation”,

Narosa Publishing House, 2005. 3. Oppenheim and Schaffer, “Discrete Time Signal Processing”, Second Edition, Prentice

Hall of India, 2004.

BICCIC 604 R01 COMPUTER NETWORKS L T P CREDITS 4 1 0 5

UNIT-I (18 Periods) Introduction: Network Hardware - Network Software - Reference Models – Example Networks Models. Physical Layer: The Theoretical Basis for data communication – Guided transmission media - Wireless Transmission– Public switched Telephone Network. UNIT-II (19 Periods) Data Link Layer: Design issues – Error Detection and Correction – Elementary data link protocol – Sliding window protocol. Medium Access Control: Channel Allocation Problem – Multiple Access protocol – Ethernet – Wireless LANs – Data Link Layer Switching. UNIT-III (19 Periods) Network Layer: Design Issues – Routing Algorithms: Optimality Principle, Shortest Path Routing, Flooding, Distance Vector Routing, Link State Routing, Hierarchical Routing, Broadcast Routing, Multicast Routing –Routing for Mobile Hosts –Routing in Ad-Hoc Networks - Congestion Control Algorithms –Internetworking - Network Layer in Internet. UNIT-IV (19 Periods) Transport layer: Transport Service – Elements of Transport Protocol - Simple transport Protocol – Internet transport Protocols: TCP and UDP – Performance Issues. Application Layer: DNS – Multimedia. Text Book: 1. Andrew S Tanenbaum , “Computer Networks”, Pearson Education, Fourth Edition,

2003. References: 1. Behrouz A Forouzan, “Data Communication and Networking”, Tata McGraw Hill,

Fourth Edition, 2006. 2. William Stallings, “Data and Computer Communications”, Prentice Hall of India,

Seventh Edition, 2004.

BICDIC 601 R01 DATA WAREHOUSING AND DATA MINING (Common for CSE, IT and ICT)

L T P CREDITS 3 1 0 4

UNIT-I (15 Periods) Data Warehouse and OLAP Technology: Data Warehouse - A Multidimensional Data Model - Data Warehouse Architecture – Data Warehouse Implementation - From Data Warehousing to Data Mining. UNIT-II (15 Periods) Introduction: Data Mining - Data Mining Functionalities; Data preprocessing: Data cleaning: Missing Values -Data Cleaning as a Process; Data Integration and Transformation; Data Reduction: Data Cube Aggregation - Attribute Subset Selection -Dimensionality Reduction - Numerosity Reduction; Data Discretization and Concept Hierarchy Generation: Discretization and Concept Hierarchy Generation for Numerical Data - Concept Hierarchy Generation for Categorical Data. UNIT-III (15 Periods) Association Rules: Basic Concepts -Efficient and Scalable Frequent Item set Mining Methods - Mining Various Kinds of Association Rules Classification and Prediction: Decision tree induction – Attribute Selection Measures - Tree pruning –Scalability and Decision Tree Induction; Bayesian classification: Bayes’ Theorem - Naïve Bayesian Classification; - Accuracy and Error Measures: Classifier Accuracy Measures -Predictor Error Measures. UNIT-IV (15 Periods) Cluster Analysis: Introduction to cluster analysis and its types-Hierarchical Methods: Agglomerative and Divisive Hierarchical Clustering -BIRCH: Balanced Iterative Reducing and Clustering using Hierarchies Mining the World Wide Web: Mining the Web Page Layout Structure -Mining the Web’s Link Structures to Identify Authoritative Web Pages -Mining Multimedia Data on the Web -Automatic Classification of Web Documents -Web Usage Mining. Text Book: 1. Jiawei Han and Micheline Kamber, “Data Mining: Concepts and Techniques”,

Morgan Kaufman, First Edition, 2006. References: 1. Margaret H. Dunham, “Data Mining Introductory and Advanced Topics”, Pearson

Education, First Edition, 2003. 2. Alex Berson, Stephen J. Smith, “Data Warehousing, Data Mining and OLAP”,

McGraw Hill, 2001.

BICDIC602 R01 DISTRIBUTED SYSTEMS (Common for CSE, IT and ICT)

L T P CREDITS 3 1 0 4

UNIT - I (12 Periods) Introduction: Goals – Hardware concepts – Bus based Multiprocessors – Switched multiprocessors – Bus Based multi computers – Switched multi computers – Software concepts – Network OS and NFS – True distributed systems – multiprocessor time sharing systems – Design issues. UNIT - II (18 Periods) Communication: Client/server model – Addressing – Blocking versus non – Blocking primitives – Buffered versus unbuffered primitives – reliable versus unreliable primitives – Implementation – Remote procedure call: Basic RPC Operation – Parameter passing – Dynamic binding – RPC Semantics in the presence of failures – Implementation issues. Remote object invocation – Distributed objects – Binding a Client to an object – Static versus dynamic – Parameter passing – Message oriented communication – Stream oriented communication - Group communication: Introduction – design issues – ISIS. UNIT - III (15 Periods) Synchronization: Clock synchronization: logical & physical clocks – Algorithms – Use of synchronized clocks – Mutual exclusion: Centralized algorithm – Distributed algorithm – Token ring algorithm – Comparison – Election algorithms: Bully algorithm – Ring algorithm. Atomic Transactions: Introduction – Transaction model – Implementation – Concurrency control – Deadlock: detection and prevention UNIT - IV (15 Periods) Consistency: Introduction – Data Centric consistency models – Client centric consistency models – Fault tolerance – process resilience – Distributed commit – Recovery – Distributed file systems – Sun network file system – Coda file system

Text Books: 1. Andrew. S Tanenbaum, “Distributed Operating system”, Prentice Hall of India, 2006.

[Units I, II & III] 2. Andrew S Tanenbaum & Maarten Van Steen, “Distributed systems – Principles &

Paradigms”, Prentice Hall, Second Edition, 2006. [Units II & IV] References: 1. Andrew. S Tanenbaum, “Modern Operating system”, Prentice Hall of India, 2000. 2. Pradeep K Sinha, “Distributed operating systems – Concepts and Design”, Prentice Hall of India, 1998.

BICDIC 604 TCP/IP AND SOCKET PROGRAMMING

L T P CREDITS 3 1 0 4

UNIT – I (15 Periods)

Internet Protocols: Internet protocol – Header, Routing, subnetting and supernetting, ARP and RARP, Internet control message protocol, IP Routing, Dynamic Routing protocols, IPV6 ceser Datagram protocol, IPV6. UNIT – II (15 Periods)

Transmission Control Protocol: TCP-services and header, connection establishment and termination, interactive dataflow, timeout and retransmission, TCP performance. UNIT – III (15 Periods) Implementation: ARP, IP routing; IP fragmentation and reassembly; TCP – input processing, finite state machine; output processing, Timer management, flow control. UNIT – IV (15 Periods) Socket Programming and Applications: Socket Abstraction, endpoint address creation, connection, sending and receiving, options, using socket calls in programs. Socket Programming Applications: TCP echo client server – UDP echo client server- ping – FTP – other client server application. Text Books: 1. Douglas E. Comer, “Internetworking with TCP/IP”, Volumes 1 & 2, Pearson

Education, Fourth Edition, 2000. [Units I,II & III] 2. W. Richard Stevens, “UNIX network programming”, Prentice Hall of India,

Second Edition, 1998. [Unit IV] References: 1. Richard Stevens, “TCP/IP Illustrated”, Volumes 1, 2 & 3, Pearson education India,

1996. 2. Behrouz A. Forouzan, “TCP/IP Protocol Suite”, Tata McGraw Hill, Third Edition,

2005.

BICDIC606R01 C# and .NET PROGRAMMING (Common for CSE, IT and ICT)

L T P CREDITS 2 0 3 4

UNIT-I (19 Periods) Basics of C#: Creation of C# - C# and .Net frame work-CLR- Managed and unmanaged code-CLS - Object Oriented Programming-Simple programs-Data types, literals, and variables-Operators- Program Control statements . Classes and Objects: Class fundamentals - Creating objects – Reference variables – Methods – Constructors – new Operator- Garbage collection and destructors - ‘this’ keyword. UNIT-II (19 Periods) Arrays and Strings: One dimensional arrays - Multi dimensional arrays – Jagged Arrays – Array references – Length property – Arrays and for. Each loop - Strings – Closer look at methods and classes Operator Overloading: Fundamentals – Overloading binary and unary operators – Handling built-in types - Overloading Relational, Logical, True and False – Conversion operators - Overloading restrictions- Indexers and Properties UNIT-III (19 Periods) Inheritance: Inheritance Basics – Member access and Inheritance – Constructors and inheritance – Name Hiding - Multilevel Hierarchy – Base class references and Derived Objects – Virtual methods and overriding – Abstract class – Sealed – Object Class- Boxing and unboxing. Interfaces: Implementation – Interface references, Properties, Indexers – Interface inheritance and name hiding – Explicit implementation – Interface Vs Abstract class – Structures and Enumerations. UNIT-IV (18 Periods) Exception Handling: - The System.Exception class – Fundamentals – Uncaught exceptions – Multiple catch – Catch all – Nesting try blocks – Throwing and Rethrowing exceptions – Finally – Deriving Exception classes – Using checked and unchecked Delegates and Events: Delegates – Multicasting – System.Delegate – Purpose of delegates – Events - Multicast event – Instance Vs Static method – Event accessors - Unsafe code and Pointers. Text Book: 1. Herbert Schildt, "C#: The Complete Reference", Tata McGraw Hill, 2002. References: 1. Burton Harvey, Simon Robinson, Julian Templeman, Karli Watson, “C#

Programming with the Public Beta”, Shroft Publishers & Distributers, 2001. 2. Balagurusamy, E, “Programming in C#”, Tata McGraw Hill, 2002.

BICCIC605R01 COMPUTER NETWORKS LAB

L T P CREDITS 0 0 3 2

Experiments using Java :

1. File Transfer-using TCP

2. File Transfer-using UDP

3. Remote Procedure Call under client server environment (RMI).

4. Serial Communication between PCs (Character Transfer)- Communication via RS

232/ Modems

5. Encryption and Decryption of message

6. Ping a computer using Java API and detect system information such as retrieval

of computer names and their IP Addresses, obtaining Node Address

7. Using networking communication functions – like sending POP-UP messages via

NetMessage functions

8. Simple firewall Implementation

Experiments using ns2 :

9. Simulation of TCP/UDP Protocols

10. Simulation of Dynamic Routing

11. Information transfer using different routing protocols

Study Exercises :

12. Case Study on web server

13. Study of Network Performance and Management using an SNMP, FTP, HTTP,

SMTP and other protocols.

14. Study of Wireless LAN Architecture and devices

15. Case study on entire SASTRA intranet (infrastructure network)

16. Selection of a suitable topology for an Organization.

BICCIC 606 R01 DIGITAL SIGNAL PROCESSING LAB

L T P CREDITS 0 0 3 2

1. Introduction to DSP starter kit.

2. Introduction to MATLAB. 3. Experiments using DSP Kit

i. Simple experiments using DSP starter Kit ii. Waveform generation – ramp iii. Waveform generation – triangular iv. Waveform generation – square v. Linear convolution of two sequences vi. Circular convolution of two sequences

4. Experiments using MATLAB i.Simple Experiments using MAT LAB a)Linear Convolution b)Circular Convolution c)Auto & Cross Correlation

ii. DTFT, DFT, IDFT iii. FFT iv. Window based FIR filter design: LFP, HPF, BPF, BSF (windows:

Boxcar, triangular, Blackman, Hanning, Hamming)

v. IIR filter design a. Butterworth

b. Chebyshev I c. Elliptic

vi. Kaiser window design

vii. Periodogram

BICCTP607 HR SKILLS - IV

L T P CREDITS 1 0 0 1

S.NO DETAILS NO.OF CLASSES

1. Employers’ Expectation-staff lecture 1

2. Selection Process – Staff lecture 1

3. Resume Writing – Presentation – Staff lecture 1

4. Group Discussion 3

5. Mock Interview 4

6. Aptitude Test – IV 3

7. End Semester Examinations 2

TOTAL 15

SEMESTER VIII:

Period of Instruction Subject Code Subject Title

L T P Credits

BICCIC 801 Project Work 0 0 18 9 BICOIC801 Web Technology 3 0 0 3 BICOIC802 E Commerce 3 0 0 3 BICOIC803 Software Project Management 3 0 0 3 BICOIC804 Management Information Systems 3 0 0 3 TOTAL 12 0 18 21

BICOIC 801 E-COMMERCE

L T P C 3 0 0 3 UNIT I: Fundamentals of E-Commerce and Network Infrastructure (11 Periods) Introduction to Electronic Commerce – EC Framework, EC and Media Convergence, Autonomy of EC applications, EC Consumer applications, EC Organization Applications. Network Infrastructure for EC – Market Forces influencing the I-way, Components of the I-way, Network Access Equipment, Global Information Distribution Networks, Public Policy issues shaping the I-way. UNIT II: WWW and Consumer-Oriented Electronic Commerce (11 Periods) Electronic Commerce and WWW – Architectural framework for E-commerce, WWW as Architecture, Web Background, Security and the WEB. Consumer Oriented Electronic Commerce - Consumer oriented applications- Personal Finance and Home Banking Management, Basic Services, Intermediate services, Advanced services, Home Shopping, Mercantile Process Models, Mercantile Models from Consumer’s Perspective and Merchant’s Perspective. UNIT III: Electronic Payment Systems (11 Periods) Types of Electronic Payment Systems, Digital Token Based Electronic Payment Systems, Smart Cards and Electronic Payments, Credit Card Based Electronic Payment Systems, Risk and Electronic Payment Systems, Designing Electronic Payment Systems. UNIT IV : Network Security and Firewalls (12 Periods) Client-Server Network Security, Emerging Client-Server Security Threats, Firewalls and Network Security, Data and Message Security, Challenge Response Systems, Encrypted Documents and Electronic mail. Text Book: 1. Kalakota, R. and, Whinston A.B., “Frontiers of E-Commerce”, Pearson Education,

2002. References:

1. Efraim Turban, Jae Lee, David King Michael, “Electronic Commerce - A Managerial Perspective”, Pearson Education, 2001.

2. Trepper, “E-commerce Strategies”, Prentice Hall of India, 1998. Pete Loshin, Paul A. Murphy, “Electronic Commerce”, Addison Wesley, Second Edition, 1997.

BICOIC 802 SOFTWARE PROJECT MANAGEMENT

L T P C 3 0 0 3 UNIT-I (11 Periods) Conventional Software Management: The waterfall Model – Conventional Software Management. Performance: Evaluation of Software Economics: Software Economics – Pragmatic Software cost estimation. Improving Software Economics: reduced Software - Product Size – Improving Software Process – Improving Team Effectiveness – Improving Automation through Software Environments – Achieving Required Quantity – peer inspections. UNIT-II (11 Periods) The old way and the new: Principles of Conventional Software Engineering – Principles of modern Software Management – transition to an iterative process. UNIT-III (11 Periods) Life Cycle Phases: Engineering and production stage – inception phase – Elaboration phase – construction phase – Transition Phase. Artifacts of the process: The artifact sets – Management Artifacts – Engineering artifacts – Pragmatic artifacts. Model Based software architectures: Architecture: A Management perspective – Technical Perspective. UNIT-IV (12 Periods) Software Management Disciplines : Iterative Process planning - work Breakdown structure – planning Guidelines – The cost and schedule Estimating process – Iteration planning process – pragmatic planning. Tailoring the process: process Determinants –examples of small – scale projects versus large scale project. Text Book: 1. Walker Royce, “Software Project Management: A Unified Framework”, Addison

Wesley, 1998. Reference : 1. Boehm & Barry.W , “Software Engineering Economics”, Prentice Hall of India,

1981.

BICOIC 803 WEB TECHNOLOGY L T P C

3 0 0 3 UNIT – I (11 Periods) Introduction: Internet Principles – Basic Web Concepts – Client/Server model – Retrieving data from Internet – HTML and Scripting Languages – Standard Generalized Mark-up Language –Next Generation Internet – Protocols and applications. UNIT – II (11 Periods) Socket & Common Gateway Interface Programming: HTML forms – CGI Concepts – HTML tags Emulation – Server-Browser communication – E-mail generation – Authorization and security. Socket Programming: Streaming – Networking principles – sockets -multicasting – Remote Method Invocation – activation – Serialization - Marshal streams. UNIT – III (11 Periods) Server Side Programming: Dynamic web content – cascading style sheets – DHTML – XML - Server side includes - communication – Java Server Pages. UNIT – IV (12 Periods) Online applications: Simple applications – On-line databases – monitoring user events – plug-ins – database connectivity – Internet Information Systems - EDI application in business – Internet commerce –Customization of Internet commerce Text Books :

1. Eric Ladd, Jim O’ Donnel, “Using HTML 4, XML and Java”, Prentice Hall of India, 1999.

2. Jeffy Dwight, Michael Erwin and Robert Niles, “Using CGI”, Prentice Hall of India, 1999.

3. Scot Johnson, Keith Ballinger, Davis Chapman, “Using Active Server Pages”, Prentice Hall of India, 1999.

BICOIC 804 MANAGEMENT INFORMATION SYSTEMS L T P C

3 0 0 3 UNIT I: Introduction (11 Periods) Technology of Information Systems – Concepts – Definition - Effect of MIS - Role and importance of management –Way to approach Management - Functions of the manager - Management as a control system - Database Management Systems - Concepts - Data Models - Database Design - MIS & Client Server Architecture.

Process of management - Planning – Organization – Staffing - Co-ordination and Controlling – Exceptional management – MIS-A Tool to management - Organization structure and Theory –Basic Model and Organization structure - Organizational Behavior.

UNIT II: Decision support systems (11 Periods) Decision making in business-decision making process - structured and unstructured problems- DSS components-types of decision support systems-sensitivity analysis-executing information systems - Human as an information Processor - Handling System Complexity - Post implementation problems in Systems.

UNIT III: System Analysis and Design (11 Periods) System analysis and design –Need for system Analysis - System Analysis of existing System - New Requirement - System Development Model - Structured Systems Analysis and Design - Computer System Design - Development of MIS - Development of long Range plans of the MIS - Ascertaining the class of information - Determining the Information Requirement - Development and implementation of MIS - Management of Quality - MIS Factors of success and failure. UNIT IV: Current Trends (12 Periods) Knowledge management – Networks – Internet and Web based Information System – Electronic Commerce – Electronic Business – Commercial applications – Case Studies.

Text Book : 1. W.S.Jawadekar, “Management Information Systems”, Tata McGraw Hill, 1997.

References:

1. Kenneth C Landon and Jane P. Laudon, “Management Information Systems”, Prentice 2. Hall of India, Sixth Edition, 2000.

2. James A O’Brien, “Management Information System”, Tata McGraw Hill, 1999.