THE UNIVERSITY OF BURDWAN

DEPARTMENT OF COMPUTER SCIENCE

SYLLABUS FOR M. Sc. in Computer Technology – 2014 (Eff. From 2014 – 2015 session)

1. Duration : Two Years (Four Semesters)

2. Total Marks : 1200

3. Credit : (3 Sem.)x(4x4+2x2) + (4 + 6+6+5+2) = 83

4. Number of Papers : Total Twenty Four of which

Fifteen Theoretical (each credit 4), Seven

Practical (each credit 2) and One paper of

Project Work (9 credit) including social

outreach (1 credit).

5. Distribution of Marks : All Papers are of full marks 50.

For each theoretical paper 40 marks

will be of University Exam & 10

marks of Sessional for two mid – term of 5

marks each. Each Laboratory paper will

carry 50 Marks of University Exam only.

For Project work, 40 marks and for social

outreach, 10 marks will be of University

exam.

6. Duration of Univ. Exam : Two Hours.

7. Instruction Period : In L-T-P pattern, ‘L’ lectures, ‘T’ tutorials, and,

‘2xP’ practical hours per week are needed for

each paper. Unless otherwise specified, credit

point of a paper will be: L + T + P. At least 50

hours are needed for each theory and practical

paper.

8. Semester Duration : 16 Weeks

FIRST SEMESTER

Paper-I – MCT 101 (Theory) (L-T-P) Credit

Digital Logic and Microprocessor (4-0-0) 4

Paper-II – MCT 102 (Theory)

Programming Techniques (3-1-0) 4

Paper-III – MCT 103 (Theory)

Data Structures & Analysis of Algorithms (3-1-0) 4

Paper-IV – MCT 104 (Theory

Discrete Mathematics (4-0-0) 4

Paper-V – MCT 105 (Practical)

Application Software Lab (0-0-4) 2 Paper-VI – MCT 106 (Practical)

Digital Electronics & Microprocessors Lab (0-0-4) 2

SECOND SEMESTER

Paper-I - MCT 201 (Theory) (L-T-P) Credit

Object Oriented Programming (3-1-0) 4

Paper-II - MCT 202 (Theory)

Computer Organisation (4-0-0) 4

Paper-III - MCT 203 (Theory)

Computer Communication and Network (3-1-0) 4

Paper-IV - MCT 204 (Theory)

Operating Systems (4-0-0) 4

Paper-V - MCT 205 (Practical)

Object Oriented Programming and Networking Lab (0-0-4) 2 Paper-VI - MCT 206 (Practical)

Operating Systems Lab (0-0-4) 2

THIRD SEMESTER `

Paper-I - MCT 301 (Theory) (L-T-P) Credit

Software Engineering (4-0-0) 4

Paper-II - MCT 302 (Theory)

Web Technology & Multimedia (3-1-0) 4

Paper-III - MCT 303 (Theory)

Advanced DBMS (3-1-0) 4

Paper-IV - MCT 304 (Theory)

Elective -I (4-0-0) 4

Paper-V - MCT 305 (Practical)

Database Lab (0-0-4) 2 Paper-VI -MCT 306 (Practical)

Web Technology & Multimedia Lab (0-0-4) 2

FOURTH SEMESTER

Paper-I - MCT 401 (Theory) (L-T-P) Credit

Object Oriented Analysis and design (4-0-0) 4

Paper-II – MCT 402(Theory)

Elective-II (4-0-4) 6

Paper-III– MCT 403(Theory)

Elective-III (4-0-4) 6

Paper-IV – MCT 404

Group A- Project & Viva (0-0-8) 4

Group B- Social outreach (0-0-0) 1

Paper V - MCT 405 OOAD Lab (0-0-4) 2 Elective-I E01: Computer Graphics E02: Windows Programming E03: Advanced Computer Networks E04: Compiler Designing E05: Advanced Microprocessor E06: Formal Language & Automata Elective-II & III E07: Distributed Computing E08: Mobile Computing E09: Data Warehousing & Data Mining E10: Artificial Intelligence E11: Advanced Network Programming E12: Image Processing E13: Embedded Technology E14: Network Security & Cryptography

DETAILED PAPER-WISE SYLLABUS FOR FIRST SEMESTER

MCT-101

DIGITAL LOGIC AND MICROPROCESSOR [50L]

Number System and Codes - Algorithms for Conversion between different

Number Systems and between different Codes; Representation of Real

Numbers as Fixed Point and Floating Point signed binary numbers, IEEE

standards of representation. Error Correcting and Error Detecting codes.

[6L]

Boolean algebra - Postulates, Fundamental Theorems and Fundamental

Operations, Boolean Functions and their representation using Venn

Diagrams, Truth Tables and Karnaugh Maps. Duality and Complementation.

Canonical Sum of Product and Product of Sum forms. Minimization of

Boolean Functions through Fundamental Theorems, Karnaugh Maps and

Quine-McCluskey's Tabular Method. [12L]

Combinational Circuits - Encoder/Decoder, Code Converter, Comparator,

Multiplexer/Demultiplexer, Parity Generator/Checker, Adder/Subtractor,

etc. Design of Combinational Circuits using Universal Gates, Multiplexers,

ROMs and PLAs. [16L]

Sequential Circuits - Different types of Flip Flops and their characteristic

and Excitation Tables. Simple Sequential Circuits like Storage Registers,

Shift Registers, Counters, etc. Design of Binary, Decade and Modulo-N

Counters. Counters using Shift Register with feedback. D/A and A/D

converters. [10L]

8086 Internal Architecture, Program development steps, Machine codes for 8086 Instructions, Idea about program development tools(Editor Assembler, Linker, Locator, Debugger, Emulator etc.), Instruction description, Sequence

Programs(Flags, Jumps), Loops(WHILE-DO, REPEAT-UNTIL), Conditions, String instruction, Procedures(Near Procedure and Far Procedure Calls), Stack initialization, Assembler macros and Directives [6L]

Text/Reference Books 1. Digital Logic & Computer Design – Mano Morris -PHI 2. Digital Principles & Application – Malvino Leach – TMH

MCT-102

PROGRAMMING TECHNIQUES [50L]

Introduction to Computers and Operating Environment, Program

Development Cycle, Algorithm - Representation of Algorithms,

Pseudocode, Flowchart, Structured Programming and Modular

Programming [4L]

Introduction to Programming with C

Data Types and Sizes, Variable Declaration, Operators, Type Conversion,

Conditional Expressions, Special Operators, Precedence Rule. [5L]

Control Structures- Statements and Blocks, If, Switch, While, For, Do-

While, Break, Continue, Goto and Labels. [10L]

Functions & Program Structure, Macro-definition and expansion, Recursion,

Arrays, Pointers, Structures, Unions and Enumeration. [16L]

String processing in C. [5L]

Standard I/O, Formatted I/O, Standard Library Functions, File and Pre-

processing. [10L]

Text/Reference Books:

1. Concepts of Programming Languages – Robert W. Sebesta, Pearson

2. The C Programming Language – Bryan W. Karninghan, Dennis M.

Ritchie, PHI

3. Programming with C – B.S.Gottfried, McGrawHill

4. Let Us C – Yashavant Kanetkar, BPB

5. Programming in ANSI C – E.Balagurusamy, TMH

6. Pointer in C - Yashavant Kanetkar, BPB

MCT-103

DATA STRUCTURES & ANALYSIS OF ALGORITHMS [50L] Basic Concept: Data Types and Algorithms, Time and Space Analysis of Algorithms – Order Notations: Linear Data Structures: Sequential Storage Representation – Arrays, Strings, Stacks, Queues, Dequeues and their applications. [10L] Linear Data Structures: Linked Storage Lists, Circularly Linked Lists, Doubly Linked Lists. [4L] Applications: Recursion, Design of Recursive Algorithms, Tail Recursion, When not to use recursion, Removal of Recursion. [4L] Non-linear Data Structures: Trees, Binary Trees, Binary Search Trees, Traversals and Threads, Insertion and Deletion Algorithms, Height Balanced and Weight-balanced Trees, B-Trees, B+ Trees. [8L] Applications of Trees: Graphs – Representation, Breadth- First and Depth-First Searches, Spanning Trees. [4L] Sorting and Searching: Basic Sorting and searching algorithms. [4L] File Organisation: Sequential, Relative, Indexed Sequential, Hashing Techniques [5L] Access Methods: Sequential, Random and Dynamic [3L] Dynamic Programming: Matrix-Chain Multiplication, Longest Common Subsequence, Optimal Polygon triangulation [5L] Greedy Algorithms : An activity selection problem, Prove correctness of the Greedy Algorithm, Greedy versus dynamic programming, Huffman Code, Correctness of Huffman Algorithm, Metroids, Correctness of the Greedy Algorithm on Metroids. [3L]

Text/Reference Books: 1. Data Structures using C & C++ by Langsam, Angenstein & Tabenbaum of PHI 2. Data Structure and Program Designing in C by R.L.Kruse, B.P.Leung, C.L. Tondo of PHI 3. An introduction to Data Structures with Applications by Tremblay & Sorenson of McGraw Hill, Stud. Edn. 4. Data Structures & Algorithm by Alfred V. Aho, John E Hopcroft & Seffery D. Ullman of Addison Wesley 5. Fundamental of Data Structure by Horowitz & Sahani of Galgotia Publication 6. Introduction to Data Structures and Algorithm with C++ by Glenn W. Rowe of PHI.

MCT-104

DISCRETE MATHEMATICS [50L]

Sets, Operations on sets, Cartesian Products, Relations, Equivalence

Relations and classes, Partitions, Functions, Inductions and Inductive

Definition and proofs, Cardinality of Set-Finite, Infinite, Countable and

Uncountable. Binary Operation - Groupoid, Semigroup and Monoid,

Subgroup, Cosets, Lagrange's Theorem(statement only), Cyclic Group,

Order of a Group, Normal Subgroup, Rings, Subrings, Integral Domains and

Fields, Field of Fractions. [18L]

Introduction to Predicate Calculus, Concept of Quantifiers. [6L]

Combinatorics [4L]

Propositional Calculus - Propositions and Connectives, Syntax, Semantics-

Truth Assignments and Truth Tables, Validity and Satisfiability, Tautology,

Adequate set of Connectives. [8L]

Generating functions, Recurrence Relations. [2L]

Graph Theory, Concepts of Graphs, Sub-graphs, Cyclic Graphs, Digraph,

Isomorphism, Homomorphism; Trees, Spanning trees, Binary trees [12L]

Text/Reference Books

1. Classical Algebra-S.K.Mapa

2. Foundation of Discrete Mathmatics-K.D.Joshi

3. Discrete Mathamatics-S.K.Sarkar

4. Graph Theory-Deo

5. Graph Theory-Harary

6. Algebra-Malik, Mordeson , Sen

7. Discrete Mathematics – Mott, Kandle, Baker

MCT-105

APPLICATION SOFTWARE LAB Program development using C programming language. Steps to be laid on writing well structured modular and readable program accompanied by good documentation.

MCT-106

DIGITAL ELECTRONICS AND MICROPROCESSOR LAB Digital circuits and 8086 Microprocessor

DETAILED PAPER-WISE SYLLABUS FOR SECOND SEMESTER

MCT–201

OBJECT ORIENTED PROGRAMMING [50L]

Principles of Object-Oriented-Programming (OOP), Comparison of Procedural Programming and OOP, Advantages of OOP, overview of OOP using C++. [6L] Declaration of classes and objects, Objects as Function Arguments. Arrays of objects, returning objects from function, structures and classes, Friend functions, comparison of macros and inline function. [8L] Constructors and Destructors: Constructors, basic Constructors, Parameterised Constructors, Constructors with Default Argument, Dynamic Initialization of Objects, Copy Constructors, Dynamic Constructors, Destructors, Constraints on Constructors and Destructors. [6L] Operator Overloading: Overloading Unary Operators, Binary Operators and Arithmetic Operators, Multiple Overloading, Comparison Operators, Conversion Between Objects and Basic Types, conversion between objects of different classes, constraints on type conversion. [8L] Derived Classes and Inheritance: Derived classes and base classes, defining a derived class, accessing base class member, Protected access specifier, derived class constructors, overriding the member function, class hierarchies, abstract base class, constructors and member function. Inheritance- public and private, access combinations and usage of access specifiers, classes and structures, multiple inheritances. [8L] Pointers: Pointers to objects [2L] Virtual Functions: Virtual functions and polymorphism [2L] Streams: Stream classes, stream class hierarchy, stream manipulators, string streams, character stream classes, object I/O, file streams, Disk I/O with member function. [6L] Templates: Function templates and class templates. [2L] Exception Handling: throw, try and catch [2L] Text/Reference Books: 1. C++ and Object-Oriented Programming Paradigm - D. Jana, PHI

2. Objecting Oriented Programming through C++ - E. Balaguruswamy, TMH 3. Object Oriented Programming in Turbo C++ - Robert Lafore, Galgotia 4. Head First Java – Kathy Sierra, O'Reilly

MCT–202

COMPUTER ORGANISATION [50L] Memory - Memory organizations, memory hierarchy, cache memory, memory interlacing, virtual memory supports. [4L] CPU Architecture - Instruction Format, Addressing Mode, Instruction Execution Cycles. Speed mismatch between CPU and memory and methods of alleviating it. [6L] I/O Architecture - I/O organization, addressing of I/O devices, programmed I/O, interrupts and DMA, Bus architectures, VMA bus, I/O bus, SCSI bus. [5L] Risc vs Cisc processors, Parallel processing, Pipelining, Instruction Pipeline, RISC Pipeline [5L] Control Unit: Hardwared control, Wilkes Control, Microprogrammed Control [5L] ALU: ALU organization, ALU design, Arithmetic Processors- Multiplication and division methods-Booths Algorithm. [5L] Microprogramming: Micro-Operations concepts - horizontal, vertical and diagonal microinstruction formats, microprogramming with multiple formats. [12L] Different Caching techniques (Associative, Direct and Set-associative mapping), Address Space, Memory space, Address mapping using pages, Segmented page mapping [8L]

Text/Reference Books:

1. Structure Computer Organization – A. S. Tanenbaum, PHI

2. Computer System Architecture – M. M. Mano, PHI

3. Computer Architecture and Organization – Hayes, McGraw Hill

4. Microcomputer System(8086)-LIU &Gibson, P.H.I

5. Computer Organization, 4th edn. – V.C. Hammacher & Others, T.M.H

MCT–203

COMPUTER COMMUNICATION AND NETWORK [50L]

Structure of computer network, Point-to-point, multidrop circuits, Data flow and physical circuits [2L] Topologies: topologies and design goals, Hierarchical topology, horizontal topology, star topology, ring topology, mess topology [1L] Basics of communication: Switched and non switched options, fundamentals of communication theory, channel speed and bit rate, Voice communication and analog waveforms, bandwidth and frequency spectrum, digital signals, the modem, asynchronous and synchronous transmission. [4L] Networking Technologies: Local area networks and wide area networks, connection oriented and connection less networks, classifications of communication protocols, time division multiple access (TDMA), time division multiplexing (TDM), carrier sense system (collision), token passing, peer-to-per priority systems, priority slot, carrier sense systems (collision free). Token passing (priority) systems. LLC and MAC protocol data units, CSMA/CD and IEEE 802.3, token ring (priority), token bus and IEEE 802.4, Metropolitan Area Networks (MANs), ANSI fibre distributed data interface (FDDI). [10L] Layered Protocols and the OSI Model: Goals of layered protocols, network design problems, communication between layers, introduction to standard organizations and the OSI model, standards organizations, Study of OSI layers : Data Link Control, Network Layer, Transmission control, Session Layer, Presentation and Application Layer.

TCP/IP reference model: IP addresses, Internet protocol, Transmission Control Protocol, Comparison between OSI and TCP/IP model. [14L] Transmission Media: Twin wire, Coaxial cable, Radio, VHF and microwaves satellite links, optical fibre. [2L] Switching and Routing in Networks: Message switching, packet switching packet routing, packet switching support to circuit switching networks, routing protocol, Shortest path routing [8L] The X.25 and Supporting Protocols: Features of X.25, Layers of X.25 and the physical layer, X.25 and the datalink layer, X.25 standards, X.25 channel options, flow control principles, other packet types, X.25 logical channel states, packet formats, internetworking, connectionless mode networks, the frame relay and X.25 stacks. [5L] Personal Computer Networks: Personal computer communications characteristics, error handling, using the personal computer as a server, linking the personal computer to mainframe computers, file transfer on personal computers and LANs, network operating systems, common IBM PC LAN protocol stacks, Private, public and value added networks, Difference between computer networks and distributed networks. [4L] Text/Reference Books: 1. Computer Networks – Protocols, Standards and Interfaces – Black, U PHI 2. Computer Communication Networks – Stallings, W PHI 3. Computer Networks – Tanenbaum, A.A PHI

MCT–204 OPERATING SYSTEMS [50L]

Basic concepts: Idea of multiprogramming, multiprocessing, Batch

processing, Time sharing systems, Distributed system, Network systems and

Real time systems [6L]

Process Management: Process concepts, PCB, process life cycle, Thread,

Context switch, Inter Process Communication (IPC): Critical section

problem, Semaphores & synchronization; Deadlock - detection, prevention

and avoidance. Scheduling: Various type Schedulers, Scheduling concepts

and algorithms [16L]

Memory management: Static & dynamic partitioning, Dynamic relocation,

Paging & demand paging memory management, Virtual memory,

Replacement algorithm, Segmented memory management, Thrashing. [10L]

Device management: Scheduling concept and algorithm, spooling. [2L]

File management: File concept, access methods, allocation methods,

Directory concept, FAT & I-node structures; File protection - Protection

mechanism and policies [6L]

UNIX Operating System: Overview of UNIX operating system, Kernel and Shell, File System, Basic Unix commands [10L] Text/Reference Books: 1. Operating System Concepts – Silberschatz, Galvin, WSE Wiley

2. Operating Systems Design and Implementation – A.S.Tanenbaum, A.S.Woodhull, PHI 3. UNIX Concepts and Applications – Sumitabha Das, TMH

MCT 205

OBJECT ORIENTED PROGRAMMING AND NETWORKING LAB Class, Object, Methods, Message Passing, Default argument, Function Overloading, Operator Overloading, Friend Function, Static Data Member, Static Member Function, Constructor, Destructor, Inheritance Virtual Function, Virtual Class, Template, Exception Handling.

Implementation of different error detection and correction algorithms. Implementation of different routing algorithms.

MCT 206

OPERATING SYSTEMS LAB Programming in UNIX/LINUX : Basic command, filters, Shell programming, Process creation using fork, inter process communications using pipes & fifo. DETAILED PAPER-WISE SYLLABUS FOR THIRD SEMESTER

MCT-301

SOFTWARE ENGINEERING [50L]

Software Development Fundamentals: Features of software, Definition and need for Process, Software Development Life Cycle, Life Cycle Models-Waterfall model, Prototyping, Spiral model [6L] Feasibility Analysis: Different categories of requirement, Prototyping, Specifications, Context Diagram, Event List, DFD-Physical & Logical, Entity-Relationship Diagram, Data Dictionary, Decision Table, Decision Tree [16L] Design: Process, Principles, Concepts, Modular Design, Structure Chart, Cohesion, Coupling [6L] Testing: Static Testing - Reviews, Walkthroughs and Inspections, Dynamic Testing – different techniques of Black Box testing and White Box testing, Different levels of testing – Unit, Integration, System and Acceptance testing [8L] Project Management: Task Schedule, GANTT chart, Base Line, Pert Chart, Critical path method, Resource sheet, Resource Allocation/Usage, Customized reports [8L] Software Quality Assurance: Understanding software quality, Quality assurance Vs Quality control, Quality definitions, Deming’s Principles, Quality pyramid, Workbench Components, QC tools, ISO approach and SEI – CMM levels, ETVX model [4L] Software Configuration Management: Risk Analysis, Baseline, Change Tracking and Control Measurements, Version Control [2L] Text/Reference Books: 1. Software Engineering A Practitioner’s Approach – Pressman - TMH 2. An Integrated Approach to Software Engineering – Jalote - Navosa 3. Software Engineering – Shooman M 4. Out of the Crisis – Demming N Edwards - MIT centre for Advanced Engineering Studies, Cambridge

MCT-302

WEB TECHNOLOGY & MULTIMEDIA [50L] Web Technology: Internet Basics: Basic Concepts, E-mail operations, FTP, Web Publishing [3L] Web Page Designing: HTML tags, Linking Pages with anchors, working with images & frames, using tables, HTML forms [7L] XML: Features, XML Parsing, DTD, Attributes, Document Object Model & Cascading Style Sheet [9L] Dynamic Web Page Designing: DHTML tags and Scripting Languages (JavaScript & VBScript) [6L] Server Side Scripting - ASP & PHP (Working with server objects, handling cookies & database programming) [15L] Multimedia: Introduction to Multimedia: Concepts, uses of multimedia, hypertext and hypermedia; Image, video and audio standards. [2L] Audio: digital audio, MIDI, processing sound, sampling, compression. [2L] Video: MPEG compression standards, compression through spatial and temporal redundancy, inter-frame and intra-frame compression. [3L] Animation: types, techniques, key frame animation, utility, morphing. [2L] Virtual Reality concepts. [1L] Text/Reference Books: 1. HTML 4.0 - BPB 2. Javascript Application Cookbook - Oreilly 3. Active Server Pages for Professionals - Wrox 4. XML - Wrox 5. PHP – TMH 6. Sanhker, Multimedia –A Practical Approach, Jaico 7. Buford J. K. – “Multimedia Systems” – Pearson Education 8. Andleigh & Thakrar, Multimedia, PHI

MCT-303

ADVANCED DBMS [50L]

Database Fundamentals: Database concepts, Data Models, DDL, DML. Access Methods-Sequential & Random access, Database Design [6L] Relational Database Concepts: Concept of Relation & Relational Model, Relational Algebra & Relational Calculus, Query Processing, Normalization, Constraints [10L] Structured Query Language: SQL statements, SQL PLUS commands, Views, Index, Sequence, synonyms [10L] DBMS Architecture: Memory Architecture, Internal Architecture, Background Processes, Clustering, Indexing, Hashing [4L] Advanced Data Bases: Transaction processing, Concurrency Control, Recovery Techniques, Database Security and Integrity, Storage Structure and File organization [8L] Distributed Database Management System: Distributed database design, Query processing and optimization in distributed databases, Concurrency control and reliability, Data replication, Data integration, Peer-to-peer systems, Distributed information retrieval. [10L] Introduction to Object Oriented Database Management System [2L] Text/Reference Books: 1. Database System Concepts – Henry F Korth and Silberschartz Abraham -Mc Graw Hill 2. Introduction to Database Management – Date C J -Mc Graw Hill 3. Principles of Database Management – Ullman J D – Galgotia 4. Advance Database Management System – Rini Chakrabarti, Shilbhadra Dasgupta, KLSI

MCT-304

ELECTIVE I [50L] Elective-I E01: Computer Graphics E02: Windows Programming E03: Advanced Computer Networks E04: Compiler Designing E05: Advanced Microprocessor E06: Formal Language & Automata E01: COMPUTER GRAPHICS [50L] Graphics Display Devices: Raster, vector devices; colour display techniques; colour look up tables. [5L] 2-D graphics: Line and curve generation algorithm; polygon filling; 2-D transformations; windowing and clipping. [18L] Interactive graphics: Interactive input devices; Interaction handling. [5L] 3-D graphics: 3-D surface modelling; 3-D transformations; Hidden line and surface elimination; Rendering of 3-D objects. [10L] Graphics Languages: GKS, PHIGS [5L] Text/Reference Books: 1. Hearn, Baker – “ Computer Graphics ( C version 2nd Ed.)” – Pearson education 2. Z. Xiang, R. Plastock – “ Schaum’s outlines Computer Graphics (2nd Ed.)” – TMH 3. D. F. Rogers, J. A. Adams – “ Mathematical Elements for Computer Graphics (2nd Ed.)” – TMH 4. Mukherjee Arup, Introduction to Computer Graphics, Vikas 5. Hill,Computer Graphics using open GL, Pearson Education

E02: WINDOWS PROGRAMMING [50L]

Windows Concepts and terminology, key elements. [5L] Creating the look, using OO technology, Communication via messages, windows resources and functions, adding multimedia and sound resources. [20L] Writing window applications, taking control of windows, adding menus, dialog boxes. [10L] Special controls, MFC library, MFC programming concepts and methods, developing an application. [15L] E03: ADVANCED COMPUTER NETWORKS [50L]

Overview of previous topics, Spanning Tree algorithm (Transparent Bridges) & Source Routing Bridge , Virtual LAN, Inter VLAN communication [4L] Error detection and Correction methods: Checksum, CRC polynomial codes, error detection capabilities of polynomial codes, Linear codes- Hamming Code [5L] Gigabit Ethernet, IEEE 802.11, Bluetooth, Cellular telephony, Satellite networks, Virtual Circuit Switching, Frame Relay, ATM. [5L] Advanced IP Addressing (Classless Inter-Domain Routing, variable length Subnet masking and Super-netting), Classless Routing [3L] Different Routing Process, Details of Routing Protocols (RIP / IGRP / EIGRP / OSPF / BGP) [8L] Network Flow Control (Open-Loop & Closed-Loop Control) [2L] Standard Router configuration, Implementation of Routing protocols using CISCO Routers, IPv6 (Frame format, Network Addressing, Extension Headers) [8L] Firewall, Access Control List, Proxy servers (Squid / Win Proxy), Static & Dynamic Network Address Translation (NAT), Port Address Translation (PAT) [6L]

DNS and DHCP in LINUX and Windows platform, Windows & Linux inter-networking using SAMBA [6L] Network File System (NFS), Network Information System (NIS) in Linux. [3L] Text/Reference Books: 1. Leon Garcia- Computer Network Communication – TMH 2. Kirch – “ Linux network Administrator’s guide (2nd Ed.)” – O’Rielly 3. Maxwell – “Unix system administration” - TMH 4. Limoncelli –“The Practice of System & Network Administration”-Pearson E04: COMPILER DESIGNING [50L]

Introduction: Definition , functions of Compiler in Linux / Unix / TC etc environments, other associated terms e.g. Text formatter, Text Editors, Phases and Passes, FSM & RE’s and their application to Lexical Analysis, Implementation of Lexical Analyzers, Lexical- Analyzer Generator, Lex – Compiler, Formal Grammar and their application to Syntax Analysis, BNF Notation, YACC. The Syntactic specification of Languages: CFG, Derivation and Parse Trees, Capabilities of CFG. [12L] Basic Parsing Techniques: Parsers, Shift Reduce Parsing, Operator precedence parsing, top down Parsing, Predictive Parsers. [8L] Automatic Construction of efficient Parsers: LR Parsers, the canonical collection of LR (0) items, constructing SLR Parsing Tables, Constructing canonical LR Parsing tables and LALR parsing tables , An Automatic Parser Generator, Implementation of LR parsing Tables, Constructing LALR sets of items. [8L] Syntax Directed Translation: Syntax directed Translation Schemes, Implementation of Syntax directed translators, Intermediate Code, Postfix notation, Parse Trees and Syntax Trees, Three address Code, Quadruple & Triples, Translation of Assignment Statements, Boolean expressions, Control Statements, Postfix Translation, Translation with a Top Down Parser, Array references in

Arithmetic expressions, Procedure Calls, Declarations and Case statements Translations. [8L] Symbol Tables: Data Structure for Symbol Tables, representing scope information. Run Time Administration: Implementation of simple Stack allocation scheme, storage allocation in block structured language. [8L] Error detection and Recovery: Lexical phase errors, syntax phase errors, semantic errors Code Optimization: Loop optimization, the DAG representation of basic blocks, value numbers and Algebraic Laws, Global Data – Flow Analysis. [6L]

Text/Reference Books:

1. Aho,Ullman & Sethi, “Compiler Design”, Addison Wesley 2. D.M.Dhamdhere, “Compiler Construction – Principles & Practice”, Macmillan India Ltd. 3. Holub, “Compiler Design in C” , PHI.

E05: ADVNCED MICROPROCESSOR [50L]

Historical background, microprocessor based personal computer system, internal Microprocessor architecture, real and protected mode memory addressing, memory Paging. [3L]

Addressing modes, data movement instructions, arithmetic and logic instructions, Program control instructions, programming in microprocessor – modular programming, Using video and keyboard display, data conversion, disk files. [5L]

8086/8088 hardware specifications – pin-out and pin functions, clock generators, bus buffering and latching, bus timing, ready and wait state, minimum mode vs. maximum mode. [7L]

Memory Interface – memory devices, addressing decoding, 8-bit memory interface, 8086, 80186, 80286, 80386sx(16bit) memory interface, 80386dx and 80486(32bit). [8L]

Memory interface, Pentium and Pentium pro (64bit) memory interface, dynamic ram. [4L]

Basic I/O interfaces – 8279 keyboard/display interface, 8254 interval timer, 16550. [5L]

Programmable communication interface, a/d and d/a converter. [4L]

Interrupts, DMA controller, arithmetic co-processor. [3L]

Component Interconnect (PCI) buses. [2L]

The 80186, 80286 microprocessors, 80386 and 80486 microprocessors.

[4L]

The Pentium and Pentium pro Microprocessors – Special Pentium Microprocessor, Pentium Memory Management, New Pentium Instructions, Special Pentium pro Feature. [5L]

Text/Reference Books:

1. Ramesh S. Gaonkar, “The Microprocessor: Architecture, interfacing,

programming and design,” Penram International

2. Douglas V Hall, “Introduction to Microprocessor and interfacing,”

McGraw Hill

3. B. Ram, “Microprocessor and applications, PHI

4. Gibson, “Introduction to Microprocessor,”

E06: FORMAL LANGUAGE & AUTOMATA [50L]

Machines: Finite states models for sequential machines, state minimization, decomposition, synchronous, asynchronous machines, liner sequential machines, structure of sequential machines. [12L] Finite state accepters: Deterministic finite accepters, Nondeterministic finite accepters, Equivalence of Deterministic finite accepters and Nondeterministic finite accepters, Reduction of the number of states in a finite automata, Recognition of a language by an automata. [12L] Regular Language: Grammars, Regular Languages, Regular Expressions, Regular Grammars, linear Grammars, Closure properties of regular sets.

[10L] Context free Languages and Grammars: Context free languages, Context free Grammars, Closure properties of Context free Languages, Methods for Transforming Grammars, Chomsky Normal Form, Greibach Normal Form. [12L] Pushdown Automata: Nondeterministic Pushdown Automata, Language recognized by Pushdown Automata. [4L] Text/Reference Books: 1. Switching & Finite Automata – Kohawi Z V I - TMH 2. Introduction to Automata Theory, Languages & Computations – Hapcroft J E & Ullman JD- Narosa 3. Theory of Automata & Formal Language – Kain - Mc Graw Hill 4. An Introduction to Formal Languages and Automata – Linz Peter - Narosa

MCT 305

DATABASE LAB SQL – Implementation of DQL, DDL, DML, DCL and TCL. PL/SQL Programming – Basic Program Construct, Exception Handling, Cursor, Procedure, Function, Package and Trigger.

MCT 306

WEB TECHNOLOGY & MULTIMEDIA LAB

Internet Basics, Web Page Designing using HTML, XML features implementation, Dynamic Web Page Designing using DHTML, Server Side Programming using ASP & PHP. Animation Programming. DETAILED PAPER-WISE SYLLABUS FOR FOURTH SEMESTER

MCT-401

OBJECT ORIENTED ANALYSIS & DESIGN [50L] OOAD Introduction: Concepts of object oriented analysis & development, Classical methods Vs OO methods. [2L] Object Oriented Analysis: Creating initial object model, the analysis cycle, object modelling, functional modelling, dynamic modelling, and iterative analysis. [10L] Object Oriented Design: Design Models, Class diagram, State transition diagrams, Design level concurrency and Design heuristics. [8L] UML Introduction: Role of UML in OOAD, Goals of UML, UML tools. [2L] UML Diagrams: Use Case diagram, Actors, Use Cases, Use Case relationships; Objects and classes, Class diagram, Relationships, Association, Aggregation, Attributes and Access specifiers, Inheritance, Realization; Object interaction, Synchronous and Asynchronous Messages, Sequence diagram, Collaboration diagram; State Transition diagram, building iterations; Action and Activity, Activity diagram, Forks and Joins,

Swim lanes; UML packages, Physical Diagrams – Component diagram, Deployment diagram. [28L] Text/Reference Books: 1. Object Oriented Analysis & Design – Booch G - Addison – Wesley 2. Object Oriented Analysis & Design – Andrew Haigh - TMH 3. UML: A Beginner’s Guide – Jason T. Roff 4. Learning UML- Sinan Si Alhir 5. System Analysis & design: An Object Oriented Approach with UML-

Alan Dennis

MCT-402

ELECTIVE – II [50 L]

MCT-403

ELECTIVE – III [50 L] Elective-II & III

E07: Distributed Computing E08: Mobile Computing E09: Data Warehousing & Data Mining E10: Artificial Intelligence E11: Advanced Network Programming E12: Image Processing E13: Embedded Technology E14: Network Security & Cryptography E07: DISTRIBUTED COMPUTING

Process Synchronization: Concepts of processes, Concurrent processes, Threads, Overview of different classical synchronization problems, Monitors, Communicating Sequential processes(CSP). [5L]

Distributed operating system: Architectures, Issues in Distributed operating systems, Limitations of Distributed Systems, Lamport’s logical clock, Global states, Chandy-Lampert’s global state recording algorithm, Basic concepts of Distributed Mutual Exclusion ,Lamport’s Algorithm, Ricart -Agrawala Algorithm. [12L] Distributed File Systems: Distributed File system, Architecture, Design issues, SUN Network File system, Basic concepts of Distributed shared memory, Basic concepts of Distrubuted Scheduling, Load balancing, Load sharing. [6L] Distributed OS Implementation: Models, Naming, Process migration, data migration, Remote Procedure Calls- architecture & implementation. [5L] Distributed Deadlock Handling: Deadlock handling mechanisms in Distributed systems, Centralised Deadlock Detection-One phase and Two phase algorithms, Distributed Deadlock Detection-Edge chasing and Path Pushing algorithms, Hierarchical Deadlock detection: Ho-Ramamurthy’s algorithm. [5L] Case Study – J2EE Java Servlet: Servlet environment and role, HTML support, Servlet API, The servlet life cycle, Cookies and Sessions. [5L] JSP: JSP architecture, JSP servers, JSP tags, understanding the layout in JSP, Declaring variables, methods in JSP, inserting java expression in JSP, processing request from user and generating dynamic response for the user, inserting applets and java beans into JSP, using include and forward action, introduction to JDBC, prepared statement and callable statement. [10L] EJB: An overview of J2EE web services, basics of Enterprise Java Beans, EJB vs. Java Beans, basics of RMI, JNI. [5L] Text/Reference Books: 1. Operating Systems Concepts & design - Milan Milenkovic, TMH 2. Operating System - H.M. Deitel, Pearsons . 3. Advanced Concepts in operating Systems - Mukesh Singhal and Niranjan G. Shivaratri, TMH

E08: MOBILE COMPUTING [50L] Mobile Computing:

Issues in Mobile Computing, Overview of wireless Telephony, IEEE 802.11 & Blue Tooth, Wireless Multiple access protocols, channel Allocation in cellular systems. [6L] Data Management Issues, data replication for mobile computers, adaptive Clustering for Mobile Wireless networks. [8L] Distributed location Management, pointer forwarding strategies, Energy Efficient Indexing on air, Energy Indexing for wireless broadcast data, Mobile IP, TCP Over wireless. [14L] Mobile Agents Computing, Security and fault tolerance, transaction processing in Mobile computing environment. [8L] Ad hoc network, Routing Protocol, Global State Routing (GSR), Dynamic State Routing (DSR), Fisheye State Routing (FSR), Ad hoc On-Demand Distance Vector (AODV), Destination Sequenced Distance – Vector Routing (DSDV). [14L] Text/Reference Books: 1. Fundamentals of Mobile and Pervasive Computing - Adelstein, Gupta, Richard 2. Mobile Computing Principles: Designing & Developing Mobile Applications with UML and XML - Reza B'Far, Roy T. Fielding 3. Mobile Computing: Technology, Applications and Service Creation - Asoke K Talukder, Roopa R. Yavagal E09: DATA WAREHOUSING & DATA MINING [50L] Introduction to Data Mining, Warehousing and Visualization: The modern Data Warehouse, Data Warehouse role and structures, Data

Warehouse capabilities, cost of warehousing data, foundations of Data Mining, roots of Data Mining, approach to Data Exploration and Data Mining, Foundations of Data Visualization. [8L] Data Warehouse: Stores, Warehouses and Marts, Data Warehouse Architecture, Metadata, Metadata Extraction, Implementation of Data Warehouse, Data Warehouse technologies. [12L] Data Mining and Data Visualization: What is Data Mining? Online Analytical Processing, Techniques used to Mine the Data, Limitations and Challenges to Data Mining. [12L] Machine that can learn: Fuzzy Logic and Linguistic Ambiguity, Artificial Neural networks, Genetic Algorithms and Genetically Evolved Networks, Applications of Machines that can learn. [8L] Designing and Building the Data Warehouse: Approach to Data Warehouse Design, Data Warehouse Project Plan, Analysis and Design Tools, Data Warehouse Architecture Specification and Development. [8L] The Future of Data Mining, Warehousing and Visualization [2L] Text/Reference Books: 1. Berson, “Data Warehousing, Data Mining & OLAP”. 2. Data Mining Techniques – Arun Kr. Pujari, University Press 3. Data Mining – Pieter Adriaans, Dolf Zantinge, Addison Wesley, 1999 4. Modern Data Warehousing, Mining and Visualization – George M. Marakas, Pearson Education E10: ARTIFICIAL INTELLIGENCE [50L] Introduction: Overview of Artificial intelligence- Problems of AI, AI technique, Tic - Tac - Toe problem. [2L] Intelligent Agents: Agents & environment, nature of environment, structure of agents, goal based agents, utility based agents, learning agents. [2L] Problem Solving: Problems, Problem Space & search: Defining the problem as state space search, production system, problem characteristics, issues in the design of search programs. [2L]

Search techniques: Solving problems by searching :problem solving agents, searching for solutions; uniform search strategies: breadth first search, depth first search, depth limited search, bidirectional search, comparing uniform search strategies. [5L] Heuristic search strategies: Greedy best-first search, A* search, memory bounded heuristic search: local search algorithms & optimization problems: Hill climbing search, simulated annealing search, local beam search, genetic algorithms; constraint satisfaction problems, local search for constraint satisfaction problems. [5L] Adversarial search: Games, optimal decisions & strategies in games, the minimax search procedure, alpha-beta pruning, additional refinements, iterative deepening. [3L] Knowledge & Reasoning: Knowledge representation issues, representation & mapping, approaches to knowledge representation, issues in knowledge representation. [3L] Using predicate logic: Representing simple fact in logic, representing instant & ISA relationship, computable functions & predicates, resolution, natural deduction. [2L] Representing knowledge using rules: Procedural verses declarative knowledge, logic programming, forward verses backward reasoning, matching, control knowledge. [3L] Probabilistic reasoning: Representing knowledge in an uncertain domain, the semantics of Bayesian networks, Dempster-Shafer theory, Fuzzy sets & fuzzy logics. [5L] Planning: Overview, components of a planning system, Goal stack planning, Hierarchical planning, other planning techniques. [2L] Natural Language processing: Introduction, Syntactic processing, semantic analysis, discourse & pragmatic processing. [2L] Learning: Forms of learning, inductive learning, learning decision trees, explanation based learning, learning using relevance information, neural net learning & genetic learning. [2L]

Expert Systems: Representing and using domain knowledge, expert system shells, knowledge acquisition. [2L] Basic knowledge of programming language like Prolog & Lisp. [10L] Text/Reference Books:

1. Artificial Intelligence, Ritch & Knight, TMH 2. Artificial Intelligence A Modern Approach, Stuart Russel Peter Norvig Pearson 3. Introduction to Artificial Intelligence & Expert Systems, Patterson, PHI 4. Poole, Computational Intelligence, OUP 5. Logic & Prolog Programming, Saroj Kaushik, New Age International 6. Expert Systems, Giarranto, VIKAS 7. Artificial Intelligence, Russel, Pearson

E11: ADVANCED NETWORK PROGRAMMING [50L] Prerequisites: C++ and Java Programming, familiar with UNIX/Linux. [2L] Networks: OSI model, TCP/UDP, IP, Ethernet, telephone system. [10L] Communication theory, encryption, data compression. [5L] Web sever development -Web servers, browsers, HTTP protocol, CGI, cookies, introduction to HTML, Perl, JavaScript, JavaApplets. [10L] Network services -telnet, FTP, email protocols CSMTP , POP), DNS, NFS, NIS, diagnostic tools(arp, ping, netstat, nslookup etc.) [10L] Networking Programming: C++ (UNIX Sockets and Windows/Winsock), Java (Network model, threads, exceptions), Servers and Clients. [13L] Text/Reference Books:

E12: IMAGE PROCESSING [50L]

Introduction: Background, Digital Image Representation, Fundamental steps in Image Processing, Elements of Digital Image Processing - Image Acquisition, Storage, Processing, Communication, Display. [8L] Digital Image Formation: A Simple Image Model, Geometric Model- Basic Transformation (Translation, Scaling, Rotation), Perspective Projection, Sampling & Quantization - Uniform & Non uniform. [8L] Mathematical Preliminaries: Neighbour of pixels, Connectivity, Relations, Equivalence & Transitive Closure; Distance Measures, Arithmetic/Logic Operations, Fourier Transformation, Properties of The Two Dimensional Fourier Transform, Discrete Fourier Transform, Discrete Cosine & Sine Transform. [10L] Image Enhancement: Spatial Domain Method, Frequency Domain Method, Contrast Enhancement –Linear & Nonlinear Stretching, Histogram Processing; Smoothing - Image Averaging, Mean Filter, Low-pass Filtering; Image Sharpening. High-pass Filtering, High-boost Filtering, Derivative Filtering, Homomorphic Filtering; Enhancement in the frequency domain - Low pass filtering, High pass filtering. [8L] Image Restoration: Degradation Model, Discrete Formulation, Algebraic Approach to Restoration - Unconstrained & Constrained; Constrained Least Square Restoration, Restoration by Homomorphic Filtering, Geometric Transformation - Spatial Transformation, Gray Level Interpolation. [8L] Image Segmentation: Point Detection, Line Detection, Edge detection, Combined detection, Edge Linking & Boundary Detection - Local Processing, Global Processing via The Hough Transform; Thresholding - Foundation, Simple Global Thresholding, Optimal Thresholding; Region Oriented Segmentation - Basic Formulation, Region Growing by Pixel Aggregation, Region Splitting & Merging. [8L] Text/Reference Books: 1. Digital Image Processing - Gonzalez R.C.& Woods R.E.; Pearson 2. Fundamentals Of Digital Image Processing - Jain A.K; PHI/ Pearson. 3. Digital Image Processing Techniques - Ekstrom

E13: EMBEDDED TECHNOLOGY [50L]

Introduction to embedded systems hardware needs; typical and advanced, timing diagrams, memories (RAM, ROM, and EPROM) Tristate devices, Buses, DMA, UART and PLD's Built-ins on the microprocessor. [6L]

Interrupts basics, ISR; Context saving, shared data problem. Atomic and critical section, Interrupt latency. [8L]

Survey of software architectures, Round Robin, Function queue scheduling architecture, Use of real time operating system. RTOS, Tasks, Scheduler, Shared data reentrancy, priority inversion, mutex binary semaphore and counting semaphore. [10L]

Inter task communication, message queue, mailboxes and pipes, timer functions, events Interrupt routines in an RTOS environment. [6L]

Embedded system software design using an RTOS Hard real-time and soft real-time system principles, Task division, need of interrupt routines, shared data. [6L]

Embedded Software development tools. Host and target systems, cross compilers, linkers, locators for embedded systems. Getting embedded software in to the target system. [10L]

Debugging techniques. Testing on host machine, Instruction set emulators, logic analysers In-circuit emulators and monitors. [4L] Text/Reference Books:

1. David A. Simon, “An Embedded Software Primer” , Pearson Education.

2. Daniel W.Lewis, “Fundamentals of Embedded Software Where C and Assembly Meet”, Pearson Education.

E14: NETWORK SECURITY & CRYPTOGRAPHY [50L]

Introduction: Introduction to Security attacks, services and mechanisms, Introduction to cryptology. Conventional Encryption model, classical

encryption techniques-substitution ciphers & transposition ciphers, cryptanalysis, stereography, stream & block ciphers. [8L] Modern Block ciphers: Block Ciphers principles, Shandars (DES), Strength of DES, Differential & Linear Cryptanalysis of DES, Block cipher model of operation, triple DES, IDEA encryption & decryption, Strength of IDES, Confidentiality using conventional encryption, traffic confidentiality, key distribution, random number generation. [10L] Principles of Public Key Cryptography: principle of public key cryptography, prime and relative prime numbers, modular arithmetic, PSA algorithm, security of RSA key management. [8L]

Authentication: Authentication recruitments, Authentications functions, and Message Authentication codes, Digital Signatures, authentication protocols Digital signatures Standard (DES), proof of digital signatures algorithm. [10L] Electronics mail security: pretty good privacy (PGP), S/MIME IP security: IP security overview, architecture, Authentication header, encapsulating security payloads, combining security association, key management. [6L] Web security: security socket layer & transport layer security, secure electronic transaction (SET). [4L] System security: intruders, viruses and related threads, firewall design principles. [4L] Text/Reference Books: 1. William Stalling “ Cryptography and networks security: Principles and Practice,” Prentice Hall, New jersey, 2. Johannes A Buchmann, “Introduction to cryptography,” Spiringer–verlag 3. Bruce Schiener, “Applied Cryptography”.

MCT 404

PROJECT & VIVA

Students will undergo their project work in an IT organization or implement some real life problem in software under the joint guidance of a faculty of the institution and/or some competent person of the company. Project duration should be about 4.5 months. Students can also perform their project work in the department on some contemporary field of IT. Viva will be conducted based on the entire curriculum of the course.

MCT 405

ELECTIVE LAB Lab assignments will be given based on the electives chosen from among the above list of Elective papers.

MCT 406

OOAD LAB

Analysis & Design of UML diagrams (Use Case, Sequence, Collaboration, Activity, State Chart, Event Trace etc.) based on given case studies.