jawaharlal nehru technological university …engineershub.co/syllabus-book/jntuh/mtech/m.tech... ·...

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABADM.Tech. (Information Technology)

COURSE STRUCTURE AND SYLLABUS

I YEAR I SEMESTERCode Group Subject L P Credits

Advanced Problem Solving 3 0 3Computer System Design 3 0 3Java & Web Technologies 3 0 3High Speed Networks 3 0 3

Elective –I Embedded Systems DesignAdvanced Databases and Data MiningLinux Programming

3 0 3

Elective -II Natural Language ProcessingSpeech ProcessingInformation Retrieval Systems

3 0 3

Lab Advanced Problem Solving & Web TechnologiesLab

0 3 2

Seminar - - 2Total Credits (6 Theory + 1 Lab.) 22

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

M.Tech. (Information Technology) Semester-I

Advanced Problem SolvingUnit IOOP Using Java - Class and Objects, Variables, Operators, Expressions, Methods, Decisionstatements,Loops,Arrays,OOP concepts- Encapsulation, Inheritance, Polymorphism,Abstraction, Modularity, Exception handling, Input and Output,Java andPointers,Interfaces,Packages, Abstract classes,Casting in Inheritance hierarchy,Casting withInterfaces,Vectors in java.util,Data Structures and OOP,Writing a java program-Design,coding,testing and debugging. Basic concepts(Review)- Abstact Data Types, Datastructures, Algorithms- Characteristics of Algorithms, Performance analysis- Time complexityand Space complexity,Asymptotic Analysis-Big O, Omega and Theta notations.Unit IILinear data structures- The List ADT, Array and Linked Implementations,Singly Linked Lists-Operations-Insertion,Deletion,Traversals,DoublyLinkedLists-Operations-Insertion,Deletion,SkipLists-implementation, StackADT,definitions,operations, Array and Linkedimplementations,applications-infix to postfix conversion, recursion implementation,tailrecursion,nontail recursion,indirect recursion, QueueADT, definitions and operations ,Array andLinked Implementations,Priority Queue ADT,Deque ADT,Implementation using doubly linkedlists,Stacks and Queues in java.util.Unit IIINon Linear data structures-Trees-Basic Terminology, Binary tree ADT,array and linkedrepresentations,iterative traversals,threaded binary trees,Applications-Disjoint-Sets,Union andFind algorithms,Huffman coding,General tree to binary tree conversion, Realizing a PriorityQueue using Heap.Search Trees- Binary Search Tree ADT, Implementation, Operations- Searching, Insertion andDeletion, Balanced Search trees-AVL Trees, Operations – Insertion and Searching,B-Trees, B-Tree of order m,Operations- Insertion,Deletion and Searching,Introduction to Red-BlackTrees,Splay Trees,B*-Trees,B+-Trees(Elementary treatement), Comparison of Search Trees,Trees injava.util.Unit IVSearching- Linear Search,Binary Search, Hashing-Hash functions,Collision-Handlingschemes,Hashing in java.util,Dictionary ADT,Linear list representation,Skip listrepresentation,Hash table representation,Comparison of Searching methods.Sorting- Bubble Sort,Insertion Sort,Shell sort,Heap Sort,Radix Sort,Quick sort,Merge sort,Comparison of Sorting methods,Sorting in java.util.Unit VGraphs–Basic Terminology, Graph Representations- Adjacency matrix,Adjacencylists,Adjacency multilists,Graph traversals- DFS and BFS, Spanning trees-Minimum costspanning trees,Kruskal’s Algorithm for Minimum cost Spanning trees, Shortest paths- SingleSource Shortest Path Problem,All Pairs Shortest Path Problem.Text Processing - Pattern matching algorithms- The Knuth-Morris-Pratt algorithm,The Boyer-Moore algorithm,Tries- Standard Tries, Compressed Tries, Suffix tries.

TEXT BOOKS :1. Data structures and Algorithms in Java,Adam Drozdek,Cengage Learning.2. Data structures and Algorithms in Java,Michael T.Goodrich and R.Tomassia , Wiley Indiaedition.

3. Data structures , Algorithms and Applications in Java,S.Sahani, Universities Press.

REFERENCE BOOKS :1. Data structures and algorithms in Java,Robert Lafore,Pearson Education.2. Data structures with Java,W.H.Ford and W.R.Topp,Pearson Education.3. Classic Data structures in Java,T.Budd,Pearson Education.4. Data Structures using Java,D.S. Malik and P.S.Nair, Cengage Learning,5.An Introduction to Data structures and Algorithms,J.A.Storer,Springer.6.Data structures and Java Collections Frame Work,W.J.Collins,Mc Graw Hill.7.Data structures with Java,J.R.Hubbard and A.Huray,PHI.8.Data Structures using Java,Y.Langsam,M.Augenstein,A.Tanenbaum,Pearson Education.9.Data structures with Java,J.R.Hubbard,Schaum’s Outlines,TMH.


M.Tech. (Information Technology) I Semester

Computer System DesignUNIT IComputer structure – hardware, software, system software, Von-neumann architecture– case study. IA -32 Pentium: registers and addressing, instructions, assembly language,program flow control, logic and shift/rotate instructions, multiply, divide MMX,SIMDinstructions, I/O operations, subroutines.Input/Output organizaton, interrupts, DMA, Buses, Interface circuits, I/O interfaces,device drivers in windows, interrupt handlers

UNIT IIProcessing Unit: Execution of a complete instruction, multiple bus organization,hardwired control, micro programmed control.Pipelining: data hazards, instruction hazards, influence on instruction sets, data path &control consideration,RISC architecture introduction.

UNIT – IIIMemory: types and hierarchy, model level organization, cache memory, performanceconsiderations, mapping, virtual memory, swapping, paging, segmentation, replacementpolicies.

UNIT – IVProcesses and Threads: processes, threads, inter process communication, classical IPCproblems, Deadlocks.

UNIT – VFile system: Files, directories, Implementation, Unix file systemSecurity: Threats, intruders, accident data loss, basics of cryptography, userauthentication.

Text books1. Computer Organization – Car Hamacher, Zvonks Vranesic, SafeaZaky, Vth Edition,

McGraw Hill.2. Modern Operating Systems, Andrew S Tanenbaum 2nd edition Pearson/PHI

Reference books1. Computer Organization and Architecture – William Stallings Sixth Edition,

pearson/PHI2. Morris Mano -Computer System Architecture –3rd Edition-Pearson Education .3. Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th

Edition, John Wiley4. Operating Systems – Internals and Design Principles Stallings, Fifth Edition–2005,

Pearson Education/PHI


M.Tech. (Information Technology) Semester-IJava & Web Technologies

Unit I:HTML Common tags- List, Tables, images, forms, Frames; Cascading Style sheets;Introduction to Java Scripts, Objects in Java Script, Dynamic HTML with Java Script,CSS

Unit II:XML: Document type definition, XML Schemas, Document Object model, PresentingXML, Using XML Processors: DOM and SAXReview of Applets, Class, Event Handling, AWT Programming.Introduction to Swing: JApplet, Handling Swing Controls like Icons – Labels – Buttons –Text Boxes – Combo – Boxes – Tabbed Pains – Scroll Pains – Trees – TablesDifferences between AWT Controls & Swing Controls Developing a Home page usingApplet & Swing.

Unit III:Java Beans: Introduction to Java Beans, Advantages of Java Beans, BDK Introspection,Using Bound properties, Bean Info Interface, Constrained properties Persistence,Customizes, Java Beans API.Web servers: Tomcat Server installation & Testing.Introduction to Servelets: Lifecycle of a Serverlet, JSDK The Servelet API, Thejavax.servelet Package, Reading Servelet parameters, Reading Initialization parameters.

Unit IV:More on Servlets: The javax.servelet HTTP package, Handling Http Request &Responses, Using Cookies-Session Tracking, Security Issues.Introduction to JSP: The Problem with Servelet. The Anatomy of a JSP Page, JSPProcessing. JSP Application Design with MVC architecture. AJAX.

Unit V:JSP Application Development: Generating Dynamic Content, Using Scripting ElementsImplicit JSP Objects, Conditional Processing – Displaying Values Using an Expression toSet an Attribute, Declaring Variables and Methods Error Handling and DebuggingSharing Data Between JSP pages, Requests, and Users Passing Control and Date betweenPages – Sharing Session and Application Data – Memory Usage ConsiderationsDatabase Access Database Programming using JDBC Studying Javax.sql.* packageAccessing a Database from a JSP Page Application – Specific Database ActionsDeploying JAVA Beans in a JSP Page

TEXT BOOKS:1. Web Programming, building internet applications, Chris Bates 2nd edition,

WILEY Dreamtech (UNIT 1,2)2. The complete Reference Java 2 Fifth Edition ,Patrick Naughton and Herbert Schildt.,

TMH (Chapters: 25) (UNIT 2,3)3. Java Server Pages –Hans Bergsten, SPD O’Reilly (UNITs 3,4,5)

REFERENCE BOOKS:1. Programming world wide web-Sebesta,Pearson2. Core SERVLETS ANDJAVASERVER PAGES VOLUME 1: CORE

TECHNOLOGIES , Marty Hall and Larry Brown Pearson3. Internet and World Wide Web – How to program , Dietel and Nieto PHI/Pearson.4. Jakarta Struts Cookbook , Bill Siggelkow, S P D O’Reilly for chap 8.5. Murach’s beginning JAVA JDK 5, Murach, SPD6. An Introduction to web Design and Programming –Wang-Thomson7. Professional Java Server Programming,S.Allamaraju and othersApress(dreamtech).8. Java Server Programming ,Ivan Bayross and others,The X Team,SPD9. Web Warrior Guide to Web Programmming-Bai/Ekedaw-Thomas10. Beginning Web Programming-Jon Duckett WROX.11. Java Server Pages, Pekowsky, Pearson.12. Java Script,D.Flanagan,O’Reilly,SPD.



High Speed Networks

UNIT ISwitching and Data TransmissionISO-OSI reference model. TCP/IP reference model, Circuit-switched networks,Datagram networks, Virtual-circuit networks, Structure of a switch, Telephone network,Dial-up modems, Digital Subscriber line, Cable TV networksData Link LayerError Detection and Correction: Introduction, Block coding, Linear Block codes,Cyclic codes, Checksum - Data Link Control: Framing, Flow and Error control,Protocols, Noiseless channels, Noisy channels, HDLC, Point-to-Point Protocol

UNIT IIMultiple Access: Random Access, Controlled Access, Channelization – ConnectingDevices: Connecting LANs, Backbone Networks, Virtual LANs.High Speed NetworksFrame Relay: Packet-Switching Networks, Frame Relay Networks – AsynchronousTransfer Mode (ATM) : ATM Protocol Architecture, ATM Logical Connections, ATMCells, ATM Service Categories, ATM Adaptation Layer (AAL)- High-Speed LANs :The Emergence of High-Speed LANs, Ethernet, Fiber Channel, Wireless LANs.

UNIT IIINetwork LayerLogical Addressing: IPv4 Addresses, IPv6 Addresses, - Internet Protocol:Internetworking, IPv4, IPv6, Transition from IPv4 to IPv6 - Network Delivery -Routing: Forwarding, Unicast Routing Protocols, Multicast Routing ProtocolsTransport Layer and Application LayerProtocols: Process-to-Process delivery, User Datagram Protocol (UDP), TCP, SCTP -Congestion control: Data traffic, Congestion, Congestion control, Quality of Service

UNIT IVDomain Name System: Name space, Domain Name Space, Distribution of Name Space,DNS in the internet, Resolution, DNS messages, E-mailNeeds and Goals for Network DesignAnalyzing Business Goals and Constraints: Using a Top-Down Network DesignConstraints, Analyzing Business Goals, Analyzing Business constraints – AnalyzingTechnical Goals & Tradeoffs: Scalability, Availability, Network Performance,Security, Manageability, Usability, Adaptability, Affordability, Making Network DesignTradeoffs – Characterizing Network Traffic: Characterizing Traffic Flow, TrafficLoad, Traffic Behavior, Quality of Service Requirements

UNIT VLogical Network Design

Designing Network Design: Hierarchical Network Design, Redundant Network DesignTopologies, Modular Network Design, Designing a Campus Network Design Topology,Designing the Enterprise Edge Topology, Secure Network Design TopologiesDesigning Models for Addressing and Naming: Guidelines for Assigning NetworkLayer Addresses, Using a Hierarchical Model for Assigning Addresses, Designing aModel for Naming.Selecting Switching and Routing ProtocolsSelecting Bridging & Switching Protocols, Spanning Tree Protocol Enhancements -Selecting Routing Protocols: Characterizing Routing protocols, IP Routing, NovellNetWare Routing, Using Multiple Routing Protocols in an Internet work

Text Books:1.Data Communications and Networking, Behrouz A. Forouzan, Fourth Edition, TataMcGraw

Hill2.High Speed Networks and Internets – Performance and Quality of Service, WilliamStallings,

Second Edition, Pearson Education.3.Top-Down Network Design, Priscilla Oppenheimer, Second Edition, PearsonEducation

(CISCO Press)

Reference Books:1.Guide to Networking Essentials, Greg Tomsho,Ed Tittel, David Johnson,Fifth

Edition, Thomson.2.Computer Networks, Andrew S. Tanenbaum, Fourth Edition, Prentice Hall.3.An Engineering Approach to Computer Networking , S.Keshav, Pearson Education.4.Campus Network Design Fundamentals, Diane Teare, Catherine Paquet, Pearson

Education (CISCO Press)5. Computer Communications Networks, Mir, Pearson Education.



Embedded System DesignElective-I

UNIT IIntroduction to Embedded Systems: Embedded Systems, Processor Embedded into a System,Embedded Hardware Units and Devices in a System, Embedded Software, Complex SystemDesign, Design Process in Embedded System, Formalization of System Design, Classification ofEmbedded SystemsUNIT II8051 and Advanced Processor Architecture: 8051 Architecture, 8051 Micro controllerHardware, Input/Output Ports and Circuits, External Memory, Counter and Timers, Serial dataInput/Output, Interrupts, Introduction to Advanced Architectures, Real World Interfacing,Processor and Memory organization - Devices and Communication Buses for DevicesNetwork: Serial and parallel Devices & ports, Wireless Devices, Timer and Counting Devices,Watchdog Timer, Real Time Clock, Networked Embedded Systems, Internet Enabled Systems,Wireless and Mobile System protocolsUNIT IIIEmbedded Programming Concepts: Software programming in Assembly language and HighLevel Language, Data types, Structures, Modifiers, Loops and Pointers, Macros and Functions,object oriented Programming, Embedded Programming in C++ & JAVAUNIT IVReal – Time Operating Systems: OS Services, Process and Memory Management, Real– Time Operating Systems, Basic Design Using an RTOS, Task Scheduling Models,Interrupt Latency, Response of Task as Performance Metrics - RTOS Programming: Basicfunctions and Types of RTOSES, RTOS VxWorks, Windows CEUNIT VEmbedded Software Development Process and Tools: Introduction to EmbeddedSoftware Development Process and Tools, Host and Target Machines, Linking andLocating Software, Getting Embedded Software into the Target System, Issues inHardware-Software Design and Co-Design - Testing, Simulation and DebuggingTechniques and Tools: Testing on Host Machine, Simulators, Laboratory Tools

TEXT BOOKS:1. Embedded Systems, Raj Kamal, Second Edition TMH.

REFERENCE BOOKS :1. Embedded/Real-Time Systems, Dr.K.V.K.K.Prasad, dreamTech press2. The 8051 Microcontroller and Embedded Systems, Muhammad Ali Mazidi, Pearson.3. The 8051 Microcontroller, Third Edition, Kenneth J.Ayala, Thomson.4. An Embedded Software Primer, David E. Simon, Pearson Education.5. Micro Controllers, Ajay V Deshmukhi, TMH.6. Microcontrollers, Raj kamal, Pearson Education.7. Introduction to Embedded Systems,Shibu K.V,TMH.



Advanced Data Bases & Data MiningElective-I

UNIT IIntroduction; Distributed Data Processing, Distributed Database System.Distributed DBMS Architecture: Architectural Models for Distributed DBMS,DDMBS Architecture.Distributed Database Design: Alternative Design Strategies, Distribution Design issues,Fragmentation, Allocation.Query Optimization: Global query, operator tree, canonical expressions, qualifiedrelations

UNIT IITransaction Management: Definition, properties of transaction, types of transactions.Distributed concurrency control: Serializability, concurrency control Mechanisms &Algorithms, Time stamped & Optimistic concurrency control Algorithms, DeadlockManagement.

UNIT IIIObject Oriented Data Model : Inheritance, Object identity, persistent programminglanguages, persistence of objects, comparing OODBMS and ORDBMSData Warehousing & OLAP: Data warehouse, Multidimensional data model, OLAPoperations, OLAP engineAssociation analysis: Apriori , partition, Pincer search,FP-tree growth,Dynamic itemsetcounting algorithms,rapid association rule mining, incremental, border algorithms,Generalized association rule, item constraints.

UNIT IVCluster analysis: Paradigms, Partitioning algorithms, k-Mediod, CLARA, CLARANS,Hierarchical algorithms, DBSCAN, BIRCH, CURE, Categorical clustering algorithms,STIRR, ROCK,CACTUS.Rough Set Theory: Definition, Reduct, Propositional reasoning, Types of reducts, Ruleextraction, Decision tree, Fuzzy sets, Granular computing.

UNIT VWeb & Text Mining: Web mining- content, structure, usage, Text mining, unstructuredtext, Episode rule discovery, Hierarchy of categories, text clustering.Temporal & Spatial Mining: Temporal association rules, Sequence mining, GSPalgorithm, SPADE, SPIRIT, WUM, Episode discovery, Event Prediction Problem, Timeseries analysis, Spatial Mining – tasks, trends, clustering.

Text books1. M.Tamer OZSU and Patuck Valduriez: Principles of Distributed Database Systems,Pearson Edn. Asia, 2001.2. Stefano Ceri and Willipse Pelagatti: Distributed Databases, McGraw Hill.3. Jiawei Han & Micheline Kamber “Data Mining – Concepts and Techniques” 2E -Harcourt India.4. Arun.K.Pujari, “ Data mining techniques” 2E,University press2009Reference Books1. Data Warehousing in the Real World – SAM ANAHORY & DENNIS MURRAY.

Pearson Edn Asia.2. Data Warehousing Fundamentals – PAULRAJ PONNAIAH WILEY STUDENT

EDITION3. The Data Warehouse Life cycle Tool kit – RALPH KIMBALL WILEY STUDENT

EDITION4. Data Mining Introductory and advanced topics –MARGARET H DUNHAM,

PEARSON EDUCATION



Linux ProgrammingElective-I

UNIT IProblem solving approaches in Unix: Using single commands, using compoundCommands, shell scripts, C programs, building own command library of programs.Working with the Bourne shell: Introduction, shell responsibilities, pipes and inputRedirection, output redirection, here documents, running a shell script, the shell as aprogramming language, shell meta characters, file name substitution, shell variables,command substitution, shell commands, the environment, quoting, test command, controlstructures, arithmetic in shell, shell script examples, interrupt processing, functions,debugging shell scripts.

UNIT IIUnix Files: File Concept, File Structure, File System Layout, File types, The standardI/O (fopen, fclose, fflush, fseek, fgetc, getc, getchar, fputc, putc, putchar, fgets, gets etc.),formatted I/O, stream errors, kernel support for files, System calls, library functions, filedescriptors, low level file access - usage of open, creat, read, write, close, lseek, statfamily, umask, dup, dup2, fcntl. file and directory management - chmod, chown,links(soft links & hard links - unlink, link, symlink), mkdir, rmdir, chdir, getcwd,opendir, readdir, closedir,rewinddir, seekdir, telldir functions.

Basics of Perl - Scalars and their operations, assignment statements and simple I/O,control statements, arrays, hashes, references, functions, pattern matching, file I/O,example programs.

UNIT IIIUnix Process – Process concept, Kernel support for process, process attributes, processhierarchy, process creation, waiting for a process, process termination, process control,zombie process, system call interface for process management-fork, vfork, exit, wait,waitpid, exec family, system.Unix Signals – Introduction to signals, Signal generation and handling, Kernel supportfor signals, Signal function, unreliable signals, reliable signals, kill, raise , alarm, pause,abort, sleep functions.

UNIT IVInterprocess Communication Overview: Introduction to IPC, IPC between processeson a single computer system, IPC between processes on different systems, file and recordlocking, other unix locking techniques, pipes, FIFOs, namespaces, introduction to threetypes of IPC(system-V)-message queues, semaphores and shared memory.Message Queues-Unix system-V messages, unix kernel support for messages, unix APIsfor messages, client/server example.

UNIT V:Semaphores-Unix system-V semaphores, unix kernel support for semaphores, unix APIsfor semaphores, file locking with semaphores.Shared Memory-Unix system-V shared memory, unix kernel support for sharedmemory, unix APIs for shared memory, semaphore and shared memory example.Sockets: Berkeley sockets, socket system calls for connection oriented protocol andconnectionless protocol, example-client/server programs.

Text Books :1. Unix Network Programming, W.R.Stevens, Pearson/PHI.2. Unix Concepts and Applications, 4th Edition, Sumitabha Das, TMH.3. Unix system programming using C++, T.Chan, PHI.

Reference Books:1. Linux System Programming, Robert Love, O’Reilly, SPD.2. Unix for programmers and users, 3

rdEdition, Graham Glass, King Ables, Pearson

Education.

3. Advanced Programming in the Unix environment, 2nd

Edition, W.R.Stevens &S.A.Rago, Pearson Education.

4. Learning Perl, R.L. Schwartz, T.Phoenix, B.D. Foy, O’Reilly, SPD.5. Unix Programming, Kumar Saurabh, 1

stEdition, Wiley India Pvt Ltd.



Natural Language ProcessingElective-II

UNIT IIntroduction and Overview What is Natural Language Processing, hands-ondemonstrations. Ambiguity and uncertainty in language. The Turing test. RegularExpressions Chomsky hierarchy, regular languages, and their limitations. Finite-stateautomata. Practical regular expressions for finding and counting language phenomena. Alittle morphology. Exploring a large corpus with regex tools. Programming in PythonAn introduction to programming in Python. Variables, numbers, strings, arrays,dictionaries, conditionals, iteration. The NLTK (Natural Language Toolkit) String EditDistance and Alignment Key algorithmic tool: dynamic programming, a simpleexample, use in optimal alignment of sequences. String edit operations, edit distance,and examples of use in spelling correction, and machine translation.

UNIT IIContext Free Grammars Constituency, CFG definition, use and limitations. ChomskyNormal Form. Top-down parsing, bottom-up parsing, and the problems with each. Thedesirability of combining evidence from both directions Non-probabilistic ParsingEfficient CFG parsing with CYK, another dynamic programming algorithms. Earleyparser. Designing a little grammar, and parsing with it on some test data.ProbabilityIntroduction to probability theory Joint and conditonal probability, marginals,independence, Bayes rule, combining evidence. Examples of applications in naturallanguage. Information Theory The "Shannon game"--motivated by language!Entropy, cross-entropy, information gain. Its application to some language phenomena.

UNIT IIILanguage modeling and Naive BayesProbabilistic language modeling and its applications. Markov models. N-grams.Estimating the probability of a word, and smoothing. Generative models of language.Part of Speech Tagging and Hidden Markov Models , Viterbi Algorithm for FindingMost Likely HMM Path , Dynamic programming with Hidden Markov Models, and itsuse for part-of-speech tagging, Chinese word segmentation, prosody, informationextraction, etc.

UNIT IVProbabilisticContext Free GrammarsWeighted context free grammars. Weighted CYK. Pruning and beam search.Parsing with PCFGsA treebank and what it takes to create one. The probabilistic version of CYK. Also: Howdo humans parse? Experiments with eye-tracking. Modern parsers.Maximum Entropy Classifiers

The maximum entropy principle, and its relation to maximum likelihood. Maximumentropy classifiers and their application to document classification, sentencesegmentation, and other language tasks

UNIT VMaximum Entropy Markov Models & Conditional Random FieldsPart-of-speech tagging, noun-phrase segmentation and information extraction models thatcombine maximum entropy and finite-state machines. State-of-the-art models for NLP.Lexical Semantics Mathematics of Multinomial and Dirichlet distributions, Dirichlet asa smoothing for multinomials.Information Extraction & Reference Resolution- Various methods, including HMMs.Models of anaphora resolution. Machine learning methods for coreference.

Text Books:1. "Speech and Language Processing": Jurafsky and Martin, Prentice Hall2. "Statistical Natural Language Processing"- Manning and Schutze, MIT Press3. “Natural Language Understanding”. James Allen. The Benajmins/CummingsPublishing Company

References Books:1. Cover, T. M. and J. A. Thomas: Elements of Information Theory. Wiley.2. Charniak, E.: Statistical Language Learning. The MIT Press.3. Jelinek, F.: Statistical Methods for Speech Recognition. The MIT Press.4. Lutz and Ascher - "Learning Python", O'Reilly



Speech ProcessingElective-II

UNIT IINTRODUCTION Production of speech,sound perception, speech Analysis, speechcoding, speech Enhancement, speech Synthesis, speech and speaker Recognition.Signals and Linear Systems: Simple signal, Filtering and convolution, FrequencyAnalysis : Fourier Transform, spectra and Correlation, Laplace Transform: Poles andZeros, Discrete –Time Signal and Systems: Sampling, Frequency Transforms of Discrete-Time Signals, Decimation and Interpolation Filter: Band pass Filter, Digital Filters,Difference Equations and InterpolationSPEECH ANALYSISIntroduction, Short-Time speech Analysis: Windowing, Spectra of Windows: Wide-andNarrow –Band Spectrograms, Time-domain Parameters: Signal Analysis in the TimeDomain, Short –Time Average Energy and Magnitude, Short –Time Average Zero-Crossing Rate ( ZCR), short-Time Autocorrelation Function , Frequency–Domain(Spectral) Parameters: Filter–Bank Analysis, Short-Time Fourier Transform Analysis,Spectral Displays, Formant Estimation and Tracking .

UNIT IISPEECH PRODUCTION AND ACOUSTIC PHONETICS :Anatomy and Physiology of the speech Organs: the Lungs and the Thorax, Larynx andVocal Folds(cords), Vocal Tract, Articulatory phonetics: Manner of Atriculatory,Structure of the Syllable, Voicing, Place of the Articulation, Phonemes in OtherLanguage, Articulatory Models, Acoustic Phonetics : Spectrograms, Vowels,Diphthongs, glides and Liquids, Nasals, Fricatives, stops (Plosives), Variants of NormalSpeech.

UNIT IIILINEAR PREDICTIVE CODING (LPC) ANALYSISBasic Principles of LPC, Least –Squares Autocorrelation Method, Least –SquaresCovariance Method, Computation Considerations, Spectral Estimation Via LPC,Updating the LPC Model Sample by Sample, Window Considerations.Cepstral Analysis: Mathematical details of Cepstral analysis, Applications for thespectrum, Mel-Scale Cepstrum, F0 Pitch estimation:Time domain F0 estimation methods,short-time Spectral methods

UNIT IVSpeech synthesis: Introduction, Principles of speech synthsis: Types of strored speechunits to concatenate, Memory size, Synthesis method, Limited text voice responsesystem, unrestricted-text TTS systems. Synthesizer methods: Articulatory synthesis,Formant synthesis, LPC synthesis.

UNIT VIntroduction: Variability in speech signals, segmenting speech into smaller units,Performance evaluation, Database for speech recognition,pattern recognition methods,pre=processing, parametric representation: parameters used in speech recognition, featureextraction, Evaluation of similarity of speech patterns: frame-based distance measures,Making ASR decisions, HMMsSpeaker recognition: Introduction, Verification Vs. Recognition, Recognition techniques:Model evaluation, text dependence, statical Vs. dynamic features, stochastic models,vector quantization, similarity and distance measures, cepstral analysis, Features thatdistinguish the speakers: measures of the effectiveness of features, techniques to choosefeatures, spectral features, prosodic features

Text Books:1. Speech Communication Douglas O’ Shaughnessy, Universities Press

Reference Books:

1. Fundamentals of Speech Recognition, Lawrence Rabiner, Biing-Hwang Juang,Pearson Education

2. Speech and Language processing, Daniel Jurafsky, James H. Martin, PearsonEducation



INFORMATION RETRIEVAL SYSTEMSElective-II

UNIT IIntroduction: Definition, Objectives, Functional Overview, Relationship to DBMS, Digitallibraries and Data Warehouses, Information Retrieval System Capabilities - Search, Browse,Miscellaneous.UNIT IICataloging and Indexing: Objectives, Indexing Process, Automatic Indexing, InformationExtraction, Data Structures: Introduction, Stemming Algorithms, Inverted file structures, N-gram data structure, PAT data structure, Signature file structure, Hypertext data structure -Automatic Indexing: Classes of automatic indexing, Statistical indexing, Natural language,Concept indexing, Hypertext linkagesUNIT IIIDocument and Term Clustering: Introduction, Thesaurus generation, Item clustering, Hierarchyof clusters - User Search Techniques: Search statements and binding, Similarity measures andranking, Relevance feedback, Selective dissemination of information search, Weighted searchesof Boolean systems, Searching the Internet and hypertext - Information Visualization:Introduction, Cognition and perception, Information visualization technologies.UNIT IVText Search Algorithms: Introduction, Software text search algorithms, Hardware text searchsystems. Information System Evaluation: Introduction, Measures used in system evaluation,Measurement example – TREC results.UNIT VMultimedia Information Retrieval – Models and Languages – Data Modeling, QueryLanguages, Indexing and Searching - Libraries and Bibliographical Systems – Online IRSystems, OPACs, Digital Libraries.

TEXT BOOKS:1. Information Storage and Retrieval Systems: Theory and Implementation By Kowalski,

Gerald, Mark T Maybury Kluwer Academic Press, 2000.2. Modern Information Retrival By Ricardo Baeza-Yates, Pearson Education, 2007.3. Information Retrieval: Algorithms and Heuristics By David A Grossman and Ophir

Frieder, 2nd Edition, Springer International Edition, 2004.

REFERENCE BOOKS:1. Information Retrieval Data Structures and Algorithms By William B Frakes, Ricardo

Baeza-Yates, Pearson Education, 1992.2. Information Storage & Retieval By Robert Korfhage – John Wiley & Sons.3. Introduction to Information Retrieval By Christopher D. Manning and Prabhakar

Raghavan, Cambridge University Press, 2008.

jawaharlal nehru technological university …engineershub.co/syllabus-book/jntuh/mtech/m.tech... ·...

Documents