IN

NFORM
MATION TECHNOLOGY
Y /CSIT

DR
R. A.P.JJ. ABDU
UL KAL
LAM TECHN
T NICAL
UNIV
VERSITTY, UTT TAR PR
RADES
SH, LUC
CKNOWW

EVA
ALUAT
TION SC
CHEME
E & SYL
LLABU
US

FOR

B. TECH.
T TH (IV) YEAR
FOURT
(INFORM
MATIO
ON TECH
HNOLO
OGY /CS
SIT)

AS PER
AICTE
E MODE
EL CUR
RRICUL
LUM
Effectivee from the
[E t Sesssion: 20
021-22]

Curricculum & Evalluation Schem

me (VII & VIIII semester) Pagee 1

Topperworld.in
 INFORMATION TECHNOLOGY /CSIT
B.TECH IV YEAR

(INFORMATION TECHNOLOGY /CSIT) CURRICULUM STRUCTURE

SEMESTER- VII
End
Sl. Subject Periods Evaluation Scheme
Subject Semester Total Credit
No.
Codes L T P CT TA Total PS TE PE

1 KHU701/KHU702 HSMC -1 / HSMC-2 3 0 0 30 20 50 100 150 3

2 KCS07X Departmental Elective-IV 3 0 0 30 20 50 100 150 3

3 KCS07X Departmental Elective-V 3 0 0 30 20 50 100 150 3

4 KOE07X Open Elective-II 3 0 0 30 20 50 100 150 3

The Department may conduct one Lab

of either of the two Electives (4 or 5)
based on the elective chosen for the
5 KIT751A curriculum. The Department shall on 0 0 2 25 25 50 1
its own prepare complete list of
practical for the Lab and arrange for
proper setup and conduct accordingly.

Mini Project or Internship

6 KIT752 0 0 2 50 50 1
Assessment*

7 KIT753 Project 0 0 8 50 100 150 4

8 MOOCs (Essential for Hons. Degree)

Total 12 0 12 850 18

*The Mini Project or internship (4 - 6 weeks) conducted during summer break after VI semester and will be assessed during VII semester.

SEMESTER- VIII

End
Sl. Subject Periods Evaluation Scheme
Subject Semester Total Credit
No.
Codes L T P CT TA Total PS TE PE
# #
1 KHU801/KHU802 HSMC-2 /HSMC-1 3 0 0 30 20 50 100 150 3

2 KOE08X Open Elective-III 3 0 0 30 20 50 100 150 3

3 KOE08X Open Elective-IV 3 0 0 30 20 50 100 150 3

4 KIT851 Project 0 0 18 100 300 400 9

5 MOOCs (Essential for Hons. Degree)

Total 9 0 18 850 18

Curriculum & Evaluation Scheme (VII & VIII semester) Page 2

Topperworld.in
 INFORMATION TECHNOLOGY /CSIT
Departmental Elective-IV

1. KCS071 Artificial Intelligence

2. KCS072 Natural language processing
3. KCS073 High Performance Computing
4. KCS074 Cryptography and Network Security
5. KCS075 Design & Development of Applications
6. KCS076 Software Testing
7. KCS077 Distributed Systems

Departmental Elective-V

1. KCS078 Deep Learning

2. KCS079 Service Oriented Architecture
3. KCS710 Quantum Computing
4. KCS711 Mobile Computing
5. KCS712 Internet of Things
6. KCS713 Cloud Computing
7. KIT071 Software Project Management

Curriculum & Evaluation Scheme (VII & VIII semester) Page 3

Topperworld.in
 INFORMATION TECHNOLOGY /CSIT
B.TECH. (IT/CSIT)
SEVENT SEMESTER (DETAILED SYLLABUS)
Artificial Intelligence (KCS071)
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to understand
Understand the basics of the theory and practice of Artificial Intelligence as a discipline and K2
CO 1
about intelligent agents.
CO 2 Understand search techniques and gaming theory. K2, K3
The student will learn to apply knowledge representation techniques and problem solving K3 , K4
CO 3
strategies to common AI applications.
CO 4 Student should be aware of techniques used for classification and clustering. K2 , K3
CO 5 Student should aware of basics of pattern recognition and steps required for it. K2 , K4
DETAILED SYLLABUS 3‐0‐0
Proposed
Unit Topic
Lecture
INTRODUCTION :
I Introduction–Definition – Future of Artificial Intelligence – Characteristics of Intelligent Agents– 08
Typical Intelligent Agents – Problem Solving Approach to Typical AI problems.
PROBLEM SOLVING METHODS:
Problem solving Methods – Search Strategies- Uninformed – Informed – Heuristics – Local Search
II Algorithms and Optimization Problems – Searching with Partial Observations – Constraint 08
Satisfaction Problems – Constraint Propagation – Backtracking Search – Game Playing – Optimal
Decisions in Games – Alpha – Beta Pruning – Stochastic Games
KNOWLEDGE REPRESENTATION:
First Order Predicate Logic – Prolog Programming – Unification – Forward Chaining-Backward
III Chaining – Resolution – Knowledge Representation – Ontological Engineering-Categories and 08
Objects – Events – Mental Events and Mental Objects – Reasoning Systems for Categories –
Reasoning with Default Information
SOFTWARE AGENTS:
IV Architecture for Intelligent Agents – Agent communication – Negotiation and Bargaining – 08
Argumentation among Agents – Trust and Reputation in Multi-agent systems.
APPLICATIONS:
AI applications – Language Models – Information Retrieval- Information Extraction – Natural
V 08
Language Processing – Machine Translation – Speech Recognition – Robot – Hardware –
Perception – Planning – Moving
Text books:
1. S. Russell and P. Norvig, “Artificial Intelligence: A Modern Approach‖, Prentice Hall, Third Edition, 2009.
2. I. Bratko, “Prolog: Programming for Artificial Intelligence”, Fourth edition, Addison-Wesley Educational Publishers
Inc., 2011.
3. M. Tim Jones, ―Artificial Intelligence: A Systems Approach(Computer Science)‖, Jones and Bartlett Publishers,
Inc.First Edition, 2008
4. Nils J. Nilsson, ―The Quest for Artificial Intelligence‖, Cambridge University Press, 2009.
5. William F. Clocksin and Christopher S. Mellish,‖ Programming in Prolog: Using the ISO Standard‖, Fifth Edition,
Springer, 2003.
6. Gerhard Weiss, ―Multi Agent Systems‖, Second Edition, MIT Press, 2013.
7. David L. Poole and Alan K. Mackworth, ―Artificial Intelligence: Foundations of Computational Agents‖, Cambridge
University Press, 2010.

Curriculum & Evaluation Scheme (VII & VIII semester) Page 4

Topperworld.in
 INFORMATION TECHNOLOGY /CSIT

Natural Language Processing (KC072)

Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able :

CO 1 To learn the fundamentals of natural language processing K1 , K2

CO 2 To understand the use of CFG and PCFG in NLP K1 , K2

CO 3 To understand the role of semantics of sentences and pragmatic K2

CO 4 To Introduce Speech Production And Related Parameters Of Speech. K1 , K2

To Show The Computation And Use Of Techniques Such As Short Time Fourier Transform,
CO 5 K3, K4
Linear Predictive Coefficients And Other Coefficients In The Analysis Of Speech.
DETAILED SYLLABUS 3-0-0
Proposed
Unit Topic
Lecture
INTRODUCTION: Origins and challenges of NLP – Language Modeling: Grammar-based LM,
Statistical LM – Regular Expressions, Finite-State Automata – English Morphology, Transducers
for lexicon and rules, Tokenization, Detecting and Correcting Spelling Errors, Minimum Edit
Distance 08
I
WORD LEVEL ANALYSIS : Unsmoothed N-grams, Evaluating N-grams, Smoothing,
Interpolation and Backoff – Word Classes, Part-of-Speech Tagging, Rule-based, Stochastic and
Transformation-based tagging, Issues in PoS tagging – Hidden Markov and Maximum Entropy
models.
SYNTACTIC ANALYSIS: Context Free Grammars, Grammar rules for English, Treebanks,
Normal Forms for grammar – Dependency Grammar – Syntactic Parsing, Ambiguity, Dynamic 08
II
Programming parsing – Shallow parsing – Probabilistic CFG, Probabilistic CYK, Probabilistic
Lexicalized CFGs – Feature structures, Unification of feature structures.
SEMANTICS AND PRAGMATICS:
Requirements for representation, First-Order Logic, Description Logics – Syntax-Driven Semantic
III analysis, Semantic attachments – Word Senses, Relations between Senses, Thematic Roles, 08
selectional restrictions – Word Sense Disambiguation, WSD using Supervised, Dictionary &
Thesaurus, Bootstrapping methods – Word Similarity using Thesaurus and Distributional methods.
BASIC CONCEPTS of Speech Processing : Speech Fundamentals: Articulatory Phonetics –
Production And Classification Of Speech Sounds; Acoustic Phonetics – Acoustics Of Speech 08
IV
Production; Review Of Digital Signal Processing Concepts; Short-Time Fourier Transform, Filter-
Bank And LPC Methods.
SPEECH-ANALYSIS: Features, Feature Extraction And Pattern Comparison Techniques: Speech
Distortion Measures– Mathematical And Perceptual – Log–Spectral Distance, Cepstral Distances,
Weighted Cepstral Distances And Filtering, Likelihood Distortions, Spectral Distortion Using A
Warped Frequency Scale, LPC, PLP And MFCC Coefficients, Time Alignment And Normalization
V
– Dynamic Time Warping, Multiple Time – Alignment Paths. 08
SPEECH MODELING : Hidden Markov Models: Markov Processes, HMMs – Evaluation,
Optimal State Sequence – Viterbi Search, Baum-Welch Parameter Re-Estimation, Implementation
Issues.

Curriculum & Evaluation Scheme (VII & VIII semester) Page 5

Topperworld.in
 INFORMATION TECHNOLOGY /CSIT
Text books:
1. Daniel Jurafsky, James H. Martin―Speech and Language Processing: An Introduction to Natural Language
Processing, Computational Linguistics and Speech, Pearson Publication, 2014.
2. Steven Bird, Ewan Klein and Edward Loper, ―Natural Language Processing with Python, First Edition, OReilly
Media, 2009.
3. Lawrence Rabiner And Biing-Hwang Juang, “Fundamentals Of Speech Recognition”, Pearson Education, 2003.
4. Daniel Jurafsky And James H Martin, “Speech And Language Processing – An Introduction To Natural Language
Processing, Computational Linguistics, And Speech Recognition”, Pearson Education, 2002.
5. Frederick Jelinek, “Statistical Methods Of Speech Recognition”, MIT Press, 1997.
6. Breck Baldwin, ―Language Processing with Java and LingPipe Cookbook, Atlantic Publisher, 2015
7. Richard M Reese, ―Natural Language Processing with Java, OReilly Media, 2015.
8. Nitin Indurkhya and Fred J. Damerau, ―Handbook of Natural Language Processing, Second Edition, Chapman
and Hall/CRC Press, 2010.
9. Tanveer Siddiqui, U.S. Tiwary, ―Natural Language Processing and Information Retrieval, Oxford University
Press, 2008.

Curriculum & Evaluation Scheme (VII & VIII semester) Page 6

Topperworld.in
 INFORMATION TECHNOLOGY /CSIT

High Performance Computing (KCS073)

Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to understand
CO 1 Able to understand the basic concept of Computer architecture and Modern Processor K2

CO 2 Able to understand the basic concepts of access optimization and parallel computers K2, K3
Able to describe different parallel processing platforms involved in achieving high performance K3 , K4
CO 3
computing
CO 4 Develop efficient and high performance parallel programming. K2 , K3
CO 5 Able to learn parallel programming using message passing paradigm. K2 , K4
DETAILED SYLLABUS 3-0-0
Proposed
Unit Topic
Lecture
Overview of Grid Computing Technology, History of Grid Computing, High Performance
Computing, Cluster Computing. Peer-to-Peer Computing, Internet Computing, Grid Computing
08
Model and Protocols, Types of Grids: Desktop Grids, Cluster Grids, Data Grids, High-
I
Performance Grids, Applications and Architectures of High Performance Grids, High Performance
Application Development Environment.
II Open Grid Services Architecture: Introduction, Requirements, Capabilities, Security 08
Considerations, GLOBUS Toolkit
Overview of Cluster Computing: Cluster Computer and its Architecture, Clusters Classifications,
III 08
Components for Clusters, Cluster Middleware and SSI, Resource Management and Scheduling,
Programming, Environments and Tools, Cluster Applications, Cluster Systems,
IV Beowulf Cluster: The Beowulf Model, Application Domains, Beowulf System Architecture, 08
Software Practices, Parallel Programming with MPL, Parallel Virtual Machine (PVM).
Overview of Cloud Computing: Types of Cloud, Cyber infrastructure, Service Oriented
V 08
Architecture Cloud Computing Components: Infrastructure, Storage, Platform, Application,
Services, Clients, Cloud Computing Architecture.
Text books:
1. Laurence T.Yang, Minyi Guo – High Performance Computing Paradigm and Infrastructure John Wiley
2. Ahmar Abbas, “Grid Computing: Practical Guide to Technology & Applications”, Firewall Media, 2004.
3. Joshy Joseph and Craig Fellenstein , “Grid Computing” Pearson Education, 2004.
4. lan Foster, et al.,“The Open Grid Services Architecture”, Version 1.5 (GFD.80). Open Grid Forum, 2006.
5. RajkumarBuyya. High Performance Cluster Computing: Architectures and Systems. PrenticeHall India, 1999.

Curriculum & Evaluation Scheme (VII & VIII semester) Page 7

Topperworld.in