Download M.Tech ICT - Punjabi University

SYLLABUS
OUTLINES OF PAPERS AND TESTS
M. TECH (INTERNET & COMMUNICATION TECHNOLOGY)
SECOND YEAR-THIRD SEMESTER EXAMINATIONS
(2009-10, 2010-11 Sessions)
CODE NO.
TITLE OF PAPER
CONTINUOUS
ASSESSMENT
UNIVERSITY
EXAMINATION
MAXIMUM
MARKS
ICT-711
Multimedia
Information
Systems
Mobile Communication
Software Lab-III
Project
Elective
50
50
100
50
60
100
50
310
50
40
100
50
290
100
100
200
100
600
ICT-712
ICT-713
ICT-714
Electives
ICT-715
ICT-716
ICT-717
ICT-718
ICT-719
ICT-720
ICT-721
Note :
TIME
TOTAL
ALLOWED
3 Hrs.
Advanced Communication Networks
E-Commerce
Graph Theory
Pattern Recognition
Data Mining
Modeling and Simulation
Natural Language Processing
Depending upon the availability of the teachers, the electives will be offered to the
students. The decision of the Head of the Department in this respect will be final.
The project will be evaluated by a committee having following members :
HOD/HOD's Nominee
Internal Supervisor
One/two nominee of D.A.A.
External Examiner
The quorum will be of any three members.
CONTINUOUS ASSESSMENT (THEORY PAPERS)
1.
Two or three tests out of
which best two will be
considered for assessment.
60% of the marks allotted for
Continuous Assessment.
2.
Seminars/Assignments/Quizzes
30% of the marks allotted for
Continuous Assessment.
3.
Attendance, class participation and
behavior
10% of the marks allotted for
Continuous Assessment.
3 Hrs
3 Hrs.
----3 Hrs.
ICT-711 MULTIMEDIA INFORMATION SYSTEMS
LTPC
4105
Maximum Marks: 50
Minimum Pass Marks: 40%
Maximum Time: 3 Hrs.
Lectures to be delivered: 55-60
A) Instructions for paper-setters
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will have two
questions from the respective sections of the syllabus and will carry 20% marks each. Section E will have
5-10 short answer type questions which will cover the entire syllabus uniformly and will carry 20% marks
in all.
B) Instructions for candidates
1.
Candidates are required to attempt one question each from sections A, B, C and D of the
question paper and the entire section E.
2.
Use of non programmable scientific calculator is allowed.
SECTION A
Multimedia Communications :
Multimedia information representation, multimedia
networks, multimedia applications, applications and networking terminology.
Multimedia Information Representation : Digitization Principles, text, images, audio, video.
Text and Image Compression : Text compression-Static Huffman Coding, Dynamic Huffman Coding,
LZW Coding
Image Compression : File formats : GIF and TIFF, digitized documents, Modified READ,
JPEG, Forward DCT, Quantization, Entropy Encoding, Frame building, JPEG decoding.
SECTION B
Audio and Video Compression : Introduction, audio compression (DPCM, ADPCM, APC, LPC, CELP),
perceptual coding, MPEG audio coders, Dolby audio coders.
Video compression : Video compression principles, frame types, motion estimation and
compensation, implementation issues, H.261, H.263, MPEG : MPEG-1, MPEG-2, MPEG-4, MP@ML,
HDTV.
SECTION C
Standards for Multimedia Communications : Introduction, Reference Models, TCP/IP reference model,
protocol basics, standards relating to interpersonal communication, circuit-mode networks, H.320,
H.321/H.310, H.322. H.323, IETF, Electronic mail.
Standards Relating to Interactive Applications over Internet : Information browsing, electronic
commerce, Intermediate systems.
Standards for Entertainment Applications-video-on : Demand, Interactive TV.
SECTION D
Entertainment Networks and High Speed Modems : Cable TV networks, HFC networks, multi-access
channel operations, protocol stack, configuration and management, cable MAC, Time synchronization,
Ranging, Frame transmission, frame formats, fragmentation.
Satellite TV Networks : Broadcast TV principles, Digital TV, Interactive services, Terrestrial TV
networks, Broadcast TV principles, COFDM principles, High speed PSTN access technologies, ADSL,
VDSL.
Application Support Functions : Introduction, ASN.1 Type definitions, Transfer syntax, Security, Data
Encryption, The data encryption standard, DES, Triple DES, IDEA, The RSA algorithm, Non repudiation,
Authentication, Public Key Certification Authorities.
TEXT :
1.
Prabhat K. Andleigh, Kiran Thakrar, “Multimedia Systems Design”, PHI, 2004.
REFERENCES :
1.
Multimedia Information Networking, Nalin K. Sharda, PHI, 2003.
ICT-712 MOBILE COMMUNICATION
LTPC
4105
Maximum Marks: 50
Minimum Pass Marks: 40%
Maximum Time: 3 Hrs.
Lectures to be delivered: 55-60
A) Instructions for paper-setters
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will
have two questions from the respective sections of the syllabus and will carry 20% marks each.
Section E will have 5-10 short answer type questions which will cover the entire syllabus
uniformly and will carry 20% marks in all.
B) Instructions for candidates
1.
Candidates are required to attempt one question each from sections A, B, C and D of
the question paper and the entire section E.
2.
Use of non programmable scientific calculator is allowed.
SECTION A
Introduction: History of wireless Communication, Reference Model, Applications,
Classification of Mobile Communication Systems : Introduction, Paging Systems, Wireless
Telephony, Trunking Systems, Cellular Systems, Personal Satellite Communication Systems,
Wireless access to the Local Area Networks.
Wireless Transmission: Frequencies for radio transmission, signals, antennas, signal
propagation, multiplexing, modulation, spread spectrum, cellular systems.
SECTION B
Medium Access Control: MAC: hidden and exposed terminals, near and far terminals. SDMA,
FDMA, TDMA, CDMA, Comparison of SDMA, FDMA, TDMA, CDMA.
Telecommunication Systems: GSM, DECT, TETRA, UMTS and IMT-2000.
SECTION C
Channel Assignment Techniques : Centralized DCA, Decentralized DCA, Fully Decentralized
DCA, Hybrid Schemes.
Wireless LAN: IEEE 802.11, 802%, HIPERLAN, Bluetooth, Security in Wireless LAN, Wi Max
Wireless ATM: WATM working group, WATM services, Reference model for WATM, Functions.
SECTION D
Mobile Network Layer: Mobile IP, Dynamic host configuration protocol, Ad hoc networks.
Mobile transport layer: Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP, Fast
retransmit/ fast recovery, time out freezing, selective retransmission.
TEXT :
1.
2.
J. Schiller, “Mobile Communications”, Addison-Wesley, Second Indian Reprint, 2000.
Principles of Mobile Communication by Gordon stuber.
REFERENCES:
1.
A.S. Tanenbaum, "Computer Networks", 4th edition, Pearson Education, 2003.
2.
Ivan Stojmenovi & Cacute, "Handbook of Wireless Networks and Mobile Computing",
Wiley, 2002.
3.
Hansmann, "Principles Of Mobile Computing", Wiley India, 2004.
4.
Mobile Communication Systems by Krzysztoj Wesolowski.
ICT-713
SOFTWARE LAB-III
LTPC
0066
Maximum Marks: *
Maximum Time: 3 Hrs.
Minimum Pass Marks: 40%
Practical Sessions to be conducted: 45-55
The
Laboratory
assignments
for
this
lab
will
include
the
assignments
on
1.
The Modeling and Performance of Computer Networks Using Networks Simulator, and
2.
ASP.NET based upon the syllabus mentioned as follows :
Introduction to .NET Framework: CLR, MSIL, JIT Compiler, Multi-lingual
Introduction to ASP.NET: Page framework, Postback events,
Web forms: Round trips, View state
Server Controls: Label, Button, Checkbox, Radio Button, Radio ButtonList, ListBox,
LinkButton, Calendar and Image controls
Validation controls: Server side and client side validation, interacting with validation
controls, validation at runtime, range validation..
ADO.NET: Features, Data Sets, Data Adapter, Data View, Sql Connection, OleDb
connection, Data Relation, Data Reader.
ASP.NET configuration file (web.config), Global File (global.asax)
State Management: application state, application state collections, session state,
features of session, session with out cookies, identifying session, session state storage,
session state configuration.
Security in ASP.NET
*Maximum Marks for Continuous Assessment:
Maximum Marks for University Examination:
60
40
ICT-714 PROJECT
Maximum Marks: 200 *
Minimum Pass Marks: 40%
In this paper, the students will be doing analysis/implementation of a
research problem to be assigned by internal guide. The student is expected
to carry out detailed we nature survey of the research problem. At the end
of the semester the student will submit a report the work carried out.
Maximum Marks for Continuous Assessment: 100
* Maximum Marks for University Examination:
100
*
ICT-715 ADVANCED COMMUNICATION NETWORKS
LTPC
4105
Maximum Marks: 50
Minimum Pass Marks: 40%
Maximum Time: 3 Hrs.
Lectures to be delivered: 55-60
A) Instructions for paper-setters
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will
have two questions from the respective sections of the syllabus and will carry 20% marks each.
Section E will have 5-10 short answer type questions which will cover the entire syllabus
uniformly and will carry 20% marks in all.
B) Instructions for candidates
1.
Candidates are required to attempt one question each from sections A, B, C and D of
the question paper and the entire section E.
2.
Use of non programmable scientific calculator is allowed.
SECTION A
Network Hardware, Network Software, Reference Models: OSI, TCP/IP; Network Models:
Internet, X.25, Frame Relays, ATM, Ethernet, Wireless LANs; Network Standardization.
Transmission media: Fiber Optics; Wireless Transmission: Radio, Microwave, Infrared,
Millimeter Waves, Lightwave; Satellite; Mobile Telephone System; Cable Television.
SECTION B
Data link layer: Wireless LANs; Broadband Wireless; Bluetooth; Bridges.
Network Layer: Routing: Broadcast, Multicast, Routing for Mobile Hosts, Ad Hoc Networks;
Congestion; Quality of Service.
SECTION C
Internet Transport Protocols: Elements; UDP; TCP; Wireless TCP and UDP.
Electronic Mail; World Wide Web; Multimedia: Digital Audio; Audio Compression; Streaming;
Voice over IP; Video Compression; Video on Demand; Multicast Backbone.
SECTION D
Network Security: Public Key Algorithms; Digital Signatures; Communication Security: Firewalls;
Wireless Security; E-Mail Security; Web Security.
TEXT :
1.
A.S. Tanenbaum, "Computer Networks", 4th edition, Pearson Education, 2003.
REFERENCES:
1.
2.
A. Shanmugam, S. Rajeev, "Computer Communication Networks" , First Edition, 2001.
J. Walrand, P. Varaiya, "High-Performance Communication Networks, Morgan
Kaufmann Publishers, 1996.
ICT-716 E-COMMERCE
LTPC
4105
Maximum Marks: 50
Minimum Pass Marks: 40%
Maximum Time: 3 Hrs.
Lectures to be delivered: 55-60
A) Instructions for paper-setters
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will
have two questions from the respective sections of the syllabus and will carry 20% marks each.
Section E will have 5-10 short answer type questions which will cover the entire syllabus
uniformly and will carry 20% marks in all.
B) Instructions for candidates
1.
Candidates are required to attempt one question each from sections A, B, C and D of
the question paper and the entire section E.
2.
Use of non programmable scientific calculator is allowed.
SECTION A
E-Commerce: Meaning, advantages & disadvantages.
Electronic Commerce Framework, Electronic Commerce and media Convergence, Types of ECommerce: B2C, B2B, C2C, P2P, M Commerce.
Architectural Framework for Electronic Commerce, World Wide Web as the Architecture, Web
Background: Hypertext publishing, Security and the Web.
SECTION B
Legal issues of E-commerce: Risks, Paper document verses electronic document, Technology
for authenticating an electronic document.
Laws for E-commerce: EDI Interchange Agreement. E-commerce in India – Laws for Ecommerce in India.
Ethical and other public policy issues related to Electronic Commerce: Protecting privacy,
protecting Intellectual property, Copyright, trademarks and patents, Taxation and encryption
policies.
SECTION C
E-Commerce Business Models: Key Element of a Business Model, Major B2C business Models
Portal,
e-tailer, Content Provider, Transaction Broker, Market creation, Service Provider, Community
Provider, Major B2B Business Models, Market Place, E-Distributor, B2B Service Provider,
Match-Maker, Infometiary. Business Models in emerging e-commerce areas- C2C business
models, P2P Business Models, M Commerce Business Models.
SECTION D
Types of Electronic Payment Systems, Digital Token Based Electronic Payment Systems,
Digital Wallet, Digital Cash, Smart cards Electronic payment Systems, Credit Card Based
Electronic Payment Systems, Risk in Electronic payment Systems, Secure Electronic
Transaction Protocol.
Electronic Data Interchange, EDI Applications in Business, EDI: Legal, Security and Privacy
Issue, EDI and Electronic Commerce.
TEXT :
1.
Kenneth C Lauden, Carol G. Traver, "E-Commerce", Perason Education.
REFERENCES:
1.
2.
3.
4.
5.
6.
Efraim Turban, Jae Lee, David King, Chung "Electronic Commerce- A managerial
perspective" Prentice-Hall International. (5th reprint, 2004)
Kamlesh K. Bajaj, Debjani Nag, "Electronic Commerce: The cutting edge of business",
Tata McGraw-Hill Publishing Co. Ltd, 2000.
Jeffrey F. Rayport, Bernard J. Jaworski, "e-Commerce", Tata McGraw Hill, 2002.
David Whiteley, "e-Commerce", Tata McGraw Hill, 2002.
Pete Loshin, Paul A. Murphy, "Electronic Commerce", Jaico Publishing House, 2000.
Ravi Kalakota, Andrew B. Whinston, "Frontiers of Electronic Commerce", Addison
Wesley, 2002.
ICT-717 GRAPH THEORY
LTPC
4105
Maximum Marks: 50
Minimum Pass Marks: 40%
Maximum Time: 3 Hrs.
Lectures to be delivered: 55-60
A) Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will
have two questions from the respective sections of the syllabus and will carry 20% marks each.
Section E will have 5-10 short answer type questions which will cover the entire syllabus
uniformly and will carry 20% marks in all.
B) Instructions for candidates
1.
Candidates are required to attempt one question each from sections A, B, C and D of
the question paper and the entire section E.
2.
Use of non-programmable scientific calculator is allowed.
SECTION A
Introduction: Definition of Graph, Applications and brief History of Graphs, Sub-graph, Multigraph, Pseudo-graph, Digraph, Weighted graph, Finite, Infinite Graphs.
Basic Concepts: Incidence & Degree, Isolated Vertex, Pendent Vertex, Null Graph.
Connectivity and Traversability: Isomorphism, Walks, Paths, Circuits, Connected and
Disconnected Graphs, Complete Graphs, Eulerian Graphs, Hamiltonian Graph, Cut Vertices,
Cut-Edges/Cut Sets, Properties, Connectivity and Separability
SECTION B
Trees: Characterizations, Tree distances, Rooted and Binary trees, Spanning Trees,
Fundamental cycles.
Planarity: Planar & non-planar graphs, Kuratowski's Two Graphs, Planar Graph
Representations, Detection of Planarity, Thickness & Crossing Numbers.
SECTION C
Matrix representation of Graph: Adjacency, Incidence, Cycle, Cut-set and Path Matrices.
Digraphs: Definition, Types, Connectivity, Circuits, Euler Digraphs, Directed Tree, Tournaments.
SECTION D
Application Algorithms of Graph: Study of Breadth First Search, Depth First Search, Kruskal’s,
Prim’s Algorithm, Dijkstras & Floyd’s Algorithms and their Complexities. Network Flows, MaxFlow Min-cut Theorems, Transportation Networks.
TEXT :
1.
Deo. N, "Graph Theory with Applications to Engineering and Computer Science"
Prentice Hall Inc. 1974.
REFERENCES:
1.
2.
Harray . F, "Graph Theory", Addison – Wesley Pub. 1972.
C. R. Foulds, "Graph Theory Applications", Narosa Publishing House, 1994.
ICT-718 PATTERN RECOGNITION
LTPC
4105
Maximum Marks: 50
Minimum Pass Marks: 40%
Maximum Time: 3 Hrs.
Lectures to be delivered: 55-60
A) Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will
have two questions from the respective sections of the syllabus and will carry 20% marks each.
Section E will have 5-10 short answer type questions which will cover the entire syllabus
uniformly and will carry 20% marks in all.
B) Instructions for candidates
1. Candidates are required to attempt one question each from sections A, B, C and D of the
question paper and the entire section E.
2. Use of non-programmable scientific calculator is allowed.
SECTION A
INTRODUCTION: Machine Perception, What is Pattern Recognition (PR)?, Pattern Recognition
system: sensing, segmentation & grouping, feature extraction, classification and post
processing, Design cycle: data collection, feature choice, model choice, training, evaluation and
computational complexity. Learning and adaptation: supervised learning, unsupervised learning
and reinforcement learning. Examples of PR Applications, Pattern Recognition Extensions.
SECTION B
STATISTICAL PATTERN RECOGNITION (StatPR): Introduction to StatPR, baye’s theorem,
multiple features, conditionally independent features, decision boundaries, unequal costs of
error, estimation of error rates, characteristic curves, estimating the composition of populations,
introduction to Supervised Parametric Approaches and Unsupervised Approaches. Cluster
analysis: clustering techniques, cluster analysis, cluster validity. Feature selection & extraction:
feature selection criteria, feature set search algorithm, feature selection.
SECTION C
SYNTACTIC (STRUCTURAL) PATTERN RECOGNITION (SyntPR): Introduction to SyntPR,
Syntactic PR: primitive selection & pattern grammars, higher – dimensional grammars, syntactic
recognition, automata, error – correcting parsing, shape & texture analysis, image database
management. Structural Analysis Using Constraint Satisfaction and Structural Matching, The
Formal Language-based Approach to SyntPR, Learning/Training in the Language-based
Approach (Grammatical Inference). Problem solving methods for PR: problem solving models,
problem solving algorithms.
SECTION D
NEURAL PATTERN RECOGNITION (NeurPR): Neurons and Neural Nets, Feedforward
Networks,Hopfield (CAM) Approaches, Other Related Neural Approaches and Extensions.
PROCESSING OF WAVEFORMS AND IMAGES Introduction, gray level scaling
transformations, equalization, geometric image and interpolation, Smoothing, transformations,
edge detection, Laplacian and sharpening operators, line detection and template matching,
logarithmic gray level sealing, the statistical significance of image features.
TEXT :
1.
Eart Gose, Richard Johnsonburg and Steve Joust, “Pattern Recognition and Image
Analysis”, Prentice-Hall of India-2003.
REFERENCES :
1.
2.
NY, Rober J. Schalkoff, "Pattern Recognition, Statistical, Syntactic and Neural
Approaches", John Wiley and Sons.
Richard O. Duda, Peter E. Hart, D and G. S. Stork, "Pattern Recognition", Wiley
Interscience, 2000.
ICT-719 DATA MINING
LTPC
4105
Maximum Marks: 50
Minimum Pass Marks: 40%
Maximum Time: 3 Hrs.
Lectures to be delivered: 55-60
A) Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will
have two questions from the respective sections of the syllabus and will carry 20% marks each.
Section E will have 5-10 short answer type questions which will cover the entire syllabus
uniformly and will carry 20% marks in all.
B) Instructions for candidates
1.
Candidates are required to attempt one question each from sections A, B, C and D of
the question paper and the entire section E.
2.
Use of non-programmable scientific calculator is allowed.
SECTION A
Data Mining Introduction: What Motivated Data Mining?, Why Is It Important? , What Is Data
Mining? , Data Mining--On What Kind of Data?, Data Mining Functionalities-What Kinds of
Patterns Can Be Mined?, Are All of the Patterns Interesting? Classification of Data Mining
Systems, Data Mining Task Primitives, Integration of a Data Mining System with a Database or
Data Warehouse System, Major Issues in Data Mining.
Data Pre-processing: Why Pre-process the Data?, Descriptive Data Summarization, Data
Cleaning, Data Integration and Transformation, Data Reduction, Data Discretization and
Concept Hierarchy Generation.
SECTION B
Data Warehouse and OLAP Technology: What Is a Data Warehouse?, A Multidimensional Data
Model, Data Warehouse Architecture, Data Warehouse Implementation, From Data
Warehousing
to
Data
Mining.
Mining Frequent Patterns, Associations, and Correlations: Basic Concepts and a Road Map,
Efficient and Scalable Frequent Item set Mining Methods, Mining Various Kinds of Association
Rules, From Association Mining to Correlation Analysis, Constraint-Based Association Mining.
Classification and Prediction: What Is Classification? What Is Prediction?, Issues Regarding
Classification and Prediction, Classification by Decision Tree Induction, Bayesian Classification,
Rule-Based Classification, Classification by Back propagation, Support Vector Machines,
Associative Classification: Classification by Association Rule Analysis, Lazy Learners (or
Learning from Your Neighbors), Other Classification Methods, Prediction, Accuracy and Error
Measures, Evaluating the Accuracy of a Classifier or Predictor, Ensemble Methods—Increasing
the Accuracy, Model Selection.
SECTION C
Cluster Analysis: What Is Cluster Analysis? , Types of Data in Cluster Analysis, A
Categorization of Major Clustering Methods, Partitioning Methods, Hierarchical Methods,
Density-Based Methods, Grid-Based Methods, Model-Based Clustering Methods, Clustering
High-Dimensional Data, Constraint-Based Cluster Analysis, Outlier Analysis
Mining Stream, Time-Series, and Sequence Data: Mining Data Streams, Mining Time-Series
Data, Mining Sequence Patterns in Transactional Databases, Mining Sequence Patterns in
Biological Data.
SECTION D
Graph Mining, Social Network Analysis, and Multi-Relational Data Mining: Graph Mining, Social
Network Analysis, Multi-Relational Data Mining.
Mining Object, Spatial, Multimedia, Text, and Web Data: Multidimensional Analysis and
Descriptive Mining of Complex Data Objects, Spatial Data Mining, Multimedia Data Mining, Text
Mining, Mining the World Wide Web
Applications and Trends in Data Mining: Data Mining Applications, Data Mining System
Products and Research Prototypes, Additional Themes on Data Mining, Social Impacts of Data
Mining, Trends in Data Mining.
TEXT :
1.
J. Han and M. Kamber, “Data Mining: Concepts and Techniques”, Morgan
Kaufmann/Elsevier India, 2006.
REFERENCES:
1.
2.
D. Hand, H. Mannila, and P. Smyth, “Principles of Data Mining", MIT Press, 2001.
Pang-Ning-Tan, Michael Steinbach and Vipan Kumar, "Introduction to Data Mining",
Addison
Wesley, 2005.
ICT-720 MODELLING AND SIMULATION
LTPC
4105
Maximum Marks: 50
Minimum Pass Marks: 40%
Maximum Time: 3 Hrs.
Lectures to be delivered: 55-60
A) Instructions for paper-setter
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will
have two questions from the respective sections of the syllabus and will carry 20% marks each.
Section E will have 5-10 short answer type questions, which will cover the entire syllabus
uniformly and will carry 20% marks in all.
B) Instructions for candidates
1.
Candidates are required to attempt one question each from sections A, B, C and D of
the question paper and the entire section E.
2.
Use of non-programmable scientific calculator is allowed.
SECTION A
Introduction to Simulation: Simulation: Definition and Scope, Advantages and Disadvantages of
Simulation, Areas of Application#1 (A Brief Overview of various applications of Simulation as
published in various Journals: Scope includes problem definition and relevance of simulation
tools for analysis), Systems and System Environment, Components of a System, Discrete and
Continuous Systems, Model of a System, Types of Models, Discrete-Event System Simulation,
Steps in a Simulation Study, Simulation Examples#2 (on Queuing and Inventory Systems). An
overview of discrete event and continuous simulation, Overview of Numerical techniques/
methods used for discrete-event simulation and continuous simulation.
Note: #1: The students shall be divided in to different groups and be asked to refer Journals to
compile reports.
#2: The Students shall be asked to implement simple problems using programming languages/
spreadsheets.
SECTION B
Statistical Models in Simulation: Discrete random variables and continuous random variables,
Cumulative distribution function, Expectation and Variance, The mode, Review of Poisson and
Normal distribution, uniform distribution and exponential distribution.
Queuing Models:
Characteristics of Queuing systems, need and importance of simulation in queuing,
implementation of M/M/1// using programming language/ spreadsheet. Birth-death queuing
systems, Markovian queues in equilibrium. Scope does not include derivations of various
parameters of any of the queuing models. Random-Numbers: Characteristics of random
numbers, techniques for generating pseudo random numbers (Multiplicative-Additive
congruential method and its comparison with mid-square method to generate random numbers),
testing random number generators (Frequency Tests, Tests for Autocorrelation. Generating
Random-Numbers (Uniformly distributed, Inverse transformation method, Acceptance rejection
method, Exponential, Poisson, Erlang, Normal). Monte Carlo Simulation and its applications.
SECTION C
Input Modelling: Data collection, assessing sample independence, hypothesizing distribution
family with data, parameter estimation, goodness-of-fit tests, selecting input models in absence
of data, models of arrival processes International standing of the highest caliber.
Verification and Validation of Simulation Models: Model-Building, Verification, and Validation,
Verification of Simulation Models, Calibration and Validation of Models.
Output Analysis for a Single Model Types of Simulations with Respect to Output Analysis,
Stochastic Nature of Output Data Measures of Performance and Their Estimation, Output
Analysis for Terminating Simulations, Output Analysis for Steady-State Simulations.
SECTION D
Simulation of Computer Systems: Case studies on CPU Scheduling Algorithms, Disk
Scheduling Algorithms, Deadlock avoidance, page-replacement techniques, memory allocation
techniques. Networking Simulation Problems related to data link layer and network layer and
Traffic Modelling. (Students should be asked to define the problem and implement the simplest
model on these topics). Introduction to Simulation Software: Simulation Software, History of
Simulation Software and Selection of Simulation Software
TEXT:
1.
2.
Banks, Carson, Nelson, and Nicol "Discrete-Event System Simulation", 4th edition,
Prentice-Hall, 2005.
Nar Singh Deo, “Simulation Using Digital Computers”, Eastern Economy Edition
REFERENCES :
3.
4.
Law and Kelton, "Simulation Modeling and Analysis", McGraw Hill, 2000.
M.H. MacDougall, "Simulating Computer Systems: Techniques and Tools", MIT
Press Series in Computer Systems, 1987.
ICT-721 NATURAL LANGUAGE PROCESSING
LTPC
4105
Maximum marks: 50
Minimum pass marks: 40%
Maximum Time: 3 Hrs.
Lectures to be taken: 55-60
A) Instructions for paper-setters
The question paper will consist of five sections A, B, C, D and E. Sections A, B, C and D will
have two questions from the respective sections of the syllabus and will carry 20% marks each.
Section E will have 5-10 short answer type questions which will cover the entire syllabus
uniformly and will carry 20% marks in all.
B) Instructions for candidates
1. Candidates are required to attempt one question each from sections A, B, C and D of the
question paper and the entire section E.
2. Use of non programmable scientific calculator is allowed.
SECTION A
Introduction to Natural Language Processing (NLP): Definition, History , Applications of NLP ,
Goals of NLP
Words: Regular expressions and Automata, Morphology and Finite State Transducers,
Computational Phonology and Text-to-Speech, Probabilistic Models of Pronunciation and
Spelling, N-grams, HMMs and Speech Recognition
SECTION B
Syntax: Word Classes and Part-of Speech Tagging, Context Free Grammars for English,
Parsing with Context-Free Grammars, Features of Unification, Lexicalized and Probabilistic
Parsing, Language and Complexity
SECTION C
Semantics: Representing Meaning, Semantic Analysis, Lexical Semantics, Word Sense
Disambiguation and Information Retrieval
SECTION D
Pragmatics: Discourse, Dialogue and Conversational Agents, Natural Language Generation,
Machine Translation.
TEXT :
1.
Jurafsky, D. & J. Martin, "Speech and Language Processing: An Introduction to Natural
Language Processing Computational Linguistics, and Speech Recognition" Prentice
Hall, 2000.
REFERENCES:
1.
2.
3.
Grosz, B.J., Sparck Jones, K. & Webber, B.L. (eds) "Readings in natural language
processing", Los Altos, CA. Morgan Kaufmann, 1986.
Allen, J., "Natural Language Understanding", Redwood City, CA: 1994.
Benjamin/Cummings.
Bharti, Akshar,Chaitanya Vineet, Sangal Rajeev, "Natural Language Processing",
Prentice Hall.
SYLLABUS
OUTLINES OF PAPERS AND TESTS
M. TECH (INTERNET & COMMUNICATION TECHNOLOGY)
SECOND YEAR-FOURTH SEMESTER EXAMINATIONS
(2009-10, 2010-11 Sessions)
FOURTH SEMESTER
ICT-731
Dissertation
400 Marks
he break up of marks will be:
seminar:
Viva:
Project Report:
25% of total marks
25% of total marks
50% (External Examiner: 25% (to be awarded separately).
Committee : 25%)
Keeping in view the demand of software development industry and foreign clientele,
joining software development project may be allowed by the Head of the Department.
As such joint project reports will also be recognized and the students should highlight
their individual contributions in a joint project report at the time of viva-voce.
Allocation of Guides to M.Tech (lVth Semester) students:
(i)
The guide assigned to student for project in 3rd semester will continue to be
guide 4th semester as well. However, in case of exceptional circumstances
the g~e may be changed through The Chairman Board of Studies of the
Department and the local members of Board of Studies.
(ii)
The cases of those M.Tech Students who want to be project work outside
the department will also finalized by the above committee. The committee
will approve the external guide in addition to the Internal guide.
The project will be evaluated by a committee having following members.
-
HOD/HOD’s Nominee
-
Internal Supervisor
-
One/two nominee of D.A.A.
-
External Examiner
The Quorum will be of any three members.