With ellecl fionr the academic year 2023-2024

Department of NI:lthcnr atics

()snrarria tlniverriit\, lI1'rlrrrth:rd
M.Sc. Computer Scicnce
(loulsc und,:r'Clroicc Basurl ( r'cdil S\sl0n1

SEMI|STER-III
l'a pcr Codc Papcr Title Hp M:rrlis (lIed its
w
I CS3OIT Artificial lntelligence 4 30+70: 100 4

II cs302't Compiler Design .l 30+70= I 00 l

Elective
III cs303T(A) Network Security

cs303T(B) Block chain and Crypto Currency

-1 30+70= 100 l
Technologies

Big Data Analyics

cs303T(c)

Elective
IV Natural Language Processitrg 4 30+70= I 00 1
cs304T(A)
cs304r(B) Web Mining

cs304T(c) DEVOPS

+ 50 2
CS3O5P Artificial lntelligence Lab
VI CS]O6P Com iler Design Latr { 50 2

'[ot:rl l-l 501) 20

SEi\4ESTEIt _ IV
Paper Code Papor'l'itle tlpW l\l a rks C rrtl it s

-l 30+70= I 00 .l
I CS4OI T Cloud Conrputing
Data Science with R .+ 30+70= I 00 ,l
u CS4O2T

Elect ive
Ill cs403T(A) Conlputer Organizatiotl

cs403T(B) l)istributed Svstems .i

30+70= I 00 ;l

cs403T(c) Machine Learning

2
IV CS,l04P Data Science rvith R Lab I -50

75 + 75= 150 6
IV C54O5P Project Work I 2

'l'0tal 28 500 2[
\---
)q -'}--'vr, e Ne.
{%*
\ uI^L dl,; /
 M.Sc. Computer Science
Semester - III
Paper- I : Artificial Intelligence
CS JOIT
Unil - I
Introduction to Artiflcial lntelligence: introtluction. Al techniques, problenr solving with AI, Al nrodels.
data acquisilion and learning aspects in Al.
Problenr Solving: problern-solving process, tirrmulating probletn, problem types and characteristics,
problem analvsis and represeDtation, problem space and search. toy problems, real-world problems,
problenr reduction Inethods.
Unifbrnred Search: general search algorithm, uniforrned search methods - BFS, uniform cost search. DFS,
Dl.S. lS, hi-directional search. comparison ofthe unifbr.nred techniques.

unir - ll
lnlbrnred Seatch: generale and test, best firct search. greedy search. A+ search. nremory bounded heuristic
search, heuristic function, AO+ search. local search algorithms and optimization problems, adversarial
sealch nrethods (game theory), online search algorithrns.
What is an intelligenl agent? Types ofagent. what is constraint satisfaction problem (CSP), CSP as search
problem. local search for CSP, formulating probleln structurc.
Knowledge and Reasoning: knowledge representalion, knowledge-based agents, the wumpus wor.kl, logic.
propositional logic. predicate logic, unification and lifting: infbrence in FOL, representing knowledge
using rules. sernantic networks, frame svstems, inference, types ofreasonints.

[;nit lll
Uncertain Knowledge and Reasoning: uncertaintv ancl methods, Bayesian probability and beliefnetwork,
plobabilistic teasonittg, probabilistic teasoning over linre, tbrrvard and backward reasoning, perception,
rnaking simple decisions, rnaking complex decisions, othel techniques in uncerlainty and reasoning
process.
Planning problem, sirnple planning agent, planning languages, blocks world, goal stack planning, means-
ends analysis, planning as a state-space search.
l-earning: what is urachine learning? Learning paradigrns. leanring concepts. ulethods and models,
statistical learning nrethods. ar-tificial neural netnorks-based learning, support vector machines,
reinforcement learning.

unir ,lv
Expert systems: architecture ofexpefi system. confidence factors, existing expert systems, knowledge
acquisition, shell and e,rplanations. self-explaining system. rule-based expeft systems, forward and
backward chaining. franre-based experl s)'stems, uncertairrty management in expert systems. expett systen.)
and DSS. plos and cons ofexpert systems, case study.
Pattern Recognitiott: nrachine perception aud pattern recognition, feature extraction, classification. object
recognilion, speech recognition. paftem nrining. came Playing: important concepts of game theory. game
playing and knolvledge structure, game as search problern. alpha-beta pruning, game theory problenrs.
lobotics.
Concepts and terminology o1'ANN, t'eed-tbrrvard NN, tbeclback rretworks, pattern associative networks,
Competitive learning, fuzzv sets. fuzzy irttlrence process, neuro-fuzzy systems, range ofAl applications,
Al applications and examples. case stud\: agricLrltural domain - larnrer's iutelligent assistant.
'fert llook:
Rclcrences:
Parag kulkarni. Prachi Joshi, Arrificial lntelliqerrce:, Build ir)g lnrelligenr Systenls
--i4 r
fl/^1
l. Nils J Nilsson, Anificial lntelligence: A Nerv Synrhesis
?. Kevin Knight, Elaine Rich. B Nair.Arlificial Intelligence
3. Sluart Russell, Peter Norvig, Artificial lntelligence: A Modent Approach
.1. Eugene Charniak, Drew McDernrott, Inlroduction to Artificial lntelligence
5. Vinod Chandra SS. Anand Haleendran S. Artificial lntellig ence and Machine l-earni Ig

€
\A
v
{tu7 u \-
 Paper - II : Compiler Design
CS 3O2T

L)n it - I
Introduction: language processors. phases of a compiler. a model fbr a compiler fiont end. syntax-
directed translation, parsing, a translator lor simple expressions, Lexical Analysis: role of leiical
analyzer, input buffering, specification of tokens, Lcx lexical analyzer generator, data structures in
conrpilation.
Top-Dorvn Parsing: lntroduction. context free granrmars, rvriting a gramma[, recursive-descerrt
parsing, LL(l) grammars, predictive parsing, preprocessing steps required fbr predicrive parsing.

Unit - ll
Bottom-Up Parsing: shift reduce parsing. SLR parsing. CLR parsing and LAt-R parsing. error
recovery in parsing. handling ambiguous gramntar. par.ser generator - yACC.
Semantic Analysis: syntax-directed definitiorrs, evaluation order for SDD's. application ofSDT.

LInit - III
-Code Cenelation: syntax trees, tlrree-address code. types and declarations. translation of
expressions, type checking. Runtime Environment: sromge organization, stack allocation ofspace,
heap management. stolage allocation for arrays. strings and records. introduction to garbage
collection and trace based collection,

Unit - lV
Code Generation: issues in the design ofcode generator. talget language. addresses in the target
code, blocks and flow graphs, optimization of blocks. peephole optimization, register allocation
and assignment.
Code Optirnization: principal sources oloptimization. data t)orv analysis, constant propagation.
partial red ndancy elimination, loops in florv graphs.

Text Book : A. V. Aho. Monica S. Lam, Ravi Sethi,J. D. Ullman, Compilers Principles,
Techniques, & Tools. (2e)

References
l Dick Grune, Henry E. Bal. Cariel T. H. Jacobs. Modern Cornpiler Design
2. Kenneth C. Louden. Compiler Construction Principles and Practice
3. Thomas rv. Parsons. lntroduction to Cornpiler Construction
4. Andrew N. Appel, Modem Compiler hnplementation in C
5. John R. Levin. Tony Mason. Doug Brown, LEX & YACC
6. Cooper, Linda, Engineering a Cornpiler

-..-_
,qJ 4''--'
@

'x
IM 0,/

tl

I \ /V,
ff,vn 4I )
 I'ape r - lll (A) : Net$,ork Security

cs 303T(A)

l..Jn it - |

overvierv of Network Security: computer Security Concepts, the osl security Architecture,
Secu,ity Attacks, Securitv Services. Security Mechanisms. a Model for Network Security.
Classical [--ncryption 1'echniques: Symmetric Cipher Model. Substitution 'feclrniques,
'l'ransposition
Techniques, Rotor Machines, Steganography.
Block Ciphers and the Data Errcryption Standard:'fraditional Block Cipher Srrucrure, the Dara
Encryption Standard (DES). A DES Exarnple. Strengh olDES. Block cipher operation: Double
DL.S. rriple DES, Electronic Code Book, Cipher Block Chaining Mode, Cipher Feedback Mode.
Output Feedback Mode, Counter Mode.

it - ll
[.rn
d Encryption Standard (AES): The origins AES, AES Structure, AES Round Functions, AES Key
Expansion. an AES Exanrple AES Implententation. Pseudorandom Number Generation and Stream
Ciphers: Principles of Pseudorandonr Number Generation, pseudorandom Number Generators.
Pseudorandom Number Generation usi'g Block cipher. St'eamC iphers-RC4. public-Key
Cryptography and RSA: Pr.inciples of Public-Key Cryprosystems. the RSA Algor.ithm.
Key Managetnent and Distributiort: Symrnetric Key Distlibution Using Sym1netric Encryption and
Asymrnetric Encryption, Distriburion of public Keys, X.509 certificates, Diffie-Hellman'Key
Exchange.

Lrn ir - lll
cryptographic Hash Functions:.Applications of cryptographic Hash Functions, Two Simple Hash
Functions, Secure Ilash Algorithrn (Sl,lA) & MD5 Algorithm.
Message Authentication Codes: Message Authentication Requirements. Message Authentication
FLrnctions, Requirements lor Message Authentication Codes. Security of MACi,
MACs Based on Hash Functions: HMAC,MACs Based on Block Ciihers: DAA and CMAC.
Digital Signatures: Digital Signatures. NlSl'Digital Signatures Algorirhm.

tlnit - lV
'[ ransport-Level
Security: web Security Considerations. Secure Sockets Layer (SSL), Transport
Layer Secu'ity (Tl-s). HTTPS, Securc Shell (SSH), E-Mail Security: prettyGood piivacy.
S/MIME.
lP Security: IP Security overview, lp Security Architecture, Encapsulatirrg Security payload,
Conrbining Security Associations, Intenlet Key Exchange. lntruders, Virui and Firewalls: Iniruders,
Intrusion Detection. Password Management. Virus and Related Threats, Countermeasures, Firewall
Design Principles, 'l'ypes of Firewalls.

'fexI Book: william principles and practice (6e)

Stallings, cryptography andNetrvork Security
-
llcli lcncer: \
I ol'Modern Cryptography
. Zhenfu Cao, Nerv Directions i..\'. I r..-.
'fheory
2. l)ouglas R. Stinson. Cryptography and practices
-[om
3. St Denis. Simon .lohnson. Crvptography for Developers
4. .loseph Migga Kizza, A Guide to Cornputer Nenvork Security
5. A. Menezes, P. Van Oorschot, S. Vanstone, Handbook of Applied Cryptography
6. Ilenk C.A. van 'filborg. Sushil Jajodia. Encyclopedia olCryptography anJ Security
7. Kehh M. Martin, Everyday cryptography-Fundamentar principies and Applicatio,s

6 A, ,a/") ui{,
v&@,-l I
 Paper - III (B) : Block chain and Crypto Currency Technologies

cs 303r(B)

Unit- I
lntroduction to cryptography and crypto currencies: Foundations of Cr.yptography and security:
ciphers and secret messages. security attacks and services. Matlrematical tools ioi cryptography:
substitution techniques, modular arithmetic. Euclid's algorithm, finite fields, polynomial irithmetic
Design Principles of Block Ciphers: Theory of Block cipher Design. Feistel cipher netrvork
structure, DES and Triple DES. modes of operation (ECB. CBC. OFB,CFB). srrength of DES.

Unit- lI
Block chain Achieves: Decentralization - Cerrtralizations. Decentralization- Distributed consensr.rs,
consensus with - out identity using a block chain, lncentives and proofofrvork- Sirnple Local
Storage, Hot and Cold Storage, Splitting and Sharing Keys, Online Wallets and Exchanges.
Payment Services. Transaction Fees, Currency Exchange Markets.

Unit- III
Mechanics of Bitcoin: Bitcoin transactions, Bitcoin Scripts, Applications of Bitcoin sctipts, Bitcoin
blocks, The Bir coin network, Limitations and improvemenls.
Bitcoin Mining :The task of Bitcoin rniner.s. Mining Har.dware. Energy consunrption and ecology,
Mining pools, Mining incentives and slrategies.
Bitcoin and Anonymity: Anorrymity s. How to De-anonymize Bitcoin. Mixing, Decentralized
Mixing, Zerocoin and Zerocaslr.

Unit- IV
Conrmunity, Politics, and Regulation: Conseusus in Bitcoin, Bitcoirr Core Softrvare, Stakeholders
Who sin Charge. Roots of Bitcoin. Govcrnntents Notice on Bitcoin, Anti Money Laundering
Regulation, Nerv York's Bit License Proposal.
Bitcoin as a Platforrn: Bitcoin as an Append only Log. Bitcoins as Smaft Property. Secure
Multiparty Lotteries in Bitcoin, Bitcoin as Public Randomness. Source- Prediction, Markets. and
Real World Data Feeds.

Text Book:
l. Narayanan, A., Bonneau. J., Felten, E-, Miller, A., and Goldtbder. S. (2016). Bitcoin and
crypto currency technologies: a comprehensive introduction. Princeton University Press.
2. William Stallings, Cryptography and Network Secur.ity. Pearson 2004.

References:
I . Antonopoulos, A. M. (2014). Mastering Bitcoin: unlockirrg digital cryptocurrencies. OReilly
Medi4 Inc.
2. Franco, P. (2014). [Jnderstanding Bitcoin: Cryptography. engineering and economics. John
Wiley and Sons.
\---:
e NV ru-
/
{ 0-t-L' W
I
0l l,eY\
tr, -L
t/
 Paper - Ill (C) : Big Data Analytics

cs 303T(c)
tinil - |

overvierv olBig Data: what is Big Dara'J Evolution ol'Big Data, Sttucturing Big Data, Elements ol
Big Data. I3ig Data Analytics. Exploring the Use ol Big Data in Business context: Use of Big Data
in Social Netr.vorking. Use of Big Dara in Preventiug Fraudulent Activities, Use of Big Data in
Detecting Fraudulent Activities in Insurance Sector. Use of Big Data in Retail Industry.
lnn'oducing Technologies for Handling Big Data: Distributed and Parallel Computing ftrr Big Data.
lntroducing Hadoop. Undersrarrding Hadoop Ecosystern: Hadoop Ecosystem. HDFS, Map Reduce.
Hadoop YARN. HBase. Hive, Pig and Pig Latin, Sqoop. ZooKeeper, Flume, Oozie.

t-ln it - II
understanding MapReduce Fundanrentals and HBase: The MapReduce Framework, Techniques to
optimize MapRedr.rce Jobs. Role of HBase in Big Data processing. Exploring the Big Data Stack,
Virtualization and Big Data, Virtualization Approaches.
Storirrg Data in Darabases and Data warehouses: RDBMS and Big Data, Non-Relational Database,
lntegrating Big Data with rraditional Data warehouses. Big Data Analysis and Data warehouse,
Changing Deployment Models in Big Data Era.
Processing Your Data with MapReduce: Developing Simple MapReduce Application, points to
Consider while Design ing MapReduce.
customizing MapReduce Execution: controlling MapReduce Execution with InputForrnat,
Reading Data with Custom RecordReader. organizing output Data wirh outpuriormats.
customizing Data with Recordwriter. optirnizing MapReduce Executio* wiih combiner,
hnplementing a MapReduce Prograrr fbr Soning Text Data.
Llnit - lll
Understanding Hadoop YARN Archirecrure: lntroduction yARN, Advantages of yARN, yARN
Architecture. Working of YARN.
Exploring Hive: Introducing Hive, cetting Started
'"vith Hive, Hive Services, Data Types in Hive,
Builrln Functions in Hive. Hive DDL, Data Manipulation irr Hive, Data Rerrieval eueries, Using
.lOlNS in Hive.
Analyzing Data rvith Pig: Introducing Pig, Running pig. cetring Starred with pig Latin, working
rvith operators in Pig. working rvith Functions in Pig, Debugging pig, Error Handling in pig.

t ln ir - lv
Usingoozie: lntrodLrcing oozie, lnstalling and configurirrg oozie, understarrding the oozie
Workfl ow. Sinrple Appl ication.
NoSQL Data Management: lnrroduction to NoSQL, Types of NoSeL Data Models, Schenra-Less
Databases. Materialized viervs. Distributed Models. Sharding. MapReduce partitioning and
Combining. Cornposing MapReduce Calculations.
Understanding Analytics and Big Data: Conrparing Reponing and Analysis, Types of Analytics.
Developing an Analytic Team. Analytical Approaches and rools to Arralyze Data: Analyticat
Approaches. History of Analyical Tools, Introducing Analyical Tools, Comparing Various
Anaryricar roors.
-_\ ,.. , \
l-extBook:D.l.EditorialServices.BigData_BlackBook(dreamtech)-l
Relerences:
l. Radha S, M. Vijayalakshrai. Big Data Analytics
2. Arshdeep B and Vijay M. Big Data Science & Analytics - A Hands-On Approach.
3. Frank Ohlhorst, Big Data Fundanrentals - Concepts, Drivers. Techniques

e ^^)
04,
ue CWXP,.rst,t f2
 Paper - IV (A) : Natural Language Processing

cs 304T(A)

Unit- I
Language Processing and Pyhon: Conrputing with Language: Texts and Words. A Closer Look at
Pyhon: Texts as Lists olWords. Cornputing with [-anguage: Sinrple Statistics, Back to Pyrhon:
Making Decisions and Taking Control. Automatic Nalural l-anguage Understanding Accessing
Text Corpora and Lexical Resources: Accessing Text Corpora. Conditional Frequency'
Distributions. Lexical Resources. WordNet.

Unit- II
Processing Raw Text: Accessing Text frorn the Web and l'rom Disk, Strings: Text Processing at the
Lowest Level, Text Processing with Unicode. Regular Expressions for Delecting Word Patterns.
Usefirl Applications of Regular Expressions. Normalizing Text. Regular Expressions fbr
Tokenizing Text, Segmentation. Formatting:From Lists to Strings.
Categorizing and Tagging Words: Using a 1'agger.'[agged Corpora. Mapping Words to Properties
Using Python Dictionaries, Automatic Tagging. N-Granr Tagging. Transformation- Based Tagging.
How to Deterurine the Category of a Word.

Unit- III
Leaming to Classify Text: Supervised Classification, Evaltration, Naive Bayes Classifiers Deep
Learning for NLP: lntroduction to Deep Learrring, ConvolLrtional Neural Networks, Recurrent
Neural Networks. Classifying Text rvith Deep l-ealnirrg

Unit- IV
Extracting [nformation ti'om Text: Infonnation Extraction. Chunking, Developing and Evaluating
Chunkers. Recursiou in Linguistic Structure. Narned Entity Recogrrition, Relation Extraction.
Anatyzing Sentence Structure: Some Grammatical Dilemmas. What's the Use of Syntax Context-
Free Grammar, Parsing with Context-Free Cramtnar.
NLP applications: Topic rnodeling, Text classification. Sentiment analysis,Word sense
disambiguation, Speech recognition and speech to text. Text to speech. Language detection and
translation.

Text Book:
L steven Bird, Ewan Klein, and Edward Lope, Natural Language Processing with Python.OReily.
2009.
2. Akshay Kulkarni, Adarsha Shivananda, Natural Language Processing Recipes: Unlocking
Text Data with Machine Learning and Deep Learning using Python. Apress' 2019
3. Allen Jarnes. Natural Language Urrderstanding, Benjanr in/Cumnt ing,1995. Charniack. Eugene.
Statistical Language Learning. MIT Press, 1993.
4. Clrarniack, Eugene, Statistical Language Learning, MIT Press, 1993.

e I 'NH,
k@q
& ) \
0l P
)t
 Paper - lV (B) : Wcb Mining

cs 304T(B)

UNIT - I : Introducrion ro web Data Mining and Data Mining Foundations, Introduction world
wide web (www). A Brief History of the web and the lnrerner, web Dara Mining-Data Mining.
-
web Mining. Data Mining Foundations - Association Rules and Sequential patterni
- Concepts
of Association Rules. Apriori Algorithrn- Frequent Iternset Gerreration, Association Rule
cenelarion, Data Formars fbr Association Rule Mining, Mining with multiple minimurn
supporrs _
Extended Model, M ining A lgorithrn, Rule Ceneration. Mining Class Assoiiation
Rules. Conceprs
olS-eq_uential Patterrrs. Mining Sequential pattems on GSp, Mining Sequential pattems
on
PretixSpan. Generating Rules frorn Sequential pafterns.

UNIT - tl : Supervised and Unsupervisctr Learrring Supervised Learning

Tree lnducion - Learning Argorirhm. Irnpurity Fuiction, Handring
- Concepts, Decision
of ciontinuous Rttribur".,
Classifier Evaluation. RLrle lrrduction Sequential covering, Rule Learning.
- Classificatioir Based
on Associations' Na)ve Bayesian Classiflcation . Naive Baylsian
Text CIas-sification - piouauitistic
Framework. Naive Bayesian Moder . Unsupervised Learning
- concepts , K-means crrsie.ing -
K-means Algorithrn, Representarion of crusters, Hierarchicir crustering
Complete link Method, Average link method. Strength and - iirrgr" rirI r",r,'"a.
Weakness.

uNlr - llI : Inforrnation Ret.ievar and web Search: conceps of Inrbr.marion Retrievar,
Infonnation Retrievar Methods Boorearr Moder. Vector Spaie
- Moder and Statisticar i;;rog.
Model, Relevarrce Feedback. Evaruation Measures. Text and web page pr.pro""..iig
- siof*ora
tt, '
Renroval. stenrming. w'eb page p'eprocessing. Dupricare Detection.
Lrr..t"d lrd"* o"na '--
c'ompression - lnverted rndex, Search using lrrverted Index,
Intrex construction, I.dex-
( onrpression. Latr-nt Serrarrtic Irrdcring.-
Singular Varue Decornposition, euery and Retrievar,
Web Search, Meta Search. Web Sparnnring.

UNIT - lv : [.ink Anarysis and web crawring: Link Anarysis Sociar

Citation and Bibriographic coupring. page Rank Argorithn;. HrrS
- Network Anarysis, co--
Argorithrn, c",r;i;;;
Discovery-Problern Dennition. Bipanire Core conrirunities,
Maxinru"m ntor,, conr,rrniii'es, -Email
communities..web crawring - A crar.vrer A rgorithm- Breadrh Fir.st
Crawrers, p."r"r"nii.i
crarvlers. lmplementation rssues - Fetching, paising. Stopword Removal,
'l'raps. Link Extraction. sDider
Page Repository. Universar Crar,,reri, Focuse-d Crawler.,
ropi.uic**i",.5."cr.*]"] iiri.,
and Conflicrs.
Sentiment Classification - classification based on Sentiment Phrases,
Classitication Using Text
( lassifi cation Methods.

TIiYI II(X)K:
Web.Data Mining: E_xploring Hyperlinks, Conrents. and Usage
Data by Bing Liu (Springer
publications)
_lu,r;: ,. \ .

REFEIIENCES I}OOI(S:

D_ataMining: ('oncepts and 'l echniques. Seconcl Edirion Jiarvei Han. Micheline
Karnber
(Elsevier Publicarions)
Web Mining:: Applicarions and'Iechniques by Anthony Scinre
the web: Discovering Knowredge fi'om Hypertext Data by Soumen
,Mining chakrabarti
wl ,r4.,, .{ i)
\,
VL J*
-__Jl_-

lbzrdt Yt
 Paper-IV(C): DEVOPS
cs 304T(c)

UNIT.I
Introduction: Introduction, Agile developrnent model, DevOps, and lTlL. DevOps plocess and
Continuous Delivery, Release management. Scrum. Kanban. delivery pipeline. bottlenecks.
exanrples.
Software development models arrd DevOps: DevOps Lilecycle tbr Business Agility, Devops, and
Continuous Testing.

UNIT - II
DevOps influence on Architecture: lntroducing solhvare architecture, The nronolithic sceuario.
Architecture rules of thumb. The separation ofconcerns. Handling database migrations.
Microservices, and the data tier, DevOps, architecture, and resilience.
tntroduction to project management: The need fbr source code control, 'Ihe history ol'source code
management, Roles and code, source code management system and n.rigrations, Shared
authentication. Hosted Git servers. Dif'ferent Git server implementations. Docker intenrission.
Gerit, The pull request model, CitLab.

UNIT.III
lntegrating the systenr: Build systenrs, Jenkins build server, Managing build dependencies. Jenkins
plugins, and file system layout. The host server, Build slaves, Softrvare orr the host. Triggers. Job
chaining and build pipelines, Build servers and infrastructure as code, Building by dependency
order, Build phases, Alternative build servers, Collating quality nleasures.
UNIT - IV
Testing Tools and autonration: Various types oftesting. Atttomation oftesting Pros and cons.
Selenium - Introduction. Selenium f'eatures, JavaScript testing. Testing hackend integlation points.
Tesl-driven developrnent. REPL-driven development
Deployment of the system: Deploymeut systems, Virtualization stacks. code execution al tlre client.
Puppet master and ageuts, Ansible, Deployrnent tools: Chef, Salt Stack and Docker

Text Books:
I . Joakim Verona. Practical Devops, Second Edition. lngram short title: 2nd edition (201 8). lSllN-
l0:1788392574
2. Deepak Gaikrvad, Viral Thakkal. Devops Tools frotn Practitioner's Viewpoint. Wiley
publications. ISBN: 9788 I 26579952
REFERENCE BOOK:
l. Len Bass, Ingo Weber, Liming Zhtr. DevOps: A Sofiware Architect's Perspective. Addison
Wesleyr ISBN-10.

@ 1 Ne
[b*, ( Y-3.--
I
q( w,,v"
 Papcr - V: Artificial lntelligencc Lab

cs305t,

I a) Proglam to print rnultiplicarion table tbr given no.

b) Plogram to check whethet the given no is prime or not.
c) Program to find factorial ofthe given no and similar programs.
2 write a prograrn ro implernent List operations(Nested list, Length. concatenation,
Membership,lteration ,lndexing and Slicing), List Methods(Add. Append, Extend & Delete)
3 Write a progratn to Illustratc Different Set Operations.
4 Write a program to ilnplement Sirnple Chatbot.

5 Write a program to irnplement Breadth First Search Traver.sal.

6 Write a program to inrplement Depth First Search Traversal.
7 Write a prcgram to implernent Water Jug problenr.

8. Write a Program to lmplernent Tic-Tac-Toe game using python.

9. Wlite a program to ir.nplement K -Nearest Neiglrbor algor.ithm.

10. Write a Program ro lmplemenr 8-puzzle problem using pyhon.
I l. Write a Program to Impletnent 'lravelling Salesman problerr using python.
12. Write a program to implernent Regression algorithnr.
I3. Write a program to implement Random Foresr Algorithm.
14. Write a Program to Implement Tower of Hanoi using py,thon.
15. Write a Program to Implement Monkey Banana problern pyhon.
using
16. Write a Progranr to Implement Alpha-Beta pruning using python.

17. Write a Program to lrnplement 8-eueens problem using python.

e /r,
IM I

I I
br& V--'Z-
r
I
f

)e \_ \ol/
 Paper - III(A): Computer Organization

cs 403r(A)

Unit- I
Digital Logic circuits: Digital computers. t.ogic Gates, Boolean algebra. Map Sinrplification,
Combinational Circuits, Flip-Flops, Sequential Circuits.
Digital components: lntegrated circuits. Decoders. MLrltiplexers. Register.s. Shift Registers,
Binary Counters, Menrory Unit.
Data Representation: Data Types, complements. Fixed point Representations, Floating point
Representation. Binary Codes, and Error Detectiorr Codes.

Unit- ll
Register Transfer and Micro operations: Register Transler Language, Register Transf'er, Bus
and Memory Transfers. Arithrnetic Micro operations, Logic Micro operations, and Shift Micro
operations.
Computer Organization and Desigrr: lnstruction Codes. Computer Registers, Compuler
lnstructions, Timing and Control, Instruction Cycle, Memory Reference Instructions, Input -
Output and Interrupt. Design of Accumulator Logic.

Unit- III
Programming the Computer: Maclrine Language. Assemblv Language, -fhe Assembler.
Proglam Loops. Programrning Arithrnetic and Logic Operations. Subrot(ines. lnput - Output
Programming.
Central Processirrg Unit: Introduction. General Register Organization, Stack Organization,
Instruction Formats, Addressing Modes. Data Transfer and Manipulation. Program Control.
Reduced lnstruction Set Computer.
Computer Arithnretic: Addition and Subtraction. Multiplication Algorithnrs, Division Algorithms.
and Floating Point Arithmetic Operations. Decimal Arithrretic Llnit, Decirnal Arithrneric
Operations.

Unit- lV
Input - Output Organization: Peripheml Devices, Input - Output Interface, Asynchronous Data
Transfer, Modes of Transfer. Priority Interrupt, Direct Memory Access (DMA), lnput - Output
Processor, Serial Cornmunication. Pipeline and Vector Processing: Parallel Processing. Pipelining,
Arithmetic Pipelines, Instruction Pipelines and RISC Pipelines, Vector Processing.

Text Book:
Computer System Architecture (3e) by M.MorrisMano

References:
l. Andrew S.Tanenbaum, Structured Computer Organization.
2. William Stallings, Computer Organization and Archilecture.
3. ZviKohavi, NirajK.Jha. Switching and F inite Automata Theory.

€ r-
r rr.J

\ I

tu@a I M
(k
)d^ a,4, ,'"\

Y )
 Paper - Ill(li): Distributctl Systcms

cs,103'r(B)

l-Jnit - I
lntroduction: detinirion ol'a distributed system, goals, types ol'distributed systems.
Architectures: architectrrral styles, systern architectures, archilectures versus middleware. self-
rnanagement in d istributed systems.
Processes: threads. vinual ization. cl ients. servers, code rn gr.ation.
i

Unit - II
cornmunication: Remore Procedure (-'all. Message-oriented communication, Stream-oriented
Comnrunication. Multicast Conrmunication.
Nanring: names. ide,tifiers. and addresses, t)at nanring, structured naming.
anribute
based narr ing.
Synchron ization: clock synchronization. logical clocks. rnutual exclusion, global
positioning of
nodes. election algorithms.

unir - llI
consistency and Replication: introduction. data-centric co.sistency models,
client-centric
consistency models. replica management, consistency protocols.
Fault Toleralrce: intloduction, process resilience, reliable client server
communication, reliable
group comnrunication. distributed comrnit. recoverv.
Security: introduction. secure channels, access control, security management.

Unit - IV
Distributed object-Based Systems: architecture. processes, conrmunication,
naming.
sy nch ron ization. consistency and replication, fault toler.ance.
securitv.
Distributed File systems: architecture, process, commrnication. raming, synchron
ization,
consistency and replication, lault tolerance. security.
Distributed web based Systems: architecture, pro".rr..,,rnlunication. naming,
synchronization,
consistency and replication, fault tolerance. security.

Text Book: Andrew S.Tanenbaum, Maarten Van Steen. Distributed sysrenrs principres
Parad igrns (2e)
- and

References:
l. SLrkurnar Ghosh. Distributed Systeurs An Algorithmic Approach
2. .loel M. Crichlorv, Distributed Svsrerns Computing Ovei Networks
-3' Kai Hrvang. Dislributed and Cloud (--omputing From Parallel Processing to Internet
of Things
Ajay D. Kshernkalyani. Mukesh Singhal. Distrihuted computing princi-ples. Algorithrns.
!Systems a,d
5. George C oulouris, Jean Dollimore, Tim Kindberg, Go'don Blair,Distributed
Systems concepts
and Design

6)
\
w W 1L4r/

)^"
\
\
 Paper - ll: Data Scicnco rvith R
CS {O2T

Unit- I
Data Science: lnlroduction to Data Science Digital Universe - Sources of Data - lnlbrmation
-
Commons - Data Science Proiect Lift Cycle: OSEMN Framework
Dara Preprocessing: Introduction to Dala Preplocessing - Reading. Selecting, Filtering DaU -
Filtering Missing Values - Manipulating, Sorting, Crouping, Rearranging, Ranking Data'

Unit- ll
Concept [,earning: Formulation of Hl,pothesis - Plobabilistic Approxirnately Correct Learning -
VC Dirnension -FIy'pothesis elirnination - Candidate Elimination Algorithm
Essentials Of R: R s - data types arrd objects - control structures - data frame -Feature Engineering
- scaling, Label Encoding and One Hot Encoding' Reduction'

unit- lll
Model Fit Using R:Regression Models- Linear and Logistic Model. Classificatiorr Models -
Decision Tree. a",ue-Bayes, SVM and Ranclonr Forest. clustering Models - K Means and
Hierarchical clustering.
Visualization: Data viualization: Box plot, histograrn, scatter plot, heat map -Working with
Tableau - Outlier detection - Data Balarrcing.

Unit- lV
per.formance Evaluation: Loss Function and Error: Mean Squared Et'ror. Root Mearr Squared
Error Model Selection anci Evaluation criteria: Accuracy. Precisiorr. Fl score. Recall Score
- -
Binar.y Predictive Classitication -Sensitivity - Specificity. Recent Ttends And Challenges ln Data
Science.

Text Book:
. Introduction to Machinc Lcarning b-v l-thern Alpaydin, Fourth Edition, MIT Press,
1020.
. Hadley wickham. Garrett Grolemund. R lbr clata science : lmport, Tidy, Transform, Visualize,
And Model Data PaPerback, 2017.
R el'e ren c es :

l. Han. J.. Kamber, M., Pei, J. Data mining concepts and techniques Morgan Kaufmann'
201 l.
2. Carl Shan, Henry wang, william Chen, Max Song. The Data Science Handbook: Advice
and lnsight fronr 25 Amazing Data scientists. The Data Science Bookshelf.2016.
3. Jamesl G.. Witten. D., T., Tibshirani, R. An Introduction to statistical learning with
applications in R- Springer. 2013.
5

e ^n M,
1
rwl
,u< .s w
certifications, cloud audit ['ramework. auditing requirements.Apprication Security in the
_cloud
cloud: cloud applicarion SDLC, croud-service repois by providers, ripprication,..r.i( in iurs.
PaaS and SaaS environments. Mobile Clloud Conrputin[ tr,lccl:arctr
l itectu re of MCC, Leneflts ol'
MCC, MCC challenges.
-lext
Book: Kailash J, Jagannath K, Donard J H. Deven Shah.croud computing
- Brack Book
Ref'erences:
L Rajkumar Buyya. Cloud Computirrg: principles arrd paratlipms

]. frs!!e1q Satr8a. Vijay Madiseui, Cloud Cornputing _ A Hlnds-On Approach

.>
?"yi! E.Y. Sarna, tnrplerrenting and Devetoping C.ioud Computing Applications
4' Kai Hwang, Disrributed and croud computirig F-rom par.a[er processing
ro Internet orrhings

@ i
\---""''"=
J
v
/
l

)d" fut
0l
lfru
]

I
 Paper - VI: Compiler Design Lab
C5306P

l. Write a program to design token separator for the given expressiotr.

2. Write a program to implemerrt a symbol table.
3. Write a program to develop a lexical analyzer to recognize a few patterrrs.

4. Write a program to develop a lexical analyzer using Lex tool.

5. Write a program 10 recognize a valid arithmetic expression using yACC.

6. Write a program to recognize a valid variable nanre using yACC.

7. Write a program to implement calculator using Lex and yACC.

8. Write a program for irnplementing type checking lbr given expression.

9. Write a program to convert the BNF rules into yACC.

10. Write a program to implement data tlorv and control llow analysis.
I l. Write a program to implement stack storage allocation strategies.
I2. Write a program to implement heap storage allocation stralegies.
13. Write a program to construct a directed acyclic graph (DAG).

14. Write a program to implement the back end of the compiler.

15. Write a program to implement simple code optitnization technique.

16. Write a program to irnplement sirnple code optirrization technique usirrg do-rvhile
Note:
. Recornmended to use the C/LEX/YACC on l.inux systems

e ^)-

UiU*-
tee
w a-----3-

AA; W,v" s )
 M.Sc. Computer Science

Semestcr - IV
Paper- | : Cloud Contputing
CS 40IT

tjn it - I
Era ol Cloud Contputing (CC): introduction. cloud and other similar configurations. CC vs. peer{o-
peer architecture. cc vs. clienl-server architecture, cC vs. GC, components ol'cc, impact ofcc
on busirrcsses.
lntroduction virtualization: lntroduction, virtualization benetits, implementation tevels 6f
virtualization. virtualization at the OS level, virtualization structure. open source virtualization
technology. Xen virtualization architecture, binary translation with fullvirtualization, para-
virtualization rvith compiler support. virtualization ofCpU. menrory, l/o devices, hardware suppon
for virtualization. virtualization in multicore processors.
Cloud Computing Services: IaaS,PaaS. leveraging PaaS fbr productivity, guidelines tbr selecring a
PaaS plovider'. concerns with PaaS, languages and paaS. SaaS, DBaas.Cloud computing
and
Business value: key drivers for CC, cC and outsourcing. types ofscalability. use of loal balancers
to enhance scalability. variable operating costs using CC, time+o-mar.ket benefits of CC.
distribution over the internet, levels olbusiness values li.om CC.
Cloud Types and Models: private cloucl. public cloud, hybrid cloud.

Llnit - ll
open Source cloud Implementation and Adrn in istration: Eucalyptus& openSatck cloud
arch itectttres. CS B ( I 58) Recent 'l'rends in C loud Cornputing and Standaids: con fl icts
of inreresr for
public cloud and I'[ product providers. ByoD and encryption exposures. cloud standards.
cloud
ratings. C'C trends that are acceleraling adoption.
Host Sectnity in the Cloud: security till virtualization products, host security fbr SaaS, paaS,
IaaS.
Dara Sectlrity in the Cloud: challenges with clor.rd dala and data secur.ity, data confidentiality
and
encryption. data availability, data integrity. CSGs. cloud application requirements,SoA for
cloud
applications.

Unit - III
Adoption and Use of cloud by Smarr and Medium Businesses: place ofadoption, benefits, adoption
phases. vendor roles and responsibilities, selection phases. provider liability, provider
capabilities,
success f'actors fbr cc Adoption proccss of public clouds by enterprises.Cioud migmtion
techniques, Phases during the migration ofan application to the ctoud.lT Service lianagement
for
CloLrd cornputing: ITIL based service management. seruice straregy, service design,
seiice
transition. service operations. continual sewice improvernent.
SLA ttith Clotrd Service Providers: concept, aspects and requirements ofSLA, credit calculation,
samples I and 3.
Risks, (ionsetluerrces, and Costs tbr cloLrd conrputing: introduction, risk assessment and
mallagelnenl. risk ofvendor lock-in. loss olcontrol, not meeting legulatory compliances. resource
scarcity, multitenant environment, t'ailu[e, inadequate SLA, nralware and internei attacks,
rranagement of cloud resources. netrvork outages. in fracture. legal, licensing, TCo, cloud costs.
cost allocations, chargeback rnodels and methodology, billable iterns. i,
,
': '
Unit - Iv '-
AAA Administration fbr cloud: AAA rnodel, single sign0on tbr clouds. industry implementation
lbr AAA, authentication management in the cloud. SAML, authentication for le;ource utilization.
Securily as a Service: beneflts olsecurity as a service. concerns with security as a service. security
service ploviders. IdMaaS. attributes of ldMaaS providers.Cloud certitications and Audits:
t

e n,
W*
@e'//- W zz-
 Paper - III(C): Machine Learning
cs 403r(c)

Unit-I

Overview and Introduction to Bayes Decision Theory: Machine irrtelligence and

applications, pattern recognition concepts classification. regression. featLrre selection.
supervised learning class conditiorral probability distributions. Exanrples ofclassifiers lrayes
optinral classifier and error, learning classificati0n approaches.
Linear machines: General and lineal discriminants. dccision regions. single layer neural
network, Iinear separability. general gradient descent. perceptron Iearning algorithm. rnean
square criterion and rvidrow-Hoff learning algorithrn; rnulti-Layer percepirons: two-layers
universal approxirnators, backpropagation learning. on-line, ofl-line error surt'ace, important
parameters.

Unit-Il
Learning tlecision trees: Infercnce rnodel, general dornains. symbolic decision trees,
consistency, learning trees from training examples entropy. rnutual inforrnation. ID3 algorithm
criterion. C4.5 algorithm continuous test nodes, conlldence. pruning. leatning with incomplete
data.
Instance-based Learning: Nearesl neighbor classification. k-nearest neighbor, nearest
neighbol erlor probabi lity.

UNit-III
Machine learning concepts and limitations: Lcarning theory, lorrnal model ofthe learnable.
sample cornplexity, learning in zero-bayes and realizable case, VC-dinrension. lundamental
algoritlrrn independent concepts, hypothesis class. target class. inductive bias. occam's razor.
enrpirical risk, limitations of inference machines, approximalion and estimation errors,
Tradeoft'.
Machine learning assessment and Inrprovement: Statistical model selection, stluctural risk
rrinirnization. bootstrapping. bagging. boosting.

Un it-IV
Support Vector Machines: Margin ola classifler, dual perceptron algorithm. learuing nonlinear
hypotheses with perceptron kernel f'unctions, implicit non-linear f'eature space. theory,
zero-Bayes. realizable infinite hypothesis class. finite covering, nrargin-based bounds on risk,
maximal margin classifier.

Text Book:
I . E. Alpaydin, lntroduction to Machine Learning. I'rentice Hall of lndia, 2006
2. T. M. Mitchell, Machine Learning. McGrarv-Hill, 1997.

References:
1.. C. M. Bishop, Pattern Recognition and Machine Learning, Splinger.2006.
2. R. O. Duda, P. E. Hart, and D.G. Stork. Pattern Classification. John Wiley and Sons.
200t.
3. Vladimir N. Vapnik, Statistical Learning Thcory, .lohn Wiley and Sons. 1998.
4. J. Sharve-Taylor and N. Cristianini, Canrbridge. lntroduction to Support Vector
Machines, U niversity Press. 2000.

@ u&
n,* D-----a-
AA,,
LD t ^.tr
e(\nt \Z'
t \\*^D q
 Papcr - lV: Data Sciencc rvith lt Lab
cs ,l0JP

I. Download and install R-Programnring environment and install

packages using install.packagesQ command in R.
ll. Learn all the basics of R-Programming (Data types, Variables,
operators, Loops, Conditional statements etc,.), write R scripts to demonstrate the same.
l. a) Perlirrnt some arithntetic and logical operations in R.
b) Write a progmm to tlnd list of even numbers iiom I to n using R-Loops.
2. a) write a program t. join columns.nd ror.vs in a data h.ame using cbind() and rbindO in R.
b) lmplernent difl'ererrt String Manipulation firnctions in R.

3. a) hnplement different data structures in R (Vectors, Lists, Data Frames)

b) Write a program to read a csv lile and analyze the data in the file in R
4. a) Create pie chart and bar chart using R.
b) Create a data set and do statistical analysis on tlre data using R

5. Demonstrate the process ofcreating a user.detined firnction in R.

6. a) Write an R script to change the structure ofa Data flrarne.
b) Write an R scr.ipt to expand a data tiame.

7. a) Write an R script to convert a vector to factors.

b) Write an R script to dentonstrare R objects.
8. Demonstrate the fbllowing aggregate lirnctions in R: sum. mean. count, min, max.

9. Write an R script to read and r.vr.ite ditterent files.

10. a) Write an R script to find subset ola dataset.
b) Elucidate the process ofdata exploration in R using read(),sumrnary().nrow0,ncol0,str0.
I l. a) Write an R script to handle rnissing values in a dataset.
b) Wlite an R script to handle ourliers.
c) Write an R sclipt to handle invalid values.
l2 . a) Visualize iris daraset using mosaic plot.
b) Visualize correlation between sepal length and petal length in iris data ser using scatter plot.
13. Linear Regression: Consider the follorving mice data:
Height: 140. t42, I 50.t 47,t39.t52.154,t35,149, 147 .
Weight: 59, 61, 66,62.57. 68. 69. 58, 6j, 62.
Derive relationship coeflicients and summary tbr the above data.

14. consider the above data and predict the weight ofa mouse for a given height and plot
the results using a graph.
15. Perfbrm Logistic Regression analysis on the above rnice data(Sl.No.l 3) and plot the results.

16. Tirne Series: Write R script to decornpose time series data Into random, trend and seasonal data.

e tf,

vu) 1 \M,\

f
I
lld,cr/
\
-\
 Paper - V: Project Work
CS 4O5P

( 1tv

v.uP---l--- P---2---

)d"
trv-