IT010 601: Computer Networks
Objectives
To teach the mode of
operation of different types of computer networks that are used to interconnect
a distributed community of computers and various interfacing standards and
protocols.
Module I (10 hours)
Introduction: - ISO-OSI Reference Model – TCP/IP Reference Model –
Comparison Network hardware-Repeaters, Routers, Bridges, Gateways, Hub, Cable
Modem.
Physical Layer: - Transmission Media– ISDN system Architecture –
Communication Satellites – geostationary satellites - Medium Earth Orbit Satellites- Low earth
orbit satellites– Satellite v/s Fiber
Module 2 (12 hours)
Data Link Layer: - Design
issues-Error Detection and correction – Elementary Data link protocols- Sliding
window protocols. .
LAN Protocols: - Static
& Dynamic channel allocation in LAN’s and WAN’s, Multiple access protocols
– ALOHA – Pure ALOHA – Slotted ALOHA – Carrier Sense Multiple Access protocols
– persistent and non-persistent CSMA – CSMA with collision detection – IEEE
802.3 standards for LAN
Module 3 (14 hours)
Network layer: -Virtual Circuits, Datagrams, Routing Algorithm –
Optimality principle - Flooding - Flow Based Routing - Link state routing –
Distance vector routing – Multicasting – Link state multicasting – Distance
vector multicasting - Congestion Control Algorithms – General principles –
Packet discarding – Choke packets - Congestion prevention policies – Traffic
shaping – Leaky bucket algorithm – Flow specifications – jitter control
Module 4 (12 hours)
Transport Layer: - Transport Service - Elements of transport protocols –
Internet Transfer Protocols UDP and TCP – ATM – Principle characteristics.
Module 5 (12 hours)
Application Layer: -Domain name system – DNS name space – Resource
records – Name servers – operation of DNS - Electronic Mail – MIME
Mobile networks: - Mobile telephone
systems, Bluetooth - Components – Error
correction – Network topology – Piconet and scatternet – L2CAP layers –
Communication in Bluetooth networks
References
- Computer Networks (Fourth Edition):
Andrew S.Tanenbaum, Pearson Education
- An Introduction to computer networking: Kenneth C. Mansfield Jr., James L. Antonakos, Prentice-Hall India
- Communication Networks:
- Computer Networks (Second Edition):
Larry L Peterson & Bruce S Davie, (Harcourt
- Computer Networking: James F Kurose & Keith W Ross, Pearson Education
- Introduction to Data Communications and Networking: Behrouz, Forouzan, McGraw Hill
IT 602:DIGITAL SIGNAL PROCESSING
|
2+2+0
|
Objectives:
·
To study the fundamentals of
discrete-time signals and system analysis, digital filter design and the DFT
Module 1 (12 Hours)
Introduction: Elements of a Digital Processing
System - Advantages of Digital over Analog Signal Processing - Applications of
DSP.
Discrete-Time Signals
and Systems: Basic
Discrete-Time sequences and sequence operations: unit sample, unit step,
exponential, sinusoidal – periodic and aperiodic discrete time sinusoids - Discrete
time systems: Properties of Systems:
Stability, Memory, Causality, Time invariance, Linearity
Module 2 (12 Hours)
LTI Systems: Representation of Signals in terms of impulses –
Impulse response – Convolution sum– Cascade and Parallel interconnections –
Memory, Causality and Stability of LTI systems – Systems described by linear
constant coefficient difference equations
Frequency Domain
representation of discrete-time signals: Fourier transform of a sequence - Properties of
Fourier Transforms – Frequency response of systems
Module 3 (12 Hours)
Z transform: Definition - ROC – Common Z
transforms - Inverse z-transform by partial fraction expansion- Properties of
z- transforms - Analysis and characterization of LTI systems using Z-Transform
Sampling of continuous
time signals: The
sampling theorem - Aliasing
Module 4 (12 Hours)
Structures for discrete time systems – IIR and FIR systems – Block
diagram representation of difference equations – Basic structures for IIR
systems – Direct form - Cascade form - Parallel form – Structures for FIR
systems – Direct and Cascade forms – Overview of finite precision numerical
effects in implementing systems
Module 5 (12 Hours)
Digital filter
design: Filter specification –Comparison of IIR and FIR filters – Design of
low pass FIR filters by windowing
The Discrete Fourier
Transform: Relation with DTFT - Computation
of the DFT – Decimation in time and decimation in frequency FFT - Reduction of
computational complexity
References
1. Alan V. Oppenheim and Ronald W.
Schafer, Digital Signal Processing – Pearson Education Asia, LPE
2. Sanjit
K Mitra, Digital Signal Processing, 3e, Tata McGraw - Hill Education,
3. John G. Proakis and Dimitris G.
Manolakis, Digital Signal Processing - Pearson Education, 4th
edition
4. L
C Ludeman ,Fundamentals of Digital Signal Processing –, Wiley
5. Johny R. Johnson, An Introduction
to Digital Signal Processing: Prentice Hall
6. S.Salivahanan,
A.Vallavaraj, C.Gnanapriya, Digital Signal Processing, 2e, Tata McGraw - Hill
Education,
7. Emmanuel C. Ifeachor and
|
IT 010 603INFORMATION
THEORY AND CODING
|
3+1+0
|
Objectives:
- To
provide basic concepts of Information Theory
- To
understand the design and analysis of coding/decoding scheme for digital communication application
Module 1 (12 Hours)
Information theory: - Concept of amount of information -units,
Entropy -marginal, conditional and joint entropies -relation among entropies
Mutual information, information rate, channel capacity, redundancy and
efficiency of channels.
Module 2 (12 Hours)
Discrete channels: - Symmetric channels, Binary Symmetric Channel,
Binary Erasure Channel, Cascaded channels, repetition of symbols, Binary
unsymmetric channel, Shannon theorem. Continuous channels: - Capacity of band
limited Gaussian channels, Shannon-Hartley theorem, Trade off between band
width and signal to noise ratio, Capacity of a channel with infinite band
width, Optimum modulation system.
Module 3 (12 Hours)
Source coding: - Encoding techniques, Purpose of encoding,
Instantaneous codes, Construction of instantaneous codes, Kraft's inequality,
Coding efficiency and redundancy, Noiseless coding theorem. Construction of
basic source codes: - Shannon-Fano algorithm, Huffman coding, Arithmetic
coding, ZIP coding.
Module 4 (12 Hours)
Codes for error detection and correction: - Parity check coding,
Linear block codes, Error detecting and correcting capabilities, Generator and
Parity check matrices, Standard array and Syndrome decoding, Hamming codes,
Encoding and decoding of systematic and unsystematic codes. Cyclic codes: -
Generator polynomial, Generator and Parity check matrices, Encoding of cyclic
codes, Syndrome computation and error detection, Decoding of cyclic codes, BCH
codes, RS codes, Burst error correction.
Module 5 (12 Hours)
Convolutional codes: - Encoding- State, Tree and Trellis diagrams,
Maximum likelihood decoding of convolutional codes -Viterby algorithm,
Sequential decoding -Stack algorithm. Interleaving
techniques: - Block and convolutional interleaving, Coding and interleaving
applied to CD digital audio system -CIRC encoding and decoding, interpolation
and muting. ARQ: - Types of ARQ,
Performance of ARQ, Probability of error and throughput.
References
1. Ranjan
Bose ,Information Theory, Coding and Cryptography 2nd Edition:, Tata
McGraw-Hill, New Delhi, 2008
2. Simon
Haykin,Communication Systems: John
Wiley & Sons. Pvt. Ltd.
3. Taub
& Schilling, Principles of Communication Systems: Tata McGraw-Hill
4. Das,
Mullick & Chatterjee, Principles of Digital Communication: Wiley Eastern
Ltd.
5. Error
Control Coding Fundamentals and Applications: Prentice Hall Inc.
6. Shu
Lin & Daniel J. Costello Jr.,Digital Communications Fundamentals and
Applications: Bernard Sklar, Person Education Asia
|
|
Objective:
·
To help students to develop
skills that will enable them to construct software of high quality – software that
is reliable, and that is reasonably easy to understand, modify and maintain.
·
To foster an understanding of why these skills
are important
Module
1 (10 Hours)
Introduction: The Nature of Software, Software Process, Software
Engineering Practice, A Generic Process Model, Prescriptive Process Models,
Specialized Process Models, The Unified Process, Personal and Team Process
Models, Agile Process, Extreme Programming, Agile Process Models.
Module
2 (14 Hours)
Requirements Modelling: Requirement
Engineering, Eliciting Requirements, Developing Use Cases, Building the Requirements
Model, Requirements Analysis, Scenario-Based Modelling, UML Models, Data
Modelling Concepts, Class Based Modelling, Flow Oriented Modelling, Behaviour
Model, Patterns for Requirements Modelling, Requirements Modelling for Web
Applications.
Module
3 (12 Hours)
Design:
The Design Process, Design Concepts, The Design
Model, Software Architecture, Architectural Styles, Architectural Design,
Architectural Mapping, Designing Class-Based Components, Component-Level
Design, Component Based Development, User Interface Analysis and Design.
Module
4 (12 Hours)
Testing
and Quality Assurance: A Strategic
Approach to Software Testing, Test Strategies for Conventional Software, Test
Strategies for Object-Oriented Software, Test Strategies for Web Applications,
Validation Testing, System Testing, Debugging, White-Box Testing, Control
Structure Testing, Black-Box Testing, Model-Based Testing, Statistical Software Quality Assurance,
Software Reliability.
Module
5 (12 Hours)
Managing
Software Project: The Management
Spectrum, Process Metrics and Product Metrics, Software Measurement, Software
Quality Metric, Integration of Metrics, Project Planning Process, Decomposition
Techniques, Empirical Estimation Models, Project Scheduling, Risk Management.
Text Books:
1.
Roger S. Pressman ,” Software Engineering- A Practitioner’s Approach”,
Seventh Edition, Mc GrawHill
Higher Education, 2010.
2.
Pankaj Jalote ,” Software Engineering”, Narosa Publications.
3.
Rajib Mall, “Fundamentals of Software Engineering”, PHI learning Private
Limited New Delhi, 2009.
References:
1.
Ian Somerville, “Software Engineering “, Pearson Education
2.
Richard Fairly,” Software Engineering Concepts”, Tata McGraw Hill.
3. Waaman S Jawadekar,” Software
Engineering- A Primer”, Tata McGraw
Hill.
4. Ali Behforooz and Frederick J.
Hudson, “Software Engineering Fundamentals”, Oxford University Press, New
Delhi, 1996.
5. Edward Kit, “Software Testing
in the Real World”, Addition Wesley, 2000.
6. Shari Lawrence Pfleeger,
“Software Engineering theory and practice”, Second edition, Pearson Education
Asia, 2001.
|
(Common with CS010
601)
Objectives
- To develop
an understanding about basic algorithms and different problem solving strategies.
- To improve
creativeness and the confidence to solve non-conventional problems and
expertise for analysing existing solutions.
Module I (13 hours)
Introduction and Complexity
What is an algorithm – Properties of an Algorithm,
Development of an algorithm, Pseudo-code Conventions, Recursive Algorithms –
Performance Analysis - Space and Time Complexity –Asymptotic Notations – ‘Oh’,
‘Omega’, ‘Theta’, Worst, Best and Average Case Complexity, Running Time
Comparison, Common Complexity Functions -Recurrence Relations – Solving
Recurrences using Iteration and Recurrence Trees – Example Problems – Profiling
- Amortized Complexity.
Module II (11
hours)
Divide and
Conquer - Control
Abstraction, Finding Maximum and Minimum, Costs associated element comparisons
and index comparisons, Binary Search, Divide and Conquer Matrix Multiplication,
Stressen’s Matrix Multiplication, Quick Sort, Merge Sort. – Refinements.
Module III (14 hours)
Greedy
Strategy - Control Abstraction,
General Knapsack Problem, Minimum Cost Spanning Trees – PRIM’s Algorithm,
Kruskal’s Algorithm, Job sequencing with deadlines.
Dynamic
Programming - Principle of
Optimality, Multistage Graph Problem, Forward Approach, Backward Approach,
All-Pairs Shortest Paths, Traveling Salesman Problem.
Module IV (11 hours)
Backtracking – State Space Tree - Fixed Tuple and Variable Tuple Formulation
- Control Abstraction – Generating Function and Bounding Function - Efficiency
of the method - Monte Carlo Method – N-Queens Problem, Sum of Subsets.
Branch
and Bound Techniques – FIFO, LIFO,
and LC Control Abstractions, 15-puzzle.
Module V (11
hours)
Sophisticated Algorithms - Approximation Algorithms
– Planar Graph Coloring, Vertex cover - String Matching Algorithms – Rabin Karp
algorithm - Topological Sort - Deterministic and Non-Deterministic Algorithms.
Lower Bound Theory - Comparison Trees for
Searching and Sorting, lower bound on comparison based algorithms, Sorting,
Selection & Merging; Oracles and
Adversary Arguments –Merging,Basic concepts of randomized algorithm-Las Vagas
algorithm for search.
|
IT010 607 Network
Programming Lab
|
Objective:
- To impart a solid foundation of the state
of the art trends in computer networking and to provide a hands on
experience of the same. The lab aims to give an overarching insight to all
arenas of networking. The experiments may be taken up with the intention
to solidify the foundations of the basic networking course. The simulation
experiments are included to have familiarization of the architecture and
internal working of the tool and to equip the students with a free to use
mindset afterwards.
1 Java network programming –
1.1
Processing
Internet Addressing
1.2
Applications with UDP datagram and sockets
1.3
implementation
of TCP/IP client and server
1.3
2 Unix Network Programming
2.1
TCP
and UDP Socket programming and applications
2.2
Client-server
using RPC
2.3
Concurrent
Server using Threads or Process
2.4
Implementations of PC-to-PC file
transfer using serial port and MODEM.
3
Simulation of ARP/RARP.
4
Simulation of GoBackN, Selective Repeat
or Sliding Window protocol.
5
Remote Procedure Call (RPC) programming.
6
Study of Network Simulators (NS2 /
Glomosim)
6.1
Simulation of different network
topologies
6.2
Performance analysis of routing
protocols both for wired, wireless
6.2 networks
6.2
References
1.
W.R. Stevens, “Unix Network Programming,
Vol 1”, 2nd ed., Prentice-Hall
1. Inc., 1998.
1.
2.
Using
Java2 Platform – Weber (AWL)
3.
Douglas
E.Comer, Hands on Networking with Internet Technologies, Pearson
3. Education
3.
|
Internal Continuous Assessment (Maximum Marks-50)
50%-Laboratory practical and record
30%- Test/s
20%- Regularity in the class
End Semester Examination (Maximum
Marks-100)
70% - Procedure, conducting experiment, results, tabulation, and
inference
30% - Viva
voce
IT010 608 Mini Project
|
Objectives
§ To
estimate the ability of the student in transforming the theoretical knowledge
studied so far into application software.
§ For
enabling the students to gain experience in organisation and implementation of
a small project and thus acquire the necessary confidence to carry out main
project in the final year.
§ To
understand and gain the knowledge of software engineering practices, so as to
participate and manage large software engineering projects in future.
In
this practical course, each group consisting of two/three members (four in
special cases) is expected to design and develop practical solutions to real
life problems related to industry, institutions and computer science research.
Software life cycle should be followed
during the development. The theoretical knowledge, principles and practices
gained from various subjects should be applied to develop effective solutions
to various computing problems. The knowledge gained during various practical
subjects to work with various software tools, Designing tools, programming
languages, operating systems, etc. should be utilized in various stages of
development. Structured/ Object Oriented design techniques may be used for the
project. Software Requirements Specification (SRS), Modeling Techniques, Design
and Testing strategies should be documented properly.
|
ELECTIVE 1
IT010 606L03 : UNIX Shell Programming (Elective 1)
(Common with CS010 606L04)
|
2
Objectives
· To provide a fair knowledge of Unix concepts and gain sharp skills in Unix Shell programming
Pre-requisites: IT010 504 level of Operating Systems knowledge
Module 1. (8 hours)
Introduction to Unix:- Architecture of Unix, Features of Unix , Basic Unix Commands - Unix Utilities:- Introduction to unix file system, vi editor, file handling utilities, security by file permissions, process utilities, disk utilities, networking commands - Text processing utilities and backup
Module 2. (13 hours)
Introduction to Shells:-Unix Session, Standard Streams, Redirection, Pipes, tee Command, Command Execution, Command-Line Editing, Quotes, Command Substitution, Job Control, Aliases, Variables, Predefined Variables, Options, Shell/Environment Customization. Regular expressions, Filters and Pipes, Concatenating files, Display Beginning and End of files, Cut and Paste, Sorting, Translating Characters, Files with Duplicate Lines, Count characters, words or lines, Comparing Files.
Module 3. (12 hours)
grep:-Operation, grep Family, Searching for File Content.
sed:-Scripts, Operation, Addresses, commands, Applications, grep and sed.
awk:-Execution, Fields and Records, Scripts, Operations, Patterns, Actions, Associative Arrays, String Functions, Mathematical Functions, User Defined Functions, Using System commands in awk, Applications of awk, grep and sed
sed:-Scripts, Operation, Addresses, commands, Applications, grep and sed.
awk:-Execution, Fields and Records, Scripts, Operations, Patterns, Actions, Associative Arrays, String Functions, Mathematical Functions, User Defined Functions, Using System commands in awk, Applications of awk, grep and sed
Module 4. (15 hours)
Interactive Shells - Korn Shell, C Shell and BASH - Shell Features, Special Files, Variables, Output, Input, Exit Status of a Command, eval Command, Environmental Variables, Options, Startup Scripts, Command History, Command Execution Process.
Shell Programming - Korn Shell, C Shell and BASH -
Basic Script concepts, Expressions, Decisions: Making Selections, Repetition, special Parameters and Variables, changing Positional Parameters, Argument Validation, Debugging Scripts, Script Examples.
Module 5. (12 hours)
Process management:- Creation, Hierarchies, Sending signals to processes, exec, termination, Zombie, waitpid etc - Network management:- tools, Client server mechanism, address resolution, ping, telnet, ftp, dns and squid – X Window System:- Overview, Architecture, starting and stopping X, X clients and display
Reference Books
1. Behrouz A. Forouzan, Richard F. Gilberg,” Unix and shell Programming.”, Cengage
Learning
2. Sumitabha Das , “Unix the ultimate guide”, TMH. 2nd Edition.
3. Kernighan and Pike, “Unix programming environment”, PHI. / Pearson Education
4. Graham Glass, King Ables,” Unix for programmers and users”, 3rd edition, Pearson
Education
3. Kernighan and Pike, “Unix programming environment”, PHI. / Pearson Education
4. Graham Glass, King Ables,” Unix for programmers and users”, 3rd edition, Pearson
Education
5. Maurice J. Bach, “The Design of the Unix Operating System”, First Edition,
Pearson Education, 1999
IT010 606 L01 SIMULATION AND MODELLING
|
Objectives:
· To build knowledge on system modelling and system study on various applications.
· To design simulation models for various case studies like inventory, Telephone system, etc.
· To practice on simulation tools and impart knowledge on building simulation systems.
Module 1 (10 Hours)
The Concepts of a System, Continuous and Discrete Systems, System Modeling, Types of Models, Physical Models, Mathematical Models, Principal Used in Modeling, Corporate Model, Environment Segment, Production Segment, Management Segment, The Full Corporate Model, System Analysis, System Design, System Postulation.
Module 2 (13 Hours)
The Monte Carlo Method, Types of System Simulation, Numerical Computation Technique for Continuous Models, Numerical Computation Technique for Discrete Models, Distributed Lag Models, Cobweb Models. Continuous System Models, Differential Equations, Analog Computers, Hybrid Computers, Digital-Analog Simulators, Continuous System Simulation Lanuages, CSMP III, Hybrid Simulation, Feedback Systems, Interactive Systems, Real- Time Simulation.
Module 3 (13 Hours)
Exponential Growth and Decay Models, Modified Exponential Growth Models, Logic Curves, System Dynamics Diagrams, Multi-Segment Models, Representation of Time Models, The DYNAMO Language. Stochastic Variables, Discrete and Continuous Probability Functions, Continuous Uniformly Distributed Random Numbers, Uniform Random Number Generator, Non-Uniform Continuously Distributed Random Numbers, Rejection Method.
Module 4 (12 Hours)
Congestion in Systems, Arrival Patterns, Exponential Distribution, Erlang Distribution, Hyper-Exponential Distribution, Normal Distributions, Queing Disciplines, Simulation of a Telephone System, Simulation Programming Tasks, Discrete Simulation Languages. GPSS Programs, Succession of Events, Simulation of a Manufacturing Shop, Facilities and Storages, Gathering Statistics, Conditional Transfers, Program Control statements, GPSS Examples.
Module 5 (12 Hours)
SIMSCRIPT Programs, SIMSCRIPT System Concepts, Organization of SIMSCRIPT Programs, SIMSCRIPT Statements, Management of Sets in SIMSCRIPT, Telephone System Model, Simulation Programming Techniques.
Text Books
1. Geofferry Gordan, “ System Simulation”, Prentice Hall of India, New Delhi,2004.
Reference Books
1. H. James Harrington and Kerim Tumay, ”Simulation Modeling Methods”, Tata McGraw Hill
2. Averill M. Law , “Simulation Modeling and Analysis”, 4th Ed., Tata McGraw Hill
3. Greenlaw, simulation modeling and analysis, Tata McGraw-Hill Education
|
IT010 606L02 Management Information Systems
|
Objective:
· To provide information needed to manage organizations effectively
Module 1 (12 Hours)
Information System and Organization: Matching the Information System Plan to the Organizational Strategic Plan, Identifying Key Organizational Objective and Processes and Developing an Information System Development, User role in Systems Development Process, Maintainability and Recoverability in System Design.
Module 2 (12 Hours)
Representation and Analysis of System Structure: Models for Representing Systems Mathematical, Graphical and Hierarchical (Organization Chart, Tree Diagram), Information Flow, Process Flow, Methods and Heuristics, Decomposition and Aggregation, Information Architecture, Application of System Representation to Case Studies.
Module 3 (12 Hours)
Systems, Information and Decision Theory: Information Theory, Information Content and Redundancy, Classification and Compression, Summarizing and Filtering, Inferences and Uncertainty, Identifying Information needed to Support Decision Making, Human Factors, Problem characteristics and Information System Capabilities in Decision Making.
Module 4 (12 Hours)
Information System Application: Transaction Processing Applications, Basic Accounting Application, Applications for Budgeting and Planning, Other use of Information Technology: Automation, Word Processing, Electronic Mail, Evaluation Remote Conferencing and Graphics, System and Selection, Cost Benefit, Centralized vs. Decentralized Allocation Mechanism.
Module 5 (12 Hours)
Development and Maintenance Of Information Systems: Systems analysis and design, System development life cycle, Limitation, End User Development, Managing End Users, off-the shelf software packages, Outsourcing, Comparison of different methodologies.
Text Books
1. Ken Laudon, Jame Laudon, Rajanish Dass, “Management Information Systems: Managing the digital firm”,11th edition, Pearson Education, 2010.
2. K.C.Laudon J.P.Laudon, “Management Information Systems - Organization and Technology in the Networked
References
1. E.F. Turban, R.K. Turban, R.E. Potter, “Introduction to Information Technology”, John Wiley and Sons, 3rd Edition, 2004.
2. Wiley and M.E. Brabston, “Management Information Systems: Managing the digital firm”, Pearson Education, 2002.
3. Jeffrey A. Hoffer, Joey F. George and Joseph S. Valachich, “Modern Systems Analysis and Design”, Third Edition, Prentice Hall, 2002.
4. Robert Schulthesis and Mary Sumner, ” Management Information System-The Manager’s View, Tata Mc Graw Hill New Delhi.
5. Waman S Jawadekar, “ Management Information Systems-Text and Cases”, Tata Mc Graw Hill New
6. O’Brien, Management Information Systems, 9e, Tata McGraw-Hill Education
|
IT010 606 L04 : Advanced Database Systems
Objectives
· Be able to design high-quality relational databases and database
· applications.
· Have developed skills in advanced visual & conceptual modelling and
· database design..
· Have developed an appreciation of emerging database trends as they
· apply to semi-structured data, the internet, and object-oriented databases.
Pre-requisites: IT010 506 Database Management Systems level of database knowledge
Module 1. Distributed Databases 8
Distributed Databases Vs Conventional Databases – Architecture – Fragmentation
– Query Processing – Transaction Processing – Concurrency Control – Recovery.
Module 2. Object Oriented Databases 15
Introduction to Object Oriented Data Bases - Approaches - Modelling and Design
- Persistence – Query Languages - Transaction - Concurrency – Multi Version
Locks - Recovery.
Module 3. Emerging Systems 12
Enhanced Data Models - Client/Server Model - Data Warehousing and Data
Mining - Web Databases – Mobile Databases.
Module 4. Database Design Issues 13
ER Model - Normalization - Security - Integrity - Consistency - Database Tuning
- Optimization and Research Issues – Design of Temporal Databases – Spatial
Databases.
Module 5. Current Issues 12
Rules - Knowledge Bases - Active And Deductive Databases - Parallel Databases
– Multimedia Databases – Image Databases – Text Database
Reference Books
1. Elisa Bertino, Barbara Catania, Gian Piero Zarri, “Intelligent Database Systems”,
Addison-Wesley, 2001.
2. Carlo Zaniolo, Stefano Ceri, Christos Faloustsos, R.T.Snodgrass,
V.S.Subrahmanian, “Advanced Database Systems”, Morgan Kaufman, 1997.
3. N.Tamer Ozsu, Patrick Valduriez, “Principles Of Distributed Database Systems”,
Prentice Hal International Inc., 1999.
4. C.S.R Prabhu, “Object-Oriented Database Systems”, Prentice Hall Of India, 1998.
5. Abdullah Uz Tansel Et Al, “Temporal Databases: Theory, Design And
Principles”, Benjamin Cummings Publishers, 1993.
6. Raghu Ramakrishnan, Johannes Gehrke, “Database Management Systems”,
Mcgraw Hill, Third Edition 2004.
7. Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System
Concepts”, Fourth Ediion, Mcgraw Hill, 2002.
8. R. Elmasri, S.B. Navathe, “Fundamentals Of Database Systems”, Pearson Education,
2004
IT010 606L05: Parallel Computing
Objectives
· To give an introduction to parallel computing that studies problem solving using a large number of inter connected processors.
· To develop understanding about the various models of parallel computation and also gives knowledge about the algorithms for merging, sorting, searching and FFT.
Pre-requisites: IT010 403 Computer Organisation and Architecture
Module I (10 hours)
Parallel processing - Control-Parallel approach - Data-Parallel approach - Data-Parallel approach with I/O - PRAM Model - PRAM Algorithms - Parallel Reduction - Prefix Sums - List Ranking - Preorder Tree Traversal - Merging Two Sorted Lists - Graph Coloring - Reducing Number of Processors
Module II (12 hours)
Processor Organizations- Processor arrays- UMA and NUMA multiprocessors – Multicomputers – nCUBE2 – Connection Machine CM5 – Paragon XP/S- Flynn’s Txonamy – Speed up and scaled speed up – Parallelizability- Mapping – Dynamic load balancing on multicomputers-Scheduling
Module III (14 hours)
Classifying MIMD Algorithms – Hypercube SIMD Model – Shuffle Exchange SIMD Model
– 2D Mesh SIMD Model – UMA Multiprocessor Model – Broadcast – Prefix Sums.
Enumeration Sort – Lower Bound on Parallel Sorting – Odd-Even Transposition Sort –
Bitonic Merge – Parallel Quick Sort
Module IV (14 hours)
Complexity of Parallel Search – Searching on Multiprocessors - P-Depth Search – Breadth Death Search – Breadth First Search – Connected Components – All pair Shortest Path – Single Source Shortest Path – Minimum Cost
Spanning Tree.
Module V (10 hours)
Matrix Multiplication on 2-D Mesh, Hypercube and Shuffle Exchange SIMD Models –
Algorithms for Multiprocessors – Algorithms for Multicomputers – Row oriented algorithm and block oriented algorithm.
Reference Books
1. Michael J. Quinn, Parallel Computing – The Theory and Practice, McGraw-Hill, INC
2. Ananth Grame, George Karpis, Vipin Kumar and Anshul Gupta, Introduction to
Parallel Computing, 2nd Edition, Addison Wesley, 2003
3. Selim G. Akl, The Design and Analysis of Parallel algorithms, PHI,
4. V. Rajaraman and C. Siva Ram Murthy, Parallel Computers – Architecture and
Programming, PHI,
5. Michael J. Quinn, Parallel Computing – Parallel Programming In C With Mpi And Openmp, McGraw-Hill,INC,
objectives
·
· To provide graduate students with a systematic training in the use of nonlinear optimization techniques in research and applications
Pre-requisites: EN010 101, EN010 301, EN010 401, EN010 501B level knowledge
Module1 Classical optimization techniques (12 Hours)
Single variable optimization – Multivariable optimization with no constraints – Hessian matrix – Multivariable saddle point – Optimization with equality constraints – Lagrange multiplier method – Multivariable optimization with inequality constrains – Kuhn- Tucker conditions.
Module 2 Constrained multivariable optimization (12 Hours)
Elimination methods – unrestricted search method – Fibonacci method – Interpolation methods – Quadratic interpolation and cubic interpolation methods.
Module 3 One-dimensional unconstrained minimization (12 Hours)
Gradient of a function – Steepest descent method – Newton’s method – Powells method – Hook and Jeeve’s method.
Module 4 Integer – Linear programming problem (12 Hours)
Gomory’s cutting plane method – Gomory’s method for all integer programming problems, mixed integer programming problems.
Module 5 Network Technique (12 Hours)
Shortest path model – Dijkstra’s Algorithm – Floyd’s Algorithm – minimum spanning tree problem – PRIM algorithm – Maximal Flow Problem algorithm.
Reference Books
- Optimization theory and application - S.S. Rao, New Age International P. Ltd.
- Optimization Concepts and applications in Engineering - A. D. Belegundu, T.R. Chandrupatla, Pearson Education Asia.
- Principles of Operations Research for Management - F. S. Budnick, D. McLeavey, R. Mojena, Richard D. Irwin, INC.
- Operation Research an introduction - H. A. Taha, Eastern Economy Edition.
- Operation Research – R. Pannerselvam, PHI
No comments:
Post a Comment