• - Your preferred source of Exams and Syllabus.

    SYLLABUS FOR B.E. (I.T.) OF PUNJAB UNIVERSITY, CHANDIGARH

    SYLLABUS FOR B.E. (I.T.)
    THIRD SEMESTER
    Paper Title: Engineering Mathematics-III
    Paper Code: AS301 Max. Marks 100 Time: 3 Hours
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part-A and two from Part-B.
    Part-A
    Sequences and Series: (08)
    Sequences, Limits of sequences, Infinite series, series of positive terms, Integral test,
    Comparison test, Ratio test, Root test. Alternating series, Absolute and Conditional
    Convergence, Leibnitz test. Power series: radius of convergence of power series, Taylor’s
    and Maclaurin’s Series, Formulae for remainder term in Taylor and Maclaurin series,
    Error estimates. (Scope as in Chapter 8, Sections 8.1 – 8.10 of Reference 2).
    Linear Algebra: (07)

    Concept of linear independence and dependence, Rank of a matrix: Row – Echelon form,
    System of linear equations: Condition for consistency of system of linear equations,
    Solution by Gauss elimination method. Inverse of a matrix: Gauss – Jordan elimination
    method (Scope as in Chapter 6, Sections 6.3 – 6.5, 6.7 of Reference 1).
    Eigen values, eigen vectors, Cayley – Hamilton theorem (statement only). Similarity of
    matrices, Basis of eigenvectors, diagonalization (Scope as in Chapter 7, Sections 7.1, 7.5
    of Reference 1). (07)
    Part-B
    Complex Functions: (08)
    Definition of a Complex Function, Concept of continuity and differentiability of a
    complex function, Cauchy – Riemann equations, necessary and sufficient conditions for
    differentiability (Statement only). Study of complex functions: Exponential function,
    Trigonometric functions, Hyperbolic functions, real and imaginary part of trigonometric
    and hyperbolic functions, Logarithmic functions of a complex variable, complex
    exponents (Scope as in Chapter 12, Sections 12.3 – 12.4, 12.6 – 12.8 of Reference 1).
    Laurent Series of function of complex variable, Singularities and Zeros, Residues at
    simple poles and Residue at a pole of any order, Residue Theorem (Statement only) and
    its simple applications (Scope as in Chapter 15, Sections 15.1 – 15.3 of Reference 1).(07)
    Conformal Mappings, Linear Fractional Transformations (Scope as in Chapter 12,
    Sections 12.5, 12.9 of Reference 1). (08)
    References:
    1. E. Kreyszig. Advanced Engineering Mathematics, Eighth Edition, John Wiley.
    2. G. B. Thomas, R. L. Finney: Calculus, Ninth Edition, Pearson Education.
    5
    3. Michael D. Greenberg. Advanced Engineering Mathematics, Second Edition,
    Pearson Education.
    4. R. V. Churchill, J. W. Brown. Complex Variables and Applications, Sixth
    Edition, McGraw-Hill, Singapore, 1996.
    5. Vivek Sahai, Vikas Bist. Linear Algebra, Narosa Publishing House, 2002 Edition.
    Paper Title: Data Communication & Networks
    Paper Code: IT302 Max. Marks 100 Time: 3 Hours
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part-A and two from Part-B.
    Part-A
    Introduction: (08)
    Data Transmission concepts; transmission impairments; switching; Modulation;
    multiplexing; Network Hardware: LAN, MAN, WAN, Wireless networks, Internet
    works; Network Software: Layer, Protocols, interfaces and services; Reference Model:
    OSI/TCP/IP and their comparison.
    Physical Layer: (08)
    Transmission media: Magnetic, Twisted pair, coaxial cable, fiber optics, wireless
    transmission (radio, microwave, infrared, light wave). Circuit Switching & Packet
    Switching. Introduction to ATM, ISDN (Narrowband & Broadband), Cellular radio and
    communication satellites.
    Data Link Layer: (09)
    Framing; Error control; Error correction & Detection; sliding window protocols (one bit,
    Go back n, selective repeat); Examples of DLL Protocols-HDLC, SLIP; Medium Access
    Sub layer: Channel Allocation, MAC protocols -ALOHA, CSMA protocols, Collision
    free protocols, Limited Contention Protocols, Wireless LAN protocols, IEEE 802.3,
    802.4, 802.5 standards and their comparison. Bridges: Transparent, source routing,
    remote.
    Part-B
    Network Layer: (09)
    Design issues, routing algorithms (shortest path, flooding, flow based, distance vector,
    hierarchical, broadcast, multicast, for mobile hosts).Congestion control algorithms
    (Leaky bucket, Token bucket, Choke, Packet, Load shedding).
    6
    Transport Layer: (06)
    Addressing, establishing and releasing connection, flow control & buffering,
    multiplexing, crash recovery, Internet Transport protocol (TCP and UDP).
    Application Layer: (05)
    Network Security; Domain Name System; Simple Network Management Protocol;
    Electronic Mail.
    Books Recommended:
    1. Computer Networks by Andrew S. Tanenbaum (PHI), Edi 4th.
    2. Data and Computer Communications by William Stallings (PHI), Edi 6th.
    3. Internet working with TCP/IP by Douglas E. Coomer,(PHI), Edi 3rd.
    4. Design & Analysis of Computer Communication Networks by Vijay Ahuja
    (McGraw), Latest Edition.
    5. Data & Computer Communication by Douglas E. Coomer (Addition Wessley),
    Latest Edition.
    Paper Title: Data Communication & Networks (Practical)
    Paper Code: IT352 Max. Marks:75 Time: 3 Hours
    Practicals based on theory.
    1. To familiarize with the various basic tools (crimping, krone etc.) used in
    establishing a LAN.
    2. To familiarize with switch (manageable & unmanageable), hub, connecters,
    cables (cabling standards) used in networks.
    3. To familiarize with routers & bridges.
    4. To use some basic commands like ping, trace-root, ipconfig for trouble shooting
    network related problems.
    5. To use various utilities for logging in to remote computer and to transfer files
    from / to remote computer.
    6. To develop a program to compute the Hamming Distance between any two code
    words.
    7. To develop a program to compute checksum for an ‘m’ bit frame using a
    generator polynomial.
    8. To develop a program for implementing / simulating the sliding window protocol.
    9. To develop a program for implementing / simulating a routing algorithm.
    7
    10. To study various IEEE standards (802.3, 802.4, 802.5, 802.11)
    11. To develop a program for implementing/simulation the ALOHA protocol
    Paper Title: Communication Theory
    Paper Code: IT 303 Max. Marks 100 Time: 3 Hours
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part-A and two from Part-B.
    Part-A
    Signal & its Representations (06)
    Review of Fourier series & Fourier transform, Continuous Spectra, Delta Function,
    power & energy spectral densities, Sampling Theorem- approximations
    Random Signal Theory (08)
    Sample space, random variables-discrete & Continuous, examples of probability Density
    Functions-Moments, joint & conditional PDF density functions of sums, Transformation,
    concept of correlation, auto & Cross-correlation functions, White Noise.
    Transmission of Signals through Networks (10)
    Convolution Theorem, graphical interpretation of Low pass, High Pass & Band Pass
    networks, Optimum Filters-Matched filters, input/output relations with random inputs,
    Envelope Detector-Rician & Rayleigh distribution. Equivalent Noise bandwidth.
    Part-B
    Noise & Interference (07)
    Classification of Noise, Sources of noises, atmospheric shots, Thermal noise, noise in
    Semiconductors, Noise spectral density, Noise calculations, Noise Figures of devices &
    circuits, cascaded networks, Minimum noise, Figures of networks. Experimental
    determination of Noise Factor
    Basic Information Theory (14)
    Concept Information, Entropies of Discrete Systems, Rate of transmission- Redundancy,
    Efficiency & Channel capacity, Source encoding including Huffman’s Technique,
    continuous Channel- Entropy maximization, Transmission rate of Channels, capacity of
    Noisy channels. Discussion of Shannon’s Coding theorem, Comparison of Analog &
    Digital Communication Systems with reference to the Ideal Channel Capacity Theorem.
    8
    Books recommended:
    1. Communication Systems by B P Lathi Pub:Willey Eastern Limited, Latest
    Edition.
    2. Introduction to Modern Communication by P D Sharma, PHI, Latest Edition
    3. Introduction to Information Theory by F M Reza, TMH, Latest Edition.
    4. Communication Systems by Haykin Pub:Willey Eastern Limited, Latest Edition.
    Paper Title: Object Oriented Programming
    Paper Code: IT304 Max. Marks 100 Time: 3 Hours
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part-A and two from Part-B.
    Part-A
    Principles of Objected Oriented Programming (03)
    Advantages of OOP, comparison of OOP with Procedural Paradigm
    C++ Constructs (03)
    Tokens, Expressions and control structures, various data types, and data structures,
    Variable declarations, Dynamic Initializations, Operators and Scope of Operators,
    Typecasting, Unformatted and formatted console I/O Operations
    Functions (05)
    Classes and Objects: Prototyping, Referencing the variables in functions, Inline, static
    and friend functions. Memory allocation for classes and objects. Arrays of objects,
    pointers to member functions.
    Constructors and Destructors (05)
    Characteristics and its various types, Dynamic Constructors, Applications, Order of
    Invocation, C++ garbage collection, dynamic memory allocation.
    Polymorphism (05)
    Using function and Operator overloading, overloading using friend Functions, type
    conversions from basic data types to user defined and vice versa.
    9
    Part-B
    Inheritance (06)
    Derived classes, types of inheritance, various types of classes, Invocation of Constructors
    and Destructors in Inheritance, aggregation, composition, classification hierarchies,
    metaclass/abstract classes.
    Pointers (05)
    Constant pointers, Use of this Pointer, Pointer to derived and base classes, virtual
    functions, Bindings, Pure virtual Functions and polymorphism
    I/O Operations and Files (04)
    Classes for files, Operations on a file, file pointers
    Generic Programming With Templates (06)
    Definition of class template, Function Templates, Overloading Template Functions, Class
    templates and member functions templates with parameters, Standard C++ classes,
    persistent objects, streams and files, namespaces, exception handling, generic classes,
    standard template library: Library organization and containers, standard containers,
    algorithm and Function objects, iterators and allocators, strings, streams, manipulators,
    user defined manipulators and vectors
    Introduction: (03)
    Object Oriented System, Analysis and Design.
    Books Recommended
    1. Object Oriented Programming with C++ by Bala Guruswamy, TMH, Edi 2nd.
    Reference Books
    1. C++ Primer Plus by Prata, Pearson Education, Latest Edition.
    2. The C++ Programming Language by Bjarne Stroutstrup, PHI, Latest Edition.
    3. Object Oriented Programming with Ansi and Turbo C++ by Kamthane, Pearson
    Education, 2003 Edition.
    4. The Complete Reference to C++ by Schildt, TMH, Latest Edition.
    5. OOPs Using C++ by Sanjeev Sofat, Khanna Publishers, Latest Edition.
    Paper Title: Object Oriented Programming (Practical)
    Paper Code: IT 354 Max. Marks: 75 Time: 3 Hours
    List of Experiments:
    1. Implementation of Functions, Classes and Objects
    2. Constructors and Destructors
    3. Operator Overloading and Type Conversion
    4. Inheritance and Virtual Functions
    5. Files
    6. Exception Handling and Generic Programming
    10
    Paper Title: Digital Electronics
    Paper Code: IT 305 Max. Marks 100 Time: 3 Hours
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part-A and two from Part-B.
    Part-A
    Introduction (10)
    Representation of Logic, Logic Variables, Boolean Algebra, Boolean Expressions and
    minimization of Boolean expression using K-Map, Review of Logic Gates & Flip-flops,
    design & Implementation of Adder, Subtractor, Multiplexer, DeMultiplexer, Encoder,
    Decoder, ROM, Digital Comparators, Code Converters
    Number Systems and Codes (07)
    Decimal, Binary, Hexadecimal, Octal’s complement, 2’s complement, addition and
    subtraction, weighted binary codes, Error detecting codes, Error correcting codes,
    Alphanumeric codes.
    Counters & Shift Registers (07)
    Ripple Counters, Design of Modulo-N ripple counter, Up-Down counter, design of
    synchronous counters with and without lockout conditions, design of shift registers with
    shift-left, shift-right & parallel load facilities, Universal shift Registers.
    Part-B
    Data Converters (06)
    Sample & Hold switch, D/A converters: weighted type, R-2R Ladder type; A/D
    Converters: Counter-Ramp type, Dual Slope Type, Successive approximation type, flash
    type; Specifications of ADC & DAC
    Digital Logic families (09)
    Characteristics of digital circuits: fan in, fan-out, power dissipation, propagation delay,
    noise margin; Transistor-transistor Logic(TTL), TTL NAND Gate with active pull up, its
    input and output Characteristics, Types of TTL Gates (Schottky, standard, low power,
    high speed). Emitter Coupled Logic(ECL), ECL gate, its transfer characteristics, Level
    translation in ECL & TTL, MOS Gates, MOS Inverter, CMOS Inverter, Rise & Fall time
    of MOS & CMOS gates, Interfacing TTL & CMOS Circuits, Comparison of
    Characteristics of TTL, ECL, MOS & CMOS logic circuits, Tristate Logic & its
    applications.
    11
    Semiconductor Memories & Programmable Logic (06)
    ROM, PROM, EPROM, EEPROM; RAM: Static RAM, Typical Memory Cell, Memory
    Organisation, Dynamic RAM cell, Reading, & Writing Operation in RAM, PLA, PAL &
    FPGA.
    Books Recommended:
    1. Digital Electronics – An introduction to theory and practice by William H. Gothmann,
    (PHI), Edi 2nd .
    2. Modern Digital Electronics by R.P.Jain, 1997, (Tata McGraw-Hill) Edi 3rd.
    3. Digital Integrated Electronics by Herbert Taub & Donald Schilling, (Tata McGraw-Hill)
    Latest Edition.
    4. Integrated Electronics by Millman & Halkias, (Tata McGraw-Hill), Edi 1st
    5. Digital System Principles & Applications by R J Tocci (PHI), Edi 8th .
    6. Digital Logic Design By Morris Mano, Pearson, Edi 1st.
    Paper Title: Digital Electronics (Practical)
    Paper Code: IT 355 Max Marks: 75 Time: 3 Hours
    Note: Do any eight experiments.
    1. To Study data sheets and truth tables of AND, OR, NOR, NAND, NOT and XOR
    Gates.
    2. To verify the truth tables of RS, D, JK and T Flip Flops
    3. To fabricate and test the truth table of half/full adder.
    4. To design and implement a Modulo-N Counter
    5. To Design and implement a Universal shift register
    6. Design & fabrication of synchronous counter.
    7. Design & fabrication of Combinational circuits using Multiplexers.
    8. To convert 8 bit Digital data to Analog value using DAC
    9. To convert Analog value into 8 bit Digital data using ADC
    10. To design and fabricate the given sequential circuits using Flip-flops as memory
    elements.
    12
    SYLLABUS FOR B.E. (I.T.)
    FOURTH SEMESTER
    Paper Title: Cyber Laws & IPR
    Paper Code: ASC 405 Max Marks: 100 Time : 3Hrs
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part-A and two from Part-B.
    Part-A
    Basics of Computer & Internet Technology (08)
    Internet, ISP & domain name; Network Security; Encryption Techniques and Algorithms;
    Digital Signatures.
    Introduction to Cyber World (02)
    Introduction to Cyberspace and Cyber Law; Different Components of cyber Laws; Cyber
    Law and Netizens.
    E-Commerce (07)
    Introduction to E-Commerce; Different E-Commerce Models; E-Commerce Trends and
    Prospects; E-Commerce and Taxation; Legal Aspects of E-Commerce.
    Part-B
    Intellectual Property Rights (12)
    IPR Regime in the Digital Society; Copyright and Patents; International Treaties and
    Conventions; Business Software Patents; Domain Name Disputes and Resolution.
    IT Act, 2000 (12)
    Aims and Objectives; Overview of the Act; Jurisdiction; Role of Certifying Authority;
    Regulators under IT Act; Cyber Crimes-Offences and Contraventions; Grey Areas of IT
    Act.
    Project Work (04)
    Candidates will be required to work on a project. At the end of the course students will
    make a presentation and submit the project report.
    Books Recommended
    1. A Guide to Cyber Laws & IT Act 2000 with Rules & Notification by Nandan
    13
    Kamath, PHI, Latest Edition.
    2. Cyber Cops, Cyber Criminals & Internet by Keith Merill & Deepti Chopra (IK
    Inter.), Edi 1st .
    3. Information Technology Law by Diane Row Land, TMH, Latest Edition.
    4. Handbook of Cyber Laws by Vakul Sharma (Mc Millian), Latest Edition.
    Paper Title: Data Structures and Algorithms (Theory)
    Paper Code: IT 401 Max. Marks 100 Time: 3 Hours
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part-A and two from Part-B.
    Part-A
    Introduction: (01)
    Introduction to data structures; Introduction to Algorithms Complexity;
    Arrays, Stacks & Queues: (08)
    Concepts; Basic operations & their algorithms: Transverse, Insert, Delete, Sorting of
    data in these data structures; Prefix, Infix, Postfix Notations;
    Lists: (10)
    Concepts of Linked List and their representation; Two way lists; Circular linked list;
    Basic operations & their algorithms: Transverse, Insert, Delete, Searching and Sorting of
    data in List; Storage Allocation & Garbage Collection; Linked stack and queues;
    Generalized List; sparse matrix representation using generalized list structure;
    Part-B
    Trees: (08)
    Binary Trees and their representation using arrays and linked lists; Trees and their
    applications; Binary tree transversal; Inserting, deleting and searching in binary trees;
    Heap & Heap Sort; General Trees; Thread binary tree; Height balance Tree (AVL); BTree.
    Graphs and their applications: (08)
    Graphs; Linked Representation of Graphs; Graph Traversal and spanning forests; Depth
    first search; Breadth first search.
    Sorting & Searching: (10)
    Insertion sort; Selection sort; Merging; Merge sort; Radix sort; Sequential & Binary
    Search; Indexed Search; Hashing schemes; Binary search Tree.
    14
    Books Recommended:
    1. Data Structure Using C and C++ by A. Tanenbaum, Y. Langsam, M. J. Augenstein
    (PHI), 5th Edition.
    2. Theory and problems of Data Structures by Seymour Lipschutz (McGraw Hill),
    Latest Edition.
    3. Data Structures & Program Design by Robert L. Kruse (PHI), Latest Edition.
    Paper Title: Data Structures and Algorithms (Practical)
    Paper Code: IT 451 Max. Marks: 75 Time: 3Hrs
    List of Programs:
    1. Implementation of Array Operation: Traversal, Insertion & Deletion at and
    from a given location; Sparse Matrices; Multiplication , addition.
    2. Stacks: Implementation of Push, Pop; Conversion of Infix expression to Postfix,
    Evaluation of Postfix Expressions.
    3. Queues: Adding, Deleting Elements; Circular Queue: Adding and Deleting
    elements.
    4. Implementation of Linked Lists: Inserting, deleting, inverting a linked list.
    Implementation of stacks and queues using linked lists; Polynomial addition,
    Polynomial multiplication.
    5. Trees: Implementation of Binary & Binary Search Trees, Recursive and Non-
    Recursive traversal of Tress.
    6. Graphs: BFS & DFS
    7. Implementation of sorting and searching algorithms.
    8. Hash Tables Implementation: Searching, inserting and deleting, searching &
    sorting techniques.
    15
    Paper Title: Analog and Digital Communication
    Paper Code: IT 402 Max. Marks 100 Time: 3 Hours
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part-A and two from Part-B.
    Part-A
    Amplitude Modulation & Demodulation and Systems (08)
    Concept of Modulation its merits & demerits, Principle and generation of AM, DSB/SC,
    SSB signal, Balanced modulator, Detection of AM, DSB/SC, and SSB signals, Super
    heterodyne Radio Receivers.
    Frequency Modulation & Demodulation and Systems (07)
    Principles and generation of FM and PM signals, FM Transmitter and FM Receiver with
    various stages.
    Pulse Modulation & Demodulation (08)
    Principles, generation and detection of PAM, PWM, PPM & PCM signals, noise in pulse
    modulation system, companding, delta modulation ,adaptive delta modulation systems.
    Part-B
    Digital modulation techniques (07)
    PSK, FSK, MSK, QAM. Error calculations for PSK, FSK, MSK, QAM, Shannon’s limit,
    Signal to Noise Ratio
    Multiplexing and Multiple Access (07)
    Allocation of communication Resources, FDM/FDMA, TDM/TDMA, CDMA, SDMA,
    Multiple Access Communications and Architecture, Access Algorithms.
    Spread Spectrum Techniques (08)
    Spread Spectrum Overview, Pseudo noise Sequences, Direct Sequence and Frequency
    Hopped Systems, Synchronization of DS and FH systems, Jamming Considerations,
    Commercial Applications
    Books Recommended :
    1. Principles of Communication Systems by Taub and Schilling (Tata McGraw
    Hill), Edi 2nd.
    2. Communication Signals and Systems by S. Haykins(Wiley), Edi 4th.
    16
    3. Principles of Digital Communication by J. Das, S.K. Mullick, P.K.
    Chatterjee, New Age International (P) Ltd, Edi 1st.
    4. Digital Communications by J.G. Proakis, (Tata McGraw Hill), Edi 4th
    5. Electronic Communication Systems by George Kennedy and B. Davis( Mc
    Graw Hill),Edi 4th
    6. Communication Systems Analog and Digital by R.P. Singh, S.D. Sapre,
    TMH, Edi 9th .
    7. Electronic Communications by Dennis Roddy and John Coolen (PHI), Edi 4th
    Paper Title: Analog and Digital Communication (Practical)
    Paper Code: IT 452 Max. Marks: 75 Time: 3 Hours
    1. To measure the modulation Index of AM signals using Trapezoidal Method.
    2. To study the voltages and waveforms of various stages of an AM
    Superheterodyne Receiver.
    3. To measure the sensitivity and selectivity of an Super heterodyne Radio Receiver.
    4. To measure the fidelity of an AM Superhetrodyne radio Receiver.
    5. To study DSB/SC AM signal and its demodulation using Product Detector Circuit
    (i) with dedicated wire
    (ii) with antenna
    6. To study the Frequency modulation and Demodulation circuits.
    7. To study the Pulse Code Modulation (PCM) and de-modulation circuits.
    8. To study the Time Division Multiplexing (TDM) and De-multiplexing circuits.
    9. To study delta and Sigma Delta modulation, demodulation circuits.
    Paper Title: Microprocessor (Theory)
    Paper Code: IT 403 Max Marks:100 Time : 3Hrs
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part-A and two from Part-B.
    Part-A
    Microprocessor Architecture and Microcomputer Systems: (06)
    Microprocessor Architecture, The 8085 MPU: Block Diagram, Pin Diagram,
    Address/Data Buses, Concept of demultiplexing of Buses, Control and status signals,
    Registers, Ports, Flags, Instruction Decoding and Execution, memory Interfacing.
    17
    Interfacing I/O Devices (06)
    Basic Interfacing Concepts, Interfacing Output Displays, Interfacing Input Devices,
    Memory- Mapped I/O .
    Programming the 8085: (07)
    Introduction to 8085 Assembly Language Programming, The 8085 Programming Model,
    Instruction Classification, Instruction Format. Data Transfer (Copy) Operations,
    Arithmetic Operations, Logic Operations, Branch Operations, Writing Assembly
    Language Programs.
    Programming Techniques with Additional Instructions: (06)
    Programming Techniques Looping, Counting and Indexing, Additional Data Transfer and
    16-Bit Arithmetic Instructions, Arithmetic Operations Related to Memory, Logic
    Operations.
    Part-B
    Counters and Time Delays: (06)
    Counters and Time Delays, Hexadecimal Counter, Modulo Ten, Counter, Generating
    Pulse Waveforms, Debugging Counter and Time-Delay Programs.
    Stack and Subroutines: (04)
    Stack, Subroutine, Conditional Call and Return Instructions.
    Interrupts: The 8085 Interrupt, 8085 Vectored interrupts. (03)
    General –Purpose Programmable Peripheral Devices: (07)
    Block Diagram, Working and Control word of: The 8255A Programmable Peripheral
    Interface, The 8259 A Programmable Interrupt Controller, Programmable
    communications interface 8251.
    Books Recommended
    1. Microprocessor Architecture, Programming and Applications with the 8085
    by Ramesh S.Gaonkar, PHI, Edi 3rd
    Reference Books:
    1 Advanced Microprocessors & Interfacing by Badri Ram, Tata McGraw Hill, Edi
    1st.
    2. Microprocessor Principles and Applications by Charles M.Gilmore, TMH Edi 2nd.
    3. Microprocessors and Interfacing programming and Hardware by Douglas V. Hall,
    TMH, Edi 2nd
    18
    Paper Title: Microprocessor(Practical)
    Paper Code: IT 453 Max Marks:75 Time : 3Hrs
    1. Familiarization of 8085 kits.
    2. Verification of arithmetic and logic operations using above kits.(At least 5
    programs)
    3. Development of interfacing circuits of various control applications based on
    8085.
    4. Application of assembly language using 8085 instructions set to develop
    various programs.
    5. Applications of data movement instructions to develop relevant programs.
    Paper title: Computer Architecture & Organization
    Paper Code: IT 404 Max Marks: 100 Time : 3Hrs
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part-A and two from Part-B.
    Part-A
    Design Methodology (04)
    System design, Design levels- Gate level, Register level, Processor level.
    Basic Computer Organization & Design (08)
    Instruction codes, common bus system, computer instruction, Design of basic computer,
    Design of accumulator logic.
    Control Design (08)
    Basic concepts, Hardwired control, Micro programmed control, Design of control unit.
    Central Processing Unit (08)
    Introduction, General reg. Organization, Inst. Formats Addressing modes, Data transfer
    & manipulation, RISC & CISC Characteristics.
    Part-B
    Input-Output Organization (06)
    I/O interface, Modes of transfer, Priority interrupts, DMA, I/O processor.
    19
    Memory Organization (06)
    Memory hierarchy, Main memory, Auxiliary memory, Associative memory. Cache
    memory, virtual memory, Memory management H/W.
    Parallel Processing (05)
    Introduction, Multiprocessors, Interconnection structure.
    Books Recommended
    1. Computer Architecture & Organization by J.P Hayes Edi 3rd TMH
    2. Computer System Architecture by Morris Mano, Edi 3rd PHI
    Reference Books
    1. Advanced Computer Architecture by Kai Hwang, TMH, Edi 1st.
    2. Computer Organization and Architecture by William Stallings, PHI, Edi 6th.
    20
    SYLLABUS FOR
    BACHELOR OF ENGINEERING (INFORMATION TECHNOLOGY)
    FIFTH SEMESTER
    Paper Title: WEB TECHNOLOGIES
    Paper Code: IT 511 Max. Marks: 100 Time: 3 Hours
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part-A and two from Part-B.
    PART-A
    Internet Basics: (07)
    Internet, Communication on the Internet; Internet services; types of accounts; Internet
    Domains; NIC; IP addresses; Web Servers; review of TCP/IP; HTTP; telnet; ftp; WWW
    concepts; web site creation concepts; web commerce; Internet telephony.
    HTML: (08)
    HTML basics; HTML tags; text formatting; text styles; lists ordered, unordered and
    definition lists; layouts; adding graphics; tables; linking documents; images as
    hyperlinks; frames and layers; DHTML, style sheets.
    Java Script: (06)
    Advantages of Java Script; writing Java Script into HTML; Java Script data types,
    variables, operators and expressions; arrays and functions in Java Script; condition
    checking; loops; dialogue boxes.
    PART-B
    Advanced Java Script: (08)
    Java Script document object model; Java Script assisted style sheets; events handling in
    Java Script; browser objects; form objects; built-in and user defined objects; cookies.
    ASP: (l6)
    Origin of ASP; how ASP works; ASP objects, Application object; ASP Error object;
    Request object; Response object; Server object; Session object; Scripting objects;
    Active Server Components; Active X Data Objects, Comparison with CGI-Perl, JSP and
    PHP.
    BOOKS RECOMMENDED
    1. Ivan Bayross : Web Enabled Commercial Application Development Using
    HTML, DHTML, Java Script, Perl CGl, BPB, 2nd Edition.
    21
    2. Richard Anderson, Dan Denault : ASP 3.0 : Programmer's Reference, Wrox.
    Publications, 1st Edition.
    Paper Title: WEB TECHNOLOGIES
    Paper Code: IT-511 Max.Marks:75 Time: 3 Hours
    Practical based on theory.
    Paper Title: DATA BASE MANAGEMENT SYSTEMS
    Paper Code: IT-512 Max.Marks:100 Time: 3 Hours
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part A and two from Part B.
    PART-A
    Data Base Concepts: (04)
    Data Base vs. File oriented approach, Basic DBMS terminology, Data independence,
    General Architecture of a Data Base Management Software, Components of DBMS.
    Data Base Design: (05)
    Introduction to Data Models, Entity Relationship Model, Entities, Attributes, E-R
    Diagrams, Conceptual Design of a relational data base model.
    Data Normalization: (06)
    Introduction, Keys, First Normal form, Second Normal form, Third Normal form, Boyce
    Codd Normal form, Denormalization, case studies of Data Normalization.
    Transaction Processing Concepts: (06)
    Schedules and recoverability, serializability, locking techniques, timestamp ordering,
    granularity, multiversion concurrency control.
    22
    PART-B
    Structured Query Language(SQL): (08)
    Introduction to SQL, Data types, Querying database tables, Conditional retrieval of rows,
    Working with Null Values, Matching a pattern from a table, Ordering the Result of a
    Query, Aggregate Functions, Grouping the Result of a Query, Insert statement, Update &
    Delete statement, Alter & Drop statements, Querying Multiple Tables: Joins, Equi Joins,
    Inner Joins, Outer Joins, Self Joins; SET Operators: Union, Intersect, Minus; Nested
    Queries. Functions: Arithmetic, Character, Date and General Functions; Group
    Functions.
    Data Manipulation and Control: (08)
    Data Definition Language (DDL), Creating Tables, Creating a Table with data from
    another table, Inserting Values into a Table, Updating Column(s) of a Table, Deleting
    Row(s) from a Table, Dropping a Column, Introduction to VIEWs, Manipulating the
    Base table(s) through VIEWs, Rules of DML Statements on Join Views, Dropping a
    VIEW, Inline Views, Materialized Views. Database Security and Privileges, GRANT
    Command, REVOKE Command, C 23. pUSQL (06) OMMIT and ROLLBACK.
    PL/SQL: (06)
    Introduction to PL/SQL, PL/SQL Block Structure, PL/SQL Architecture, Fundamentals
    of PL/SQL, PL/SQL Data Types, Variables and Constants, Scope and Visibility of a
    Variable, Assignments and Expressions, Operator Precedence, Referencing Non-PL/SQL
    Variables, Built-in-Functions, Conditional and Iterative Control, SQL within PL/SQL,
    Writing PL/SQL Code, Composite Data types. Cursor Management in PL/SQL, Cursor
    Manipulation, Implicit Cursor Attributes. Exception Handling in PL/SQL; Predefined
    Exceptions, User Defined Exceptions.
    Relational Queries: (02)
    Relational Algebra and Calculus, Preliminaries, Relational Algebra, Relational Calculus,
    Expressive Power of Algebra and Calculus, Points to review.
    BOOKS RECOMMENDED:
    C.J Date : An Introduction to Database Systems, Pearson, 7th Edition.
    Reference Books :
    1. Toledo : Schaum's Outlines Fundamentals of Relational Databases, Tata McGraw
    Hill, 1stEdition.
    2. James Martin : Database Management Systems, PHI, 1st Edition.
    23
    3. Ullman : Database Management Systems, Pearson, 1st tEdition.
    4. Raghu RamakTishnan and Johannes Gehrke : Database Management Systems,
    McGraw Hill, 3rd Edition.
    5. Desai, Bipin C.: Introduction to Database Systems, Galgotia Publications, Latest
    Edition.
    Paper Title: DATA BASE MANAGEM.ENT SYSTEMS
    Paper Code: IT-562 Max.Marks:75 Time: 3 Hours
    Practical based on theory
    Paper Title: WIRELESS COMMUNICATION
    Paper Code: IT-513 Max.Marks100 Time: 3 Hours
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part A and two from Part B.
    Introduction: (09)
    Evolution of Mobile Communication Systems, Paging systems, cordless telephone
    systems, cellular telephone systems, comparison of common wireless communication
    systems.
    System Design Fundamentals : (13)
    Frequency reuse, Channel assignment strategies, handoff strategies, interference,
    improving coverage and capacity in cellular systems, mechanism for capacity
    improvement--cell splitting, cell sectoring and microcell zone concept, modulation
    techniques.
    Wireless System: (08)
    GSM, GSM reference architecture and GSM security architecture, CDMA digital cellular
    standard, IS-95 system.
    PART-B
    Channel Impairment Mitigation Techniques : (05)
    Introduction, Power control, Diversity techniques : Frequency Diversity, Time Diversity,
    24
    Space Diversity, Path Diversity, Channel Equalization, Rake receiver, Channel coding
    and interleaving.
    Multiple Access Techniques: (06)
    Simplex, Duplex, Time Division Duplex, Frequency Division Duplex FDMA, TDMA,
    CDMA, SDMA, OFDM, Hybrid Multiple Access.
    Migration to 3G Technologies : (04)
    Wi-Fi, WiMax, EDGE, Bluetooth, cdma-2000.
    Books Recommended:
    1. Theodore S. Rappaport: Wireless Communications-Principles and
    Practice, Prentice Hall India, 2"d Edition.
    2. Sanjay Sharma Wireless and Cellular Communication, S.K.
    Kataria & Sons Publishers.
    3. Raj Pandya Mobile and Personal Communication
    Systems and Services, IEEE Press.
    25
    Paper Title: WIRELESS COMMUNICATION
    Paper Code: IT-563 Max.Marks75 Time: 3 Hours
    Practical based on theory
    Paper Title: ENTERPRISE RESOURCE PLANNING
    Paper Code: IT-514 Max.Marks100 Time: 3 Hours
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part A and two from Part B.
    PART-A
    Introduction to ERP: (03)
    Introduction, Evolution of ERP, What is ERP, Reasons for the growth of the ERP market,
    Advantages of ERP.
    Enterprise--An Overview: (03)
    Introduction, Integrated Management Information, Business Modeling, Integrated Data
    Model.
    ERP and Related Technologies: (06)
    Introduction, Business Process Re-Engineering (BPR), Management Information
    Systems (MIS), Decision Support System (DSS), Executive Information System (EIS),
    Data Warehousing, Data Mining, On-line Analytical Processing (OLAP), Supply Chain
    Management.
    ERP-A Manufacturing Perspective: (09)
    Introduction, ERP, CAD/CAM, Materials Requirement Planning (MRP), Bill of Material
    (BOM), Closed Loop MRP, Manufacturing Resource Planning (MRP-II), Distribution
    Requirement Planning (DRP), JIT and Kanban, Computer-Aided-Design/Computer-
    Aided-Manufacturing (CAD/CAM), Product Data Management (PDM), Data
    Management, Benefits of PDM, Make-to-order (MTO) and Make-to-Stock (MTS),
    Assemble-to-order (A TO), Engineer-to-order (ETO), Configure-to-order (CTO).
    26
    PART-B
    ERP Modules: (06)
    Introduction, Finance, Plant Maintenance, Quality Management, Material Management.
    Benefits of ERP: (06)
    Introduction, Reduction of Lead-Time, On-time Shipment, Reduction in Cycle Time,
    Improved Resource Utilization, Better Customer Satisfaction, Improved Supplier
    Performance, Increased Flexibility, Reduced Quality Costs, Improved Information
    Accuracy & Decision-making capability.
    ERP Market : (03)
    Introduction, SAP AGBaan Company, Oracle Corporation, People Soft, J.D. Edwards
    World Solutions Company, System Software Associates, Inc. (SSA) Q.A.
    ERP Implementation Lifecycle: (03)
    Introduction, Pre-evaluation Screening, Package Evaluation, Project Planning Phase, Gap
    Analysis , Reengineering, Configuration Implementation Team Training, Testing Going
    Live, End-user Training, Post-implementation (Maintenance mode).
    Vendors, Consultants and Users : (03)
    Introduction, In-house Implementation -Pros and Cons, Vendors, Consultants, End-Users.
    Future Directions in ERP : (03)
    Introduction, New Markets, New Channels, Faster Implementation Methodologies,
    Business Models and BAPIs, Convergence on Windows NT, Application Platforms, New
    Business Segment, More Features, Web Enabling, Market Snapshot.
    Book Recommended:
    Alexis Leon : Enterprise Resource Planning, TMH, 1st Edition.
    4.Note: Examiner shall set ~ight questions, four from Part-A and syllabus. . four from Part-B of the
    27
    Paper Title: SYSTEM SOFTWARE
    Paper Code: IT-515 Max.Marks100 Time: 3 Hours
    Course Duration: 45 Lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
    syllabus. Candidate will be required to attempt any five questions selecting at least two
    questions from Part A and two from Part B.
    PART-A
    Introduction : (6Hrs)
    System software and machine architecture. Simplified Instructional Computer (SIC),
    Traditional CISC and RISC Machines.
    Assemblers : (8 Hrs)
    Basic assembler functions, Machine-dependent assembler features, Machine-
    Independent assembler features, Assembler Design options, Implementation examples:
    AIX Assembler.
    Macro Processors : (8 Hrs)
    Basic Macro processor functions, Machine-Independent Macro processor features,
    Design options.
    PART-B
    Loader and Linkers : (7 Hrs)
    Basic loader functions, Machine dependent Loader features, Machine-Independent
    Loader features, Loader Design options, Implementation examples.
    Compilers: (10 Hrs)
    Basic Compiler functions, Machine dependent compiler features, Machine Independent
    compiler features, and Compiler Design options.
    Software Engineering Issues: (06 Hrs)
    Introduction to Software Engineering concepts, System Specifications, Procedural
    System Design, Object-Oriented System design.
    Text Book :
    Leland L. Beck : System Software, An Introduction to System
    Programming, 3rd Edition, Addison Wesley.
    28
    Reference Books :
    1. D.M Dhamdere : System Programming and Operating
    System, 2nd Edition, TMH.
    2. Mednick & Donovan : System Programming, TMH
    29
    SYLLABUS FOR
    BACHELOR OF ENGINEERING (INFORMATION TECHNOLOGY)
    SIXTH SEMESTER
    Paper Title: COMPUTER GRAPHICS
    Paper Code: IT 611 Max. Marks: 100 Time: 3 Hours
    Course Duration: 45 lectures of one hour each
    Note: Examiner shall set eight questions, four from Part – A and four from Part – B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two questions from Part B.
    PART-A
    Introduction to Computer Graphics: 7 Hrs
    Applications of computer graphics, Picture representation, color table, Video Display
    Devices-Raster Scan Systems, Random Scan Systems, Input Devices, Output
    primitives.
    Raster Scan Graphics: 7 Hrs
    Scan conversion, Frame buffer, Bresenham's line and circle drawing algorithms, Scan-
    Line Polygon Fill Algorithm, Inside-Outside Tests, Boundary-Fill Algorithm, Flood-
    Fill Algorithm, Antialiasing and Halftoning, Character Generation, Attributes of lines.
    Segments: 6 Hrs
    Segments table, creating, deleting and renaming segments, visibility, image
    transformations.
    Transformations: 7 Hrs
    Geometric Transformations : Matrices, Translation, Scaling, Rotation, Homogeneous
    Coordinates, Composite Transformation Matrix, Coordinate Transformation, Rotation
    about an arbitrary point, Inverse Transformations, Other transformations.
    PART-B
    Windowing and Clipping: 8 Hrs
    Viewing transformation and clipping, The Cohen-Sutherland algorithm, The
    Sutherland-Hodgman Algorithm, The clipping of polygons.
    Three Dimension: 5 Hrs
    3-D geometry, 3-D primitives, 3-D transformations, rotation about arbitrary axis,
    parallel projection, perspective projection, viewing parameters, conversion to view
    plane coordinates.
    30
    Hidden Line and Surface: 5 Hrs
    Back face removal algorithms, hidden line methods.
    Text Book:
    Donald Hearn and M. Pauline Baker : Computer Graphics, Prentice Hall Of
    India.
    Reference Books:
    1. Newman and Sproul : Principle of Interactive Computer
    Graphics, McGraw Hill
    2. Steven Harrington : Computer Graphics, A Programming
    Approach, Second edition, McGraw Hill.
    3. Rogar and Adams : Mathematical elements of Computer
    Graphics, McGraw Hill
    4. N KrishnaMurthy : Introduction to Computer Graphics,
    Tata McGraw Hill
    Paper Title: COMPUTER GRAPHICS
    Paper Code: IT 661 Max. Marks: 75 Time: 3 Hours
    Practical Based on Theory
    Paper Title: SOFTWARE ENGINEERING
    Paper Code: IT 612 Max. Marks: 100 Time: 3 Hours
    Course Duration: 45 lectures of one hour each
    Note: Examiner shall set eight questions, four from Part – A and four from Part – B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two questions from Part B.
    PART-A
    Software Evolution: (06)
    Software products, Evolving role of software, software crisis, S/W engineering- a
    Layered Technology, Software process models.
    Project Management Concepts: (06)
    People, The problem, The process, S/W measurement, project metrics.
    S/W Project Planning: (04)
    Project estimation, Empirical Estimation Models, COCOMO Model.
    31
    Risk Management: (04)
    Reactive vs. Proactive risk strategies, S/W Risks, Risk Identification, Projection, Risk
    Mitigation, Monitoring and Management.
    S/W Quality Assurance: (06)
    S/W quality concept, SQA- S/W quality assurance activities, reviews, SQA plan, ISO
    9000 Quality standards, ISO approach to quality assurance systems.
    PART- B
    S/W Configuration Management: (04)
    Baselines, S/W configuration Items, SCM process, Version Control, Change Control
    Design: (05)
    Design Concepts and Principles, Modular Design, Design Methods
    S/W Testing Methods: (06)
    Testing Fundamentals, test case design, White box testing, Black box testing, Testing
    Strategies, Verification & Validation, Unit, Integration, Validation, System Testing.
    Computer Aided S/W Engineering: (04)
    CASE, Building Blocks for CASE, Integrated CASE environment
    Books Recommended:
    Roger S. Pressman : S/W Engineering- A Practitioner’s Approach, McGraw Hill
    International Editions, 4th edition
    Reference Books:
    Ian Somerville : S/W Engineering, Addison Wesley, 7th Edition
    Jalote : S/W Engineering, Pearson First Edition
    Paper Title: SOFTWARE ENGINEERING
    Paper Code: IT 662 Max. Marks: 75 Time: 3 Hours
    Practical Based On Theory
    32
    Paper Title: NETWORK SECURITY AND CRYPTOGRAPHY
    Paper Code: IT 613 Max. Marks: 100 Time: 3 Hours
    Course Duration: 45 lectures of one hour each
    Note: Examiner shall set eight questions, four from Part – A and four from Part – B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two questions from Part B.
    PART- A
    Basic Encryption and Decryption: (05)
    Attackers and Types of threats, challenges for information security, Encryption
    Techniques, Classical Cryptographic Algorithms : Monoalphabetic Substitutions such
    as the Caesar Cipher, Cryptanalysis of Monoalphabetic Ciphers, Polyalphabetic Ciphers
    such as Vigenere, Vernam Cipher.
    Stream and Block Ciphers: (07)
    Rotor based system and shift register based systems. Block cipher: Principles, Modes
    of operations. The Data Encryption Standard (DES), Analyzing and Strengthening of
    DES, Introduction to Advance Encryption Standard (AES).
    Number Theory and Basic Algebra: (05)
    Modular Arithmetic, Euclidean algorithm, Random number generation.
    Key Management Protocols: (05)
    Solving Key Distribution Problem, Diffie-Hellman Algorithm, Key Exchange with
    Public Key Cryptography ..
    PART-B
    Public Key Encryption Systems: (08)
    Concept and Characteristics of Public Key Encryption system, Rivest-Shamir-Adlman
    (RSA) Encryption, Digital Signature Algorithms and authentication protocol, the
    Digital Signature Standard (DSS).
    Hash Algorithms : (05)
    Hash concept, description of Hash Algorithms, Message Digest Algorithms such as
    MD4 and MD5, Secure Hash Algorithms such as SHA-1 and SHA-2.
    Network Security: (05)
    Kerberos, IP security: Architecture, Authentication Header, Encapsulating Security
    Payload.
    Web Security: (05)
    Web security consideration, secure socket Layer protocol, Transport Layer Security
    Secure Electronic Transaction Protocol.
    33
    Books Recommended:
    William Stallings : Principles of Cryptography, Pearson Education, Latest edition
    Reference Books:
    Charles. P. Pfleegar : Security in Computing,
    Prentice Hall International,
    Inc., 2nd Edition 1996
    Atul Kahate : Cryptography and Network
    Security, TMH, Latest edition
    Behrooz A. Forouzan : Cryptography and Network
    Security, McGraw Hill, Latest
    edition
    Bill Cheswis and Steve Bellovin : Firewalls and internet
    Security, Addison Wesley,
    Latest Edition
    Rolf Oppliger : Security Technologies for the
    world wide web, Artech
    House, Inc., Latest edition
    Jalal Feghhi, Jalli Feghhi and Peter Williams : Digital Certificates Applied
    Internet Security, Addison
    Wesley Longman, Inc.,Latest
    Edition
    Paper Title: Network Security and Cryptography
    Paper Code: IT 663 Max. Marks: 75 Time: 3 Hours
    Practical Based On Theory
    34
    Paper Title: NETWORK TECHNOLOGY
    Paper Code: IT 614 Max. Marks: 100 Time: 3 Hours
    Course Duration: 45 lectures of one hour each
    Note: Examiner shall set eight questions, four from Part – A and four from Part – B of
    the syllabus.Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two questions from Part B.
    PART- A
    Introduction: (08)
    Overview of Local Area Networks: Basic LAN terminology, LAN Standards, How
    LANs operate, LAN Topologies, Example Applications of LANs, Overview of Wide
    Area Networks : WAN Architecture, W AN Transmission Mechanism, WAN
    Addressing, LAN Access Techniques : Performance measures and Notation, Random
    Access Overview, ALOHA, CSMA, CSMA/CD Controlled Access Schemes, Switched
    Access Methods.
    LAN Technologies: (15)
    Ethernet: Overview of Ethernet (IEEE 802.3), Standard Ethernet, Fast Ethernet,
    Switched Ethernet, Gigabit Ethernet, Ten Gigabit Ethernet Token Passing LANs :
    Token Bus (IEEE 802.4), Token Ring (IEEE 802.5), FDDI ATM, LANs : ATM LAN
    Architecture, LAN Emulation (LANE), Client Server Model, LANE Operation, Frame
    Format Wireless LANs : Wireless LAN Concepts, IEEE 802.11 -MAC Layer and
    Physical Layer Storage Area Networks: Basic features only.
    PART-B
    Network Interconnections: (08)
    Internetworking Concepts, Repeaters, Hubs, Bridges-remote, transparent, source
    routing, Routers, Multiprotocol Routers and Tunneling, Half Bridge Configuration of
    Routers, Switches, Gateways and Protocol Converters, Virtual LANs.
    WAN Technologies: (08)
    Frame Relay: Introduction, Frame Relay Operation, Frame Relay Layers.
    ATM : Introduction, ATM Architecture, ATM Cell Structure, Switching, ATM Layers,
    ATM Service Categories.
    Bluetooth : (06)
    Architecture, applications, protocol stack, radio, baseband and L2CAP, Layer, frame
    structure.
    Books Recommended:
    G. Keiser : Local Area Networks, TMH,
    second edition 2002
    Reference Books:
    B.A. Forouzan : Local Area Networks,
    35
    TMH, First edition 2003
    A.L.Garcia and I. widraje : Communication Networks,
    TMH, Second Edition, 2004
    W.Stallings : Data and Computer
    Communications, Pearson Education
    Asia, 2001, 6th edition
    A.S.Godbole : Data Communications and
    Networks, TMH, 2002 Latest
    Edition
    B.A.Forouzan : Data Communications and
    Networking, TMH,2003, 2nd edition
    Andrew S. Tanenbaum : Computer Networks, 2003,
    4th Edition
    Mani Subramaniam : Network Management,
    Principles and Practise, 2003, latest
    Edition
    Paper Title: DATA MINING AND WAREHOUSING
    Paper Code: IT 615 Max. Marks: 100 Time: 3 Hours
    Course Duration: 45 lectures of one hour each
    Note: Examiner shall set eight questions, four from Part – A and four from Part – B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two questions from Part B.
    PART-A
    Introduction to Data Warehousing (03)
    Data Warehousing Definition and characteristics, need for data warehousing, DBMS vs.
    data warehouse, OLAP.
    Data Warehousing Components (05)
    Overall Architecture, Data Warehouse Database, Sourcing Acquisition, Cleanup and
    Transformation Tools, Metadata Access Tools, Data Marts, Data Warehouse
    Administration and Management, Information Delivery Systems.
    Mapping the Data Warehouse to a Multiprocessor Architecture (05)
    Relational Database Technology for Data warehouse, Database Architectures for Parallel
    Processing, Parallel RDBMS features, Alternative Technologies, Parallel DBMS
    Vendors.
    36
    Introduction to Data Mining (08)
    Functionalities, classification data mining systems, Multidimensional data model, data
    cubes, Schemas for multidimensional databases, OLAP operations, Data Marts,
    Metadata.
    Part B
    Data Preprocessing (06)
    Data cleaning, integration and transformation, Data reduction, Discretization and Concept
    Hierarchy Generation.
    Concept Description (06)
    Data Mining techniques-Concept description, attribute oriented induction, analytical
    characterization, mining class comparisons, mining descriptive statistical measures.
    Association Rule Mining (08)
    Mining single dimension rules from transactional databases, Apriori algorithm,
    efficiency, mining rules without candidate generation.
    Applications and Trends In Data Mining (04)
    Commercial Importance of DW, applications of data mining, data mining in business
    process, Embedded data mining.
    Recommended Books
    1. Data Mining –Concepts & Techniques; Jiawei Han & Micheline Kamber, Morgan
    Kaugmann Publishers.
    2. Data Warehousing in the Real World; Sam Anahory & Dennis Murray; Pearson
    Education
    3. “Data Mining” by Pieter Adrians, Dolf Zantinge, Addison Wesley, 2000.
    4. Data Mining; Pieter Adriaans & Dolf Zantinge; 1997, Pearson
    5. Data Warehousing, Data Mining and OLTP; Alex Berson, 1997, McGraw Hill.
    6. Data Warehousing System; Mallach; 2000, McGraw Hill.
    7. Building the Data Warehouses; W.H.Longhman, C.Klelly, John wiley & Sons.
    8. “Data Warehousing: Concepts, Techniques, Products and Applications”, by
    C.S.R. Prabhu Prentice Hall of India.
    37
    SYLLABUS FOR B.E. (Information Technology) Seventh Semester
    Paper Title: Multimedia Systems
    Paper Code: IT 711 Max. Marks: 100 Time: 3 hours
    Course duration: 45 lectures of one hour duration each
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two from Part B.
    Part - A
    Introduction: (05)
    Multimedia and its types, Introduction to Hypermedia, Hyper Text, Multimedia
    Systems and their Characteristics, Challenges, Desirable Features, Components and
    Applications, Trends in Multimedia.
    Multimedia Technology: (06)
    Multimedia Systems Technology , Multimedia Hardware devices, Multimedia
    software development tools, Multimedia Authoring Tools, Multimedia Standards for
    Document Architecture, SGML, ODA, Multimedia Standards for Document
    interchange, MHEG, Multimedia Software for different media.
    Storage Media : (05)
    Magnetic and Optical Media, RAID and its levels, Compact Disc and its standards,
    DVD and its standards, Multimedia Servers.
    Audio: (05)
    Basics of Digital Audio, Application of Digital Audio, Digitization of Sound, Sample
    Rates and Bit Size, Nyquist's Sampling Theorem Typical Audio Formats Delivering
    Audio over a Network , Introduction to MIDI (Musical Instrument Digital Interface),
    Components of a MIDI System Hardware Aspects of MIDI ,MIDI Messages
    Part - B
    Image,Graphics and Video: (06)
    Graphic/Image File Formats, Graphic/Image Data, Colour in Image and Video,
    Colour Image and Video Representations, Basics of Video ,Types of Colour Video
    Signals, Analog Video, Digital Video, TV standards.
    Video and Audio Compression: (12)
    Classifying Compression Algorithms, Lossless Compression Algorithms, Entropy
    Encoding, Run-length Encoding, Pattern Substitution, Basics of Information theory,
    Huffman Coding, Huffman Coding of Images, Adaptive Huffman Coding, Arithmetic
    Coding, Lempel-Ziv-Welch (LZW) Algorithm, Source Coding Techniques ,
    Transform Coding, Frequency Domain Methods, Differential Encoding, Vector
    Quantization, JPEG Compression, Video Compression, H.261 Compression, Intra
    Frame Coding, Inter-frame (P-frame) Coding, MPEG Compression, MPEG Video,
    The MPEG Video Bitstream , Decoding MPEG Video in Software , Audio
    38
    Compression, Simple Audio Compression Methods, Psychoacoustics ,MPEG Audio
    Compression
    Multimedia Communication: (06)
    Building Communication network, Application Subsystem, Transport Subsystem,
    QOS, Resource Management, Distributed Multimedia Systems
    Books Recommended:
    Multimedia Computing Communications and Applications by Ralf , Steinmetz and
    Klara Nahrstedt, Pearson Education, Latest Edition.
    Reference Books:
    1. Multimedia System Design By Prabhat K. Andleigh, Kran Thakkar, PHI, Latest
    Edition
    2. Multimedia Computing By Li, Drew, Pearson Education, Edi 3rd.
    3. Multimedia Communications By Fred Halsall, Pearson Education, Latest Edition
    Paper Title: Multimedia Systems
    Paper code: IT 761 Max. Marks 50 Time: 3Hrs
    Practical related to all of the following
    1. Multimedia Authoring Systems
    2. Programming in Multimedia Authoring Systems
    3. Creating Presentation using Flash Media
    4. Designing Hypertext and Hypermedia Systems
    5. SMIL
    6. Programming in Multimedia API in any Language
    7. Programming of Various Compression Standards
    8. Multimedia System Design Project For Application areas such as
    Education, Sales, Medical, Communication, Marketing etc
    Paper Title: Digital Signal Processing
    Paper code: IT 712 Max. Marks: 100 Time: 3 hours
    Course duration: 45 lectures of one hour duration each
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two from Part B.
    Part - A
    Introduction to Digital Signal Processing (04)
    Applications and advantages of DSP. Sampling theorem, concept of frequency in
    discrete time signals.
    39
    Discrete Time Signals and Systems (08)
    Classification of signals, standard signals and classification of discrete time systems.
    Linear Time Invariant systems and their representation by difference equations and
    structures.
    Z- Transform (04)
    Definition of direct, inverse z-transform and its properties. System function of a LTI
    system. Inverse z-transform by power series expansion and partial fraction expansion.
    Frequency Analysis (08)
    Fourier series and transform of discrete time signals and properties (DTFT). Discrete
    Fourier Transform and its properties. Fast Fourier Transform algorithms, decimation
    in time and decimation in frequency algorithms (radix 2).
    Part – B
    Realization of FIR & IIR Systems: (04)
    Direct forms, cascade and parallel form IIR structures. Direct form, cascade and linear
    phase FIR structures.
    Design of Digital Filters: (12)
    Comparison of Analog and Digital filters, Comparison of IIR and FIR filters. FIR
    Filters and linear phase requirement. FIR filters design using the window technique.
    IIR Filters and their design using the impulse invariance technique and bilinear
    transformation. Finite word length effects.
    DSP Processors (05)
    Introduction to DSP Processors, architecture of TMS 320CXX and ADSP 21XX
    Books Recommended:
    1. Digital Signal Processing: Principles, Algorithms and Applications. by
    Proakis & Manolakis, Pearson, Edi 3rd.
    2. Digital Signal Processing by E C Ifeacher and B W Jervis, Latest Edition.
    3. Digital Signal Processing by S Salivaharan, A Vallavraj, C Granapriya,
    TMH, Edi 1st.
    4. Digital Signal Processing by Sanjay Sharma, Publisher- S.K. Kataria &
    Sons.
    Paper Title: Digital Signal Processing (Practical)
    Paper code: IT762 Max. Marks 50 Time: 3 hrs
    Practical based on theory.
    40
    Paper Title: Unix Network Programming
    Paper Code: IT713 Max Marks 100 Time: 3 hrs
    Course Duration: 45 lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two from Part B.
    Part - A
    Overview of the UNIX Operating System (05)
    Various commands of Unix Shell Programming, features of Korn shell, Bourne shell
    and C shell.
    Unix Model (05)
    Basic definitions- kernel, process, system calls, environment list, shadow passwords,
    shells, IDs, permissions; Input and Output- open, create, close, read, write, lseek, dup
    and dup2, fcntl, ioctl System Calls; Process control- fork, exit, exec, wait, wait3
    System Calls, process relationships, file sharing; Daemon Processes.
    Inter process Communication (09)
    Introduction, File and Record Locking, Advisory vs Mandatory locking, other Unix
    locking techniques, Pipes, FIFOs, Streams & messages, Namespaces, Message
    Queues, Semaphores, Shared memory, Sockets & TLI.
    Part - B
    Communication Protocol: (08)
    Introduction, TCP, IP, XNS, UDP, SPP, PEX, SNA, NetBIOS, OSI Protocols, UUCP,
    Protocol comparisons.
    Berkeley Sockets: (07)
    Introduction, Overview, Unix Domain protocols, Socket Address, Elementary Socket
    System Calls, Advanced Calls, Reserved Ports, Stream Pipes, Passing Files
    descriptor, Socket Options, Asynchronous I/O, Input/Output Multiplexing, Out-of-
    Band Data, Sockets and Signals, Socket Implementation.
    System V Transport Layer interface: (06)
    Introduction, Transport End Point Addresses, Elementary TLI functions, Advanced
    TLI functions, Streams, TLI Implementation.
    Brief overview: (05)
    Ping Routines, Internet Ping Client, TFTP- protocol, security, data formats,
    connections, Remote Login- Terminal Line disciplines, Pseudo-terminals, Terminal
    modes, Control terminals.
    Books Recommended:
    1. Unix Network Programming by W. Richard Stevens, PHI. Edi 2nd .
    41
    2. Unix Shell Programming by Yashavant Kanetkar, BPB publications. Latest Edition.
    Paper Title: Unix Network Programming
    Paper code: IT 763 Max. Marks 50 Time: 3 Hours
    Practical based on theory.
    ELECTIVE-I
    Paper Title: Reliability Engineering
    Paper Code: IT714 Max. Marks: 100 Time: 3Hours
    Course Duration: 45 lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two from Part B.
    Part - A
    Basic Reliability Models: (03)
    The Reliability Function, Mean Time to Failure, Hazard Rate Function, Bathtub
    Curve, Conditional Reliability.
    Constant Failure Rate Model: (03)
    The Exponential Reliability Function, Failure Modes, Applications. The Two-
    Parameter Exponential Distribution, Poisson Process, Redundancy and the CTR
    Model.
    Time- Dependent Failure Models (04)
    The Weibull Distribution, the Normal Distribution, the Log Normal Distribution.
    Reliability of Systems (05)
    Serial Configuration, Parallel Configuration, Combined Series- Parallel
    Configuration, System Structure Function, Minimal Cuts and Minimal Paths.
    Common- Mode Failures, Three- State Devices.
    State- Dependent Systems (04)
    Markov Analysis, Load- sharing Systems, Standby Systems , Degraded systems,
    Three State Devices Covariate Models, Static Models, Dynamic Models, Physics of
    Failure Models.
    Physical Models For Reliability (04)
    Covariate Models, State Models Static Models , Dynamic Models, Physics of failure
    Models
    42
    Part - B
    Design for Reliability (06)
    Reliability Specification and Systems Measurements, Reliability Allocation, Design
    Methods, Failure Analysis, System Safety and Fault Tree Analysis.
    Maintainability (08)
    Analysis of Downtime, Repair time Distribution, Stochastic Point Process, System
    Repair Time Reliability under Preventive Maintenance, State- Dependent Systems
    with Repair, Maintenance requirements, Design Methods, Human Factors and
    Ergonomics, Maintenance and Spares provisioning, Maintainability Prediction and
    Demonstration.
    Availability (04)
    Concepts and definitions, Exponential Availability model, System availability,
    Inspection and repair Available Model, Design trade-off Analysis.
    Reliability Testing (04)
    Product Testing, reliability Life Testing, test time Calculation, Burn-in Testing,
    Acceptance testing Accelerated Life testing Experimental Design, Competing Failure
    Modes.
    Books Recommended:
    1. Reliability and maintainability Engg. by Charles E. Ebeling( Tata McGraw
    Hill), Edi 1st.
    2. Reliability Engineering by Govil, Edi 2nd .
    3. Reliability Engineering by K.K.Aggarwal, Edi 3rd .
    Paper Title: Reliability Engineering (Practical)
    Paper code: IT764 Max. Marks 50 Time: 3Hrs
    Practical based on theory.
    Paper title: Soft Computing
    Paper Code: IT714 Max. Marks: 100 Time: 3 hours
    Course Duration: 45 lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two from Part B.
    Part - A
    Neural Networks: (05)
    History, overview of biological Neuro-system, Mathematical Models of Neurons,
    ANN architecture, Learning rules, Learning Paradigms-Supervised, Unsupervised and
    reinforcement Learning, ANN training Algorithms-perceptrons, Training rules, Delta,
    43
    Back Propagation Algorithm, Multilayer Perceptron Model, Hopfield Networks,
    Associative Memories, Applications of Artificial Neural Networks.
    Fuzzy Logic: (04)
    Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical Sets,
    Membership Function, Fuzzy rule generation.
    Operations on Fuzzy Sets: (05)
    Compliment, Intersections, Unions, Combinations of Operations, Aggregation
    Operations.
    Fuzzy Arithmetic: (06)
    Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals &
    Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations.
    Part – B
    Fuzzy Logic: 05)
    Classical Logic, Multivalued Logic, Fuzzy Propositions, Fuzzy Qualifiers, Linguistic
    Hedges.
    Uncertainty based Information: (05)
    Information & Uncertainty, Nonspecificity of Fuzzy & Crisp Sets, Fuzziness of Fuzzy
    Sets.
    Introduction of Neuro-Fuzzy Systems: (05)
    Architecture of Neuro Fuzzy Networks.
    Application of Fuzzy Logic: (04)
    Medicine, Economics etc.
    Genetic Algorithm: (06)
    An Overview, GA in problem solving, Implementation of GA
    Books Recommended:
    1. “An Introduction to Neural Networks”, Anderson J.A., PHI, 1999.
    2. “Introduction to the Theory of Neural Computation”, Hertz J. Krogh, R.G. Palmer,
    Addison-Wesley, California, 1991.
    3. “Fuzzy Sets & Fuzzy Logic”, G.J. Klir & B. Yuan, PHI, 1995.
    4. “An Introduction to Genetic Algorithm”, Melanie Mitchell, PHI, 1998.
    Reference:
    1. “Neural Networks-A Comprehensive Foundations”, Prentice-Hall International,
    New Jersey, 1999.
    2. “Neural Networks: Algorithms, Applications and Programming Techniques”,
    Freeman J.A. & D.M. Skapura, Addison Wesley, Reading, Mass, (1992).
    44
    Paper Title: Soft Computing (Practical)
    Paper code: IT764 Max. Marks 50 Time: 3Hrs
    Practical based on theory.
    Paper Title: Artificial Intelligence
    Paper Code: IT714 Max. Marks: 100 Time: 3 hours
    Course Duration: 45 lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two from Part B.
    Part – A
    Introduction: (06)
    Artificial Intelligence and its applications, Artificial Intelligence Techniques, criteria
    of success, Intelligent Agents, Nature and structure of Agents, Learning Agents
    Problem solving techniques: (09)
    State space search, control strategies, heuristic search, problem characteristics,
    production system characteristics., Generate and test, Hill climbing, best first search,
    A* search, Constraint satisfaction problem, Mean-end analysis, Min-Max Search,
    Alpha-Beta Pruning, Additional refinements, Iterative Deepening
    Knowledge representation: (08)
    Mapping between facts and representations, Approaches to knowledge representation,
    procedural vs. declarative knowledge, Forward vs. Backward reasoning, Matching,
    conflict resolution, Non-monotonic reasoning, Default reasoning, statistical reasoning,
    fuzzy logic Weak and Strong filler structures, semantic nets, frame, conceptual
    dependency, scripts.
    Part – B
    Planning: (06)
    The Planning problem, planning with state space search, partial order planning,
    planning graphs, planning with propositional logic, Analysis of planning approaches,
    Hierarchical planning, conditional planning, Continuous and Multi Agent planning
    Learning : (10)
    Forms of Learning, inductive learning, Decision trees, Computational learning theory,
    Logical formulation, knowledge in learning, Explanation based and relevance based
    learning, statistical learning, Learning with complete data and hidden variables,
    instance based learning, Neural Networks
    Introduction to Natural Language processing and Expert system: (06)
    Basic Tasks of Natural Language processing, Expert systems, Expert system
    examples, Expert System Architectures, Rule base Expert systems, Non Monotonic
    45
    Expert Systems, Decision tree base Expert Systems.
    Books Recommended:
    1.Stuart J.Russel, Peter Norvig: AI: A Modern Approach, Pearson Education, Latest
    Edition
    2.Elaine Rich, Knight:Artificial Intelligence, McGraw Hill, 1993
    References:
    1. Partick Henry Winston:Artificial Intelligence, Addison Wesley, Latest Edition
    2. George Luger:Artificial Intelligence, Pearson Education, Latest Edition
    3. Dan, W. Patterson:Introduction to AI and Expert Systems, PHI, latest Edition
    4. A.J. Nillson:Principles of AI, Narosa publications, latest Edition
    Paper Title: Artificial Intelligence (Practical)
    Paper code: IT764 Max. Marks 50 Time: 3Hrs
    1. Program Related to Problem Solving techniques of AI
    • Breadth First Search
    • Depth First Search
    • Heuristic Search
    • Best Search
    • Min-Max Search with alpha-beta pruning
    • Tic-Tac-Toe problem
    • N-Queens and N-Knight problem
    • Unification Algorithm
    2. Introduction to AI Languages such as LISP, PROLOG
    3. Representing Knowledge using RuleML
    4. Using semantic Web
    5. Knowledge of using Neural Networks, Fuzzy logic, genetic algorithms
    6. Other new AI Techniques
    46
    Syllabus for B.E. (Information Technology) Eighth Semester
    Paper title: Advanced Database Management Systems
    Paper Code: IT 811 Max. Marks: 100 Time: 3 hours
    Course Duration: 45 lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two from Part B.
    Part - A
    Review of basic DBMS concepts:
    ER model, Normalization, Query Languages (01)
    Transaction Management: (03)
    Transaction concept, state, serializability, Recoverability, Implementation of
    Isolation, Testing for serializability.
    Concurrency Control: (03)
    Lock based protocols, time stamp based protocol, validation based protocols, locking.
    Crash Recovery: (03)
    Failure classification, storage hierarchy, recovery and atomicity , log-based , shadow
    paging , recovery, buffer management.
    Security & Integrity: (03)
    Security & integrity violation, authorization & views, security systems in SQL,
    encryption.
    The Extended Entity Relationship Model and Object Model: (04)
    The ER model revisited, Motivation for complex data types, User defined abstract
    data types, structured types, Subclasses, Super classes, Inheritance, Specialization and
    Generalization, Constraints and characteristics of specialization and Generalization,
    Relationship types of degree higher than two.
    Object-Oriented Databases: (04)
    Overview of Object-Oriented concepts, Object identity, Object structure, and type
    constructors, Encapsulation of operations, Methods, and Persistence, Type hierarchies
    and Inheritance, Type extents and queries, Complex objects;
    Part – B
    Object Relational and Extended Relational Databases: (05)
    Database design for an ORDBMS - Nested relations and collections; Storage and
    access methods, Query processing and Optimization; Systems comparison of
    RDBMS, OODBMS, ORDBMS.
    47
    Parallel Databases: (04)
    Architectures for parallel databases, Parallel query evaluation; Parallelizing individual
    operations, Sorting, Joins;
    Distributed Database: (04)
    Concepts, Data fragmentation, Replication, and allocation techniques for distributed
    database design; Query processing in distributed databases; Concurrency control and
    Recovery in distributed databases
    Enhanced Data Models for Advanced Applications: (04)
    Active database concepts. Generalized model, design and implementation issues,
    potential applications. Temporal database concepts: Time representation, calendars
    and time dimensions, tuple versioning, attribute versioning.
    Spatial Databases : (03)
    Types of spatial data and queries , application involving spatial data , spatial indexes ,
    indexing based on space filling curves .
    Deductive Databases and Query Processing: (04)
    Introduction to recursive queries, least model semantics, recursive queries with
    negation , efficient query evaluation.
    Books Recommended:
    1. Database Management Systems by Raghu Ramakrishnan, Johannes Gehrke,
    McGraw-Hill International, Edi 3rd.
    2. Fundamentals of database system , Fourth Edition , Elmasri , Navathe ,
    Pearson Edi 4th.
    Reference Books:
    1. Database system concepts by Abraham Silberschatz , Henry .F .Korth , S.
    Sudarshan , Fourth Edition , TMH, Edi 7th.
    2. BC Desai, An Introduction to Database Systems, Galgotia Publications, Latest
    Edition.
    3. An Introduction to database systems, Sixth Edition C. J. Date Addison Wesley
    4. Computer Data Base Organization by Martin J. (Latest edition), PHI, Latest
    Edition.
    5. Principles of data base systems. (Latest edition) by J.D.Ullman, Narosa
    Publishers, Latest Edition.
    48
    Paper Title: Visual Programming
    Paper Code: IT 812 Max. Marks: 100 Time: 3 hours
    Course Duration: 45 lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two from Part B.
    Part – A
    Introduction: (08)
    Introduction to Programming: Variables, Functions, Visual Programming, Object
    Oriented Concepts: Abstraction, Inheritance, Polymorphism, Classes, Collections,
    Debugging.
    Graphical User Interface Concepts - I: (05)
    Windows Forms, Control Properties and Layout, Using Common Dialogs, Event
    Handling: Mouse and Keyboard, Labels, Textboxes, Buttons, GroupBoxes, Panels,
    CheckBoxes and RadioButtons, PictureBoxes, ToolTips.
    Graphical User Interface Concepts - II: (04)
    Menus, Controls: MonthCalendar, DateTimePicker, LinkLabel, ListBox,
    CheckedListBox, ComboBox, TreeView, ListView, Datagrid, Gridview, TabControl,
    Multiple Document Interface (MDI) Windows.
    Multithreading and Exception Handling: (05)
    Thread States, Lifecycle of a Thread, Thread Priorities and Scheduling, Creating and
    Executing Threads, Thread Synchronization and Class Monitor, Exception Handling.
    Part – B
    Graphics and Multimedia: (05)
    Drawing Classes and the Coordinate System, Graphics Contexts and Graphics
    Objects, Color and Font Control, Drawing Lines, Rectangles, Ovals, Arcs, Loading,
    Displaying and Scaling Images, Animating a Series of Images.
    File Processing and Streams: (05)
    Data Hierarchy, Files and Streams, Classes File and Directory, Reading and Writing
    Sequential Access Files, Serialization.
    Data Access: (08)
    Data Access Techniques, XML, LINQ, SQL, ADO.NET Object Model, LINQ to
    SQL, ADO.NET and LINQ, LINQ to XML.
    Additional Techniques: (05)
    XML Documentation, Networking, Security, Web Services, Introduction to GDI+.
    49
    Books Recommended:
    1. Deitel :Visual C# 2005 How to Program, Second Edition, Deitel.
    References:
    1. Karli Watson, Christian Nagel, Jacob Hammer, et al.:Beginning Microsoft Visual
    C# 2008, Wrox.
    2. Christian Nagel, Bill Evjen, Jay Glynn, Morgan Skinner, Karli Watson
    :Professional C# 2008, Wrox.
    Paper title: Visual Programming
    Paper Code: IT 862 Max. Marks: 50 Time: 3 hours
    Practical based on theory.
    Paper title: Embedded System Design
    Paper Code: IT 813 Max. Marks: 100 Time: 3 hours
    Course Duration: 45 lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two from Part B.
    Part - A
    Introduction to Microcontrollers (08)
    Comparison of Microprocessors and Microcontrollers, Embedded and external
    memory devices, CISC and RISC processors, Harvard and Von Neumann
    Architectures.
    Overview of 8 bit Microcontrollers (12)
    Overview of 8051, Architecture, addressing modes and instructions. Interrupts,
    Timer/ Counters, Serial Communication and applications. Interfacing, overview of
    Atmel 89C51 microcontroller.
    Part - B
    PIC Microcontrollers (17)
    Introduction and features, PIC 16C6X/7X: Architecture, Registers, Reset actions,
    Memory Organization, Instructions, Addressing Modes, I/O Ports, Interrupts, Timers,
    ADC. Input Capture, Output Compare, Frequency Measurement, Serial I/O Device
    50
    Software Development & Tools (04)
    Embedded System Evolution Trends, Round Robin with Interrupts, Function
    Scheduling architecture, Algorithms, Introduction to assembler, Compiler and Cross
    compilers and Integrated Development Environment IDE, Object Oriented
    Interfacing, Recursion, Debugging Strategies, Simulators.
    Real Time Operating Systems (04)
    RTOS Architecture, Task and Task States, Tasks and Data, Semaphores and shared
    data, Operating System Services: message queues, timer function, events, memory
    management, interrupt Routines in an RTOS environment, Basic Design Using RTOS
    Books Recommended:
    1. The 8051 Microcontroller and Embedded Systems by Muhammed Ali Mazidi,
    Janice Gillispie Mazidi and Robin D. Mckinlay, Pearson 2nd Edi
    2. The 8051 Microcontroller: Architecture, Programming & Applications by
    Kenneth J. Ayala, Penram International Publishing, 2nd Edi
    3. Microcontrollers ( Theory and Applications ) by Ajay Deshmukh, TMH
    Publishers
    4. An Embedded Software Primer, by David E. Simon, Latest Edition.
    5. Specification and Design of Embedded Systems by D. D. Gajski, F. Vahid, S.
    Narayan, J. Gong, Prentice Hall. Latest Edition.
    .
    Paper title: Embedded System Design & Techniques
    Paper Code: IT 863 Max. Marks: 50 Time: 3 hours
    Practical based on theory.
    51
    ELECTIVE II
    Paper Title: Software Testing And Quality Assurance
    Paper Code: IT814 Max. Marks: 100 Time: 3 hours
    Course Duration: 45 lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two from Part B.
    Part– A
    Introduction: (07)
    Software Process, Characteristics of a Software Process, Process Models, Project
    Management Process and its Phases, Software Measurements, Metrics, Scheduling,
    Estimation.
    Software Quality Assurance Concepts and Standards : (08)
    Quality Concepts, Quality Control, Quality Assurance, SQA Activities, Software
    Reviews, Formal Technical Reviews, Review Guidelines, Software Reliability,
    Software Safety, Quality Assurance Standards, ISO 9000, ISO 9001:2000, ISO 9126
    Quality Factors, CMM, TQM, Six Sigma, SPICE, Software Quality Assurance
    Metrics.
    Risk Management and Change Management: (07)
    Software Risks, Risk Identification, Risk Projection, Risk Refinement, The RMMM
    Plan, Software Configuration Management, Baselines, Software Configuration Items,
    SCM Process: Version Control, Change Control, Configuration Audit, Configuration
    Management for Web Engineering.
    Part– B
    Software Testing: (07)
    Testing, Verification and Validation, Test Strategies for Conventional and Object
    Oriented Software, Unit Testing, Integration Testing, Validation Testing, Alpha and
    Beta Testing, System Testing, Recovery Testing, Security Testing, Stress Testing,
    Performance Testing, Metrics for Source Code, Metrics for Testing, Debugging
    Process, Debugging Strategies.
    Testing Techniques: (08)
    Software Testing Fundamentals, Black Box and White Box Testing, Basis Path
    Testing, Flow Graph Notation, Independent Program Paths, Graph Matrices, Control
    Structure Testing, Condition Testing, Data Flow Testing, Loop Testing, Graph Based
    Testing Methods, Equivalence Partitioning, Boundary Value Analysis, Object
    Oriented Testing Methods: Applicability of Conventional Test Case Design Methods,
    Fault-Based Testing, Scenario-Based Testing, Random Testing and Partition Testing
    for Classes, InterClass Test Case Design.
    Testing Process: (08)
    Test Plan Development, Requirement Phase, Design Phase and Program Phase
    Testing, Testing Client/Server Systems, Testing Web based Systems, Testing Off-the52
    Shelf Software, Testing in Multiplatform Environment, Testing for Real Time
    Systems, Testing Security.
    Books Recommended:
    1.Ian Sommerville: Software Engineering, Seventh Edition, Pearson Education.
    2.R.S. Pressman: Software Engineering: A Practitioner's Approach, Sixth Edition,
    Tata McGraw-Hill.
    3. William E. Perry: Effective Methods for Software Testing, Second Edition, John
    Wiley & Sons.
    References:
    1.S.L. Pfleeger, J.M. Atlee: Software Engineering: Theory and Practice, Second
    Edition, Pearson Education.
    2.K.K. Aggarwal, Yogesh Singh: Software Engineering, Second Edition, New Age
    International.
    3.Pankaj Jalote : An Integrated Approach to Software Engineering,
    Second Edition, Narosa.
    4.Nina S Godbole : Software Quality Assurance – Principles and Practice,
    Narosa.
    5. Boris Beizer : Software Testing Techniques, Second Edition,
    Dreamtech.
    Paper Title: Network Management
    Paper Code: IT814 Max. Marks: 100 Time: 3 hours
    Course Duration: 45 lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two from Part B.
    Part - A
    Large Enterprise Networks: (5)
    Managing Enterprise Networks, need for network management, SNMP: the de facto
    network management standard.
    Elements of NMS Development: (12)
    NMS development, data analysis, class design for major NMS features, GUI
    development, insulating applications from low level code, multiservice switches,
    MPLS, MPLS and scalability.
    Solving the Network Management Problem: (08)
    Filling the development skills gap, better NMS, MIBs and NEs; Policy based Network
    Management (PBNM), Network Management policies, Directory Enabled
    Networking (DEN); IP QoS and the Enterprise.
    53
    Part - B
    Network Management Software Components: (10)
    Fault Server, Configuration Server, Accounting Server, Performance Server, Security
    Server, Other Servers.
    Performance Management in Broadband Networks: (10)
    Performance Control, Performance Monitoring in T-carrier systems, Performance
    Monitoring in SDH/SONET based networks, Performance Monitoring in ATM
    networks, Performance Monitoring in Frame Relay networks, Transmission Quality
    Assurance, Traffic Management.
    Books Recommended:
    1. Network Management, MIBs and MPLS by Stephen B. Morris; Pearson
    Education, Edi 1st .
    2. Network Management in wired and wireless networks, by Tejinder S.
    Randhawa, Stephen Hardy, Kulwer Academic publication, Edi 3rd.
    Paper Title: Network Administration
    Paper Code: IT814 Max. Marks: 100 Time: 3 hours
    Course Duration: 45 lectures of one hour each.
    Note: Examiner shall set eight questions, four from Part-A and four from Part-B of
    the syllabus. Candidate will be required to attempt any five questions selecting at least
    two questions from Part A and two from Part B.
    Part - A
    Introduction to Unix System Administration (04)
    Daily Tasks of a System Administrator, Startup and Shutdown, Periodic Processes,
    Managing File Systems, Responsibilities to the users, Hardware responsibilities,
    Types of SunOS Systems.
    Disks and Devices in Unix (03)
    Disk Structure and Partitions, Disk Partitions; Devices- Logical Names, Disk Label
    and Bootblock, Tapes.
    Unix File System Management (07)
    File Systems, File Systems types Compatibility, Names & contents of important Unix
    directories , File Structure of standalone and server machines, Disk Partitioning, File
    System management, Fork, Disk Check Commands, Swapping and Paging, Adding
    swap space, Setting up a Cache file system, ZFS (IRIX), File Systems Quotas,
    Miscellaneous useful commands, Log files .
    Operating Systems Installation (03)
    Installing Solaris 10.0, Post Install Actions, Solaris Patch List, IRIX 5,X; Startup and
    Shutdown- Booting, Run Levels etc/inittab, Solaris PROM, Diskless Workstations,
    Shutdown, Crashes.
    54
    System Configuration (06)
    Kernel configuration; Adding Hardware Special Files in Solaris 10.0, IRIX 5.X,
    Digital UNIX and Ultrix, Systems Directories,/ -root/ etc- systems. Creating networks
    and subnets, configuring network interfaces, obtaining network statistics, routing ,
    /user- system programs, libraries, etc; User accounts-admittance, login procedure,
    Password Aging.
    Part - B
    Daily Systems Administration (05)
    User and Group Administration, Communicating with systems users, Running
    programs automatically, corn & at, Admintool, Solstice Adminsuite, Services
    Managed, The Distributed Systems Administration Daemon.
    Backup Procedures (04)
    Backup Procedures, Backup Strategies, Backup and Restore Commands.
    Network Services (07)
    Overview of Services Access, Service Access Facility, Service Access Controller,
    Port Monitors, Setting Up a Terminal, Network Port Monitors, Terminal Control,
    Network Administration, Network Initialization, Host Names and addresses, Services,
    Network Programs.
    Security (06)
    System Security Concerns, Need for security, Security Programs, Security Response
    Teams, The password and group files, File and Directory Permissions, EEPROM
    Security, Secure the console port, Security Loopholes, Additional Security features in
    Solaris 10.0, Secure Shell, SSII, SSII Programs, Control Files, Setting up the Service,
    Login Process.
    Books Recommended:
    1. Unix System Administration Handbook, Evi Nemeth, Garth Snyder, Scott
    Seabass and Trent Hein,Edi 2nd.
    2. Essential UNIX System Administration, Aeleen Frisch, Edi 3rd.
    3. Solaris System Administration’s Guide Janice Winsor, Original edition