MAULANA AZAD NATIONAL INSTITUTE

OF

TECHNOLOGY

( Deemed University )

 BHOPAL - 462 007

Course of Study and Scheme of Examination

Of

III B.E (w.e.f 2003)

B.E. (Information Technology)

V – SEMESTER

B.E. (Information Technology)

VI - SEMESTER

Course of Study and Scheme of Examination

Of

IV B.E (w.e.f 2004)

B.E. (Information Technology)

VII- SEMESTER

List of Electives

B.E. (Information Technology)

VIII – SEMESTER

List of Electives

SOFTWARE ENGINEERING

5153 IT

Theory -100

     Sessional - 25

Unit1:

Introduction to software engineering, software characterization and components, software as a product, software process & process models, capability maturity model (CMM). Software metrics and measurements software project planning (Project scheduling and tracking, cost estimation methods).

Unit 2:

Requirements analysis: - Analysis principles, complexity, methods, structured analysis method formal specification, data dictionary, software prototyping and specifications, other requirement analysis methods, storage and processing time analysis, data base requirement, SRS documentation.

Unit 3:

Design principles, design concepts like abstraction, refinement, modularity, control hierarchy, software architecture, structured partitioning, data structure, information hiding etc, modular design, design heuristics for modularity, object oriented design, user interface design, other design methods.

Unit 4:

Software coding and testing, influence of implementation language and coding, coding style, coding efficiency, software quality assurance, software testing techniques, software testing strategies, comparison of test methods, choice of test data, classification of test data, other verification & validation methods.

Unit 5:

Software maintenance process, quality management, maintenance cost and maintainability measures, software list analysis, configuration management and version control system documentation, software reusability.

Books:

1.      Jalote

2.      Pressman 

ANALYSIS AND DESIGN OF ALGORITHMS

5154 IT

      Theory -100

     Sessional - 25

Unit 1:

Concepts of algorithm, asymptotic complexity, examples of analysis use of recurrence relation in analysis of algorithms, removal of recursion, heap and heap sort, disjoint set structure.

Unit 2:

Divide and conquer technique, analysis and design of algorithms base on this technique for binary search, merge sort, quick sort, and selection problem matrix multiplication.

Unit 3:

Study of greedy strategy, solutions based on greedy strategy for knap sack problem, minimum spanning trees, scheduling problem, shortest paths optimal merge patterns. Concept of dynamic programming and problems based on this approach such as O/I knapsack problem, multi-stage graphs, shortest paths, travelling sales person problem, reliability design problem.

Unit 4:

Depth-first search, breadth search, bi-connected components. Backtracking concept and

its example like 8-queen’s problem, Hamiltonian cycle problem, introduction to branch and its examples like 8-puzzle problem travelling sales-person problem.

Unit 5:

Binary search trees, height balanced trees, AVL trees, 2-3 trees, B-trees hashing. Introduction to lower-bound theory introduction to NP-Complete and NP Hard problems, examples of NP complete problem like Hamiltonian path and circuits, Eulerian paths and circuits etc.

MIS & SOFTWARE ENGINEERING LAB

5157 IT

Practical : 50

Sessional : 75

v    MIS:

v    SOFTWARE ENGINEERING:

1.      Design the software requirement specification (SRS) for the assigned project.

2.      Generate test cases for extensive testing of your project and generate the report.

COMPUTER GRAPHICS & ALGORITHM LAB

5158 IT

Practical : 50

Sessional : 75

v    COMPUTER GRAPHICS

v    ANALYSIS & DESIGN OF ALGORITHM:

2.         Implement two stacks in one array A[1...n] in such a way that neither stack overflows unless the total number of elements in both stacks together in n. The PUSH and POP operation should run in O(1) time.

3.         Give a θ(n) time non-recursive procedure that reverses a singly linked list of n elements.  The procedure should use no more than constant storage beyond that needed for list itself.

4.         Implement the following operations for a Binary search tree. To determine the                     (i) Maximum (ii) Minimum (iii) Successor (iv) Predecessor. Find the orders of search operation.

5.         Implement Strassen’s Matrix multiplication and calculate its time complexity.

6.         Write a program to find the shortest path from one vertex to remaining other vertices in a graph. Give a graphical representation of your program and find out the time complexity of your program.

MULTIMEDIA AND WEB TECHNOLOGY

6151 IT

Theory -100

     Sessional - 25

Unit 1:

Introduction to multimedia, integrating digital information, text, graphics images, video animation, sound and popularity of multimedia.

Unit 2:

Introduction to multimedia applications, people to people and people to system applications, audio and video interpersonal applications, shared applications tools. Audio-video conferencing, multimedia electronic mail and document transfer, server based applications.

Unit 3:

Networking requirements, network features and performance of audio and motion video, other requirements like multicasting, image transfer etc.

Unit 4:

Networking solutions, for multimedia several network aspects, LAN, WAN, circuit WAN  and ATM, WAN as multimedia carrier, frame relay and SMPS as multimedia carriers.

Unit 5:

Introduction to web technology, encoding, digitization, compression techniques for audio, image etc.

DATA WAREHOUSING AND DATA MINING

6152 IT

Theory -100

     Sessional - 25

Unit 1:

Introduction to data mining:- Kinds of data, relational databases, traditional databases, advanced database systems. Data Mining functionalities and patterns generated.

Data warehouse and operational databases, multidimensional data model. Data warehouse architecture:- process flow, extract & load process, clean & transform data. Backup and archive process load and warehouse manager

Unit 2:

Data Warehouse Design:- Identifying facts & dimensions. Designing:- fact tables, dimension tables, star flake schema query redirection. Multidimensional schemes:- partitioning strategy, aggregation, data marting, metadata. Capacity planning, tuning the data warehouse. Testing the data warehouse: developing test plan, testing operational environment, database, application.

Unit 3:

Data preprocessing, data cleaning, data integration & transformation, data reduction.

Data mining primitives, languages & systems, architecture of data mining systems.

Unit 4:

Concept description, characterization & comparison. Mining and association rules in large databases, Mining single dimension and multilevel association rules for transactional databases, relational databases and Data Warehouses.

Unit 5:

Issues regarding classification & prediction, Methods of Classification & prediction. Cluster analysis:- types of data in cluster analysis clustering methods. Multidimensional analysis & descriptive mining of complex objects. Mining spatial databases, multidimensional databases, text databases and world wide web.

Books:

1.      “Data Mining Concepts and technique “ by Jimali Klan and Micheline Kamber

2.      “Data Warehousing in the real world “ by Sam Anahory and Dennis Murray

OPERATING  SYSTEMS

6153 IT

Theory -100

     Sessional - 25

Unit 1:

Introduction to operating systems, computer system levels, application & functions provided by operating systems, operating systems interface, system calls & system calls interface. File system organization, devices as file, access and allocation methods of file, systems directory, structure of file system on a disk. Disk scheduling and their algorithms, device drivers, device driver interface, device driver access strategies.

Unit 2:

Concept of a process, processes and program, process management, system calls, communication between processors, communication related system calls, CPU/Process scheduling, scheduling algorithms and their evaluation, device numbers, partitioning large logical disk, RAM disk, memory as device psenls, tty’s disk caching.

Unit 3:

Introduction to memory management, various memory management schemes like paging, segmentation, demand paging, virtual memory, page replacement algorithms, thrashing and load control, dealing with large page tables, two level paging, staring memory. .

Unit 4:

Meaning of deadlocks, condition for deadlocks to occur, deadlock prevention, deadlock avoidance, deadlock detection, deadlock recovery, sequence of approach to deadlock handling, two phase locking, stagnation, introduction to concurrent processing, precedence graphs.

Unit 5:

Process hierarchy, critical section problem, semaphore concept, study of classical co-ordination problem, security and protection, protection of resources like data, file , I/O resources, CPU and memory protection, goals of protection authorization, authentication, dynamic protection structures, security, case study of windows environment.

COMPUTER NETWORKS

6154 IT

Theory -100

     Sessional - 25

Unit 1:

Study of the functions of OSI and TCP/IP reference model in computer networks, circuit, message, packet and hybrid switching, broadband ISDN and ATM, polling techniques, multiplexing and concentration, transmission media used in physical layer, X.25 networks.

Unit 2:

Queuing theory, introduction to LAN, MAN and WAN, various types of ALOHA, LAN protocols, IEEE standards for LAN and MAN, high speed fiber optic networks like FDDI, SONET etc., satellite networks, packet radio networks. Data link layer protocols, error detection and correction codes in data link layer, protocol performance evaluation, protocol specification and verification.

Unit 3:

Introduction to routing and congestion in network layer, routing and congestion control algorithms, inter networking, network layer in internet and ATM networks.                                                                             

Unit 4:

Connection management in transport layer, protocols of transport layer, internet transport protocol like TCP, UDP etc, ATM AAL protocols.

Unit 5:

Data security and cryptography techniques, access management in application layer, world wide web(www), electronic mail(E-mail), concept of virtual terminals. Study of common types of networks like ARPANET, USENET etc.

Books : -

1)

MULTIMEDIA & NETWORKING LAB

6155 IT

Practical : 50

v    MULTIMEDIA:

Projects for designing some multimedia applications , Website designing.

v    COMPUTER NETWORK:

1.      Write a program to simulate shortest path routing algorithm.

2.      Write a program to simulate STOP & WAIT sliding window protocol. Let the sender and receiver be two processes resident on the same system.

3.      Write a program to simulate the operation of a token ring with no priorities.

4.      Write a program to break mono alphabetic cipher.

5.      Connect two computers and transfer data from one computer to another.

DATA MINING & OS LAB

6156 IT

Practical : 50

v    DATA MINING:

1.Project on designing data warehouse.

      2.Projects for mining data from multidimensional databases, text databases, and World Wide Webs.

v    OPERATING SYSTEM:

1.         Implement the DOS operations using interrupts.

(i)                 Change System Date and Time.

(ii)               Directory Listing.

(iii)             Rename a File.

(iv)             Copy File from one Directory to another Directory using Wild Card characters.

(v)               Format the 41^st track of the floppy.

(vi)             Get the Hardware information of the system.

2.         Implement Banker’s algorithm for Deadlock Avoidance.

3.         Find a Deadlock-free and Starvation-free solution for Dining Philosophers problem using Semaphores.

UNIX INTERNALS AND SHELL PROGRAMMING

7152 IT

Theory -100

     Sessional - 25

Unit 1:

Introduction to the kernel :- Architecture of the Unix, the buffer cache. Internal representation of files:- inode, accessing blocks, releasing blocks, structure of regular files, conversion of a path name to an inode, inode assignment to a new file, allocation of disk-block.

Unit 2:

System calls for the file systems:- OPEN, READ , WRITE, CLOSE. PIPES:- the pipe system call, opening a named pipes, reading and writing pipes, closing pipes, DUP, mounting and unmounting file system, LINK, UNLINK. System call for TIME and CLOCK.

Unit 3:

The structure of processes:- process states and transitions, layout of system memory, the context of a process, saving the context of the process, manipulation of the process address space.

Process Control:- process creation, signals, process termination, awaiting process termination, the user id of a process, changing the size of the process, the system BOOT and INIT process.

Unit 4:

Shell Programming:- Study of different types of Shell like C Shell, Bourne Shell etc. Shell variable, Shell Script, Shell Command. Looping and Making choices:-  For Loop, While and Until, Passing Arguments to Scripts. Programming  in different shells.

Unit 5:

Inter Process Communication:- Process Tracing ,Network Communication Sockets. Multiprocessor System:- Problem of multiprocessor systems, Solution with Master and Slave Processor, Solution with Semaphores. Study of Distributed Unix System.

Books:

1.      “The Design of Unix Operating System “  by Maurice J Bach.

2.      “Advanced Unix-A Programmer  Guide” by  Stephen Prata.

ARTIFICIAL INTELLIGENCE

7153 IT

Theory -100

     Sessional - 25

Unit 1:

Meaning and definition of artificial intelligence, various types of production systems, characteristics of production systems, study and comparison of breadth first search and depth first search techniques, other search techniques like hill climbing, best first search, A* algorithm, AO* algorithm etc. and various types of control strategies.

Unit 2:

Knowledge representation, problems in representing knowledge, knowledge representation using prepositional and predicate logic, comparison of prepositional and predicate logic, resolution, refutation, deduction, theorem proving, inferencing, monotonic and non-monotonic reasoning.

Unit 3:

Probabilistic reasoning, Baye’s theorem, semantic networks, scripts, schemas, frames, conceptual dependency, fuzzy logic, forward and backward reasoning.

Unit 4:

Game playing techniques like minimax procedure, alpha-beta cut-off etc., planning, study of blocks world problem in robotics, understanding and natural language processing.

Unit 5:

Introduction to learning, various techniques used in learning, neural networks, applications of neural networks, common sense, reasoning and expert systems.

WIRELESS LAN & MOBILE COMPUTING

7154 IT(Elective-I)

Theory -100

     Sessional - 25

UNIT 1:-

Introduction to wireless technology, comparison of wired and wireless mechanism, various types of wireless communication technologies used in Mobiles, Antennas etc. Concept of spread spectrum, various types of spread spectrum, spreading sequences.

UNIT 2:-

Introduction to wireless networking, cellular wireless networks, TDMA, CDMA, working of a cordless system, wireless local loops.

UNIT 3:-

Introduction to Mobile-IP, wireless access protocols, various types of wireless LAN technologies like infrared, microwave LANs etc.

UNIT 4:-

IEEE standards for wireless LANs, various types of Blue tooth specifications and protocols.

UNIT 5:-

Introduction to VoIP, wireless VoIP solution, procedures, message flow etc. Introduction to WAP, WAP protocols.

Books:-

1.      “Wireless Communication and Networks” by William Stallings, 1^st edition.

2.      “Wireless and Mobile Network Architectures” by Yi-Bing Lin and Imrich chlamtac

FAULT TOLERANT AND REAL TIME SYSTEMS

7154 IT(Elective-I)

Theory -100

     Sessional - 25

Unit 1:

Introduction to Real time system:- Definition, components of a real system, sensors and transducers, signal conditioning, computer input and output, the processor output conditioning and power control, actuators. Computer hardware requirements for real time systems, general purpose computer, CPU, memory, RAM, ROM, cache memory, DMA selection of memory, buses, computer input & output. Real time operating system:- Concepts, basic elements of an operating system, operating system facilities, real time operating systems, tasks and task scheduling, task synchronization and data transfer factors in selecting a real time operating system

Unit 2:

Design of a real time system:- Prelude to the design process:- General approach component, design

Specifications, development environment, hardware development, system software. Analysis and design:- Analysis of required documents, response time specification on human interface, preliminary system design, block diagram, representation of control flow and data flow,

Functional decomposition and relationship among them, modular design, estimation of cost, required development time, program length, execution time and required memory. Software Design:- Structured flowcharts, stepwise development and programming, testing the model.

Unit 3:

Selection of programming languages:- machine and assembly languages, limitations of assembly language, high level languages, advantages and disadvantages of high level languages, real time languages, choosing a language. Integrated assembly language components:- Processor background information required, Subroutine calls and returns, subroutine parameters, linking high and low level programs, Start up routines, computer interrupt system and service routines.

Unit 4:

Interface and control:- Parallel input and output interface, D to A and A to D conversion interface, digital representation of analog voltage, full scale voltage, successive approximation A/D, dual slope A/D, flash converter, sample and hold circuit, the multiplexer, real time clock interfaces, direct memory access interface. Input systems:- Sensors with binary state supports, sensors that produces, continuous analog signals, signal conditioning circuits, transmission circuitry, bus compatible input systems. Output systems:-Output systems involving two-state actuators, output system with continuous actuators.

Unit 5:-

Board-based microcomputer systems:- The back plane bus, address and data transfer lines, interrupt lines, microprocessor control lines, power supply lines, characteristics, boards or bus systems, CPU board, memory board, peripheral device controller and I/O board, selecting a bus system. Study of fault tolerant system:- Concept of fault tolerant in a system, different characteristics and features of fault tolerant systems.

DIGITAL SIGNAL PROCESSING

7154 IT(Elective-I)

Theory -100

     Sessional - 25

Unit 1:

Discrete Time Signals:- Sequences, Representation.

Discrete Time Systems:– Linear, Time Invariant, LTI System, Properties, Constant – coefficient Difference Equations.

Frequency Domain Representation of Discrete Time Signals & Systems.

Unit 2:

Discrete:– Time Random Signals.

Z- Transform:– Properties, R.O.C., Stability, Causality criteria.

Inverse Z- Transform, Recursive and Non-recursive Systems, Realization of Discrete Time System.

Unit 3:

D.F.T.:- Properties, Linear and Circular Convolution.

Discrete Cosine Transform, Relationship between DFT & DCT

I.D.F.T., Computation of D.F.T : F.F.T – Decimation in Time & Decimation in frequency.

Unit 4:

F.I.R. and I.I.R. Systems:- Basic structure of F.I.R. & I.I.R., Bilinear transformation, Design of Discrete time I.I.R. filters:- Butterworth, Chebychev, Inverse Chebychev, Elliptic etc.

Design of F.I.R. filters by Windowing- Rectangular, Bartlett, Hann, Hamming, Kaiser window filter, Design methods, Relationship of Kaiser to other windows. Application of MATLAB for design of digital filters. Effect of finite register length in filter design.

Unit 5:

Advance Signal Processing Techniques and Transforms:- Multi-line Signal Processing:- Down Sampling/Upsampling, Introduction to Discrete Hilbert Transform, Wavelet Transform, Haar Transform etc. Application of DSP to Speech Signal Processing.

Books :-

1.      "Discrete- Time Signal Processing" by A.V. Opprenheim and R.W.Schaffer

        2^nd Edition.

2.      "Digital Signal Processing using MATLAB"  by S.Mittra, 2^nd Edition.

3.      " Introduction to Digital Signal Processing" by Proakis

INTERNET TECHNOLOGY

7155 IT(Elective-I)

Theory -100

     Sessional - 25

Unit 1:

Internet working :-  Concept, Architecture and Protocols. IP Addressing scheme, Routers and IP addressing principles, Binding protocol address (ARP). IP Datagrams and Datagram forwarding. IP encapsulation. Fragmentation and reassemble, IPv6- motivation, frame format  and addressing.

Unit 2:

Internet Control Message Protocol :-Introduction and usage for testing reachability, route tracking, MTU determination, TCP introduction, application, segment format.

Unit 3:

Domain name system:- Introduction, DNS Client server Model, Server hierarchy, server architectures, optimization of DNS performance, DNS entry types, electronic mail paradigm ,message format, SMTP, Mail Gateways, Mailbox access, FTP commands, Filename translation examples, TFTP, NFS.

Unit 4:

World Wide Web:- Introduction, HTML format, Client-server interaction, Browser architecture, CGI, Java techniques for Dynamic Web documents, Network Management :- SNMP, NMS.

Unit 5:

Network security, protocol startup procedure, BOOTP, DHCP, Intranet contents, security aspects, hardware software features, setting up internet site and troubleshooting, Extranet.

Books:

1.      “Computer Networks and Internet” by D.E.Comer

2.      “Internet” by Coleman & Dyson

VLSI  DESIGN

7155 IT(Elective-II)

 Theory -100

     Sessional - 25

Unit 1:

Review of Logic design fundamentals:- combinational logic, k-maps, designing with NOR and NAND gates, hazards in combinational networks, Mealy sequential network design, Moore sequential network design, synchronous design, machine design.

Introduction to VHDL:- VHDL description and combinational network, modeling flip-flops multiplexes using VHDL processes, compilation and simulation of VHDL code, modeling a sequential m/c, variables, signals and constants, arrays, VHDL operators functions and procedures, packages and libraries.

Unit 2:

Attributes, multi-valued logic and signal resolutions. IEEE 1164 standard logic, generics, generate statements, synthesis of VHDL code, synthesis examples, files and TEXTIO.

Unit 3:

Designing with programmable logic devices ROM, PLA’S, PAL’S, PLD’S, designing with programmable gate arrays, FPGA’S, CPLD’S(Complex Programmable Logic Devices).

Floating point arithmetic multiplication and other operations.

Unit 4:

Hardware testing and design:– combinational logic testing, sequential logic testing, scan testing, boundary scan, built-in self test.

Unit 5:-

Design examples and case studies:- USART design, micro-controller design, design of micro-controller CPU, filter design etc.

Books:-

1. “VHDL Primer” by Bhaskar
2. “Digital System design using VHDL” by Charles Roth
3. “Modern VLSI design(System on Silicon)” by Wayne Walf

SYSTEM PROGRAMMING AND COMPILER DESIGN

7155 IT(Elective-II)

 Theory -100

     Sessional - 25

Unit 1:

Function of an assembler, phases of an assembler, pass structure, study of various tables used like symbol table, op-code table etc. Introduction to macros, macro definition and call, macro expansion, nested macro, macro facilities like flow of control, expansion time variables etc, design of a macro pre-processor.

Unit 2:

Introduction to loading, linking and relocation, design of the linker, relocation factor and types of relocation. Various types of software tools like editors, debug monitors etc.

Unit 3:

Functions of a compiler, various phases of a compiler, bookkeeping, Boot Strapping in a compiler

Basic Parsing technique like Shift reduce parsing, operator precedence parsing, top down parsing, predictive parsing, LR parsers etc, SLR and LALR parsing table.

Unit 4:

Syntax directed translation schemes, intermediate code generation, syntax trees, three address code, quadruple and triples, translation of various type of statements like assignment, while, case, for etc.

Introduction to symbol table generation, data structure used for symbol table generation, error detection and recovery in a compiler, removal of lexical, syntactic, semantics errors and errors encountered in other phases.

Unit 5:

Introduction to code optimization, loop optimization, techniques using DAG, reducible flow graphs, depth first search etc, data flow analysis. Introduction to code generation, code generation using DAG, register allocation and assignment in code generation, problems in code generation.

Books:

1.      “System Programming and Operating System “ by D.M Dhamdhare  2^nd edition 

2.      “Principle of compiler design “ by Alfred V. Aho and Jeffery D. Ullman

UNIX SHELL PROGRAMMING LAB

7156 IT

Practical : 50

1. Write a shell program for the development of the calendar such that it should be able to perform   

     the following tasks:-

(a)   cal 9 2003 – it should be able to display the calendar for the month of September for the year 2003.

(b)   cal September 2003 – give the same output as (a) above.

(c)    cal sep 2003 - give the same output  as (a) above.

(d)   cal 1-5 2003 – give the calendar for the months of January, February, March, April, and May for the year 2003

(e)   cal Jan-May 2003 – give the same output as (d) above.

(f)     cal Jan 2000 –Jan 2003 – prints the calendar from the month of January’2000 to January’2003.

ARTIFICIAL INTELLIGENCE LAB

7157 IT

Practical : 50

1.      Write a program in PROLOG to play the game of Tic-Tac-Toe with computer. The game could be easily designed under following steps:-

(a)       Draw the empty board (for this you will need write predicate)

|             |

           -----|----------|---------

                  |             |

           -----|----------|---------

                  |             |

(b)       If say the user puts the * at position 5 then board position must be displayed as

         |             |

  -----|----------|---------

                           |     *      |

                    -----|----------|---------

                           |             |

(for this you will require the list function to insert * at position 5 in the list. The list will be of 9 occupied by a *.)

(c)        Then the computer can put the 0 at any position on the board other than position 5, as it is already occupied by a *.

(for this you can use a good logic or may even use a random number generator to generate a random number between 1 to 9, and put 0 if that square is having a blank i.e. these are not having 0 or *)

(d) Make the computer intelligent by not loosing to the opponent and winning whenever it is given a chance.

2.      Implement A* algorithm.

EMBEDDED SYSTEM

8151 IT

Theory -100

     Sessional - 25

Unit 1:

Hardware fundamentals:-Gates, timing diagram, memory, microprocessor, buses, DMA.

Interrupts:- Microprocessor architecture, interrupt basics, interrupt latency, shared data problem. System partitioning, building the architectural model, Input and output processing, Hardware and software partitioning, Timing requirements

Unit 2:

Microprocessor selection, Microprocessor versus Micro-controller analysis CISC versus RISC Study of major embedded processor architectures Memory system design. System optimization. Architecture for embedded software:- Round robin, round robin with interrupts, function- queue-scheduling and real time operating system.  

Unit 3:

Real time operating system:- Tasks and task states, task and data, semaphores and shared data. Operating system services:- Inter task communication, timer services, memory management, events and interaction between interrupt routines and real time operating system. Software selection issues, selecting an RTOS, RTOS performance metrics. RTOS scalability and tool support, Compiler selection.

Unit 4:

Embedded system design using a real time operating system: Encapsulating semaphores and queues, hard real time scheduling considerations saving memory space.

Unit 5:

Development tools and debugging:- Host and target machines, linker/locators, target system, testing, instruction set, assert macro. Establishing a software development environment C runtime environments Embedded debuggers Cross-development methods Embedded file formats, readers Creating object files - the build process Loading software into remote targets

Books:-

1.      “An Embedded Software Primer” by David E. Simon ISBN 0-201-61569-X

2.      “Embedded Systems Design”      by Arnold S. Berger ISBN 1-57820-073-3

NETWORK SECURITY

8152 IT

Theory -100

     Sessional - 25

Unit 1:

Introduction to Network security. Network security needs. Threats to network security. Effect of Virus on Network security. Modern security management, goals of network security, sources of danger, elements of a security plan. Types of computer criminal, types of computer crime- scavenging, leakage, wire tapping etc.

Unit 2:

Controlling physical access: kind of computer security. Role of physical security. Weakness of physical security. Types of identification badges, types of badges. Site security factors.

Desktop security:- challenges of PC security. Desktop security techniques:- physical security & procedural methods. Procedural steps for PC. Protecting data- hardware & software problems & their solutions.

Unit 3:

Building security procedures:- role of procedural security, security goals, keys to security procedures. Organizational controls:-  personnel, programming & operating. Security training & its objectives. Role of password in network security. strength & weakness of password. Administering a password system.

Unit 4:

Hardware & Software security:- role of technical security, types of technical security, technical security goals, technical security applications, Data Encryption. LAN security, challenges of securing networks, technical security for LANs, NetWare security system.

Firewalls. Filters- Junk Email Filters, Web Filters.

Unit 5:

Enterprise network security, building an Enterprise security plan, major security functions for networks, principles of network security. hardware security for network. Principles of Database security. Role of Encryption:- private & public key encryption, protecting identity, verification, digital signature, access authorization principles, range of capabilities, composite authorizations.

Books :-

1.      “ Network Security” by Richard H. Baker

2.      “ Information Warfare & Security” by Dorothy E. Denning

NEURAL NETWORKS

8153 IT(Elective-III)

 Theory -100

     Sessional - 25

Unit 1:

Introduction to neural networks, working of a biological and an artificial neuron, neural network architectures, single and multi-layer neural networks. Perception, linear seperability, perception training algorithm, back-propagation learning.

Unit 2:

Adaptive multi-layer networks, prediction networks, radial basis functions, polynomial networks and regularization.

Unit 3:

Difference between supervised and unsupervised learning, counter-propagation networks, adoptive resonance theory, neocognitron.

Unit 4:

Hopfield networks, Boltzmann’s training, bi-directional associative memory networks.

Unit 5:

Various types of optimization methods such as gradient descent, simulated annealing etc., applications of neural networks.

Books:-

1.      Elements of artificial neural networks by Kishan Mehrotra, Chilkuri K. Mohan and Sanjay Ranka, Penram International.

2.      Neural networks and fuzzy systems by Bart Kosko, Prentice Hall of India.

3.      Fundamentals of artificial neural networks by Mohamad H. Hassoun, Prentice Hall of India.

DIGITAL IMAGE PROCESSING

8153 IT(Elective-III)

Theory -100

     Sessional - 25

Unit 1:

Introduction to Image Processing Systems, Digital Image Fundamentals:- Image model, Relationship between Pixels, Imaging geometry, Camera model.

Manipulation on Images:- Images transformation : Introduction to FT, DFT and FFT. Walsh transformation, Hadamard transformation, Hotelling transformation, Histogram.

Unit 2:

Image Smoothing:- Neighborhood Averaging, Median Filtering, Low Pass Filters, Average of Multiple Images, Image Sharpening by Differentiation Technique, High Pass filtering.

Image Restoration:- Degradation models for continuous function, effect of diagonalization,

on-degradation, algebraic approach to restoration, interactive restoration, Gray level interpolation.

Unit 3:

Image Encoding and Segmentation:- Encoding, Mapping, Quantizer and Coder.

Segmentation:- Detection of discontinuation by point detection, line detection, edge detection.

Unit 4:

Edge linking and boundary detection:- Local analysis, global by graph, theoretic techniques. Thresh-holding:- definition, global thresh-holding.

Unit 5:

Filtering:- median, gradient, simple method of representation signatures, boundary segments, skeleton of region.

Books:-

1.      “ Digital Image Processing” by Gonzalez & Wood

2.      “ Digital Image Processing” by A.K.Jain
 

ADVANCED COMPUTER ARCHITECTURE

8154 IT(Elective-IV)

Theory -100

     Sessional - 25

Unit 1:

Introduction to parallel processing and pipelining, array computers, multiprocessor systems, dataflow diagrams and applications of parallel processors.

Unit 2:

Various types of pipeline processors like arithmetic pipelines, instruction pipelines etc., reservation table, design of various types of pipelines, instruction pre-fetching and branch handling in pipelines, data buffering and busing structures in pipelines.

Unit 3:

Meaning of instruction streams and data streams, classification of computers based on these as SISD, SIMD, MISD and MIMD, SIMD computer organization, various types of SIMD interconnected networks like static and dynamic networks, mesh-connected, networks, cube connected networks etc., SIMD matrix multiplication and parallel sorting algorithms.

Unit 4:

Various types of array and associative processors, loosely and tightly coupled microprocessors, various types of interconnection networks like time shared or common bus, crossbar switch, multi-port memories etc.

Unit 5:

Control flow and data flow computers, data flow computers, data flow graphs and languages, static and dynamic data flow computers, systolic array architecture.

DISTRIBUTED SYSTEMS

8154 IT(Elective-IV)

Theory -100

     Sessional - 25

Unit 1:

Overview of distributed systems, features of distributed and centralized databases, DDBMS, levels of distribution transparency, data fragmentation and integrity constraints.

Unit 2:

Management of distributed transactions, concurrency control, reliability, distributed database administration.

Unit 3:

Translation of global queries to fragment queries, optimization of access strategies, distributed database design.

Unit 4:

Distributed process management, Lamport’s algorithm, Richart and Agarwal’s algorithms, Maekawa’s square root algorithm.

Unit 5:

Distributed deadlock detection, comparison with centralized and hierarchical deadlock detection, periodic and continuous deadlock detection, deadlock prevention and avoidance algorithms, lock granularity & recovery.

 =================